Towards small asymptotically near-optimal roadmaps

Proceedings - IEEE International Conference on Robotics and Automation

Volumn , Issue , 2012, Pages 2557-2562

  Marble, James D ^a   Bekris, Kostas E ^a  

^a Reno   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC OPTIMALITY; DENSE GRAPHS; MOTION PLANNERS; NEAR-OPTIMAL SOLUTIONS; QUERY RESOLUTION; REDUNDANT SAMPLES; SAMPLING-BASED; STOPPING CRITERIA;

ROBOTICS;

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

References (34)

1. L. E. Kavraki, P. Svestka, J.-C. Latombe, and M. Overmars, "Probabilistic roadmaps for path planning in high-dimensional configuration spaces," IEEE Transactions on Robotics and Automation (TRA), vol. 12, no. 4, pp. 566-580, 1996.
2. O. Nechushtan, B. Raveh, and D. Halperin, "Sampling-Diagrams Automata: a Tool for Analyzing Path Quality in Tree Planners," in Workshop on the Algorithmic Foundations of Robotics (WAFR), Singapore, December 2010.
3. L. Jaillet and T. Simeon, "Path Deformation Roadmaps," in Workhop on the Algorithmic Foundations of Robotics (WAFR), New York City, NY, July 2006.
4. E. Schmitzberger, J. L. Bouchet, M. Dufaut, D. Wolf, and R. Husson, "Capture of Homotopy Classes with Probabilistic Roadmap," in IEEE/RSJ Intl. Conf. on Intelligent Robots and Systems (IROS), Switzerland, 2002, pp. 2317-2322.
5. B. Raveh, A. Enosh, and D. Halperin, "A Little More, a Lot Better: Improving Path Quality by a Path-Merging Algorithm," IEEE Transactions on Robotics, vol. 27, no. 2, pp. 365-370, 2011.
6. S. Karaman and E. Frazzoli, "Incremental Sampling-based Algorithms for Optimal Motion Planning," in Robotics: Science and Systems (RSS), Zaragoza, Spain, 2010.
7. -, "Sampling-based algorithms for optimal motion planning," International Journal of Robotics Reseach (IJRR), vol. 30, no. 7, pp. 846-894, June 2011.
8. J. D. Marble and K. E. Bekris, "Computing Spanners of Asympotically Optimal Probabilistic Roadmaps," in IEEE/RSJ Intl. Conf. on Intelligent Robots and Systems (IROS), San Francisco, CA, September 2011.
9. -, "Asymptotically Near-Optimal is Good Enough for Motion Planning," in International Symposium of Robotics Research (ISRR), Flagstaff, AZ, August 2011.
10. T. Simeon, J.-P. Laumond, and C. Nissoux, "Visibility-based probabilistic roadmaps for motion planning," Advanced Robotics Journal, vol. 41, no. 6, pp. 477-494, 2000.
11. N. M. Amato, O. B. Bayazit, L. K. Dale, C. Jones, and D. Vallejo, "OBPRM: An Obstacle-based PRM for 3D Workspaces," in Workshop on the Algorithmic Foundations of Robotics (WAFR), 1998, pp. 155-168.
12. L. J. Guibas, C. Holleman, and L. E. Kavraki, "A Probabilistic Roadmap Planner for Flexible Objects with a Workspace Medial-Axis-Based Sampling Approach," in IEEE/RSJ Intl. Conf. on Intelligent Robots and Systems (IROS), vol. 1, Oct. 1999, pp. 254-259.
13. E. Plaku, K. E. Bekris, B. Y. Chen, A. M. Ladd, and L. E. Kavraki, "Sampling-Based Roadmap of Trees for Parallel Motion Planning," IEEE Transactions on Robotics and Automation (TRA), vol. 21, no. 4, pp. 587-608, 2005.
14. G. Sanchez and J.-C. Latombe, "A Single-Query, Bi-Directional Probabilistic Roadmap Planner with Lazy Collision Checking," in International Symposium of Robotics Research (ISRR), 2001, pp. 403-418.
15. D. Xie, M. Morales, R. Pearce, S. Thomas, J.-L. Lien, and N. M. Amato, "Incremental Map Generation (IMG)," in Workshop on the Algorithmic Foundations of Robotics (WAFR), New York City, NY, July 2006.
16. R. Geraerts and M. H. Overmars, "Creating Small Graphs for Solving Motion Planning Problems," in IEEE International Conference on Methods and Models in Automation and Robotics (MMAR), 2005, pp. 531-536.
17. M. A. Morales, R. Pearce, and N. M. Amato, "Metrics for Analyzing the Evolution of C-Space Models," in IEEE International Conference on Robotics and Automation (ICRA), May 2006, pp. 1268-1273.
18. R. Pearce, M. Morales, and N. Amato, "Structural Improvement Filtering Strategy for PRM," in Robotics: Science and Systems (RSS), June 2008.
19. D. Nieuwenhuisen and M. H. Overmars, "Using Cycles in Probabilistic Roadmap Graphs," in IEEE International Conference on Robotics and Automation (ICRA), 2004, pp. 446-452.
20. R. Geraerts and M. H. Overmars, "Creating High-Quality Roadmaps for Motion Planning in Virtual Environments," in IEEE/RSJ Intl. Conf. on Intelligent Robots and Systems (IROS), Beijing, China, October 2006, pp. 4355-4361.
21. J. Kim, R. A. Pearce, and N. M. Amato, "Extracting Optimal Paths from Roadmaps for Motion Planning," in IEEE Intl. Conf. on Robotics and Automation (ICRA), vol. 2, Taipei, Taiwan, 14-19 September 2003, pp. 2424-2429.
22. M. Likhachev, D. Ferguson, G. Gordon, A. Stentz, and S. Thrun, "Anytime search in dynamic graphs," Artificial Intelligence Journal, vol. 172, no. 14, pp. 1613-1643, 2008.
23. M. Kobilarov, "Cross-entropy randomized motion planning," in Robotics: Science and Systems (RSS), Los Angeles, CA, June 2011.
24. S. M. LaValle and J. J. Kuffner, "Randomized Kinodynamic Planning," International Journal of Robotics Reseach (IJRR), vol. 20, no. 5, pp. 378-400, May 2001.
25. D. Hsu, R. Kindel, J. C. Latombe, and S. Rock, "Randomized Kinodynamic Motion Planning with Moving Obstacles," International Journal of Robotics Reseach (IJRR), vol. 21, no. 3, pp. 233-255, Mar. 2002.
26. K. Bekris and L. Kavraki, "Informed and Probabilistically Complete Search for Motion Planning under Differential Constraints," in First International Symposium on Search Techniques in Artificial Intelligence and Robotics (STAIR), Chicago, IL, July 2008.
27. Y. Li and K. E. Bekris, "Learning Approximate Cost-to-Go Metrics To Improve Sampling-based Motion Planning," in IEEE International Conference on Robotics and Automation (ICRA), Shanghai, China, 9-13 May 2011.
28. D. Ferguson and A. Stentz, "Anytime RRTs," in IEEE/RSJ Intl. Conf. on Intelligent Robots and Systems (IROS), Beijing, China, Oct. 2006, pp. 5369-5375.
29. D. Peleg and A. Schäffer, "Graph Spanners," Journal of Graph Theory, vol. 13, no. 1, pp. 99-116, 1989.
30. J. M. Keil, "Approximating the Complete Euclidean Graph," in 1st Scandinavian Workshop on Algorithm Theory. London, UK: Springer-Verlag, 1988, pp. 208-213.
31. J. Gao, L. J. Guibas, and A. Nguyen, "Deformable spanners and applications." Computational Geometry: Theory and Applications, vol. 35, no. 1-2, pp. 2-19, Aug. 2006.
32. I. Althöfer, G. Das, D. Dobkin, D. Joseph, and J. Soares, "On sparse spanners of weighted graphs," Discrete and Computational Geometry, vol. 9, no. 1, pp. 81-100, 1993.
33. S. Baswana and S. Sen, "A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs," Random Structures and Algorithms, vol. 30, no. 4, pp. 532-563, July 2007.
34. I. A. Sucan, M. Moll, and L. E. Kavraki, "The Open Motion Planning Library (OMPL)," http://ompl.kavrakilab.org, 2010.