2008-12-01
The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems
Publication
Publication
Electronic Notes in Theoretical Computer Science , Volume 223 p. 87- 102
Presented at the
Workshop on Reachability Problems, Liverpool, UK
This paper introduces a new algorithm dedicated to the rigorous reachability analysis of nonlinear dynamical systems. The algorithm is initially presented in the context of discrete time dynamical systems, and then extended to continuous time dynamical systems driven by ODEs. In continuous time, this algorithm is called the Reach and Evolve algorithm. The Reach and Evolve algorithm is based on interval analysis and a rigorous discretization of space and time. Promising numerical experiments are presented.
| Additional Metadata | |
|---|---|
| , , | |
| , | |
| Elsevier | |
| Electronic Notes in Theoretical Computer Science | |
| Computational Topology for Systems and Control | |
| Workshop on Reachability Problems | |
| Organisation | Scientific Computing |
|
Collins, P., & Goldsztejn, A. (2008). The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems. In Electronic Notes in Theoretical Computer Science (Vol. 223, pp. 87–102). Elsevier. |
|
