Search-based planning with provable suboptimality bounds for continuous state spaces

Proceedings of the 4th Annual Symposium on Combinatorial Search, SoCS 2011

Volumn , Issue , 2011, Pages 60-67

  Gonzalez, Juan Pablo ^a   Likhachev, Maxim ^b  

^a General Dynamics Land Systems   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTINUOUS STATE SPACE; FAST SOLUTIONS; HIGHER RESOLUTION; INITIAL SOLUTION; LOWER RESOLUTION; MOBILE ROBOT MOTION-PLANNING; OPTIMAL PATHS; SUBOPTIMALITY;

MOTION PLANNING; OPTIMIZATION;

EQUIVALENCE CLASSES;

EID: 84893411936     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. Barraquand, J. &Latombe, J. 1993. Nonholonomic Multibody Mobile Robots: Controllability and Motion Planning in the Presence of Obstacles. Algorithmica, 10 (2-4), 121-155.
2. Gonzalez, J. &Stentz, A. 2009. Using linear landmarks for path planning with uncertainty in outdoor environments. Intelligent Robots and Systems, 2009. IROS 2009. IEEE/RSJ International Conference on, 1203-1210.
3. Hansen, E. A. &Zhou, R. 2007. Anytime heuristic search. Journal of Artificial Intelligence Research (JAIR), 28, 267-297.
4. Karaman, S. &Frazzoli, E. 2010. Incremental Sampling-based Algorithms for Optimal Motion Planning. Proceedings of Robotics: Science and Systems.
5. Kavraki, L. E.; Svestka, P.; Kavraki, L. E.; Latombe, J. &Overmars, M. H. 1996. Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces. IEEE Transactions on Robotics and Automation, 12, 566-580.
6. Koenig, S. &Likhachev, M. 2002. Dlite. Eighteenth national conference on Artificial intelligence, American Association for Artificial Intelligence, 476-483.
7. LaValle, S. 1998. Rapidly-exploring random trees: A new tool for path planning. TR 98-11, Computer Science Dept., Iowa State University.
8. Likhachev, M. &Ferguson, D. 2009. Planning Long Dynamically Feasible Maneuvers for Autonomous Vehicles. Int. J. Rob. Res., Sage Publications, Inc., 28, 933-945.
9. Likhachev, M.; Gordon, G. &Thrun, S. 2003. ARA&z.ast;: Formal Analysis. Tech. Rep. CMU-. CS-03-148, Carnegie Mellon University, Pittsburgh, PA.
10. Likhachev, M.; Gordon, G. &Thrun, S. 2003. ARA&z.ast;: Anytime A&z.ast; with provable bounds on sub-optimality. Advances in Neural Information Processing Systems (NIPS).
11. Pivtoraiko, M. &Kelly, A. 2005. Generating Near-Minimal Spanning Control Sets for Constrained Motion Planning in Discrete State Spaces. Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, 3231-3237.
12. Zhou, R. &Hansen, E. A. 2002. Multiple sequence alignment using anytime A&z.ast;. Eighteenth national conference on Artificial intelligence, American Association for Artificial Intelligence, 975-976.