Recent developments in motion planning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2331 LNCS, Issue PART 3, 2002, Pages 3-13

  Overmars, Mark H ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

MOTION PLANNING; OPTIMAL SYSTEMS; VIRTUAL REALITY;

APPLICATION AREA; MOTION PLANNING PROBLEMS; PROBABILISTIC ROADMAP;

ROBOT PROGRAMMING;

EID: 0010279730     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47789-6_1     Document Type: Conference Paper

References (27)

1. N. Amato, O. Bayazit, L. Dale, C. Jones, D. Vallejo, OBPRM: An obstacle-based PRM for 3D workspaces, in: P.K. Agarwal, L.E. Kavraki, M.T. Mason (eds.), Robotics: The algorithmic perspective, A.K. Peters, Natick, 1998, pp. 155-168.
2. N. Amato, Y. Wu, A randomized roadmap method for path and manipulation planning, Proc. IEEE Int. Conf. on Robotics and Automation, 1996, pp. 113-120.
3. P. Bessière. J.M. Ahuactzin, E.-G. Talbi, E. Mazer, The Ariadne's clew algorithm: Global planning with local methods, in: K. Goldberg et al. (eds.), Algorithmic foundations of robotics, A.K. Peters, 1995, pp. 39-47.
4. R. Bohlin, L.E. Kavraki, Path planning using lazy PRM, Proc. IEEE Int. Conf. on Robotics and Automation, 2000, pp. 521-528.
5. V. Boor, M.H. Overmars, A.F. van der Stappen, The Gaussian sampling strategy for probabilistic roadmap planners, Proc. IEEE Int. Conf. on Robotics and Automation, 1999, pp. 1018-1023.
6. J. Cortes, T. Simeon, J.P. Laumond, A random loop generator for planning the motions of closed kinematic chains using PRM methods, Rapport LAAS N01432, 2001.
7. L. Han, N. Amato, A kinematics-based probabilistic roadmap method for closed chain systems, Proc. Workshop on Algorithmic Foundations of Robotics (WAFR'00), 2000, pp. 233-246.
8. O. Hofstra, D. Nieuwenhuisen, M.H. Overmars, Improving path quality for probabilistic roadmap planners, 2002, in preparation.
9. C. Holleman, L. Kavraki, J. Warren, Planning paths for a flexible surface patch, Proc. IEEE Int. Conf. on Robotics and Automation, 1998, pp. 21-26.
10. D. Hsu, L. Kavraki, J.C. Latombe, R. Motwani, S. Sorkin, On finding narrow passages with probabilistic roadmap planners, in: P.K. Agarwal, L.E. Kavraki, M.T. Mason (eds.), Robotics: The algorithmic perspective, A.K. Peters, Natick, 1998, pp. 141-154.
11. L. Kavraki, Random networks in configuration space for fast path planning, PhD thesis, Stanford University, 1995.
12. L. Kavraki, M. Kolountzakis, J.C. Latombe, Analysis of probabilistic roadmaps for path planning, Proc. IEEE Int. Conf. on Robotics and Automation, 1996, pp. 3020-3025.
13. L. Kavraki, J.C. Latombe, Randomized preprocessing of configuration space for fast path planning, Proc. IEEE Int. Conf. on Robotics and Automation, 1994, pp. 2138-2145.
14. L. Kavraki, P. Švestka, J-C. Latombe, M.H. Overmars, Probabilistic roadmaps for path planning in high-dimensional configuration spaces, IEEE Trans. on Robotics and Automation 12 (1996), pp. 566-580.
15. F. Lamiraux, L.E. Kavraki, Planning paths for elastic objects under manipulation constraints, Int. Journal of Robotics Research 20 (2001), pp. 188-208.
16. J-C. Latombe, Robot motion planning, Kluwer Academic Publishers, Boston, 1991.
17. C. Nissoux, T. Siméon, J.-P. Laumond, Visibility based probabilistic roadmaps, Proc. IEEE Int. Conf. on Intelligent Robots and Systems, 1999, pp. 1316-1321.
18. M.H. Overmars, A random approach to motion planning, Technical Report RUUCS-92-32, Dept. Comput. Sci., Utrecht Univ., Utrecht, the Netherlands, October 1992.
19. G. Sánchez, J.-C. Latombe, A single-query bi-directional probabilistic roadmap planner with lazy collision checking, Int. Journal of Robotics Research, 2002, to appear.
20. D. Sent, M.H. Overmars, Motion planning in an environment with dangerzones, Proc. IEEE Int. Conf. on Robotics and Automation, 2001, pp. 1488-1493.
21. T. Simeon, J. Cortes, A. Sahbani, J.P. Laumond, A manipulation planner for pick and place operations under continuous grasps and placements, Rapport LAAS N01433, 2001.
22. P. Švestka, Robot motion planning using probabilistic roadmaps, PhD thesis, Utrecht Univ. 1997.
23. P. Švestka, M.H. Overmars, Motion planning for car-like robots, a probabilistic learning approach, Int. Journal of Robotics Research 16 (1997), pp. 119-143.
24. P. Švestka, M.H. Overmars, Coordinated path planning for multiple robots, Robotics and Autonomous Systems 23 (1998), pp. 125-152.
25. S. Sekhavat, P. Švestka, J.-P. Laumond, M.H. Overmars, Multilevel path planning for nonholonomic robots using semiholonomic subsystems, Int. Journal of Robotics Research 17 (1998), pp. 840-857.
26. J. Vleugels, J. Kok, M.H. Overmars, Motion planning with complete knowledge using a colored SOM, Int. Journal of Neural Systems 8 (1997), pp. 613-628.
27. S.A. Wilmarth, N.M. Amato, P.F. Stiller, MAPRM: A probabilistic roadmap planner with sampling on the medial axis of the free space, Proc. IEEE Int. Conf. on Robotics and Automation, 1999, pp. 1024-1031.