 |
 |
|
|
| HAL: hal-00307009, version 1 |
| DOI: 10.3182/20080706-5-KR-1001.0569 |
| Detailed view |  Export this paper |
 |
| IFAC World Congress, Séoul : Corée, République De (2008) |
|
|
|
|
| Efficient reachability analysis for linear systems using support functions |
|
|
| Antoine Girard 1Colas Le Guernic 2 |
|
|
| (2008-07) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire Jean Kuntzmann (LJK) |
|
|
|
CNRS : UMR5224 – Université Joseph Fourier - Grenoble I – Université Pierre-Mendès-France - Grenoble II – Institut Polytechnique de Grenoble - Grenoble Institute of Technology |
|
|
| 2: | VERIMAG (VERIMAG - IMAG) |
|
|
|
CNRS : UMR5104 – Université Joseph Fourier - Grenoble I – Institut National Polytechnique de Grenoble (INPG) |
|
|
|
|
|
|
|
|
|
| Subject | : | Mathematics/Optimization and Control |
| hal-00307009, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00307009 | |
| oai:hal.archives-ouvertes.fr:hal-00307009 | |
| From: Antoine Girard | |
| Submitted on: Monday, 28 July 2008 17:17:24 | |
| Updated on: Wednesday, 2 January 2013 00:18:32 | |
