Framework for planning feedback motion strategies based on a random neighborhood graph

Proceedings - IEEE International Conference on Robotics and Automation

Volumn 1, Issue , 2000, Pages 544-549

  Yang, Libo ^a   LaValle, Steven M ^a  

^a IOWA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN TERMINATION CONDITION; GLOBAL NAVIGATION FUNCTION; PLANNING FEEDBACK MOTION STRATEGIES; RANDOM NEIGHBORHOOD GRAPH;

ALGORITHMS; COLLISION AVOIDANCE; COMPUTATIONAL GEOMETRY; DEGREES OF FREEDOM (MECHANICS); GRAPH THEORY; NAVIGATION; QUERY LANGUAGES; RANDOM PROCESSES; ROBOTICS;

MOTION PLANNING;

EID: 0033724174     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. J. M. Ahuactzin and K. Gupta. Completeness results for a point-to-point inverse kinematics algorithm. In IEEE Int. Conf. Robot. & Autom., pages 1526-1531, 1999.
2. N. M. Amato and Y. Wu. A randomized roadmap method for path and manipulation planning. In IEEE Int. Conf. Robot. & Autom., pages 113-120, 1996.
3. J. Barraquand and J.-C. Latombe. Robot motion planning: A distributed representation approach. Int. J. Robot. Res., 10(6):628-649, December 1991.
4. C. Connolly and R. Grupen. The application of harmonic potential functions to robotics. J. Robotic Systems, 10(7):931-946, 1993.
5. E. G. Gilbert and D. W. Johnson. Distance functions and their application to robot path planning in the presence of obstacles. IEEE Trans. Robot. & Autom., 1(1):21-30, March 1985.
6. S. Gottschalk, M. C. Lin, D. Manocha, and Eric Larsen. PQP - the Proximity Query Package. Available at http://www.cs.unc.edu/ geom/SSV/, 1999.
7. L. J. Guibas, D. Hsu, and L. Zhang. H-Walk: Hierarchical distance computation for moving convex bodies. In Proc. ACM Symposium on Computational Geometry, pages 265-273, 1999.
8. D. Hsu, L. E. Kavraki, J.-C. Latombe, R. Motwani, and S. Sorkin. On finding narrow passages with probabilistic roadmap planners. In et al. P. Agarwal, editor, Robotics: The Algorithmic Perspective, pages 141-154. A.K. Peters, Wellesley, MA, 1998.
9. I. Kamon, E. Rivlin, and E. Rimon. Range-sensor based navigation in three dimensions. In IEEE Int. Conf. Robot. & Autom., 1999.
10. 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. & Autom., 12(4):566-580, June 1996.
11. O. Khatib. Real-time obstacle avoidance for manipulators and mobile robots. Int. J. Robot. Res., 5(1):90-98, 1986.
12. R. Kimmel, N. Kiryati, and A. M. Bruckstein. Multivalued distance maps for motion planning on surfaces with moving obstacles. IEEE Trans. Robot. & Autom., 14(3):427-435, June 1998.
13. J.-C. Latombe. Robot Motion Planning. Kluwer Academic Publishers, Boston, MA, 1991.
14. S. M. LaValle. Rapidly-exploring random trees: A new tool for path planning. TR 98-11, Computer Science Dept., Iowa State University. 〈http://janowiec.cs.iastate.edu/papers/rrt.ps〉, Oct. 1998.
15. S. M. LaValle and J. J. Kuffher. Randomized kinody-namic planning. In Proc. IEEE Int'l Conf. on Robotics and Automation, 1999.
16. M. C. Lin and J. F. Canny. Efficient algorithms for incremental distance computation. In IEEE Int. Conf. Robot. & Autom., 1991.
17. V. J. Lumelsky and A. A. Stepanov. Path planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape. Algorithmica, 2:403-430, 1987.
18. A. Massoud. Robot navigation using the vector potential approach. In IEEE Int. Conf. Robot. & Autom., pages 1:805-811, 1993.
19. G. L. Miller, S.-H. Teng, W. Thurston, and S. A. Vava-sis. Separators for sphere-packings and nearest neighbor graphs. Journal of the ACM, 44(1):1-29, January 1997.
20. B. Mirtich. V-Clip: Fast and robust polyhedral collision detection. Technical Report TR97-05, Mitsubishi Electronics Research Laboratory, 1997.
21. D. Mount and S. Arya. ANN: Library for Approximate Nearest Neighbor Searching. Available at http://www.cs.umd.edu/ ount/ANN/, 1998.
22. S. Quinlan. Efficient distance computation between nonconvex objects. In IEEE Int. Conf. Robot. & Autom., pages 3324-3329, 1994.
23. S. Quinlan and O. Khatib. Elastic bands: Connecting path planning and control. In IEEE Int. Conf. Robot. &. Autom., pages 802-807, 1993.
24. E. Rimon and D. E. Koditschek. Exact robot navigation using artificial potential fields. IEEE Trans. Robot. & Autom., 8(5):501-518, October 1992.
25. S. Sundar and Z. Shiller. Optimal obstacle avoidance based on the Hamilton-Jacobi-Bellman equation. IEEE Trans. Robot. & Autom., 13(2):305-310, April 1997.