Hybrid PRM sampling with a cost-sensitive adaptive strategy

Proceedings - IEEE International Conference on Robotics and Automation

Volumn 2005, Issue , 2005, Pages 3874-3880

  Hsu, David ^a,b   Sánchez Ante, Gildardo ^b   Sun, Zheng ^c  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b SINGAPORE MIT ALLIANCE   (Singapore)

^c HONG KONG BAPTIST UNIVERSITY   (Hong Kong)

Author keywords

Motion planning; Probabilistic roadmap planners; Randomized algorithms; Robotics

Indexed keywords

ALGORITHMS; DEGREES OF FREEDOM (MECHANICS); PROBLEM SOLVING; ROBOTICS;

ADAPTIVE STRATEGY; PROBABILISTIC ROADMAP PLANNERS; RANDOMIZED ALGORITHMS;

MOTION PLANNING;

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

References (17)

1. N. Amato, O. Bayazit, L. Dale, C. Jones, and D. Vallejo, "OBPRM: An obstacle-based PRM for 3D workspaces," in Robotics: The Algorithmic Perspective: 1998 Workshop on the Algorithmic Foundations of Robotics, P. Agarwal et al., Eds. Wellesley, MA: A. K. Peters, 1998, pp. 155-168.
2. P. Auer, N. Cesa-Bianchi, Y. Freund, and R. Schapire, "The non-stochastic multiarmed bandit problem," SIAM J. Computing, vol. 32, no. 1, pp. 48-77, 2002.
3. V. Boor, M. Overmars, and F. van der Stappen, "The Gaussian sampling strategy for probabilistic roadmap planners," in Proc. IEEE Int. Conf. on Robotics & Automation, 1999, pp. 1018-1023.
4. L. Dale and N. Amato, "Probabilistic roadmaps - putting it all together," in Proc. IEEE Int. Conf. on Robotics & Automation, 2001, pp. 1940-1947.
5. M. Foskey, M. Garber, M. Lin, and D. Manocha, "A Voronoi-based hybrid motion planner," in Proc. IEEE/RSJ Int. Conf. on Intelligent Robots & Systems, 2001, pp. 55-60.
6. C. Holleman and L. E. Kavraki, "A framework for using the workspace medial axis in PRM planners," in Proc. IEEE Int. Conf. on Robotics & Automation, 2000, pp. 1408-1413.
7. D. Hsu, T. Jiang, J. Reif, and Z. Sun, "The bridge test for sampling narrow passages with probabilistic roadmap planners," in Proc. IEEE Int. Conf. on Robotics & Automation, 2003, pp. 4420-4426.
8. D. Hsu, L. Kavraki, J. Latombe, R. Motwani, and S. Sorkin, "On finding narrow passages with probabilistic roadmap planners," in Robotics: The Algorithmic Perspective: 1998 Workshop on the Algorithmic Foundations of Robotics, P. Agarwal et al., Eds. Wellesley, MA: A. K. Peters, 1998, pp. 141-154.
9. D. Hsu and Z. Sun, "Adaptive hybrid sampling for probabilistic roadmap planning," National University of Singapore, Singapore, Tech. Rep. TRA5/04, May 2004.
10. L. Kavraki, P. Švestka, J. Latombe, and M. Overmars, "Probabilistic roadmaps for path planning in high-dimensional configuration space," IEEE Trans. on Robotics & Automation, vol. 12, no. 4, pp. 566-580, 1996.
11. J. Latombe, "Motion planning: A journey of robots, molecules, digital actors, and other artifacts," Int. J. Robotics Research, vol. 18, no. 11, pp. 1119-1128, 1999.
12. J.-M. Lien, S. Thomas, and N. Amato, "A general framework for sampling on the medial axis of the free space," in Proc. IEEE Int. Conf. on Robotics & Automation, 2003, pp. 4439-4444.
13. N. Littlestone and M. Warmuth, "The weighted majority algorithm," Information & Computation, vol. 108, no. 2, pp. 212-261, 1994.
14. M. Morales, L. Tapia, R. Pearce, S. Rodriguez, and N. Amato, "A machine learning approach for feature-sensitive motion planning," in Proc. The Sixth Int. Workshop on the Algorithmic Foundations of Robotics, 2004.
15. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge University Press, 1995.
16. C. Nissoux, T. Siméon, and J.-P. Laumond, "Visibility based probabilistic roadmaps," in Proc. IEEE/RSJ Int. Conf. on Intelligent Robots & Systems, 1999, pp. 1316-1321.
17. J. Reif, "Complexity of the mover's problem and generalizations, " in Proc. IEEE Symp. on Foundations of Computer Science, 1979, pp. 421-427.