A framework for real-time path planning in changing environments

International Journal of Robotics Research

Volumn 21, Issue 12, 2002, Pages 999-1030

  Leven, Peter ^a   Hutchinson, Seth ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

Motion planning; Probabilistic roadmaps

Indexed keywords

ALGORITHMS; GRAPH THEORY; IMAGE CODING; IMAGE COMPRESSION; MANIPULATORS; MOBILE ROBOTS; PROBABILITY; REAL TIME SYSTEMS; UNIVERSAL JOINTS;

COLLISION FREE PATHS; PROBABILISTIC ROADMAPS;

MOTION PLANNING;

EID: 0036959221     PISSN: 02783649     EISSN: None     Source Type: Journal    
DOI: 10.1177/0278364902021012001     Document Type: Article

References (70)

1. Abrams, S., and Allen, P. K. 1995. Swept volumes and their use in viewpoint computation in robot work-cells. In Proceedings of IEEE Conference on Robotics and Automation, pp. 188-193.
2. Abrams, S., Allen, P. K., and Tarabanis, K. A. 1993. Dynamic sensor planning. In Proceedings of IEEE Conference on Robotics and Automation, pp. 605-610.
3. Ahuactzin, J.-M., and Gupta, K. 1999. The kinematic roadmap: A motion planning based global approach for inverse kinematics of redundant robots. IEEE Transactions on Robotics and Automation 15(4):653-669.
4. Ahuactzin, J.-M., Gupta, K., and Mazer, E. 1998. Manipulation planning for redundant robots: A practical approach. International Journal of Robotics Research 17(7):731-747.
5. Ahuactzin, J.-M., Mazer, E., and Bessière, P. 1995. Fondements mathématiques d'algorithme "fil d'Ariane", Revue d'Intelligence Artificielle 9(1):7-34.
6. Ahuactzin, J.-M., Talbi, E.-G., Bessière, P., and Mazer, E., 1992. Using genetic algorithms for robot motion planning. In European Conference on Artificial Intelligence, pp. 671-675.
7. Amato, N. M., and Wu, Y. 1996. A randomized roadmap method for path and manipulation planning. In Proceedings of IEEE Conference on Robotics and Automation Vol. 1, pp. 113-120.
8. Amato, N. M., Bayazit, O. B., Dale, L. K., Jones, C., and Vallejo, D. 1998. OBPRM: An obstacle-based PRM for 3D workspaces. In Proceedings of Workshop on Algorithmic Foundations of Robotics, pp. 155-168.
9. Amato, N. M., Bayazit, O. B., Dale, L. K., Jones, C., and Vallejo, D. 2000. Choosing good distance metrics and local planners for probabilistic roadmap methods. IEEE Transactions on Robotics and Automation 16(4):442-447.
10. Anshelevich, E., Owens, S., Lamiraux, F., and Kavraki, L. E. 2000. Deformable volumes in path planning applications. In Proceedings of IEEE Conference on Robotics and Automation, pp. 2290-2295.
11. Barber, C. B., Dobkin, D. P., and Huhdanpaa, H. 1996. The quickhull algorithm for convex hulls. ACM Transactions on Mathematical Software 22(4)
12. Barraquand, J., and Latombe, J.-C. 1991. Robot motion planning: A distributed representation approach. International Journal of Robotics Research 10(6):628-649.
13. Bell, T. C., Cleary, J. G., and Witten, I. H. 1990. Text Compression, Prentice Hall, Englewood Cliffs, NJ.
14. Bessière, P., Ahuactzin, J.-M., Talbi, E.-G. and Mazer, E. 1994. The "Ariadne's clew" algorithm: Global planning with local methods. In Proceedings of Workshop on Algorithmic Foundations of Robotics, pp. 39-47.
15. Blackmore, D., and Leu, M. C. 1990. A differential equation approach to swept volumes. In Proceedings of Rensselaer's 2nd International Conference on Computer Integrated Manufacturing, pp. 143-149.
16. Bohlin, R., and Kavraki, L. E. 2000. Path planning using lazy PRM. In Proceedings of IEEE Conference on Robotics and Automation, pp. 521-528.
17. Boor, V., Overmars, M. H., and van der Stappen, A. F. 1999. The Gaussian sampling strategy for probabilistic roadmap planners. In Proceedings of IEEE Conference on Robotics and Automation, pp. 1018-1023.
18. Boussac, S., and Crosnier, A. 1996. Swept volumes generated from deformable objects application to nc verification. In Proceedings of IEEE Conference on Robotics and Automation, pp. 1813-1818.
19. Brooks, R., and Lozano-Pérez, T. 1983. A subdivision algorithm in configuration space for findpath with rotation. In International Joint Conference on Artificial Intelligence, pp. 799-806.
20. Canny, J. F. 1988. The Complexity of Robot Motion Planning. MIT Press, Cambridge, MA.
21. Elias, P. 1975. Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory 21(2).
22. Furht, B., Greenberg, J., and Westwater, R. 1997. Motion Estimation Algorithms for Video Compression. Kluwer Academic, Boston.
23. Guibas, L. J., Holleman, C., and Kavraki, L. E. 1999. A probabilistic roadmap planner for flexible objects with a workspace medial-axis-based sampling approach. In Proceedings of IEEE/RSJ Conference on Intelligent Robots and Systems.
24. Han, L., and Amato, N. M. 2000. A kinematics-based probabilistic roadmap method for closed chain systems. In Proceedings of Workshop on Algorithmic Foundations of Robotics.
25. Hankerson, D., Harris, G. A., and Johnson Jr, P. D. 1998. Introduction to Information Theory and Data Compression. Discrete Mathematics and its Applications. CRC Press, New York.
26. Holleman, C., and Kavraki, L. E. 2000. A framework for using the workspace medial axis in PRM planners. In Proceedings of IEEE Conference on Robotics and Automation, pp. 1408-1413.
27. Holleman, C., Kavraki, L. E., and Warren, J. 1998. Planning paths for a flexible surface patch. In Proceedings of IEEE Conference on Robotics and Automation, pp. 21-26.
28. Horsch, T., Schwarz, F., and Tolle, H. 1994. Motion planning with many degrees of freedom-random reflections at c-space obstacles. In Proceedings of IEEE Conference on Robotics and Automation, pp. 3318-3323
29. Hsu, D., Latombe, J.-C., and Motwani, R. 1999. Path planning in expansive configuration spaces. International Journal of Computational Geometry and Applications 9(4/5):495-512.
30. Hunter, G. M., and Steiglitz, K. 1979. Operations on images using quad trees. IEEE Transactions on Pattern Analysis and Machine Intelligence 1(2):145-153.
31. Hwang, Y. K. and Ahuja, N. October 1988, Path planning using a potential field representation. Technical Report UILU-ENG-8-2251, University of Illinois.
32. Kambhampati, S., and Davis, L. S. 1986. Multiresolution path planning for mobile robots. IEEE Journal of Robotics and Automation 2(3):135-145.
33. Kaufman, A., and Shimony, E. 1986. 3D scan-conversion algorithms for voxel-based graphics. In Proceedings of 1986 Workshop on Interactive 3D Graphics. ACM, New York, pp. 45-76.
34. Kavraki, L. E., and Latombe, J.-C. 1994. Randomized pre-processing of configuration space for fast path planning. In Proceedings of IEEE Conference on Robotics and Automation Vol. 3, pp. 2138-2145.
35. Kavraki, L. E., and Latombe, J.-C. 1998. Probabilistic roadmaps for robot path planning. In Practical Motion Planning in Robotics: Current Approaches and Future Directions, K. Gupta and P. del Pobil, eds. Wiley, New York, pp. 33-53.
36. Kavraki, L. E., Kolountzakis, M. N., and Latombe, J.-C. 1996. Analysis of probabilistic roadmaps for path planning. In Proceedings of IEEE Conference on Robotics and Automation Vol. 4, pp. 3020-3025.
37. Kavraki, L. E., Lamiraux, F., and Holleman, C. 1998. Towards planning for elastic objects. In Proceedings of Workshop on Algorithmic Foundations of Robotics.
38. Kavraki, L. E., Švestka, P., Latombe, J.-C., and Overmars, M.H. 1996. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Transactions on Robotics and Automation 12(4):566-580.
39. Khatib, O. 1986. Real-time obstacle avoidance for manipulators and mobile robots. International Journal of Robotics Research 5(1):90-98.
40. Kindel, R., Hsu, D., Latombe, J.-C., and Rock, S. 2000. Kinodynamic motion planning amidst moving obstacles. In Proceedings of IEEE Conference on Robotics and Automation, pp. 537-543.
41. Koditschek, D. E. 1989. Robot planning and control via potential functions. In The Robotics Review 1, pp. 349-367. MIT Press, Cambridge, MA.
42. Kuffner Jr, J. J., and LaValle, S. M. 2000. RRT-connect: An efficient approach to single-query path planning. In Proceedings of IEEE Conference on Robotics and Automation, pp. 995-1001.
43. LaValle, S. M., and Kuffner Jr, J. J. 1999. Randomized kinodynamic planning. In Proceedings of IEEE Conference on Robotics and Automation, pp. 473-479.
44. LaValle, S. M., and Kuffner Jr, J. J. 2000. Rapidly-exploring random trees: Progress and prospects. In Proceedings of Workshop on Algorithmic Foundations of Robotics.
45. LaValle, S. M., Yakey, J. H., and Kavraki, L. E. 1999. A probabilistic roadmap approach for systems with closed kinematic chains. In Proceedings of IEEE Conference on Robotics and Automation, pp. 1671-1676.
46. Leven, P., and Hutchinson, S. 2000. Toward real-time path planning in changing environments. in Proceedings of Workshop on Algorithmic Foundations of Robotics.
47. Lin, M., and Manocha, D. 1997. Efficient contact determination in dynamic environments. International Journal of Computational Geometry and Applications 7(1):123-151.
48. Lozano-Pérez, T. 1983. Spatial planning: A configuration space approach. IEEE Transactions on Computers
49. Ma, L., Jiang, Z., and Chan, K. Y. T. 2000. Interpolating and approximating moving frames using b-splines. In Proceedings of the 8th Pacific Conference on Computer Graphics and Applications, pp. 154-164.
50. Matula, D. W. 1993. A linear time 2 + ∈ approximation algorithm for edge connectivity. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pp. 500-504.
51. Mazer, E., Ahuactzin, J.-M., and Bessiè, P. 1998. The Ariadne's clew algorithm. Journal of Artificial Intelligence Research 9:295-316.
52. McLean, A., and Mazon, I. 1996. Incremental roadmaps and global path planning in evolving industrial environments. In Proceedings of IEEE Conference on Robotics and Automation, pp. 101-107.
53. Mehrandezh, M., and Gupta, K. 2002. Simultaneous path planning and free space exploration with skin sensor. In Proceedings of IEEE Conference on Robotics and Automation, pp. 3838-3843.
54. Mirtich, B. June 1997. V-Clip: Fast and robust polyhedral collision detection. Technical Report TR97-05, Mitsubishi Electric Research Laboratory, 201 Broadway, Cambridge, MA 02139.
55. Mitchell, J.L., Pennebaker, W. B., Fogg, C. E., and LeGall, D. J., eds. 1997. MPEG Video Compression Standard Chapman and Hall, New York.
56. Overmars, M. H., and Švestka, P. 1994. A probabilistic learning approach to motion planning. In Proceedings of Workshop on Algorithmic Foundations of Robotics, pp. 19-37.
57. Overmars, M. H., and Švestka, P. 1995. A paradigm for probabilistic path planning. Technical Report UU-CS-1995-22 Utrecht University.
58. Rosenfeld, A., and Kak, A. C. 1982. Digital Picture Processing. Academic Press, New York, second edition.
59. Samet, H. 1984. The quadtree and related hierarchical data structures. Computing Surveys 16(2):187-260.
60. Schwartz, J. T., Sharir, M., and Hopcroft, J., eds. 1987. Planning, Geometry, and Complexity of Robot Motion. Ablex, Norwood, NJ.
61. Švestka, P., and Overmars, M. H. 1995. Coordinated motion planning for multiple car-like robots using probabilistic roadmaps. In Proceedings of IEEE Conference on Robotics and Automation, pp. 1631-1636.
62. Trjan, R. E. 1972. Depth-first search and linear graph algorithms. SIAM Journal on Computing 1(2).
63. Vallejo, D., Jones, C., and Amato, N. M. October 1999. An adaptive framework for 'single shot' motion planning. Technical Report TR99-024, Department of Computer Science, Texas A&M University, College Station, TX.
64. van den Bergen, G. 1997. Efficient collision detection of complex deformable models using AABB trees. Journal of Graphics Tools 2(4):1-14.
65. van den Bergen, G. 1999. A fast and robust GJK implementation for collision detection of convex objects. Journal of Graphics Tools 4(2):7-25.
66. Wilmarth, S. A., Amato, N. M., and Stiller, P. F. 1999. Motion planning for a rigid body using random networks on the medial axis of the free space. In Proceedings of ACM Symposium on Computational Geometry, pp. 173-180.
67. Witten, I. H., Moffat, A., and Bell, T. C. 1999. Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann, San Francisco, CA, second edition.
68. Xavier, P.G. 1997. Fast swept-volume distance for robust collision detection. In Proceedings of IEEE Conference on Robotics and Automation, pp. 1162-1169.
69. Yoshikawa, T. 1985. Manipulability of robotic mechanisms. International Journal of Robotics Research 4(2):3-9.
70. Yu, Y., and Gupta, K. 1999. Sensor-based roadmaps for motion planning for articulated robots in unknown environments: Some experiments with an eye-in-hand system. In Proceedings of IEEE/RSJ Conference on Intelligent Robots and Systems.