Planning motion in environments with similar obstacles

Robotics: Science and Systems

Volumn 5, Issue , 2010, Pages 89-96

  Lien, Jyh Ming ^a   Lu, Yanyan ^a  

^a GEORGE MASON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84959571073     PISSN: 23307668     EISSN: 2330765X     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (40)

1. M. Morales, L. Tapia, R. Pearce, S. Rodriguez, and N. M. Amato, "A machine learning approach for feature-sensitive motion planning," in Proc. Int. Workshop Alg. Found. Robot.(WAFR), Utrecht/Zeist, The Netherlands, July 2004, pp. 361-376.
2. B. Burns and O. Brock, "Toward optimal configuration space sampling," in Proc. Robotics: Sci. Sys. (RSS), 2005.
3. A. Yershova, L. Jaillet, T. Simeon, and S. M. Lavalle, "C-space subdivision and integration in feature-sensitive motion planning," in Proc. of IEEE Int. Conf. on Robotics and Automation, April 2005, pp. 3867-3872.
4. S. Rodriguez, S. Thomas, R. Pearce, and N. M. Amato., "(resampl): A region-sensitive adaptive motion planner," in Proc. Int. Workshop Alg. Found. Robot.(WAFR), July 2007.
5. S. Finney, L. Kaelbling, and T. Lozano-Perez, "Predicting partial paths from planning problem parameters," in Proceedings of Robotics: Science and Systems, Atlanta, GA, USA, June 2007.
6. L. Han and N. M. Amato, "A kinematics-based probabilistic roadmap method for closed chain systems," in Robotics:New Directions. Natick, MA: A K Peters, 2000, pp. 233-246, book containts the proceedings of the International Workshop on the Algorithmic Foundations of Robotics (WAFR), Dartmouth, March 2000.
7. N. Ailon, B. Chazelle, S. Comandur, and D. Liu, "Self-improving algorithms," in SODA '06: Proceedings of the seventeenth annual ACMSIAM symposium on Discrete algorithm. New York, NY, USA: ACM, 2006, pp. 261-270.
8. K. L. Clarkson and C. Seshadhri, "Self-improving algorithms for delaunay triangulations," in SCG '08: Proceedings of the twenty-fourth annual symposium on Computational geometry. New York, NY, USA: ACM, 2008, pp. 148-155.
9. T.-Y. Li and Y.-C. Shie, "An incremental learning approach to motion planning with roadmap management," in Proc. of IEEE Int. Conf. on Robotics and Automation, 2002, pp. 3411-3416.
10. R. Gayle, K. R. Klingler, and P. G. Xavier, "Lazy reconfiguration forest (LRF): An approach for motion planning with mulitple tasks in dynamic environments," in Proc. of IEEE Int. Conf. on Robotics and Automation, 2007, pp. 1316-1323.
11. J. F. Canny, The Complexity of Robot Motion Planning. Cambridge, MA: MIT Press, 1988.
12. L. E. Kavraki, P. Svestka, J. C. Latombe, and M. H. Overmars, "Probabilistic roadmaps for path planning in high-dimensional configuration spaces," IEEE Trans. on Robotics and Automation, vol. 12, no. 4, pp. 566-580, August 1996.
13. 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. Natick, MA: A.K. Peters, 1998, pp. 155-168, proc. Third Workshop on Algorithmic Foundations of Robotics (WAFR), Houston, TX, 1998.
14. N. M. Amato and Y. Wu, "A randomized roadmap method for path and manipulation planning," in Proc. of IEEE Int. Conf. on Robotics and Automation, 1996, pp. 113-120.
15. D. Hsu, J.-C. Latombe, and R. Motwani, "Path planning in expansive configuration spaces," Int. J. Comput. Geom. & Appl., pp. 2719-2726, 1997.
16. S. M. LaValle and J. J. Kuffner, "Rapidly-Exploring Random Trees: Progress and Prospects," in Proc. Int. Workshop Alg. Found. Robot.(WAFR), 2000, pp. SA45-SA59.
17. R. Geraerts and M. H. Overmars, "Sampling techniques for probabilistic roadmap planners," in Intelligent Autonomous Systems (IAS), 2004, pp. 600-609.
18. S. M. LaValle, Planning Algorithms, 6th ed. Cambridge University Press, 2006.
19. V. Boor, M. H. Overmars, and A. F. van der Stappen, "The Gaussian sampling strategy for probabilistic roadmap planners," in Proc. of IEEE Int. Conf. on Robotics and Automation, vol. 2, May 1999, pp. 1018-1023.
20. S. A. Wilmarth, N. M. Amato, and P. F. Stiller, "MAPRM: A probabilistic roadmap planner with sampling on the medial axis of the free space," in Proc. of IEEE Int. Conf. on Robotics and Automation, vol. 2, 1999, pp. 1024-1031.
21. D. Hsu, T. Jiang, J. Reif, and Z. Sun, "Bridge test for sampling narrow passages with proabilistic roadmap planners," in Proc. of IEEE Int. Conf. on Robotics and Automation, 2003, pp. 4420-4426.
22. J. van den Berg and M. Overmas, "Roadmap-based motion planning in dynamic environments," in Proc. IEEE Int. Conf. Intel. Rob. Syst. (IROS), 2004, pp. 1598-1605.
23. S. Rodriguez, J.-M. Lien, and N. M. Amato, "Planning motion in completely deformable environments," in Proc. of IEEE Int. Conf. on Robotics and Automation, May 2006, pp. 2466-2471.
24. P. Fiorini and Z. Shiller, "Motion planning in dynamic environments using velocity obstacles," Int. Journal of Robotics Research, vol. 17, no. 7, pp. 760-772, 1998.
25. S. Petti and T. Fraichard, "Safe motion planning in dynamic environments," in Proc. IEEE Int. Conf. Intel. Rob. Syst. (IROS), 2005, pp. 2210-2215.
26. L. Jaillet and T. Simeon, "A prm-based motion planner for dynamically changing environments," in Proc. IEEE Int. Conf. Intel. Rob. Syst. (IROS), 2004, pp. 1606-1611.
27. J. van den Berg, D. Ferguson, and J. Kuffner, "Anytime path planning and replanning in dynamic environments," in Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), May 2006, pp. 2366-2371.
28. P. J. Leven and S. Hutchinson, "A framework for real-time path planning in changing environments," Int. Journal of Robotics Research, vol. 21, no. 12, pp. 999-1030, 2002.
29. J. Vannoy and J. Xiao, "Real-time planning of mobile manipulation in dynamic environments of unknown changes," in Proc. Robotics: Sci. Sys. (RSS), 2006.
30. Y. Yan and O. Brock, "Elastic roadmaps: Globally task-consistent motion for autonomous mobile manipulation in dynamic environments," in Proc. Robotics: Sci. Sys. (RSS), 2006.
31. M. K. Philip Shilane, Patrick Min and T. Funkhouser, "The princeton shape benchmark," in Proceedings of the Shape Modeling International, 2004.
32. J.-M. Lien, "Hybrid motion planning using Minkowski sums," in Proc. Robotics: Sci. Sys. (RSS), Zurich, Switzerland, 2008.
33. T. Lozano-Pérez, "Spatial planning: A configuration space approach," IEEE Trans. Comput., vol. C-32, pp. 108-120, 1983.
34. G. Varadhan and D. Manocha, "Accurate Minkowski sum approximation of polyhedral models," Graph. Models, vol. 68, no. 4, pp. 343-355, 2006.
35. J.-M. Lien, "Point-based minkowski sum boundary," in PG '07: Proceedings of the 15th Pacific Conference on Computer Graphics and Applications. Washington, DC, USA: IEEE Computer Society, 2007, pp. 261-270.
36. J.-M. Lien and N. M. Amato, "Approximate convex decomposition," in SCG '04: Proceedings of the twentieth annual symposium on Computational geometry. New York, NY, USA: ACM Press, 2004, pp. 457-458, video Abstract.
37. R. Bohlin and L. E. Kavraki, "A randomized algorithm for robot path planning based on lazy evaluation," in Handbook on Randomized Computing, P. Pardalos, S. Rajasekaran, and J. Rolim, Eds. Kluwer Academic Publishers, 2001, pp. 221-249.
38. D. Xie, M. A. Morales, R. Pearce, S. Thomas, J.-M. Lien, and N. M. Amato, "Incremental map generation (IMG)," in Proc. Int. Workshop Alg. Found. Robot.(WAFR), July 2006.
39. C. Nissoux, T. Simeon, and J.-P. Laumond, "Visibility based probabilistic roadmaps," in Proc. IEEE Int. Conf. Intel. Rob. Syst. (IROS), 1999, pp. 1316-1321.
40. R. C. Veltkamp and M. Hagedoorn, "State of the art in shape matching," Principles of visual information retrieval, pp. 87-119, 2001.