Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article

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

Published: 01 December 2008 Publication History
  • Get Citation Alerts
  • 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.

    References

    [1]
    Alefeld, G. and J. Herzberger, “Introduction to Interval Computations,” Computer Science and Applied Mathematics, 1974
    [2]
    Benvenuti, L., D. Bresolin, A. Casagrande, P. Collins, A. Ferrari, E. Mazzi, A. Sangiovanni-Vincentelli and T. Villa, Reachability computation for hybrid systems with ariadne, in: Proceedings of the 17th IFAC World Congress, 2008
    [3]
    Collins, P., Continuity and computability of reachable sets. Theor. Comput. Sci. v341. 162-195.
    [4]
    Collins, P., Optimal semicomputable approximations to reachable and invariant sets. Theory Comput. Syst. v41. 33-48.
    [5]
    Goldberg, D., What every computer scientist should know about floating-point arithmetic. Computing Surveys. v23. 5-48.
    [6]
    Goldsztejn, A. and W. Hayes, Reliable Inner Approximation of the Solution Set to Initial Value Problems with Uncertain Initial Value, in: Proceedings of SCAN 2006
    [7]
    Hayes, B., A Lucid Interval. American Scientist. v91. 484-488.
    [8]
    Jaulin, L., Kieffer, M., Didrit, O. and Walter, E., Applied Interval Analysis with Examples in Parameter and State Estimation, Robust Control and Robotics. 2001. Springer-Verlag.
    [9]
    Knueppel, O., PROFIL/BIAS - A Fast Interval Library. Computing. v53. 277-287.
    [10]
    Kühn, W., Rigorously Computed Orbits of Dynamical Systems Without the Wrapping Effect. Computing. v61. 47-67.
    [11]
    Kurzhanski, A.B. and Varaiya, P., On ellipsoidal techniques for reachability analysis. I. External approximations. Optim. Methods Softw. v17. 177-206.
    [12]
    Lohner, R., Enclosing the solutions of ordinary initial and boundary value problems. In: Wiley-Teubner Series in Computer Science, pp. 255-286.
    [13]
    Makino, K. and Berz, M., Suppression of the Wrapping Effect by Taylor Model-based Verified Integrators: Long-term Stabilization by Preconditioning. International Journal of Differential Equations and Applications. v10. 353-384.
    [14]
    Moore, R., Interval Analysis. 1966. Prentice-Hall.
    [15]
    Nedialkov, N.S., Jackson, K.R. and Corliss, G.F., Validated Solutions of Initial Value Problems for Ordinary Differential Equations. Applied Mathematics and Computation. v105. 21-68.
    [16]
    Neumaier, A., Interval Methods for Systems of Equations. 1990. Cambridge Univ. Press.
    [17]
    Ratschan, S. and She, Z., Constraints for continuous reachability in the verification of hybrid systems. In: LNCS, number 4120. pp. 196-210.
    [18]
    Ratschan, S. and She, Z., Safety verification of hybrid systems by constraint propagation based abstraction refinement. ACM Transactions in Embedded Computing Systems. v6.
    [19]
    Ratschan, S. and Z. She, Recursive and backward reasoning in the verification on hybrid systems, in: Proceedings of the 5th Int. Conf. on Informatics in Control, Automation and Robotics, 2008
    [20]
    Rump, S.M., INTLAB - Interval Laboratory. In: Csendes, T. (Ed.), Developments in Reliable Computing, Kluwer. pp. 77104
    [21]
    Wolfram Research inc., Mathematica, Champaign, Illinois (2007)
    [22]
    Zgliczynski, P., C1-Lohner Algorithm. Foundations of Computational Mathematics. v2. 429-465.

    Cited By

    View all
    • (2022)Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version)Information and Computation10.1016/j.ic.2022.104937289:PAOnline publication date: 1-Nov-2022
    • (2019)Facetal abstraction for non-linear dynamical systems based on δ-decidable SMTProceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control10.1145/3302504.3311793(99-108)Online publication date: 16-Apr-2019
    • (2018)Bracketing the solutions of an ordinary differential equation with uncertain initial conditionsApplied Mathematics and Computation10.1016/j.amc.2017.07.036318:C(70-79)Online publication date: 1-Feb-2018
    • Show More Cited By

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image Electronic Notes in Theoretical Computer Science (ENTCS)
    Electronic Notes in Theoretical Computer Science (ENTCS)  Volume 223, Issue
    December, 2008
    256 pages

    Publisher

    Elsevier Science Publishers B. V.

    Netherlands

    Publication History

    Published: 01 December 2008

    Author Tags

    1. Reachability analysis
    2. interval analysis
    3. nonlinear dynamical systems

    Qualifiers

    • Article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 11 Aug 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2022)Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version)Information and Computation10.1016/j.ic.2022.104937289:PAOnline publication date: 1-Nov-2022
    • (2019)Facetal abstraction for non-linear dynamical systems based on δ-decidable SMTProceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control10.1145/3302504.3311793(99-108)Online publication date: 16-Apr-2019
    • (2018)Bracketing the solutions of an ordinary differential equation with uncertain initial conditionsApplied Mathematics and Computation10.1016/j.amc.2017.07.036318:C(70-79)Online publication date: 1-Feb-2018
    • (2017)Guaranteed computation of robot trajectoriesRobotics and Autonomous Systems10.1016/j.robot.2017.03.02093:C(76-84)Online publication date: 1-Jul-2017
    • (2015)Monitoring Bounded LTL Properties Using Interval AnalysisElectronic Notes in Theoretical Computer Science (ENTCS)10.1016/j.entcs.2015.10.009317:C(85-100)Online publication date: 18-Nov-2015
    • (2011)An interval-based SAT modulo ODE solver for model checking nonlinear hybrid systemsInternational Journal on Software Tools for Technology Transfer (STTT)10.5555/3220907.322115813:5(449-461)Online publication date: 1-Oct-2011

    View Options

    View options

    Get Access

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media