Adaptive RRTs for Validating Hybrid Robotic Control Systems

Abstract : Most robot control and planning algorithms are complex, involving a combination of reactive controllers, behavior-based controllers, and deliberative controllers. The switching between different behaviors or controllers makes such systems hybrid, i.e. combining discrete and continuous dynamics. While proofs of convergence, robustness and stability are often available for simple controllers under a carefully crafted set of operating conditions, there is no systematic approach to experimenting with, testing, and validating the performance of complex hybrid control systems. In this paper we address the problem of generating sets of conditions (inputs, disturbances, and parameters) that might be used to "test" a given hybrid system. We use the method of Rapidly exploring Random Trees (RRTs) to obtain test inputs. We extend the traditional RRT, which only searches over continuous inputs, to a new algorithm called the Rapidly exploring Random Forest of Trees (RRFT), which can also search over time invariant parameters by growing a set of trees for each parameter value choice. We introduce new measures for coverage and tree growth that allows us to dynamically allocate our resources among the set of trees and to plant new trees when the growth rate of existing ones slows to an unacceptable level. We demonstrate the application of RRFT to testing and validation of aerial robotic control systems.

[1]  J. Esposito Randomized test case generation for hybrid systems: metric selection , 2004, Thirty-Sixth Southeastern Symposium on System Theory, 2004. Proceedings of the.

[2]  Ian M. Mitchell,et al.  Level Set Methods for Computation in Hybrid Systems , 2000, HSCC.

[3]  Steven M. LaValle,et al.  Reducing metric sensitivity in randomized trajectory design , 2001, Proceedings 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems. Expanding the Societal Role of Robotics in the the Next Millennium (Cat. No.01CH37180).

[4]  E. Feron,et al.  Real-time motion planning for agile autonomous vehicles , 2000, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).

[5]  Emilio Frazzoli,et al.  Real-Time Motion Planning for Agile Autonomous Vehicles , 2000 .

[6]  Steven M. LaValle,et al.  Randomized Kinodynamic Planning , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[7]  John Canny,et al.  The complexity of robot motion planning , 1988 .

[8]  J. Halton On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals , 1960 .

[9]  Joshua A. Levine,et al.  Sampling-Based Planning for Hybrid Systems , 2003 .

[10]  Maja J. Mataric,et al.  Issues and approaches in the design of collective autonomous agents , 1995, Robotics Auton. Syst..

[11]  Thomas A. Henzinger,et al.  Automatic symbolic verification of embedded systems , 1993, 1993 Proceedings Real-Time Systems Symposium.

[12]  Thao Dang,et al.  d/dt: A Tool for Reachability Analysis of Continuous and Hybrid Systems , 2001 .

[13]  Gerardo Lafferriere,et al.  Symbolic Reachability Computation for Families of Linear Vector Fields , 2001, J. Symb. Comput..

[14]  Thomas A. Henzinger,et al.  Beyond HYTECH: Hybrid Systems Analysis Using Interval Numerical Methods , 2000, HSCC.

[15]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .

[16]  Michael M. Curtiss,et al.  RRTs for nonlinear, discrete, and hybrid planning and control , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[17]  Ning Xi,et al.  Intelligent Motion Planning and Control for Robot Arms , 1993 .

[18]  S. LaValle,et al.  Randomized Kinodynamic Planning , 2001 .

[19]  Steven M. LaValle,et al.  On the Relationship between Classical Grid Search and Probabilistic Roadmaps , 2004, Int. J. Robotics Res..

[20]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

[21]  Gerardo Lafferriere,et al.  A New Class of Decidable Hybrid Systems , 1999, HSCC.

[22]  Bruce H. Krogh,et al.  Computational techniques for hybrid system verification , 2003, IEEE Trans. Autom. Control..

[23]  Vijay Kumar,et al.  Design and verification of controllers for airships , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[24]  Steven M. LaValle,et al.  Rapidly-Exploring Random Trees: Progress and Prospects , 2000 .

[25]  Yong K. Hwang,et al.  SANDROS: a dynamic graph search algorithm for motion planning , 1998, IEEE Trans. Robotics Autom..

[26]  Daniel E. Koditschek,et al.  Safe Cooperative Robot Patterns via Dynamics on Graphs , 1998 .

[27]  Lydia E. Kavraki,et al.  Probabilistic roadmaps for path planning in high-dimensional configuration spaces , 1996, IEEE Trans. Robotics Autom..

[28]  Steven M. LaValle,et al.  From Dynamic Programming to RRTs: Algorithmic Design of Feasible Trajectories , 2003, Control Problems in Robotics.

[29]  Qianchuan Zhao,et al.  Generating test inputs for embedded control systems , 2003 .