Related papers: Eigensets of switching dynamical systems
For bilinear control systems in $\mathbb{R}^d$ we prove, under an accessibility hypothesis, the existence of a nontrivial compact set $D\subset\mathbb{R}^d$ satisfying $\mathcal{O}_t(D)=e^{tR}D$ for all $t>0$, where $R\in\mathbb{R}$ is a…
We consider the problem of proving that each point in a given set of states ("target set") can indeed be reached by a given nondeterministic continuous-time dynamical system from some initial state. We consider this problem for abstract…
This paper explores the concept of topological transitivity in nonautonomous dynamical systems, which are defined as sequences of continuous maps from a compact metric space to itself. It investigates various conditions (including…
We consider reachability in dynamical systems with discrete linear updates, but with fixed digital precision, i.e., such that values of the system are rounded at each step. Given a matrix $M \in \mathbb{Q}^{d \times d}$, an initial vector…
We describe a mathematical formalism and numerical algorithms for identifying and tracking slowly mixing objects in nonautonomous dynamical systems. In the autonomous setting, such objects are variously known as almost-invariant sets,…
We study discrete time linear constrained switching systems with additive disturbances, in which the switching may be on the system matrices, the disturbance sets, the state constraint sets or a combination of the above. In our general…
Time-invariant finite-dimensional systems, under reasonable continuity assumptions, exhibit the property that if solutions exist for all future times, the set of vectors reachable from a bounded set of initial conditions over bounded time…
The sequential compactness afforded hybrid systems under mild regularity constraints guarantee outer/upper semicontinuous dependence of solutions on initial conditions and perturbations. For reachable sets of hybrid systems, this property…
Let $(X,d)$ be a compact metric space and $f:X \to X$ be a self-map. The compact dynamical system $(X,f)$ is called sensitive or sensitivity depends on initial conditions, if there is a positive constant $\delta$ such that in each non-empty…
We characterize and compute the maximal admissible positively invariant set for asymptotically stable constrained switching linear systems. Motivated by practical problems found, e.g., in obstacle avoidance, power electronics and nonlinear…
Shaping the reachable set of a dynamical system is a fundamental challenge in control design, with direct implications for both performance and safety. This paper considers the problem of selecting the optimal input matrix for a linear…
This paper is concerned with identifying linear system dynamics without the knowledge of individual system trajectories, but from the knowledge of the system's reachable sets observed at different times. Motivated by a scenario where the…
This paper explicitly computes the unique control set $D$ with non-empty interior of a linear control system on $\mathbb{R}^2$, when the associated matrix has complex eigenvalues. It turns out that the closure of $D$ coincides with the the…
We consider the decidability of state-to-state reachability in linear time-invariant control systems over discrete time. We analyse this problem with respect to the allowable control sets, which in general are assumed to be defined by…
Reachability analysis, in general, is a fundamental method that supports formally-correct synthesis, robust model predictive control, set-based observers, fault detection, invariant computation, and conformance checking, to name but a few.…
Determining the reachable set for a given nonlinear system is critically important for autonomous trajectory planning for reach-avoid applications and safety critical scenarios. Providing the reachable set is generally impossible when the…
We study the following optimization problem over a dynamical system that consists of several linear subsystems: Given a finite set of $n\times n$ matrices and an $n$-dimensional vector, find a sequence of $K$ matrices, each chosen from the…
Approximating the set of reachable states of a dynamical system is an algorithmic yet mathematically rigorous way to reason about its safety. Although progress has been made in the development of efficient algorithms for affine dynamical…
It is well known that the set of all $ n \times n $ matrices with distinct eigenvalues is a dense subset of the set of all real or complex $ n \times n $ matrices. In [Hartfiel, D. J. Dense sets of diagonalizable matrices. Proc. Amer. Math.…
We study the stabilized automorphism group of minimal and, more generally, certain transitive dynamical systems. Our approach involves developing new algebraic tools to extract information about the rational eigenvalues of these systems…