Current issues in sampling-based motion planning

Springer Tracts in Advanced Robotics

Volumn 15, Issue , 2005, Pages 36-54

  Lindemann, Stephen R ^a   LaValle, Steven M ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL EFFICIENCY; DEGREES OF FREEDOM (MECHANICS); IMPORTANCE SAMPLING; PHILOSOPHICAL ASPECTS; WAVE FUNCTIONS;

BOUNDARY REPRESENTATIONS; COLLISION DETECTION ALGORITHM; COMPUTATION POWER; CONFIGURATION SPACE; MOTION PLANNING ALGORITHMS; REGULAR SAMPLINGS; SAMPLING-BASED METHOD; SAMPLING-BASED MOTION PLANNING;

MOTION PLANNING;

EID: 84885050332     PISSN: 16107438     EISSN: 1610742X     Source Type: Book Series    
DOI: 10.1007/11008941_5     Document Type: Article

References (70)

1. N. M. Amato, O. B. Bayazit, L. K. Dale, C. Jones, and D. Vallejo. OBPRM: An obstacle-based PRM for 3D workspaces. In Proceedings of the Workshop on Algorithmic Foundations of Robotics, pages 155-168, 1998.
2. N. M. Amato and Y. Wu. A randomized roadmap method for path and manipulation planning. In IEEE Int. Conf. Robot. & Autom., pages 113-120, 1996.
3. N.M. Amato, O.B. Bayazit, L.K. Dale, C. Jones, and D. Vallejo. Choosing good distance metrics and local planners for probabilistic roadmap methods. IEEE Trans. Robot. & Autom., 16(4):442-447, Aug 2000.
4. B. Baginski. The Z3 method for fast path planning in dynamic environments. In Proceedings of IASTED Conference on Applications of Control and Robotics, pages 47-52, 1996.
5. B. Baginski. Motion Planning for Manipulators with Many Degrees of Freedom-The BB-Method. PhD thesis, Technische Universität München, 1998.
6. J. Barraquand, L. Kavraki, J.-C. Latombe, T.-Y. Li, R. Motwani, and P. Raghavan. A random sampling scheme for robot path planning. In G. Giralt and G. Hirzinger, editors, Proc. of the 7th International Symposium on Robotics Research, pages 249-264. Springer, New York, NY, 1996.
7. J. Barraquand and J.-C. Latombe. A Monte-Carlo algorithm for path planning with many degrees of freedom. In IEEE Int. Conf. Robot. & Autom., pages 1712-1717, 1990.
8. S. Basu, R. Pollack, and M.-F. Roy. Algorithms in Real Algebraic Geometry. Springer-Verlag, Berlin, 2003.
9. K. E. Bekris, B. Y. Chen, A. M. Ladd, E. Plakue, and L. E. Kavraki. Multiple query probabilistic roadmap planners using single query primitives. In IEEE/RSJ Int. Conf. on Intelligent Robots & Systems, 2003.
10. R. Bohlin. Path planning in practice; lazy evaluation on a multi-resolution grid. In IEEE/RSJ Int. Conf. on Intelligent Robots & Systems, 2001.
11. R. Bohlin and L. Kavraki. Path planning using Lazy PRM. In IEEE Int. Conf. Robot. & Autom., 2000.
12. V. Boor, N. H. Overmars, and A. F. van der Stappen. The gaussian sampling strategy for probabilistic roadmap planners. In IEEE Int. Conf. Robot. & Autom., pages 1018-1023, 1999.
13. M. S. Branicky and M. M. Curtiss. Nonlinear and hybrid control via RRTs. In Proc. Intl. Symp. on Mathematical Theory of Networks and Systems, 2002.
14. M. S. Branicky, S. M. LaValle, K. Olson, and L. Yang. Quasi-randomized path planning. In Proc. IEEE Int'l Conf. on Robotics and Automation, pages 1481-1487, 2001.
15. R. A. Brooks and T. Lozano-Pérez. A subdivision algorithm in configuration space for findpath with rotation. IEEE Trans. Syst., Man, Cybern., SMC-15(2):224-233, 1985.
16. J. Bruce and M. Veloso. Real-time randomized path planning for robot navigation. In IEEE/RSJ Int. Conf. on Intelligent Robots & Systems, 2002.
17. J. F. Canny. The Complexity of Robot Motion Planning. MIT Press, Cambridge, MA, 1988.
18. P.C. Chen and Y.K. Hwang. Sandros: A motion planner with performance proportional to task difficulty. In Proc. of IEEE Int. Conf. Robotics and Automation, pages 2346-2353, Nice, France, 1992.
19. P. Cheng and S. M. LaValle. Resolution complete rapidly-exploring random trees. In Proc. IEEE Int'l Conf. on Robotics and Automation, pages 267-272, 2002.
20. P. Choudhury and K. Lynch. Trajectory planning for second-order underactuated mechanical systems in presence of obstacles. In Proceedings of the Workshop on Algorithmic Foundations of Robotics, 2002.
21. M. J. de Smith. Distance and Path: The Development, Interpretation and Application of Distance Measurement in Mapping and Modelling. PhD thesis, University College, University of London, London, 2003.
22. B. R. Donald. Motion planning with six degrees of freedom. Technical Report AI-TR-791, Artificial Intelligence Lab., Massachusetts Institute of Technology, 1984.
23. B. R. Donald. A search algorithm for motion planning with six degrees of freedom. Artif. Intell., 31:295-353, 1987.
24. B. Faverjon. Hierarchical object models for efficient anti-collision algorithms. In IEEE Int. Conf. Robot. & Autom., pages 333-340, 1989.
25. B. Faverjon and P. Tournassoud. A local based method for path planning of manipulators with a high number of degrees of freedom. In IEEE Int. Conf. Robot. & Autom., pages 1152-1159, 1987.
26. G. B. Folland. Real Analysis: Modern Techniques and Their Applications. Wiley, New York, 1984.
27. E. Frazzoli, M. A. Dahleh, and E. Feron. Real-time motion planning for agile autonomous vehicles. AIAA Journal of Guidance and Control, 25(1):116-129, 2002.
28. R. Geraerts and M. H. Overmars. A comparative study of probabilistic roadmap planners. In Proc. Workshop on the Algorithmic Foundations of Robotics, December 2002.
29. E. G. Gilbert, D. W. Johnson, and S. S. Keerth. A fast procedure for computing the distance between complex objects in three-dimensional space. IEEE J. of Robot. & Autom., RA-4(2):193-203, Apr 1988.
30. B. Glavina. Solving findpath by combination of goal-directed and randomized search. In IEEE Int. Conf. Robot. & Autom., pages 1718-1723, May 1990.
31. F. J. Hickernell, H. S. Hong, P. L'Ecuyer, and C. Lemieux. Extensible lattice sequences for quasi-Monte Carlo quadrature. SIAM Journal on Scientific Computing, 22:1117-1138, 2000.
32. D. Hsu, L. E. Kavraki, J.-C. Latombe, R. Motwani, and S. Sorkin. On finding narrow passages with probabilistic roadmap planners. In et al. P. Agarwal, editor, Robotics: The Algorithmic Perspective, pages 141-154. A.K. Peters, Wellesley, MA, 1998.
33. D. Hsu, J.-C. Latombe, and R. Motwani. Path planning in expansive configuration spaces. Int. J. Comput. Geom. & Appl., 4:495-512, 1999.
34. Y. K. Hwang and N. Ahuja. A potential field approach to path planning. IEEE Trans. Robot. & Autom., 8(1):23-32, February 1992.
35. P. Isto. Constructing probabilistic roadmaps with powerful local planning and path optimization. In IEEE/RSJ Int. Conf. on Intelligent Robots & Systems, pages 2323-2328, 2002.
36. S. Kagami, J. Kuffner, K. Nishiwaki, and K. Okada M. Inaba. Humanoid arm motion planning using stereo vision and RRT search. In IEEE/RSJ Int. Conf. on Intelligent Robots & Systems, 2003.
37. M. Kallmann, A. Aubel, T. Abaci, and D. Thalmann. Planning collision-free reaching motions for interative object manipulation and grasping. Eurographics, 22(3), 2003.
38. L. E. Kavraki, P. Svestka, J.-C. Latombe, and M. H. Overmars. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans. Robot. & Autom., 12(4):566-580, June 1996.
39. J. Kim and J. P. Ostrowski. Motion planning of aerial robot using rapidly-exploring random trees with dynamic constraints. In IEEE Int. Conf. Robot. & Autom., 2003.
40. Y. Koga, K. Kondo, J. Kuffner, and J.-C. Latombe. Planning motions with intentions. Computer Graphics (SIGGRAPH'94), pages 395-408, 1994.
41. K. Kondo. Motion planning with six degrees of freedom by multistrategic bidirectional heuristic free-space enumeration. IEEE Trans. Robot. & Autom., 7(3):267-277, 1991.
42. S. M. LaValle. Rapidly-exploring random trees: A new tool for path planning. TR 98-11, Computer Science Dept., Iowa State University, Oct. 1998.
43. S. M. LaValle, M. S. Branicky, and S. R. Lindemann. On the relationship between classical grid search and probabilistic roadmaps. International Journal of Robotics Research (to appear), 24, 2004.
44. S. M. LaValle and J. J. Kuffner. Rapidly-exploring random trees: Progress and prospects. In B. R. Donald, K. M. Lynch, and D. Rus, editors, Algorithmic and Computational Robotics: New Directions, pages 293-308. A K Peters, Wellesley, MA, 2001.
45. J. Lengyel, M. Reichert, B. R. Donald, and D. P. Greenberg. Real-time robot motion planning using rasterizing computer graphics hardware. Computer Graphics, 24(4):327-335, August 1990.
46. P. Leven and S. Hutchinson. Real-time motion planning in changing environments. In Proc. International Symposium on Robotics Research, 2000.
47. T.-Y. Li and Y.-C. Shie. An incremental learning approach to motion planning with roadmap management. In IEEE Int. Conf. Robot. & Autom., 2002.
48. S. R. Lindemann and S. M. LaValle. Incremental low-discrepancy lattice methods for motion planning. In Proc. IEEE International Conference on Robotics and Automation, pages 2920-2927, 2003.
49. T. Lozano-Pérez. A simple motion-planning algorithm for general robot manipulators. IEEE J. of Robot. & Autom., RA-3(3):224-238, Jun 1987.
50. T. Lozano-Pérez and M. A. Wesley. An algorithm for planning collision-free paths among polyhedral obstacles. Communications of the ACM, 22(10):560-570, 1979.
51. J. Matousek. Geometric Discrepancy. Springer-Verlag, Berlin, 1999.
52. E. Mazer, J. M. Ahuactzin, and P. Bessière. The Ariadne's clew algorithm. J. Artificial Intell. Res., 9:295-316, November 1998.
53. E. Mazer, G. Talbi, J. M. Ahuactzin, and P. Bessière. The Ariadne's clew algorithm. In Proc. Int. Conf. of Society of Adaptive Behavior, Honolulu, 1992.
54. H. Niederreiter. Random Number Generation and Quasi-Monte-Carlo Methods. Society for Industrial and Applied Mathematics, Philadelphia, USA, 1992.
55. H. Niederreiter and C. P. Xing. Nets, (t, s)-sequences, and algebraic geometry. In P. Hellekalek and G. Larcher, editors, Random and Quasi-Random Point Sets, Lecture Notes in Statistics, Vol. 138, pages 267-302. Springer-Verlag, Berlin, 1998.
56. N. J. Nilsson. Shakey the robot. Technical Report TR 223, SRI International, 1984.
57. A. B. Owen. Monte Carlo variance of scrambled equidistribution quadrature. SIAM J. Numer. Anal., 34(5):1884-1910, 1997.
58. B. Paden, A. Mees, and M. Fisher. Path planning using a Jacobian-based freespace generation algorithm. In IEEE Int. Conf. Robot. & Autom., pages 1732-1737, 1989.
59. J. Pettré, J.-P. Laumond, and T. Siméon. A 2-stages locomotion planner for digital actors. In Eurographics/SIGGRAPH Symposium on Computer Animation, pages 258-264, 2003.
60. C. Pisula, K. Hoff, M. Lin, and D. Manoch. Randomized path planning for a rigid body based on hardware accelerated Voronoi sampling. In Proc. Workshop on Algorithmic Foundation of Robotics, 2000.
61. J. H. Reif. Complexity of the mover's problem and generalizations. In Proc. of IEEE Symp. on Foundat. of Comp. Sci., pages 421-427, 1979.
62. J. T. Schwartz and M. Sharir. On the piano movers' problem: II. General techniqies for computing topological properties of algebraic manifolds. Communications on Pure and Applied Mathematics, 36:345-398, 1983.
63. T. Simeon, J.-P. Laumond., and C. Nissoux. Visibility based probabilistic roadmaps for motion planning. Advanced Robotics Journal, 14(6), 2000.
64. I. H. Sloan and S. Joe. Lattice Methods for Multiple Integration. Oxford Science Publications, Englewood Cliffs, NJ, 1990.
65. G. Song and N. M. Amato. Using motion planning to study protein folding pathways. Journal of Computational Biology, 9(2):149-168, 2002.
66. A. G. Sukharev. Optimal strategies of the search for an extremum. U.S.S.R. Computational Mathematics and Mathematical Physics, 11(4), 1971. Translated from Russian, Zh. Vychisl. Mat. i Mat. Fiz., 11, 4, 910-924, 1971.
67. C. Urmson and R. Simmons. Approaches for heuristically biasing RRT growth. In IEEE/RSJ Int. Conf. on Intelligent Robots & Systems, 2003.
68. X. Wang and F. J. Hickernell. Randomized Halton sequences. Math. Comp. Modelling, 32:887-899, 2000.
69. S. A. Wilmarth, N. M. Amato, and P. F. Stiller. MAPRM: A probabilistic roadmap planner with sampling on the medial axis of the free space. In IEEE Int. Conf. Robot. & Autom., pages 1024-1031, 1999.
70. J. Yakey, S. M. LaValle, and L. E. Kavraki. Randomized path planning for linkages with closed kinematic chains. IEEE Transactions on Robotics and Automation, 17(6):951-958, December 2001.