Skip to main content

Growth Bounds

  • Chapter
  • First Online:
Interval Reachability Analysis

Part of the book series: SpringerBriefs in Electrical and Computer Engineering ((BRIEFSCONTROL))

  • 468 Accesses

Abstract

In this chapter, we consider reachability methods that characterize how a set centered around a system trajectory grows or contracts as the trajectory evolves. In particular, we consider interval growth bounds, which characterize the growth and contraction of intervals. An interval over-approximation of the reachable set from an interval of initial states can be obtained by computing a single successor state from the center of the initial set and bounding the growth of neighboring trajectories. We first describe the general method for over-approximating reachable sets with interval growth bounds. Then, we describe three methods to compute such growth bounds: from a matrix measure of the state Jacobian matrix; from a componentwise upper bound on the state Jacobian matrix; and from matrix measures of a blockwise partition of the state Jacobian matrix to allow for a greater flexibility in computational efficiency and conservativeness.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Such bounds are also known as contraction metrics (Aylward et al. 2008), discrepancy functions (Fan et al. 2016), and the property of incremental stability (Angeli 2002). Despite the name, growth bounds also describe the contraction of sets.

References

  • Aminzare Z, Sontag ED (2014) Contraction methods for nonlinear systems: a brief introduction and some open problems. In: 53rd IEEE conference on decision and control. IEEE, pp 3835–3847

    Google Scholar 

  • Angeli D (2002) A Lyapunov approach to incremental stability properties. IEEE Trans Autom Control 47(3):410–421

    Article  MathSciNet  Google Scholar 

  • Arcak M, Maidens J (2018) Simulation-based reachability analysis for nonlinear systems using componentwise contraction properties. In: Principles of modeling. Springer, pp 61–76

    Google Scholar 

  • Aylward EM, Parrilo PA, Slotine JJE (2008) Stability and robustness analysis of nonlinear systems via contraction metrics and SOS programming. Automatica 44(8):2163–2170

    Article  MathSciNet  Google Scholar 

  • Fan C, Kapinski J, Jin X, Mitra S (2016) Locally optimal reach set over-approximation for nonlinear systems. In: 2016 international conference on embedded software (EMSOFT). IEEE, pp 1–10

    Google Scholar 

  • Kapela T, ZgliczyÅ„ski P (2009) A Lohner-type algorithm for control systems and ordinary differential inclusions. Discrete Contin Dyn Syst Ser B 11(2):365–385

    MathSciNet  MATH  Google Scholar 

  • Maidens J, Arcak M (2014) Reachability analysis of nonlinear systems using matrix measures. IEEE Trans Autom Control 60(1):265–270

    Article  MathSciNet  Google Scholar 

  • Reissig G, Weber A, Rungger M (2016) Feedback refinement relations for the synthesis of symbolic controllers. IEEE Trans Autom Control 62(4):1781–1796

    Article  MathSciNet  Google Scholar 

  • Rungger M, Zamani M (2016) SCOTS: A tool for the synthesis of symbolic controllers. In: Proceedings of the 19th international conference on hybrid systems: computation and control, pp 99–104

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Pierre-Jean Meyer .

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Meyer, PJ., Devonport, A., Arcak, M. (2021). Growth Bounds. In: Interval Reachability Analysis. SpringerBriefs in Electrical and Computer Engineering(). Springer, Cham. https://doi.org/10.1007/978-3-030-65110-7_6

Download citation

Publish with us

Policies and ethics