Efficient reachability analysis for linear systems using support functions

Abstract : This work is concerned with the algorithmic reachability analysis of linear systems with constrained initial states and inputs. In this paper, we present a new approach for the computation of tight polyhedral over-approximations of the reachable sets of a linear system. The main contribution over our previous work is that it makes it possible to consider systems whose sets of initial states and inputs are given by arbitrary compact convex sets represented by their support functions. We first consider the discrete-time setting and then we show how our algorithm can be extended to handle continuous-time linear systems. Finally, the effectiveness of our approach is demonstrated through several examples.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00307009
Contributor : Antoine Girard <>
Submitted on : Monday, July 28, 2008 - 5:17:24 PM
Last modification on : Thursday, July 4, 2019 - 9:54:02 AM

Identifiers

Collections

Citation

Antoine Girard, Colas Le Guernic. Efficient reachability analysis for linear systems using support functions. IFAC World Congress, Jul 2008, Séoul, South Korea. pp.8966-8971, ⟨10.3182/20080706-5-KR-1001.0569⟩. ⟨hal-00307009⟩

Share

Metrics

Record views

418