Skip to main content

Guided Randomized Simulation

  • Conference paper
Hybrid Systems: Computation and Control (HSCC 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4416))

Included in the following conference series:

Abstract

The paper presents a simulation-based method for the validation of continuous and hybrid systems, which is built upon the RRT algorithm (Rapidly-exploring Random Trees). We propose a coverage measure, defined as the star discrepancy of the explored points, and use it to guide the simulation towards the behaviors of interest.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dang, T., Nahhal, T.: Randomized simulation of hybrid systems. Technical report, Verimag, IMAG (May 2006)

    Google Scholar 

  2. Branicky, M.S., et al.: Sampling-based reachability algorithms for control and verification of complex systems. In: Proc. Thirteenth Yale Workshop on Adaptive and Learning Systems, New Haven, CT (2005)

    Google Scholar 

  3. Esposito, J.M., Kim, J., Kumar, V.: Adaptive RRTs for validating hybrid robotic control systems. In: Int. Workshop on Algorithmic Foundations of Robotics (2004)

    Google Scholar 

  4. Bhatia, A., Frazzoli, E.: Incremental Search Methods for Reachability Analysis of Continuous and Hybrid Systems. In: Alur, R., Pappas, G.J. (eds.) HSCC 2004. LNCS, vol. 2993, pp. 142–156. Springer, Heidelberg (2004)

    Google Scholar 

  5. Kuipers, L., Niederreiter, H.: Uniform Distribution of Sequences. John Wiley, New York (1974)

    MATH  Google Scholar 

  6. LaValle, S.M., Kuffner, J.J.: Rapidly-exploring random trees: Progress and prospects. In: Algorithmic and Computational Robotics: New Directions, pp. 293–308. A K Peters, Wellesley (2001)

    Google Scholar 

  7. Thiémard, E.: An algorithm to compute bounds for the star discrepancy. J. Complexity 17(4), 850 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  8. Yershova, A., et al.: Dynamic-domain RRTs: Efficient exploration by controlling the sampling domain. In: Proc. IEEE Int. Conf. on Robotics and Automation, IEEE Computer Society Press, Los Alamitos (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Alberto Bemporad Antonio Bicchi Giorgio Buttazzo

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Nahhal, T., Dang, T. (2007). Guided Randomized Simulation. In: Bemporad, A., Bicchi, A., Buttazzo, G. (eds) Hybrid Systems: Computation and Control. HSCC 2007. Lecture Notes in Computer Science, vol 4416. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71493-4_72

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71493-4_72

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71492-7

  • Online ISBN: 978-3-540-71493-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics