A machine learning approach for feature-sensitive motion planning

Springer Tracts in Advanced Robotics

Volumn 17, Issue , 2005, Pages 361-376

  Morales, Marco ^a   Tapia, Lydia ^a   Pearce, Roger ^a   Rodriguez, Samuel ^a   Amato, Nancy M ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MACHINE LEARNING; PLANNING;

C-SPACE; MACHINE LEARNING APPROACHES; MOTION PLANNERS; PROBLEM INSTANCES; PROTOTYPE SYSTEM; ROAD-MAPS; ROADMAP;

MOTION PLANNING;

EID: 84880152114     PISSN: 16107438     EISSN: 1610742X     Source Type: Book Series    
DOI: 10.1007/10991541_25     Document Type: Article

References (27)

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.
2. J. Barraquand and J. C. Latombe. Robot motion planning: A distributed representation approach. Int. J. Robot. Res., 10(6):628-649, 1991.
3. P. Bessiere, J. M. Ahuactzin, E. G. Talbi, and E. Mazer. The Ariadne's clew algorithm: Global planning with local methods. In Proc. IEEE Int. Conf. Intel. Rob. Syst. (IROS), volume 2, pages 1373-1380, 1993.
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, 1999.
6. O. Brock and L.E. Kavraki. Decomposition-based motion planning: A framework for real-time motion planning in high-dimensional configuration places. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pages 1469-1475, 2001.
7. R. A. Brooks and T. Lozano-Pérez. A subdivision algorithm in configuration space for findpath with rotation. In Proc. Int. Conf. Artif. Intel., pages 799-806, 1983.
8. C. Bystroff and D. Baker. Prediction of local structure in proteins using a library of sequence-structure motifs. In J. Mol. Biol., volume 281, pages 565-577, 1998.
9. J. F. Canny. The Complexity of Robot Motion Planning. MIT Press, Cambridge, MA, 1988.
10. L. K. Dale and N. M. Amato. Probabilistic roadmaps - putting it all together. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pages 1940-1947, 2001.
11. R. Geraerts and M. H. Overmars. A comparative study of probabilistic roadmap planners. In Proc. Int. Workshop on Algorithmic Foundations of Robotics (WAFR), December 2002.
12. D. Hsu, R. Kindel, J. C. Latombe, and S. Rock. Randomized kinodynamic motion planning with moving obstacles. In Proc. Int. Workshop on Algorithmic Foundations of Robotics (WAFR), pages SA1-SA18, 2000.
13. C. Kamath, E. Cantu-Paz, I. Fodor, and N. Tang. Classifying bent-double galaxies. In IEEE Comput. in Sci. & Eng., volume 4, pages 52-60, 2002.
14. L. E. Kavraki, P. Svestka, 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.
15. O. Khatib. Real-time obstacle avoidance for manipulators and mobile robots. Int. J. Robot. Res., 5(1):90-98, 1986.
16. S. M. LaValle and M. S. Branicky. On the relationship between classical grid search and probabilistic roadmaps. In Proc. Int. Workshop on Algorithmic Foundations of Robotics (WAFR), December 2002.
17. S. M. LaValle and J. J. Kuffner. Randomized kinodynamic planning. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), pages 473-479, 1999.
18. T. Lozano-Péerez and M. A. Wesley. An algorithm for planning collision-free paths among polyhedral obstacles. Communications of the ACM, 22(10):560-570, October 1979.
19. T. Mitchell. Machine Learning. McGraw-Hill, 1997.
20. M. Morales, S. Rodriguez, and N. M. Amato. Improving the connectivity of PRM roadmaps. In Proc. IEEE Int. Conf. Robot. Autom. (ICRA), volume 3, pages 4427-4432, September 2003.
21. 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.
22. M. Overmars. A random approach to path planning. Technical Report RUUCS- 92-32, Computer Science, Utrecht University, The Netherlands, 1992.
23. M. Overmars and P. Svestka. A probabilistic learning approach to motion planning. In Proc. Int. Workshop on Algorithmic Foundations of Robotics (WAFR), pages 19-37, 1994.
24. J.R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, 1993.
25. J. H. Reif. Complexity of the mover's problem and generalizations. In Proc. IEEE Symp. Foundations of Computer Science (FOCS), pages 421-427, San Juan, Puerto Rico, October 1979.
26. J. T. Schwartz and M. Sharir. On the "piano movers" problem II: General techniques for computing topological properties of real algebraic manifolds. Adv. Appl. Math., 4:298-351, 1983.
27. 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. IEEE Int. Conf. Robot. Autom. (ICRA), volume 2, pages 1024-1031, 1999.