To see the other types of publications on this topic, follow the link: Forward reachable set.

Journal articles on the topic 'Forward reachable set'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 15 journal articles for your research on the topic 'Forward reachable set.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Feng, Xuhui, Mario E. Villanueva, and Boris Houska. "Backward-forward reachable set splitting for state-constrained differential games." Automatica 111 (January 2020): 108602. http://dx.doi.org/10.1016/j.automatica.2019.108602.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sun, Gengxin, and Chih-Cheng Chen. "Influence Maximization Algorithm Based on Reverse Reachable Set." Mathematical Problems in Engineering 2021 (July 27, 2021): 1–12. http://dx.doi.org/10.1155/2021/5535843.

Full text
Abstract:
Most of the existing influence maximization algorithms are not suitable for large-scale social networks due to their high time complexity or limited influence propagation range. Therefore, a D-RIS (dynamic-reverse reachable set) influence maximization algorithm is proposed based on the independent cascade model and combined with the reverse reachable set sampling. Under the premise that the influence propagation function satisfies monotonicity and submodularity, the D-RIS algorithm uses an automatic debugging method to determine the critical value of the number of reverse reachable sets, which
APA, Harvard, Vancouver, ISO, and other styles
3

Limpiyamitr, Akarawit, and Yoshito Ohta. "On the Approximation of Maximal Output Admissible Set and Reachable Set via Forward Euler Discretization." IFAC Proceedings Volumes 37, no. 11 (July 2004): 395–400. http://dx.doi.org/10.1016/s1474-6670(17)31643-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kim, Suseong, Davide Falanga, and Davide Scaramuzza. "Computing the Forward Reachable Set for a Multirotor Under First-Order Aerodynamic Effects." IEEE Robotics and Automation Letters 3, no. 4 (October 2018): 2934–41. http://dx.doi.org/10.1109/lra.2018.2848302.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Jones, Morgan, and Matthew M. Peet. "Using SOS and Sublevel Set Volume Minimization for Estimation of Forward Reachable Sets." IFAC-PapersOnLine 52, no. 16 (2019): 484–89. http://dx.doi.org/10.1016/j.ifacol.2019.12.008.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Rad, Ciprian, Calin Rusu, and Radu Balan. "Kinematics Investigation, Workspace Analysis and Actuators Design for a 2-DOF Redundant Parallel Robot." Solid State Phenomena 166-167 (September 2010): 333–38. http://dx.doi.org/10.4028/www.scientific.net/ssp.166-167.333.

Full text
Abstract:
This paper discusses the inverse and forward kinematics problem for a 2-dof parallel robot with actuator redundancy. The reachable workspace of the robot is generated for a set of parameters and a solution for the actuators is proposed in the final.
APA, Harvard, Vancouver, ISO, and other styles
7

ARMBRUSTER, BENJAMIN, LI WANG, and MARTINA MORRIS. "Forward reachable sets: Analytically derived properties of connected components for dynamic networks." Network Science 5, no. 3 (June 29, 2017): 328–54. http://dx.doi.org/10.1017/nws.2017.10.

Full text
Abstract:
AbstractFormal analysis of the emergent structural properties of dynamic networks is largely uncharted territory. We focus here on the properties of forward reachable sets (FRS) as a function of the underlying degree distribution and edge duration. FRS are defined as the set of nodes that can be reached from an initial seed via a path of temporally ordered edges; a natural extension of connected component measures to dynamic networks. Working in a stochastic framework, we derive closed-form expressions for the mean and variance of the exponential growth rate of the FRS for temporal networks wi
APA, Harvard, Vancouver, ISO, and other styles
8

Hughes Hallett, Andrew, and Nicola Acocella. "STABILIZATION AND COMMITMENT: FORWARD GUIDANCE IN ECONOMIES WITH RATIONAL EXPECTATIONS." Macroeconomic Dynamics 22, no. 1 (April 5, 2016): 122–34. http://dx.doi.org/10.1017/s136510051600002x.

Full text
Abstract:
We construct a theory of forward guidance in economic policy making in order to provide a framework for explaining the role and strategic advantages of including forward guidance as an explicit part of policy design. We do this by setting up a general policy problem in which forward guidance plays a role, and then examine the consequences for performance when that guidance is withdrawn. We show that forward guidance provides enhanced controllability and stabilizability—especially where such properties may not otherwise be available. As a by-product, we find that forward guidance limits the sco
APA, Harvard, Vancouver, ISO, and other styles
9

Chun, Seung Su. "Effective Extraction of State Invariant for Software Verification." Applied Mechanics and Materials 752-753 (April 2015): 1097–104. http://dx.doi.org/10.4028/www.scientific.net/amm.752-753.1097.

Full text
Abstract:
In software design of complex systems, more time and effort are spent on verification than on constructions. Model checking for software verification techniques offer a large potential to obtain and early integration of verification in the design process. This paper describes how to easily specify and the software properties and to understand the software generating automatically invariant. In this paper deal with issue that state invariant is a property that holds in every reachable state. Not only can be used in understanding and analysis of complex software systems. In addition, it can be u
APA, Harvard, Vancouver, ISO, and other styles
10

