Toward optimal configuration space sampling

Robotics: Science and Systems

Volumn 1, Issue , 2005, Pages 105-112

  Burns, Brendan ^a   Brock, Oliver ^a  

^a University of Massachusetts Amherst   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AGRICULTURAL ROBOTS; MOTION PLANNING; ROBOTICS;

APPROXIMATE MODEL; CONFIGURATION SPACE; EXPECTED UTILITY; INDIVIDUAL CONFIGURATION; PLANNING TASKS; SAMPLING STRATEGIES; SAMPLING-BASED; SAMPLING-BASED MOTION PLANNING;

DEGREES OF FREEDOM (MECHANICS);

EID: 84959555568     PISSN: None     EISSN: 2330765X     Source Type: Conference Proceeding    
DOI: 10.15607/rss.2005.i.015     Document Type: Conference Paper

References (27)

1. N. Amato, O. B. Bayazit, L. Dale, C. Jones, and D. Vallejo. OBPRM: An obstacle-based PRM for 3D workspaces. In Robotics: The Algorithmic Perspective. AK Peters, 1998.
2. C. G. Atkeson, A. W. Moore, and S. Schaal. Locally weighted learning. Artificial Intelligence Review, 11(1-5):11-73, 1997.
3. D. Bernoulli. Exposition of a new theory of risk. Econometrica (translated and reprinted), 1954. originally in Comentarii Academiae Scientiarum Imperialis Petropolitanae, 1738.
4. V. Boor, M. Overmars, and F. van der Stappen. The gaussian sampling strategy for probabilistic roadmap planners. In Proceedings of the International Conference on Robotics and Automation, 1999.
5. B. Burns and O. Brock. Information theoretic construction of probabilistic roadmaps. In Proceedings of the International Conference on Intelligent Robots and Systems, pages 650-655, Las Vegas, USA, 2003.
6. B. Burns and O. Brock. Entropy-guided single-query motion planning. In Proceedings of the International Conference on Robotics and Automation, 2005.
7. B. Burns and O. Brock. Model-based motion planning. In Proceedings of the International Conference on Robotics and Automation, 2005.
8. D. Cohn, L. Atlas, and R. Ladner. Improving generalization with active learning. Machine Learning, 15(2):201-221, 1994.
9. D. A. Cohn, Z. Ghahramani, and M. I. Jordan. Active learning with statistical methods. Journal of Artificial Intelligence Research, 4:129-145, 1996.
10. C. Holleman and L. E. Kavraki. A framework for using the workspace medial axis in PRM planners. In Proceedings of the International Conference on Robotics and Automation, volume 2, pages 1408-1413, San Francisco, USA, 2000.
11. D. Hsu, T. Jiang, J. Reif, and Z. Sun. The bridge test for sampling narrow passages with probabilistic roadmap planners. In Proceedings of the International Conference on Robotics and Automation, 2003.
12. D. Hsu, L. E. Kavraki, J.-C. Latombe, R. Motwani, and S. Sorkin. On fi nding narrow passages with probabilistic roadmap planners. In Proceedings of the Workshop on the Algorithmic Foundations of Robotics, pages 141-154. A K Peters, 1998.
13. D. Hsu, G. Snchez-Ante, and Z. Sun. Hybrid prm sampling with a cost-sensitive adaptive strategy. In Proceedings of the International Conference on Robotics and Automation, Barcelona, Spain, 2005.
14. L. Jaillet, A. Yershova, S. LaValle, and T. Simeon. Adaptive tuning of the sampling domain for dynamic-domain RRTs. In Proceedings of the International Conference on Intelligent Robots and Systems, 2005. To Appear.
15. N. E. Jensen. Introduction to bernoullian utility theory. Swedish Journal of Economics, pages 163-183, 1967.
16. L. E. Kavraki, P. Švestka, J.-C. Latombe, and M. H. Overmars. Probabilistic roadmaps for path planning in high-dimensional confi guration spaces. IEEE Transactions on Robotics and Automation, 12(4):566-580, 1996.
17. S. M. LaValle and J. J. Kuffner. Rapidly-exploring random trees: Progress and prospects. In Proceedings of the Workshop on the Algorithmic Foundations of Robotics, pages 293-308, 2000.
18. P. Leven and S. Hutchinson. Toward real-Time path planning in changing environments. In Proceedings of the Workshop on the Algorithmic Foundations of Robotics, 2000.
19. T. M. Mitchell. Machine Learning. McGraw-Hill, 1997.
20. M. Morales, L. Tapia, R. Pearce, S. Rodriguez, and N. Amato. A machine learning approach for feature-sensitive motion planning. In Proceedings of the Workshop on the Algorithmic Foundations of Robotics, 2004.
21. M. Saar-Tsechansky and F. Provost. Active sampling for class probability estimation and ranking. Machine Learning, 54(2):153-178, 2004.
22. C. E. Shannon. A mathemtatical theory of communication. Bell System Technical Journal, 27:379-423, July 1948.
23. C. E. Shannon. A mathemtatical theory of communication. Bell System Technical Journal, 27:623-656, October 1948.
24. T. Simeon, J.-P. Laumond, and C. Nissoux. Visibility-based probabilistic roadmaps for motion planning. In Proceedings of the International Conference on Intelligent Robots and Systems, 1999.
25. J. von Neumann and O. Morgenstern. Theory of Games and Economic Behavior. Princeton University Press, 1953.
26. Y. Yang and O. Brock. Adapting the sampling distribution in prm planners based on an approximated medial axis. In Proceedings of the International Conference on Robotics and Automation, 2004.
27. A. Yershova, L. Jaillet, T. Simeon, and S. M. LaValle. Dynamic-domain RRTs: Effi cient exploration by controlling the sampling domain. In Proceedings of the International Conference on Robotics and Automation, 2005.