The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems

15Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

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. © 2008 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Collins, P., & Goldsztejn, A. (2008). The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems. Electronic Notes in Theoretical Computer Science, 223(C), 87–102. https://doi.org/10.1016/j.entcs.2008.12.033

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free