Related papers: Polynomial methods to construct inputs for uniform…
This paper presents computational methods for families of linear systems depending on a parameter. Such a family is called ensemble controllable if for any family of parameter-dependent target states and any neighborhood of it there is a…
In real world applications, uncertain parameters are the rule rather than the exception. We present a reachability algorithm for linear systems with uncertain parameters and inputs using set propagation of polynomial zonotopes. In contrast…
We investigate the task of controlling ensembles of initial and terminal state vectors of parameter-dependent linear systems by applying parameter-independent open loop controls. Necessary, as well as sufficient, conditions for ensemble…
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…
In this paper, we study the control of a class of time-invariant linear ensemble systems whose natural dynamics are linear in the system parameter. This class of ensemble control systems arises from practical engineering and physical…
A joint characterization of reachability (controllability) and observability (constructibility) for linear SISO nonuniformly sampled discrete systems is presented. The work generalizes to the nonuniform sampling the criterion known for the…
The main objective of this article is to develop a matrix pencil approach for the study of the controllability and reachability of a class of linear singular discrete time systems. The description equation of a practical system may be…
In this paper a constructive method to determine and compute probabilistic reachable and invariant sets for linear discrete-time systems, excited by a stochastic disturbance, is presented. The samples of the disturbance signal are not…
Reachable sets of nonlinear control systems can in general only be approximated numerically, and these approximations are typically very expensive to compute. In this paper, we explore a strategy for choosing the temporal and spatial…
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…
The paper introduces a novel algorithm for computing the output admissible set of linear discrete-time systems subject to input saturation. The proposed method takes advantage of the piecewise-affine dynamics to propagate the output…
We develop a new numerical method for approximating the infinite time reachable set of strictly stable linear control systems. By solving a linear program with a constraint that incorporates the system dynamics, we compute a polytope with…
We develop an algorithm for computing bounded reachability probability for hybrid systems, i.e., the probability that the system reaches an unsafe region within a finite number of discrete transitions. In particular, we focus on hybrid…
We present a complexity reduction algorithm for a family of parameter-dependent linear systems when the system parameters belong to a compact semi-algebraic set. This algorithm potentially describes the underlying dynamical system with…
It is shown that for two large subclasses of discrete-time nonlinear systems - analytic systems defined on a compact state space and rational systems - the minimum length $r^*$ for input sequences, called here accessibility index of the…
Reachable set computation is an important technique for the verification of safety properties of dynamical systems. In this paper, we investigate reachable set computation for discrete nonlinear systems based on parallelotope bundles. The…
In this paper, we consider families of linear systems (linear ensembles) defined by matrix pairs $\big( A(\theta),B(\theta) \big)$ depending on a parameter $\theta \in \p$ that is varying over a compact subset $\p$ of the complex plane. In…
In this paper, we propose a decision procedure of reachability for linear system {\xi}' = A{\xi} + u, where the matrix A's eigenvalues can be arbitrary algebraic numbers and the input u is a vector of trigonometric-exponential polynomials.…
A subalgebraic approximation algorithm is proposed to estimate from a set of time series the parameters of the observer representation of a discrete-time polynomial system without inputs which can generate an approximation of the observed…
Despite the possibility to quickly compute reachable sets of large-scale linear systems, current methods are not yet widely applied by practitioners. The main reason for this is probably that current approaches are not push-button-capable…