Guided randomized simulation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4416 LNCS, Issue , 2007, Pages 731-735

  Nahhal, Tarik ^a   Dang, Thao ^a  

^a VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INFORMATION ANALYSIS; TREES (MATHEMATICS);

HYBRID SYSTEMS; RRT ALGORITHM (RAPIDLY-EXPLORING RANDOM TREES);

COMPUTER SIMULATION;

EID: 38049144905     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71493-4_72     Document Type: Conference Paper

References (8)

1. T. Dang and T. Nahhal. Randomized simulation of hybrid systems. Technical report, Verimag, IMAG, May 2006.
2. M. S. Branicky, M. M. Curtiss, J. Levine, and Stuart Morgan. Sampling-based reachability algorithms for control and verification of complex systems. Proc. Thirteenth Yale Workshop on Adaptive and Learning Systems, New Haven, CT, 2005.
3. J.M. Esposito, J. Kim, and V. Kumar. Adaptive RRTs for validating hybrid robotic control systems. In Int. Workshop on Algorithmic Foundations of Robotics, 2004.
4. A. Bhatia and E. Frazzoli. Incremental Search Methods for Reachability Analysis of Continuous and Hybrid Systems. In HSCC, LNCS 2993, 142-156, Springer, 2004.
5. L. Kuipers and H. Niederreiter. Uniform Distribution of Sequences. John Wiley, New York, 1974.
6. S. M. LaValle and J. J. Kuffner. Rapidly-exploring random trees: Progress and prospects. In Algorithmic and Computational Robotics: New Directions, pages 293-308. A K Peters, Wellesley, MA, 2001.
7. E. Thiémard. An algorithm to compute bounds for the star discrepancy. J. Complexity 17(4):850, Dec 2001.
8. A. Yershova, L. Jaillet, T. Simeon, and S.M. LaValle. Dynamic-domain RRTs: Efficient exploration by controlling the sampling domain. In Proc. IEEE Int. Conf. on Robotics and Automation, 2005.