publication . Conference object . Preprint . 2010

Incremental Sampling-based Algorithms for Optimal Motion Planning

Sertac Karaman; Emilio Frazzoli;
Open Access
  • Published: 27 Jun 2010
  • Publisher: Robotics: Science and Systems Foundation
Comment: 20 pages, 10 figures, this manuscript is submitted to the International Journal of Robotics Research, a short version is to appear at the 2010 Robotics: Science and Systems Conference.
Persistent Identifiers
arXiv: Computer Science::Robotics
free text keywords: Computer Science - Robotics, 68T40, Algorithm, Sampling (statistics), Completeness (statistics), Almost surely, Probabilistic logic, Tree structure, Computational complexity theory, Computer science, Random graph, Mathematical optimization, Motion planning
Related Organizations
74 references, page 1 of 5

[1] J. Latombe. Motion planning: A journey of robots, molecules, digital actors, and other artifacts. International Journal of Robotics Research, 18(11):1119-1128, 1999.

[2] A. Bhatia and E. Frazzoli. Incremental search methods for reachability analysis of continuous and hybrid systems. In R. Alur and G.J. Pappas, editors, Hybrid Systems: Computation and Control, number 2993 in Lecture Notes in Computer Science, pages 142-156. Springer-Verlag, Philadelphia, PA, March 2004.

[3] M. S. Branicky, M. M. Curtis, J. Levine, and S. Morgan. Samplingbased planning, control, and verification of hybrid systems. IEEE Proc. Control Theory and Applications, 153(5):575-590, Sept. 2006.

[4] J. Cortes, L. Jailet, and T. Simeon. Molecular disassembly with RRTlike algorithms. In IEEE International Conference on Robotics and Automation (ICRA), 2007.

[5] Y. Liu and N.I. Badler. Real-time reach planning for animated characters using hardware acceleration. In IEEE International Conference on Computer Animation and Social Characters, pages 86-93, 2003.

[6] P.W. Finn and L.E. Kavraki. Computational approaches to drug design. Algorithmica, 25:347-371, 1999.

[7] T. Lozano-Perez and M. A. Wesley. An algorithm for planning collisionfree paths among polyhedral obstacles. Communications of the ACM, 22(10):560-570, 1979.

[8] J. T. Schwartz and M. Sharir. On the 'piano movers' problem: II. general techniques for computing topological properties of real algebraic manifolds. Advances in Applied Mathematics, 4:298-351, 1983.

[9] J.H. Reif. Complexity of the mover's problem and generalizations. In Proceedings of the IEEE Symposium on Foundations of Computer Science, 1979.

[10] R. Brooks and T. Lozano-Perez. A subdivision algorithm in configuration space for findpath with rotation. In International Joint Conference on Artificial Intelligence, 1983.

[11] J. Barraquand and J. C. Latombe. Robot motion planning: A distributed representation approach. International Journal of Robotics Research, 10(6):628-649, 1993.

[12] O. Khatib. Real-time obstacle avoidance for manipulators and mobile robots. International Journal of Robotics Research, 5(1):90-98, 1986. [OpenAIRE]

[13] J. Canny. The Complexity of Robot Motion Planning. MIT Press, 1988.

[14] S. S. Ge and Y.J. Cui. Dynamic motion planning for mobile robots using potential field method. Autonomous Robots, 13(3):207-222, 2002.

[15] Y. Koren and J. Borenstein. Potential field methods and their inherent limitations for mobile robot navigation. In IEEE Conference on Robotics and Automation, 1991.

74 references, page 1 of 5
Any information missing or wrong?Report an Issue