RRTs for nonlinear, discrete, and hybrid planning and control

In this paper, we describe a planning and control approach in terms of sampling using Rapidly-exploring Random Trees (RRTs), which were introduced by LaValle. We review RRTs for motion planning and show how to use them to solve standard nonlinear control problems. We extend them to the case of hybrid systems and describe our modifications to LaValle's Motion Strategy Library to allow for hybrid motion planning. Finally, we extend them to purely discrete spaces (using heuristic evaluation as a distance metric) and provide computational experiments comparing them to conventional methods, such as A.

[1]  B. Achiriloaie,et al.  VI REFERENCES , 1961 .

[2]  Mark W. Spong,et al.  Swing up control of the Acrobot , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[3]  Michael S. Branicky,et al.  Studies in hybrid systems: modeling, analysis, and control , 1996 .

[4]  Andrew G. Barto,et al.  Reinforcement learning , 1998 .

[5]  V. Borkar,et al.  A unified framework for hybrid control: model and optimal control theory , 1998, IEEE Trans. Autom. Control..

[6]  Emilio Frazzoli,et al.  A hybrid control architecture for aggressive maneuvering of autonomous helicopters , 1999, Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304).

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

[8]  Michael S. Branicky,et al.  Nonlinear and Hybrid Control Via RRTs , 2002 .

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

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