Add to ORKGA model of 2D continuous-discrete linear system is considered whose input disturbances are unknown but bounded by known ellipsoid. The formula for a support function of reachability set of this system is presented. A method of construction of ellipsoid limiting reachability set is proposed and illustrated with an example
Robustly feasible invariant sets provide a way of identifying stabilizable regions for uncertain/tim...
This paper introduces a technique for solving the problem of control synthesis for linear systems wi...
In this paper, we discuss semidefinite relaxation techniques for computing minimal size ellipsoids t...
This paper addresses the problem of reachable set bounding for linear discrete-time systems that are...
Abstract—In a previous paper we showed how the continual reachability set can be numerically compute...
Special Issue: IFAC World Congress 2008International audienceThis work is concerned with the algorit...
This paper addresses the problem of reachable set bounding for linear systems in the presence of bot...
This paper investigates the problem of reachable set bounding for discrete-time system with time-var...
This article gives an early account of the application of ellipsoidal techniques to various problems...
The problem of reachable set bounding for a class of linear systems subject to both discrete and dis...
The investigation of control and estimation problems under unknown but bounded errors and disturbanc...
International audienceThis work extends reachability analyses based on ellipsoidal techniques to Lin...
This paper presents a new approach to the reachability problem for a class of hybrid systems called ...
This paper presents sufficient conditions for the robust stabilization of discrete-time polytopic sy...
The properties of reachable sets for linear dynamical systems for specified control sets are discuss...
Robustly feasible invariant sets provide a way of identifying stabilizable regions for uncertain/tim...
This paper introduces a technique for solving the problem of control synthesis for linear systems wi...
In this paper, we discuss semidefinite relaxation techniques for computing minimal size ellipsoids t...
This paper addresses the problem of reachable set bounding for linear discrete-time systems that are...
Abstract—In a previous paper we showed how the continual reachability set can be numerically compute...
Special Issue: IFAC World Congress 2008International audienceThis work is concerned with the algorit...
This paper addresses the problem of reachable set bounding for linear systems in the presence of bot...
This paper investigates the problem of reachable set bounding for discrete-time system with time-var...
This article gives an early account of the application of ellipsoidal techniques to various problems...
The problem of reachable set bounding for a class of linear systems subject to both discrete and dis...
The investigation of control and estimation problems under unknown but bounded errors and disturbanc...
International audienceThis work extends reachability analyses based on ellipsoidal techniques to Lin...
This paper presents a new approach to the reachability problem for a class of hybrid systems called ...
This paper presents sufficient conditions for the robust stabilization of discrete-time polytopic sy...
The properties of reachable sets for linear dynamical systems for specified control sets are discuss...
Robustly feasible invariant sets provide a way of identifying stabilizable regions for uncertain/tim...
This paper introduces a technique for solving the problem of control synthesis for linear systems wi...
In this paper, we discuss semidefinite relaxation techniques for computing minimal size ellipsoids t...