相关论文: A note on the reachability of a Fibonacci control …

Controlling a dynamical system is the ability of changing its configuration arbitrarily through a suitable choice of inputs. It is a very well studied concept in control theory, with wide ranging applications in medicine, biology, social…

The design of tracking controllers that closely follow a reference trajectory while ensuring safety and robustness against disturbances is a challenging problem in the control of autonomous systems. In this work, we propose a neural…

This paper considers discrete-time linear systems with bounded additive disturbances, and studies the convergence properties of the backward reachable sets of robust controlled invariant sets (RCIS). Under a simple condition, we prove that…

We propose and discuss a new computational method for the numerical approximation of reachable sets for nonlinear control systems. It is based on the support vector machine algorithm and represents the set approximation as a sublevel set of…

Hamilton-Jacobi (HJ) reachability analysis is a powerful framework for ensuring safety and performance in autonomous systems. However, existing methods typically rely on a white-box dynamics model of the system, limiting their applicability…

Complete controllability is a fundamental issue in the field of control of quantum systems, not least because of its implications for dynamical realizability of the kinematical bounds on the optimization of observables. In this paper we…

A complete deterministic finite automaton in which every non-empty subset of the state set occurs as the image of the whole state set under the action of a suitable input word is called completely reachable. We characterize completely…

We study pushdown vector addition systems, which are synchronized products of pushdown automata with vector addition systems. The question of the boundedness of the reachability set for this model can be refined into two decision problems…

Controllability -- the possibility of performing any target dynamics by applying a set of available operations -- is a fundamental requirement for the practical use of any physical system. For finite-dimensional systems, as for instance…

Controllability properties are studied for control-affine systems depending on a parameter and with constrained control values. The uncontrolled systems in dimension two and three are subject to a homoclinic bifurcation. This generates two…

This work proposes a robust data-driven predictive control approach for unknown nonlinear systems in the presence of bounded process and measurement noise. Data-driven reachable sets are employed for the controller design instead of using…

The probabilistic reachability problems of nondeterministic systems are studied. Based on the existing studies, the definition of probabilistic reachable sets is generalized by taking into account time-varying target set and obstacle. A…

We consider the safety evaluation of discrete time, stochastic systems over a finite horizon. Therefore, we discuss and link probabilistic invariance with reachability as well as reach-avoid problems. We show how to efficiently compute…

Hamilton-Jacobi (HJ) reachability analysis has been developed over the past decades into a widely-applicable tool for determining goal satisfaction and safety verification in nonlinear systems. While HJ reachability can be formulated very…

In this paper, controllability of systems defined on graphs is discussed. We consider the problem of controllability of the network for a family of matrices carrying the structure of an underlying directed graph. A one-to-one correspondence…

We investigate the stabilizability of discrete-time linear switched systems, when the sole control action of the controller is the switching signal, and when the controller has access to the state of the system in real time. Despite their…

Several concepts on the measure of observability, reachability, and robustness are defined and illustrated for both linear and nonlinear control systems. Defined by using computational dynamic optimization, these concepts are applicable to…

We study the reachability problem for communicating timed processes, both in discrete and dense time. Our model comprises automata with local timing constraints communicating over unbounded FIFO channels. Each automaton can only access its…

In this paper we study reachability verification problems of stochastic discrete-time dynamical systems over the infinite time horizon. The reachability verification of interest in this paper is to certify specified lower and upper bounds…

A deterministic finite automaton in which every non-empty set of states occurs as the image of the whole state set under the action of a suitable input word is called completely reachable. We characterize such automata in terms of graphs…