Reachability analysis of linear systems using support functions

Abstract : This work is concerned with the algorithmic reachability analysis of continuous-time linear systems with constrained initial states and inputs. We propose an approach for computing an over-approximation of the set of states reachable on a bounded time interval. The main contribution over previous works is that it allows us to consider systems whose sets of initial states and inputs are given by arbitrary compact convex sets represented by their support functions. We actually compute two over-approximations of the reachable set. The first one is given by the union of convex sets with computable support functions. As the representation of convex sets by their support function is not suitable for some tasks, we derive from this first over-approximation a second one given by the union of polyhedrons. The overall computational complexity of our approach is comparable to the complexity of the most competitive available specialized algorithms for reachability analysis of linear systems using zonotopes or ellipsoids. The effectiveness of our approach is demonstrated on several examples.
Document type :
Journal articles
Complete list of metadatas
Contributor : Brigitte Bidégaray-Fesquet <>
Submitted on : Saturday, December 15, 2012 - 12:08:35 AM
Last modification on : Thursday, July 4, 2019 - 9:54:02 AM

Links full text




Colas Le Guernic, Antoine Girard. Reachability analysis of linear systems using support functions. Nonlinear Analysis: Hybrid Systems, Elsevier, 2010, 4 (2), pp.250-262. ⟨10.1016/j.nahs.2009.03.002⟩. ⟨hal-00765598⟩



Record views