The Toggle Local Planner for sampling-based motion planning

Proceedings - IEEE International Conference on Robotics and Automation

Volumn , Issue , 2012, Pages 1779-1786

  Denny, Jory ^a   Amato, Nancy M ^a  

^a Department of Electrical and Computer Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MOTION PLANNING; ROBOTICS;

EXPERIMENTAL ANALYSIS; LOCAL PLANNING; MOTION PLANNING PROBLEMS; OVERALL PLANNING; PROBABILISTIC ROADMAP METHODS; ROBOTICS APPLICATIONS; SAMPLING-BASED MOTION PLANNING; TWO-DIMENSIONAL SUBSPACES;

ROBOT PROGRAMMING;

EID: 84864441973     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICRA.2012.6225212     Document Type: Conference Paper

References (28)

1. N. M. Amato, O. B. Bayazit, L. K. Dale, C. V. Jones, and D. Vallejo. OBPRM: An obstacle-based PRM for 3D workspaces. In Robotics: The Algorithmic Perspective, pages 155-168, Natick, MA, 1998.
2. A.K. Peters. Proc. Third Workshop on Algorithmic Foundations of Robotics (WAFR), Houston, TX, 1998.
3. N. M. Amato, O. B. Bayazit, L. K. Dale, C. V. Jones, and D. Vallejo. Choosing good distance metrics and local planners for probabilistic roadmap methods. IEEE Trans. Robot. Automat., 16(4):442-447, August 2000.
4. J. Basch, L. J. Guibas, D. Hsu, and A. T. Nguyen. Disconnection proofs for motion planning. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pages 1765-1772, 2001.
5. R. Bohlin and L. E. Kavraki. Path planning using Lazy PRM. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pages 521-528, 2000.
6. V. Boor, M. H. Overmars, and A. F. van der Stappen. The Gaussian sampling strategy for probabilistic roadmap planners. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), volume 2, pages 1018-1023, May 1999.
7. J. Denny and N. M. Amato. Toggle PRM: Simultaneous mapping of C-free and C-obstacle - a study in 2D -. In Proc. IEEE Int. Conf. Intel. Rob. Syst. (IROS), 2011.
8. R. Geraerts and M. Overmars. Reachability-based analysis for probabilistic roadmap planners. In Journal of Robotics and Autonomous Systems, 55:824-836, 2007.
9. B. Glavina. Solving findpath by combination of directed and randomized search. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pages 1718-1723, 1990.
10. S. Gottschalk, M. C. Lin, and D. Manocha. OBB-tree: A hierarchical structure for rapid interference detection. Comput. Graph., 30:171-180, 1996. Proc. SIGGRAPH '96.
11. K. K. Gupta and Z. Guo. Motion planning for many degrees of freedom: Sequential search with backtracking. IEEE Trans. Robot. Automat., 11(6):897-906, 1995.
12. T. Horsch, F. Schwarz, and H. Tolle. Motion planning for many degrees of freedom - random reflections at c-space obstacles. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pages 3318-3323, 1994.
13. D. Hsu, T. Jiang, J. Reif, and Z. Sun. Bridge test for sampling narrow passages with probabilistic roadmap planners. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pages 4420-4426, 2003.
14. D. Hsu, J.-C. Latombe, and R. Motwani. Path planning in expansive configuration spaces. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pages 2719-2726, 1997.
15. Y. K. Hwang and P. C. Chen. A heuristic and complete planner for the classical mover's problem. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pages 729-736, 1995.
16. L. E. Kavraki, P. Švestka, J. C. Latombe, and M. H. Overmars. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans. Robot. Automat., 12(4):566-580, August 1996.
17. S. M. LaValle and J. J. Kuffner. Randomized kinodynamic planning. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pages 473-479, 1999.
18. J.-M. Lien, O. B. Bayazit, R.-T. Sowell, S. Rodriguez, and N. M. Amato. Shepherding behaviors. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pages 4159-4164, April 2004.
19. 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, October 1979.
20. C. Mirolo and E. Pagello. A practical motion planning strategy based on plane-sweep approach. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pages 2705-2712, 1997.
21. M. Morales, L. Tapia, R. Pearce, S. Rodriguez, and N. M. Amato. A machine learning approach for feature-sensitive motion planning. In Algorithmic Foundations of Robotics VI, pages 361-376. Springer, Berlin/Heidelberg, 2005. book contains the proceedings of the International Workshop on the Algorithmic Foundations of Robotics (WAFR), Utrecht/Zeist, The Netherlands, 2004.
22. C. L. Nielsen and L. E. Kavraki. A two level fuzzy PRM for manipulation planning. Technical Report TR2000-365, Computer Science, Rice University, Houston, TX, 2000.
23. J. H. Reif. Complexity of the mover's problem and generalizations. In Proc. IEEE Symp. Foundations of Computer Science (FOCS), pages 421-427, San Juan, Puerto Rico, October 1979.
24. S. Rodriguez, S. Thomas, R. Pearce, and N. M. Amato. (RESAMPL): A region-sensitive adaptive motion planner. In Algorithmic Foundation of Robotics VII, pages 285-300. Springer, Berlin/Heidelberg, 2008. book contains the proceedings of the International Workshop on the Algorithmic Foundations of Robotics (WAFR), New York City, 2006.
25. A. P. Singh, J.-C. Latombe, and D. L. Brutlag. A motion planning approach to flexible ligand binding. In Int. Conf. on Intelligent Systems for Molecular Biology (ISMB), pages 252-261, 1999.
26. X. Tang, S. Thomas, P. Coleman, and N. M. Amato. Reachable distance space: Efficient sampling-based planning for spacially constrained systems. Int. J. Robot. Res., 29(7):916-934, 2010.
27. P. Watterberg, P. Xavier, and Y. Hwang. Path planning for everyday robotics with sandros. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pages 1170-1175, 1997.
28. S. W. H. Wong and M. Jenkin. Exploiting collision information in probabilistic roadmap planning. In Int. Conf. on Mechatronics, 2009.