A hybrid approach for complete motion planning

IEEE International Conference on Intelligent Robots and Systems

Volumn , Issue , 2007, Pages 7-14

  Zhang, Liangjun ^a   Kim, Young J ^b   Manocha, Dinesh ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

^b Ewha Womans University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; CELLS; CYTOLOGY; INTELLIGENT ROBOTS; INTELLIGENT SYSTEMS; LINEAR ALGEBRA; ROBOTICS; ROBOTS; WAVE FUNCTIONS;

COMPLETE MOTION PLANNING; ROAD-MAPS;

MOTION PLANNING;

EID: 51349094799     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IROS.2007.4399064     Document Type: Conference Paper

References (32)

1. N. Amato, O. Bayazit, L. Dale, C. Jones, and D. Vallejo, Obprm: An obstacle-based prm for 3d workspaces. Proceedings of WAFR98, pages 197-204, 1998.
2. F. Avnaim and J.-D. Boissonnat. Practical exact motion planning of a class of robots with three degrees of freedom. In Proc. of Canadian Conference on Computational Geometry, page 19, 1989.
3. V. Boor, M. H. Overmars, and A. F. van der Stappen. The gaussian sampling strategy for probabilistic roadmap planners. In Proc. IEEE International Conference on Robotics and Automation, pages 1018-1023, 1999.
4. R. A. Brooks and T. Lozano-Pérez. A subdivision algorithm in configuration space for findpath with rotation. IEEE Trans. Syst, SMC-15:224-233, 1985.
5. J. Canny. The Complexity of Robot Motion Planning. ACM Doctoral Dissertation Award. MIT Press, 1988.
6. H. Choset, K. Lynch, S. Hutchinson, G. Kantor, W. Burgard, L. Kavraki, and S. Thrun. Principles of Robot Motion: Theory, Algorithms, and Implementations. MIT Press, 2005.
7. B. R. Donald. Motion planning with six degrees of freedom. Master's thesis, MIT Artificial Intelligence Lab., 1984. AI-TR-791.
8. M. Foskey, M. Garber, M. Lin, and D. Manocha. A voronoi-based hybrid planner. Proc. of IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, 2001.
9. L. Guibas, C. Holleman, and L. Kavraki. A probabilistic roadmap planner for flexible objects with a workspace medial-axis-based sampling approach. In Proc. of IROS, 1999.
10. D. Halperin. Robust geometric computing in motion. International Journal of Robotics Research, 21(3):219-232, 2002.
11. S. Hirsch and D. Halperin. Hybrid motion planning: Coordinating two discs moving among polygonal obstacles in the plane. In Springer Tracts in Advanced Robotics, pages 239 - 256, Jan 2003.
12. D. Hsu, L. Kavraki, J. Latombe, R. Motwani, and S. Sorkin. On finding narrow passages with probabilistic roadmap planners, 1998.
13. D. Hsu, J. Latombe, and H. Kurniawati. On the probabilistic foundations of probabilistic roadmap planning. In Proc. Int. Symp. on Robotics Research, 2005.
14. D. Hsu, G. Sánchez-Ante, and Z. Sun. Hybrid PRM sampling with a cost-sensitive adaptive strategy. In Proc. IEEE Int. Conf. on Robotics & Automation, 2005.
15. L. Kavraki, P. Svestka, J. C. Latombe, and M. Overmars. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans. Robot. Automat., pages 12(4):566-580, 1996.
16. K. Kedem and M. Shark. An automatic motion planning system for a convex polygonal mobile robot in 2-d polygonal space. In ACM Symposium on Computational Geometry, pages 329-340, 1988.
17. H. Kurniawati and D. Hsu. Workspace-based connectivity oracle: An adaptive sampling strategy for prm planning. In Proc. of 7th International Workshop on the Algorithmic Foundations of Robotics, 2006.
18. J. Latombe. Robot Motion Planning. Kluwer Academic Publishers, 1991.
19. S. M. LaValle. Planning Algorithms. Cambridge University Press (also available at http://msl.cs.uiuc.edu/planning/), 2006.
20. F. Lingelbach. Path planning using probabilistic cell decomposition. In Proc. IEEE International Conference on Robotics and Automation, 2004.
21. T. Lozano-Pérez and M. Wesley. An algorithm for planning collision-free paths among polyhedral obstacles. Comm. ACM, 22(10):560-570, 1979.
22. M. Morales, L. Tapia, R. Pearce, S. Rodriguez, and N. M. Amato. C-space subdivision and integration in feature-sensitive motion planning. In Proc. IEEE International Conference on Robotics and Automation, 2005.
23. B. Paden, A. Mess, and M. Fisher. Path planning using a jacobian-based freespace generation algorithm. In Proceedings of International Conference on Robotics and Automation, 1989.
24. C. Pisula, K. Hoff, M. Lin, and D. Manocha. Randomized path planning for a rigid body based on hardware accelerated voronoi sampling. In Proc. of 4th International Workshop on Algorithmic Foundations of Robotics, 2000.
25. J. T. Schwartz and M. Sharir. On the piano movers problem ii, general techniques for computing topological properties of real algebraic manifolds. Advances of Applied Maths, 4:298-351, 1983.
26. T. Simeon, J. P. Laumond, and C. Nissoux. Visibility based probabilistic roadmaps for motion planning. Advanced Robotics Journal, 14(6), 2000.
27. Z. Sun, D. Hsu, T. Jiang, H. Kurniawati, and J. Reif. Narrow passage sampling for probabilistic roadmap planners. IEEE Trans. on Robotics, 21(6): 1105-1115, 2005.
28. J. van den Berg and M. Overmars. Using workspace information as a guide to non-uniform sampling in probabilistic roadmap planners. 24(12):1055-1071, Jan 2005.
29. G. Varadhan and D. Manocha. Star-shaped roadmaps - a deterministic sampling approach for complete motion planning. In Proceedings of Robotics: Science and Systems, Cambridge, USA, June 2005.
30. S. A. Wilmarth, N. M. Amato, and P. F. Stiller. Motion planning for a rigid body using random networks on the medial axis of the free space. In Symposium on Computational Geometry, pages 173-180, 1999.
31. L. Zhang, Y. Kim, and D. Manocha. A simple path non-existence algorithm using c-obstacle query. In proc, of WAFR, 2006.
32. D. Zhu and J. Latombe. Constraint reformulation in a hierarchical path planner. Proceedings of International Conference on Robotics and Automation, pages 1918-1923, 1990.