Adaptive workspace biasing for sampling-based planners

Proceedings - IEEE International Conference on Robotics and Automation

Volumn , Issue , 2008, Pages 3757-3762

  Zucker, Matt ^a   Kuffner, James ^a   Bagnell, J Andrew ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; INDUSTRIAL ENGINEERING; MOTION PLANNING; ROBOTICS; ROBOTS; WAVE FUNCTIONS;

CONFIGURATION SPACES; SAMPLING DISTRIBUTIONS;

ADAPTIVE ALGORITHMS;

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

References (30)

1. J. Kuffner and S. LaValle, "RRT-Connect: An efficient approach to single-query path planning," in Proc. IEEE Int'l Conf. on Robotics and Automation, San Francisco, CA, Apr. 2000, pp. 995-1001.
2. L. Kavraki, P. Švestka, J. C. Latombe, and M. H. Overmars, "Probabilistic roadmaps for path planning in high-dimensional configuration space," IEEE Trans. on Robotics and Automation, vol. 12, no. 4, pp. 566-580, 1996.
3. D. Hsu, L. Kavraki, J. Latombe, R. Motwani, and S. Sorkin, "On finding narrow passages with probabilistic roadmap planners," in Proceedings of the Workshop on the Algorithmic Foundations of Robotics. AK Peters, Ltd. Natick, MA, USA, 1998, pp. 141-153.
4. D. Hsu, T. Jiang, J. Reif, and Z. Sun, "The bridge test for sampling narrow passages with probabilistic roadmap planners," in Proc. IEEE Int'l Conf. on Robotics and Automation, vol. 3, 2003.
5. Y. Yang and O. Brock, "Adapting the sampling distribution in PRM planners based on an approximated medial axis," in Proc. IEEE Int'l Conf. on Robotics and Automation, vol. 5, 2004.
6. A. Yershova, L. Jaillet, T. Simeon, and S. LaValle, "Dynamic-Domain RRTs: Efficient Exploration by Controlling the Sampling Domain," in Proc. IEEE Int'l Conf. on Robotics and Automation, 2005, pp. 3856-3861.
7. P. Leven and S. Hutchinson, "Using manipulability to bias sampling during the construction of probabilistic roadmaps," Robotics and Automation, IEEE Transactions on, vol. 19, no. 6, pp. 1020-1026, 2003.
8. J. Bruce and M. Veloso, "Real-time randomized path planning for robot navigation," in Proceedings of IROS-2002, Switzerland, October 2002, an earlier version of this paper appears in the Proceedings of the RoboCup-2002 Symposium.
9. X. Jiang and M. Kallmann, "Learning humanoid reaching tasks in dynamic environments," Proc. IEEE/RSJ Int'l Conf. on Intelligent Robots and Systems, pp. 1148-1153, 2007.
10. S. Thomas, M. Morales, X. Tang, and N. Amato, "Biasing Samplers to Improve Motion Planning Performance," in Proc. IEEE Int'l Conf. on Robotics and Automation, 2007, pp. 1625-1630.
11. V. Boor, M. Overmars, and A. van der Stappen, "Gaussian sampling strategy for probabilistic roadmap planners," in Proc. IEEE Int'l Conf. on Robotics and Automation, vol. 2, 1999, pp. 1018-1023.
12. C. Holleman and L. Kavraki, "A framework for using the workspace medial axis in PRM planners," in Proc. IEEE Int'l Conf. on Robotics and Automation, vol. 2, 2000.
13. H. Kurniawati and D. Hsu, "Workspace importance sampling for probabilistic roadmap planning," in Proc. IEEE/RSJ Int'l Conf. on Intelligent Robots and Systems, vol. 2, 2004.
14. J. van den Berg and M. Overmars, "Using Workspace Information as a Guide to Non-uniform Sampling in Probabilistic Roadmap Planners," International Journal of Robotics Research, vol. 24, no. 12, p. 1055, 2005.
15. N. Ratliff, D. Bradley, J. Bagnell, and J. Chestnutt, "Boosting structured prediction for imitation learning," in Advances in Neural Information Processing Systems 19. Cambridge, MA: MIT Press, 2007.
16. Y. Xu, A. Fern, and S. Yoon, "Discriminative learning of beamsearch heuristics for planning," in Proceeding of the International Joint Conference on Artifical Intelligence, 2007.
17. R. Geraerts and M. Overmars, "A comparative study of probabilistic roadmap planners," in Proceedings of the Workshop on the Algorithmic Foundations of Robotics, 2004, pp. 43-57.
18. _, "Sampling Techniques for Probabilistic Roadmap Planners," in Proc. IEEE Int'l Conf. on Robotics and Automation, 2004, pp. 10-13.
19. J. Baxter and P. Bartlett, "Direct gradient-based reinforcement learning," in Circuits and Systems, 2000. Proceedings. ISCAS 2000 Geneva. The 2000 IEEE International Symposium on, vol. 3, 2000.
20. D. Hsu and G. Sun, "Hybrid PRM Sampling with a Cost-Sensitive Adaptive Strategy," in Proc. IEEE Int'l Conf. on Robotics and Automation, 2005, pp. 3874-3880.
21. L. Zhang, Y. Kim, G. Varadhan, and D. Manocha, "Generalized penetration depth computation," Computer-Aided Design, vol. 39, no. 8, pp. 625-638, 2007.
22. S. Quinlan, "Real-time modification of collision-free paths," Ph.D. dissertation, Stanford University, 1994.
23. O. Brock and L. Kavraki, "Decomposition-based motion planning: a framework for real-time motion planning in high-dimensional configuration spaces," in Proc. IEEE Int'l Conf. on Robotics and Automation, vol. 2, 2001.
24. Y. Fujita, Y. Nakamura, and Z. Shiller, "Dual Dijkstra Search for paths with different topologies," in Proc. IEEE Int'l Conf. on Robotics and Automation, vol. 3, 2003.
25. J. Kuffner, "Efficient Optimal Search of Euclidean-Cost Grids and Lattices," in Proc. IEEE/RSJ Int'l Conf. on Intelligent Robots and Systems, 2004.
26. B. Salomon, N. Govindaraju, A. Sud, R. Gayle, M. Lin, D. Manocha, B. Butler, M. Bauer, A. Rodriguez, L. Eifert, et al., Accelerating Line of Sight Computation Using Graphics Processing Units. Defense Technical Information Center, 2004.
27. N. N. Schraudolph, J. Yu, and D. Aberdeen, "Fast online policy gradient learning with SMD gain vector adaptation," in Advances in Neural Information Processing Systems, Y. Weiss, B. Schölkopf, and J. Platt, Eds., vol. 18. The MIT Press, Cambridge, MA, 2006, pp. 1185-1192.
28. J. Bagnell and J. Schneider, "Covariant policy search," in Proceeding of the International Joint Conference on Artifical Intelligence, August 2003.
29. R. Korf, "Finding optimal solutions to rubik's cube using pattern databases," in Proceedings of the Workshop on Computer Games (W31) at IJCAI-97, Nagoya, Japan, 1997, pp. 21-26. [Online]. Available: citeseer.ist.psu.edu/korf97finding.html
30. D. Ferguson, N. Kalra, and A. T. Stentz, "Replanning with RRTs," in Proc. IEEE Int'l Conf. on Robotics and Automation, May 2006.