Li, Hong Bing, and Ming Wei Wang. "Real-Time Embedded Software Architecture Modeling and Reliability Evaluation Based on Time-Extended Petri Net." Applied Mechanics and Materials 651-653 (September 2014): 1888–92. http://dx.doi.org/10.4028/www.scientific.net/amm.651-653.1888.

Full text
Abstract:
Software reliability is one of the most important quality indices in software quality evaluation. Reliability analysis based on software architecture has become a researching hotspot. This paper makes a review on existed architecture-based reliability evaluation models, and puts forward the shortage of these models. As petri net has a good ability of description for concurrency and asynchronism, this paper focuses on the research of petri net model. Transitions are divided into time transitions and instantaneous transitions. Time-related reliability, including time-delay reliability and tempor
APA, Harvard, Vancouver, ISO, and other styles
11

Liu, Minshi, Yi Long, Ling Zhang, and Guifang He. "A Method for extracting multi-scale stay feature of trajectory based on OPTICS." Abstracts of the ICA 1 (July 15, 2019): 1. http://dx.doi.org/10.5194/ica-abs-1-222-2019.

Full text
Abstract:
<p><strong>Abstract.</strong> With the popularity of mobile positioning devices, mobile trajectory data is rapidly increasing. The trajectory stay feature extraction is to find the staying part of the moving object from the moving trajectory, which is the basis of the semantic matching of the staying segment. The trajectory stay segment extraction can be used to analyze tourist visit recommendation and mode, special landmark extraction such as gas station, destination prediction, rental car passenger advice, and even traffic guidance. Most existing researches extract the sing
APA, Harvard, Vancouver, ISO, and other styles
12

Kousik, Shreyas, Sean Vaskov, Fan Bu, Matthew Johnson-Roberson, and Ram Vasudevan. "Bridging the gap between safety and real-time performance in receding-horizon trajectory design for mobile robots." International Journal of Robotics Research 39, no. 12 (August 30, 2020): 1419–69. http://dx.doi.org/10.1177/0278364920943266.

Full text
Abstract:
To operate with limited sensor horizons in unpredictable environments, autonomous robots use a receding-horizon strategy to plan trajectories, wherein they execute a short plan while creating the next plan. However, creating safe, dynamically feasible trajectories in real time is challenging, and planners must ensure persistent feasibility, meaning a new trajectory is always available before the previous one has finished executing. Existing approaches make a tradeoff between model complexity and planning speed, which can require sacrificing guarantees of safety and dynamic feasibility. This wo
APA, Harvard, Vancouver, ISO, and other styles
13

Brafman, R. I. "On Reachability, Relevance, and Resolution in the Planning as Satisfiability Approach." Journal of Artificial Intelligence Research 14 (January 1, 2001): 1–28. http://dx.doi.org/10.1613/jair.737.

Full text
Abstract:
In recent years, there is a growing awareness of the importance of reachability and relevance-based pruning techniques for planning, but little work specifically targets these techniques. In this paper, we compare the ability of two classes of algorithms to propagate and discover reachability and relevance constraints in classical planning problems. The first class of algorithms operates on SAT encoded planning problems obtained using the linear and Graphplan encoding schemes. It applies unit-propagation and more general resolution steps (involving larger clauses) to these plan encodings. The
APA, Harvard, Vancouver, ISO, and other styles
14

Qin, Yanding, Bijan Shirinzadeh, Dawei Zhang, and Yanling Tian. "Design and Kinematics Modeling of a Novel 3-DOF Monolithic Manipulator Featuring Improved Scott-Russell Mechanisms." Journal of Mechanical Design 135, no. 10 (August 21, 2013). http://dx.doi.org/10.1115/1.4024979.

Full text
Abstract:
This paper proposes the design of a novel 3-DOF monolithic manipulator. This manipulator is capable of performing planar manipulations with three kinematically coupled DOFs, i.e., the translations in the X and Y axes and the rotation about the Z axis. An improved Scott-Russell (ISR) mechanism is utilized to magnify the displacement of the piezoelectric actuator (PEA). Unlike the SR mechanism, a set of leaf parallelograms is incorporated into the drive point of the ISR mechanism as a prismatic joint. As a result, the linearity of motion and stability are improved. With circular flexure hinges b
APA, Harvard, Vancouver, ISO, and other styles
15

Köcher, Chris. "Reachability Problems on Reliable and Lossy Queue Automata." Theory of Computing Systems, June 19, 2021. http://dx.doi.org/10.1007/s00224-021-10031-2.

Full text
Abstract:
AbstractWe study the reachability problem for queue automata and lossy queue automata. Concretely, we consider the set of queue contents which are forwards resp. backwards reachable from a given set of queue contents. Here, we prove the preservation of regularity if the queue automaton loops through some special sets of transformation sequences. This is a generalization of the results by Boigelot et al. and Abdulla et al. regarding queue automata looping through a single sequence of transformations. We also prove that our construction is possible in polynomial time.
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!