Sampling-based algorithms for optimal motion planning

International Journal of Robotics Research

Volumn 30, Issue 7, 2011, Pages 846-894

  Karaman, Sertac ^a   Frazzoli, Emilio ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Motion planning; Optimal path planning; Random geometric graphs; Sampling based algorithms

Indexed keywords

ASYMPTOTIC BEHAVIORS; ASYMPTOTICALLY OPTIMAL; CONSTANT FACTORS; FORMAL ANALYSIS; NUMBER OF SAMPLES; OPTIMAL MOTION PLANNING; OPTIMAL PATH PLANNING; PATH-PLANNING ALGORITHM; PROBABILISTIC ROAD MAPS; RANDOM GEOMETRIC GRAPHS; RAPIDLY-EXPLORING RANDOM TREES; SAMPLING-BASED; SAMPLING-BASED ALGORITHMS; TECHNICAL CONDITIONS;

COMPUTATIONAL COMPLEXITY; MOTION PLANNING; OPTIMIZATION; QUALITY CONTROL; STOCHASTIC SYSTEMS;

ALGORITHMS;

EID: 80052218929     PISSN: 02783649     EISSN: 17413176     Source Type: Journal    
DOI: 10.1177/0278364911406761     Document Type: Conference Paper

References (107)

1. Abramowitz M and Stegun IA (eds) (1964) Handbook of Mathematical Functions. New York: Dover.
2. Alterovitz R, Patil S and Derbakova A (2011) Rapidly-exploring roadmaps: Weighing exploration vs. reginement in optimal motion planning. In: IEEE Conference on Robotics and Automation (ICRA).
3. Arya S, Malamatos T and Mount DM (2005) Space-time tradeoffs for approximate spherical range counting. In: Symposium on Discrete Algorithms.
4. Arya S and Mount DM (2000) Approximate range searching. Computational Geometry: Theory and Applications 17: 135-163.
5. Arya S, Mount DM, Silverman R and Wu AY (1999) An optimal algorithm for approximate nearest neighbor search in fixed dimensions. Journal of the ACM 45: 891-923.
6. Balister P, Bollobás B and Sarkar A (2009a) Percolation, connectivity, coverage and colouring of random geometric graphs. In Bollobás B, Kozma R and Miklós D (eds), Handbook of Large- Scale Random Networks (Bolyai Society Mathematical Studies, Vol. 18). Berlin: Springer, pp. 117-142.
7. Balister P, Bollobás B, Sarkar A andWaltersM(2005) Connectivity of random k-nearest neighbour graphs. Advances in Applied Probability 37: 1-24. (Pubitemid 40573777)
8. Balister P, Bollobás B, Sarkar A and Walters M (2009b) A critical constant for the k nearest-neighbour model. Advances in Applied Probability 41: 1-12.
9. Barraquand J, Kavraki LE, Latombe JC, Li T, Motwani R and Raghavan P (1997) A random sampling scheme for path planning. The International Journal of Robotics Research 16: 759-774. (Pubitemid 127555191)
10. Barraquand J and Latombe JC (1993) Robot motion planning: A distributed representation approach. The International Journal of Robotics Research 10: 628-649.
11. Berenson D, Kuffner J and Choset H (2008) An optimization approach to planning for mobile manipulation. In IEEE International Conference on Robotics and Automation.
12. Berenson D, Simeon T and Srinivasa S (2011) Addressing costspace chasms in manipulation planning. In IEEE Conference on Robotics and Automation (ICRA).
13. Bhatia A and Frazzoli E (2004) Incremental search methods for reachability analysis of continuous and hybrid systems. In Alur R and Pappas G (eds), Hybrid Systems: Computation and Control (Lecture Notes in Computer Science, vol. 2993). Philadelphia, PA: Springer-Verlag, pp. 142-156.
14. Bollobás B (2001) Random Graphs (2nd edn). Cambridge: Cambridge University Press.
15. Bollobás B and Riordan OM (2006) Percolation. Cambridge: Cambridge University Press.
16. Branicky MS, Curtis MM, Levine J and Morgan S (2006) Sampling-based planning, control, and verification of hybrid systems. IEEE Proc. Control Theory and Applications 153: 575-590. (Pubitemid 44561814)
17. Branicky MS, Curtis MM, Levine JA and Morgan SB (2003) RRTs for nonlinear, discrete, and hybrid planning and control. In IEEE Conference on Decision and Control.
18. Branicky MS, LaValle SM, Olson K and Yang L (2001) Quasirandomized path planning. In IEEE Conference on Robotics and Automation.
19. Brooks R and Lozano-Perez T (1983) A subdivision algorithm in configuration space for findpath with rotation. In International Joint Conference on Artificial Intelligence.
20. Bruce J and Veloso M (2003) RoboCup 2002: Robot Soccer World Cup VI. In Real-Time Randomized Path Planning for Robot Navigation, (Lecture Notes in Computer Science, vol. 2752). Berlin: Springer, pp. 288-295.
21. Bry A and Roy N (2011) Rapidly-exploring random belief trees for motion planning under uncertainty. In IEEE Conference on Robotics and Automation (ICRA).
22. Canny J (1988) The Complexity of Robot Motion Planning. Cambridge, MA: The MIT Press.
23. Canny J and Reif JH (1987) New lower bound techniques for robot motion planning problems. In IEEE Symposium on Foundations of Computer Science (FoCS), Los Angeles, CA, pp. 49-60. (Pubitemid 18538580)
24. Chanzy P, Devroye L and Zamora-Cura C (2001) Analysis of range search for random k-d trees. Acta Informatica 37: 355-383.
25. Choset H, Lynch K, Hutchinson S, Kantor G, Burgard W, Kavraki L, et al. (2005) Principles of Robot Motion: Theory, Algorithms, and Implementations. Boston, MA: The MIT Press.
26. Cortes J, Jailet L and Simeon T (2007) Molecular disassembly with RRT-like algorithms. In IEEE International Conference on Robotics and Automation (ICRA).
27. Dolgov D, Thrun S, Montemerlo M and Diebel J (2009) Path planning for autonomous driving in unknown environments. Experimental Robotics. Berlin: Springer, pp. 55-64.
28. Dubhashi DP and Panconesi A (2009) Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge: Cambridge University Press.
29. Edelsbrunner H and Maurer HA (1981) On the intersection of orthogonal objects. Information Processing Letters 13: 177-181.
30. Eppstein D, Paterson M and Yao FF (1997) On nearest-neighbor graphs. Discrete and Computational Geometry 17: 263-282. (Pubitemid 127347395)
31. Ferguson D and Stentz A (2006) Anytime RRTs. In Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).
32. Finn PW and Kavraki LE (1999) Computational approaches to drug design. Algorithmica 25: 347-371. (Pubitemid 129674405)
33. Frazzoli E, Dahleh MA and Feron E (2002) Real-time motion planning for agile autonomous vehicles. Journal of Guidance, Control, and Dynamics 25: 116-129. (Pubitemid 34109520)
34. Ge SS and Cui Y (2002) Dynamic motion planning for mobile robots using potential field method. Autonomous Robots 13: 207-222. (Pubitemid 35377435)
35. Gilbert, E. N. (1961). Random plane networks. Journal of the Society for Industrial and Applied Mathematics 9: 533-543.
36. Grimmett G and Stirzaker D (2001) Probability and Random Processes (3rd edn). Oxford: Oxford University Press.
37. Gupta P and Kumar PR (1998) Critical power for asymptotic connectivity in wireless networks. In McEneany WM, Yin G and Zhang Q (eds), Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming. Boston, MA: Birkhäuser, pp. 547-566.
38. Gupta P and Kumar PR (2000) The capacity of wireless networks. IEEE Transactions on Information Theory 46: 388-404.
39. Henze N (1987) On the fraction of points with specified nearestneighbour interrelations and degree of attraction. Advances in Applied Probability 19: 873-895.
40. Hopcroft J, Schwartz J and Sharir M (1983) Efficient detection of intersections among spheres. The International Journal of Robotics Research 2: 77-80.
41. Hsu D, Kindel R, Latombe JC and Rock S (2002) Randomized kinodynamic motion planning with moving obstacles. The International Journal of Robotics Research 21: 233-255.
42. Hsu D, Latombe JC and Kurniawati H (2006) On the probabilistic foundations of probabilistic roadmap planning. The International Journal of Robotics Research 25: 7.
43. Hsu D, Latombe JC and Motwani R (1997) Path planning in expansive configuration spaces. In IEEE Conference on Robotics and Automation.
44. Hsu D, Latombe JC and Motwani R (1999) Path planning in expansive configuration spaces. International Journal of Computational Geometry and Applications 9: 495-512.
45. Jaillet L, Cortes J and Simeon T (2010) Sampling-based path planning on configuration-space costmaps. IEEE Transactions on Robotics 26: 635-646.
46. Karaman S and Frazzoli E (2010a) Incremental sampling-based algorithms for a class of pursuit-evasion games. In Workshop on Algorithmic Foundations of Robotics (WAFR), pp. 71-87.
47. Karaman S and Frazzoli E (2010b) Incremental sampling-based algorithms for optimal motion planning. In Robotics: Science and Systems (RSS).
48. Karaman S and Frazzoli E (2010c). Optimal kinodynamic motion planning using incremental sampling-based methods. In IEEE Conference on Decision and Control.
49. Karaman S, Walter M, Perez A, Frazzoli E and Teller S (2011) Anytime motion planning using the RRT?. In IEEE Conference on Robotics and Automation (ICRA).
50. Kavraki L and Latombe JC (1994) Randomized preprocessing of configuration space for fast path planning. In IEEE International Conference on Robotics and Automation.
51. Kavraki LE, Kolountzakis MN and Latombe JC (1998) Analysis of probabilistic roadmaps for path planning. IEEE Transactions on Roborics and Automation 14: 166-171. (Pubitemid 128742164)
52. Kavraki LE, Svestka P, Latombe JC and Overmars MH (1996) Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Transactions on Robotics and Automation 12: 566-580. (Pubitemid 126774162)
53. Khatib O (1986) Real-time obstacle avoidance for manipulators and mobile robots. The International Journal of Robotics Research 5: 90-98. (Pubitemid 16546612)
54. Koren Y and Borenstein J (1991) Potential field methods and their inherent limitations for mobile robot navigation. In IEEE Conference on Robotics and Automation.
55. Koyuncu E, Ure N and Inalhan G (2010) Integration of path/manuever planning in complex environments for agile maneuvering UCAVs. Jounal of Intelligent and Robotic Systems 57: 143-170.
56. Kuffner JJ, Kagami S, Nishiwaki K, Inaba M and Inoue H (2002) Dynamically-stable motion planning for humanoid robots. Autonomous Robots 15: 105-118. (Pubitemid 34156625)
57. Kuffner JJ and LaValle SM (2000) RRT-connect: An efficient approach to single-quert path planning. In Proceedings of the IEEE International Conference on Robotics and Automation.
58. Kuwata Y, Teo J, Fiore G, Karaman S, Frazzoli E and How J (2009) Real-time motion planning with applications to autonomous urban driving. IEEE Transactions on Control Systems 17: 1105-1118.
59. Ladd AL and Kavraki L (2004) Measure theoretic analysis of probabilistic path planning. IEEE Transactions on Robotics and Automation 20: 229-242.
60. Latombe JC (1991) Robot Motion Planning. Boston, MA: Kluwer Academic Publishers.
61. Latombe JC (1999) Motion planning: A journey of robots, molecules, digital actors, and other artifacts. The International Journal of Robotics Research 18: 1119-1128.
62. LaValle SM (2006) Planning Algorithms. Cambridge: Cambridge University Press.
63. LaValle SM, Branicky MS and Lindemann SR (2004) On the relationship between classical grid search and probabilistic roadmaps. The International Journal of Robotics Research 23: 673-692.
64. LaValle SM and Kuffner JJ (2001) Randomized kinodynamic planning. The International Journal of Robotics Research 20: 378-400.
65. LaValle SM and Kuffner JJ (2009) Space Filling Trees. Technical Report CMU-RI-TR-09-47, Carnegie Mellon University, The Robotics Institute.
66. Lee DT and Wong CK (1977) Worst-case analysis for region and partial region searches in multidimensional binary search trees and quad trees. Acta Informatica 9: 23-29. (Pubitemid 8574823)
67. Likhachev M and Ferguson D (2009) Planning long dynamicallyfeasible maneuvers for autonomous vehicles. The International Journal of Robotics Research 28: 933-945.
68. Likhachev M, Ferguson D, Gordon G, Stentz A and Thrun S (2008) Anytime search in dynamic graphs. Artificial intelligence Journal 172: 1613-1643.
69. Likhachev M, Gordon G and Thrun S (2004) Anytime a with provable bounds on sub-optimality. In Advances in Neural Information Processing Systems.
70. Lin MC and Manocha D (2004) Collision and proximity queries. In Goodman J and O'Rourke J (eds), Handbook of Discrete and Computational Geometry (2nd edn). London: Chapman and Hall/CRC.
71. Lindemann SR and LaValle SM (2005) Current issues in sampling-based motion planning. In Dario P and Chatila R (eds), Eleventh International Symposium on Robotics Research. Berlin: Springer, pp. 36-54.
72. Liu Y and Badler N (2003) Real-time reach planning for animated characters using hardware acceleration. In IEEE International Conference on Computer Animation and Social Characters, pp.86-93.
73. Lozano-Perez T and Wesley MA (1979) An algorithm for planning collision-free paths among polyhedral obstacles. Communications of the ACM 22: 560-570. (Pubitemid 10424755)
74. Luders B, Karaman S, Frazzoli E and How JP (2010) Bounds on tracking error using closed-loop rapidly-exploring random trees. In American Control Conference.
75. Meester R and Roy R (1996) Continuum Percolation. Cambridge: Cambridge University Press.
76. Munkres JR (2000) Topology (2nd edn). Englewood Cliffs, NJ: Prentice-Hall.
77. Nechushtan O, Raveh B and Halperin D (2010) Sampling-diagram automata: a tool for analyzing path quality in tree planners. In Hsu D, Isler V, Latombe JC and LinM(eds), Algorithmic Foundations of Robotics IX (Springer Tracts in Advanced Robotics, Vol. 68). Berlin: Springer, pp. 285-301.
78. Niederreiter H (1992) Random Number Generation and Quasi- Monte-Carlo Methods. Philadelphia, PA: Society for Industrial and Applied Mathematics.
79. Penrose MD (2003) Random Geometric Graphs. Oxford: Oxford University Press.
80. Plaku E, Bekris K, Chen B, Ladd A and Kavraki L (2005) Sampling-based roadmap of trees for parallel motion planning. IEEE Transactions on Robotics 21: 597-608. (Pubitemid 41226890)
81. Plaku E and Kavraki LE (2008) Quantitative analysis of nearestneighbors search in high-dimensional sampling-based motion planning. In Workshop on Algorithmic Foundations of Robotics (WAFR).
82. Prentice S and Roy N (2009) The belief roadmap: Efficient planning in blief space by factoring the covariance. The International Journal of Robotics Research 28: 1448-1465.
83. Quintanilla J, Torquato S and Ziff R (2000) Efficient measurement of the percolation threshold for fully penetrable discs. Journal of Physics A 33: L399-L407.
84. Reif JH (1979) Complexity of the mover's problem and generalizations. In Proceedings of the IEEE Symposium on Foundations of Computer Science.
85. Resnick SI (1999) A Probability Path. Basel: Birkhäuser.
86. Rimon E and Koditschek DE (1992) Exact robot navigation using artificial potential fields. IEEE Transactions on Robotics and Automation 8: 501-518. (Pubitemid 23580959)
87. Rowe NC and Alexander RS (2000) Finding optimal-path maps for path planning across weighted regions. The International Journal of Robotics Research 19: 83-95. (Pubitemid 30556766)
88. Sahimi M (1994) Applications of Percolation Theory. London: Taylor & Francis.
89. Samet H (1989a) Applications of Spatial Data Structures: Computer Graphics, Image Processesing and Gis. Reading, MA: Addison-Wesley.
90. Samet H (1989b) Design and Analysis of Spatial Data Structures. Reading, MA: Addison-Wesley.
91. Schrijver A (2003) Combinatorial Optimization, volume A. Berlin: Springer.
92. Schwartz JT and SharirM(1983) On the 'piano movers' problem: II. general techniques for computing topological properties of real algebraic manifolds. Advances in Applied Mathematics 4: 298-351.
93. Shkolnik A, Levashov M, Manchester IR and Tedrake R (2011) Bounding on rough terrain with the LittleDog robot. Submitted for publication.
94. Six H andWood D (1982) Counting and reporting intersections of D-ranges. IEEE Transactions on Computers, C-31: 181-187.
95. Stentz D (1995) The focussed Dalgorithm for real-time replanning. In International Joint Conference on Artificial Intelligence.
96. Stilman M, Schamburek J, Kuffner J and Asfour T (2007) Manipulation planning among movable obstacles. In IEEE International Conference on Robotics and Automation.
97. Stoyan D, Kendall WS and Mecke J (1995) Stochastic Geometry and Its Applications. New York: John Wiley & Sons.
98. Tedrake R, Manchester IR, Tobekin MM and Roberts JW (2011) LQR-trees: Feedback motion planning via sums of squares verification. The International Journal of Robotics Research (to appear).
99. Teller S, Walter MR, Antone M, Correa A, Davis R, Fletcher L, et al. (2010) A voice-commandable robotic forklift working alongside humans in minimally-prepared outdoor environments. In IEEE International Conference on Robotics and Automation.
100. Urmson C and Simmons R (2003) Approaches for heuristically biasing RRT growth. In Proceedings of the IEEE/RSJ International Conference on Robotics and Systems (IROS).
101. Wade AR (2007) Explicit laws of large numbers for random nearest-neighbor-type graphs. Advances in Applied Probability 39: 326-342. (Pubitemid 47278758)
102. Wade AR (2009) Asymptotic theory for the multidimensional random on-line nearest-neighbour graph. Stochastic Processes and their Applications 119: 1889-1911.
103. Wedge NA and Branicky M (2008) On heavy-tailed runtimes and restarts in rapidly-exploring random trees. In Twenty-third AAAI Conference on Artificial Intelligence.
104. Xue F and Kumar PR (2004) The number of neighbors needed for connectivity of wireless networks. Wireless Networks 10: 169-181.
105. Yershova A and LaValle SM (2007) Improving motion-planning algorithms by efficient nearest-neighbor searching. IEEE Transactions on Robotics 23: 151-157. (Pubitemid 46443349)
106. Yershova A and LaValle SM (2008) Motion Planning in Highly Constrained Spaces. Technical report, University of Illinois at Urbana-Champaign.
107. Zucker M, Kuffner JJ and Branicky MS (2007) Multiple RRTs for rapid replanning in dynamic environments. In IEEE Conference on Robotics and Automation.