An unsupervised adaptive strategy for constructing probabilistic roadmaps

Proceedings - IEEE International Conference on Robotics and Automation

Volumn , Issue , 2009, Pages 4037-4044

  Tapia, Lydia ^a   Thomas, Shawna ^a   Boyd, Bryan ^a   Amato, Nancy M ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE METHODS; ADAPTIVE SOLUTION; ADAPTIVE STRATEGY; LEARNING RATES; PROBABILISTIC ROAD MAPS; UNSUPERVISED LEARNING METHOD; USER INTERVENTION;

ROBOTICS; UNSUPERVISED LEARNING;

PLANNING;

EID: 70350373889     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ROBOT.2009.5152544     Document Type: Conference Paper

References (23)

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. J. Barraquand and J. C. Latombe. Robot motion planning: A distributed representation approach. Int. J. Robot. Res., 10(6):628-649, 1991.
3. J. Berg and M. Overmars. Using workspace information as a guid to non-uniform sampling in probabilistic roadmap planners. Int. J. Robot. Res., 24(12):1055-1072, 2005.
4. R. Bohlin and L. E. Kavraki. Path planning using Lazy PRM. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pages 521-528, 2000.
5. 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.
6. B. Burns and O. Brock. Sampling-based motion planning using predictive models. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), 2005.
7. B. Burns and O. Brock. Toward optimal configuration space sampling. In Proc. Robotics: Sci. Sys. (RSS), 2005.
8. R. Geraerts and M. H. Overmars. Reachablility-based analysis for probabilistic roadmap planners. Robotics and Autonomous Systems, 55:824-836, 2007.
9. 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.
10. T. Hastie, R. Tibshirani, and J. Friedman. The Elements of Statistical Learning: Data Mining, Inference, and Prediction. Springer, 2001.
11. D. Hsu, G. Sánchez-Ante, and Z. Sun. Hybrid PRM sampling with a cost-sensitive adaptive strategy. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pages 3885-3891, 2005.
12. 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.
13. H. Kurniawati and D. Hsu. Workspace-based connectivity oracle-an adaptive sampling strategy for prm planning. In Algorithmic Foundation of Robotics VII, pages 35-51. Springer, Berlin/Heidelberg, 2008.
14. S. M. LaValle and J. J. Kuffner. Randomized kinodynamic planning. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pages 473-479, 1999.
15. L. Lieu and N. Saito. Automated shapes discrimination in high dimensions. Proc. of SPIE, 6701-Wavelets XII(67011W), 2007.
16. 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.
17. 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.
18. M. A. Morales A., R. Pearce, and N. M. Amato. Metrics for analyzing the evolution of C-Space models. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pages 1268-1273, May 2006.
19. M. A. Morales A., L. Tapia, R. Pearce, S. Rodriguez, and N. M. Amato. C-space subdivision and integration in feature-sensitive motion planning. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pages 3114-3119, April 2005.
20. 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.
21. J. H. Reif. Complexity of the mover's problem and generalizations. In Proc. 1EEE Symp. Foundations of Computer Science (FOCS), pages 421-427, San Juan, Puerto Rico, Oct. 1979.
22. 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.
23. D. Xie, M. Morales, R. Pearce, S. Thomas, J.-M. Lien, and N. M. Amato. Incremental map generation (IMG). In Algorithmic Foundation of Robotics VII, pages 53-68. Springer, Berlin/Heidelberg, 2008.