Randomized kinodynamic motion planning with moving obstacles

International Journal of Robotics Research

Volumn 21, Issue 3, 2002, Pages 233-255

  Hsu, David ^a   Kindel, Robert ^b   Latombe, Jean Claude ^a   Rock, Stephen ^b  

^a Stanford University   (United States)

^b 496 Lomita Mall   (United States)

Author keywords

Expansive space; Kinodynamic constraints; Motion planning; Moving obstacles; Probabilistic roadmaps

Indexed keywords

GEOMETRY; KINEMATICS; MOTION PLANNING; PROBABILITY; ROBUSTNESS (CONTROL SYSTEMS); TRAJECTORIES;

KINODYNAMIC MOTION PLANNING;

ROBOTS;

EID: 0036523380     PISSN: 02783649     EISSN: None     Source Type: Journal    
DOI: 10.1177/027836402320556421     Document Type: Article

References (67)

1. Agawal, P.K. 1997. Range searching. In Handbook of discrete and computational geometry, eds. J.E. Goodman and J. O'Rourke, 575-598. Boca Raton, FL: CRC Press.
2. Ahuactzin, J.M. 1994. Le Fil d'Ariane. Une méthode de planification générale. Application à la planfification des trajectoires. PhD thesis, National Polytechnic Institute of Grenoble, France.
3. Ahuactzin, J.M., and Gupta, K.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. Amato, N.M., Bayazit, O.B., Dale, L.K., Jones, C., and Vallejo, D. 1998. OBPRM: An obstacle-based PRM for 3D workspaces. In Robotics: The Algorithmic Perspective: 1998 Workshop on the Algorithmic Foundations of Robotics, eds. P.K. Agarwal et al., 155-168. Wellesley, MA: A. K. Peters.
5. Barraquand, J., Kavraki, L., Latombe, J.C., Li, T.-Y., Motwani, R., and Raghavan, P. 1997. A random sampling scheme for path planning. International Journal of Robotics Research 16(6):759-774.
6. Barraquand, J., and Latombe, J.C. 1989. On nonholonomic robots and optimal maneuvering. Revue d'Intelligence Artificielle 3(2):77-103.
7. Barraquand, J., and Latombe, J.C. 1991. Robot motion planning: A distributed representation approach. International Journal of Robotics Research 10(6):628-649.
8. Barraquand, J., and Latombe, J.C. 1993. Nonholonomic multibody mobile robots: Controllability and motion planning in the presence of obstacles. Algorithmica 10(2-4):121-155.
9. Bobrow, J.E., Dubowsky, S., and Gibson, J.S. Time-optimal control of robotic manipulators along specified paths. International Journal of Robotics Research 4(3):3-17.
10. Bohlin, R., and Kavraki, L.E. 2000. Path planning using lazy PRM. In Proc. IEEE Int. Conf. on Robotics and Automation.
11. Boor, V., Overmars, M.H., and van der Stappen, F. 1999. The gaussian sampling strategy for probabilistic roadmap planners. In Proc. IEEE Int. Conf. on Robotics and Automation, pp. 1018-1023.
12. Chang, H., and Li, T.-Y. 1995. Assembly maintainability study with motion planning. In Proc. IEEE Int. Conf. on Robotics and Automation, pp. 1012-1019.
13. Cohen, J., Lin, M., Manocha, D., and Ponamgi, M. 1995. I-Collide: An interactive and exact collision detection system for large scale environments. In Proc. ACM Interactive 3D Graphics Conf., pp. 189-196.
14. Desai, J.P., and Kumar, V. 1999. Motion planning for cooperating mobile manipulators. Journal of Robotic Systems 16(10):557-579.
15. Donald, B.R. 1987. A search algorithm for motion planning with six degrees of freedom. Artificial Intelligence 31 (3):295-353.
16. Donald, B.R., Xavier, P., Canny, J., and Reif, J. 1993. Kinodynamic motion planning. Journal of the ACM 40(5): 1048-1066.
17. Erdmann, M., and Lozano-Pérez, T. 1987. On multiple moving objects. Algorithmica 2(4):477-521.
18. Ferbach, P. 1998. A method of progressive constraints for nonholonomic motion planning. IEEE Transactions on Robotics and Automation 14(1): 172-179.
19. Fiorini, P., and Shiller, Z. 1996. Time optimal trajectory planning in dynamic environments. In Proc. IEEE Int. Conf. on Robotics and Automation, pp. 1553-1558.
20. Fraichard, T. 1993. Dynamic trajectory planning with dynamic constraints: A "state-time space" approach. In Proc. IEEE/RSJ International Conference on Intelligent Robots and Systems, vol. 2, pp. 1394-1400.
21. Fujimura, K. 1995. Time-minimum routes in time-dependent networks. IEEE Transactions on Robotics and Automation, 11(3):343-351.
22. Gottschalk, S., Lin, M., and Manocha, D. 1996. OBB-Tree: A hierarchical structure for rapid interference detection. In SIGGRAPH 96 Conference Proceedings, pp. 171-180.
23. Hermann, R., and Krener, A.J. 1977. Nonlinear controllability and observability. IEEE Transactions on Automatic Control 22(5):728-740.
24. Horsch, T., Schwarz, F., and Tolle, H. 1994. Motion planning for many degrees of freedom-random reflections at C-space obstacles. In Proc. IEEE Int. Conf. on Robotics and Automation, pp. 3318-3323.
25. Hsu, D. 2000. Randomized Single-query Motion Planning in Expansive Spaces. PhD thesis, Dept. of Computer Science, Stanford University, Stanford, CA
26. Hsu, D., Kavraki, L., Latombe, J.C., Motwani, R., and Sorkin, S. 1998. On finding narrow passages with probabilistic roadmap planners. In Robotics: The Algorithmic Perspective: 1998 Workshop on the Algorithmic Foundations of Robotics, eds. P.K. Agarwal et al., 141-154. Wellesley, MA: A. K. Peters.
27. Hsu, D., Kindel, R., Latombe, J.C., and Rock, S. 2000. Randomized kinodynamic motion planning with moving obstacles. In Algorithmic and Computational Robotics: New Directions: The Fourth International Workshop on the Algorithmic Foundations of Robotics, eds. B.R. Donald et al., 247-264. Wellesley, MA: A. K. Peters.
28. Hsu, D., Latombe, J.C., and Motwani, R. 1997. Path planning in expansive configuration spaces. In Proc. IEEE Int. Conf. on Robotics and Automation, pp. 2719-2726.
29. Hsu, D., Latombe, J.C., and Motwani, R. 1999. Path planning in expansive configuration spaces. International Journal of Computational Geometry & Applications 9(4 & 5):495-512.
30. Hsu, D., Latombe, J.C., Motwani, R., and Kavraki, L.E. 1999. Capturing the connectivity of high-dimensional geometric spaces by parallelizable random sampling techniques. In Advances in randomized parallel computing, eds. P.M. Pardalos and S. Rajasekaran, 159-182. Boston, MA: Kluwer Academic Publishers.
31. Hubbard, P.M. 1996. Approximating polyhedra with spheres for time-critical collision detection. ACM Transactions on Graphics 15(3): 179-210.
32. Hwang, Y.K., Xavier, P.G., Chen, P.C., and Watterberg, P.A. 1998. Motion planning with SANDROS and the configuration space toolkit. In Practical Motion Planning in Robotics, eds. K.K. Gupta and A.P. del Pobil, 55-77. John Wiley & Sons.
33. Kalos, M.H., and Whitlock, P.A. 1986. Monte Carlo Methods, vol. 1., New York: John Wiley & Son.
34. Kant, K., and Zucker, S.W. 1986. Toward efficient trajectory planning: The path-velocity decomposition. International Journal of Robotics Research 5(3):72-89.
35. Kavraki, L.E. 1994. Random Networks in Configuration Space for Fast Path Planning. PhD thesis, Dept. of Computer Science, Stanford Univerity, Stanford, CA.
36. Kavraki, L., Kolountzakis, M.N., and Latombe, J.C. 1998. Analysis of probabilistic roadmaps for path planning. IEEE Transactions on Robotics and Automation 14(1):166-171.
37. Kavraki, L., Latombe. J.C., Motwani, R., and Raghavan, P. 1995. Randomized query processing in robot path planning. In Proc. ACM Symposium on Theory of Computing, pp. 353-362.
38. Kavraki, L., Švestka, P., Latombe, J.C., and Overmars, M.H. 1996. Probabilistic roadmaps for path planning in high-dimensional configuration space. IEEE Transactions on Robotics and Automation 12(4):566-580.
39. Kindel, R. 2001. Motion Planning for Free-Flying Robots in Dynamic and Uncertain Environments. PhD thesis, Dept. of Aeronautics & Astronautics, Stanford University, Stanford, CA.
40. Kindel, R., Hsu, D., Latombe, J.C., and Rock, S. 2000. Kinodynamic motion planning amidst moving obstacles. In Proc. IEEE Int. Conf. on Robotics and Automation, pp. 537-543.
41. Klosowski, J., Held, M., Mitchell, J.S.B., Sowizral, H., and Zikan, K. 1998. Efficient collision detection using bounding volume hierarchies of k-dops. IEEE Transactions on Visualization and Computer Graphics 4(1):21-37.
42. Krishnan, S., Pattekar, A., Lin, M., and Manocha, D. 1998. Spherical shell: A higher order bounding volume for fast proximity queries. In Robotics: The Algorithmic Perspective: 1998 Workshop on the Algorithmic Foundations of Robotics, pp. 177-190.
43. Kuffner, J.J. 1999. Autonomous Agents for Real-Time Animation. PhD thesis, Dept. of Computer Science, Stanford University, Stanford, CA.
44. Lamiraux, F., and Laumond, J.-P. 1996. On the expected complexity of random path planning. In Proc. IEEE Int. Conf. on Robotics and Automation, pp. 3014-3019.
45. Latombe, J.C. 1999. Motion planning: A journey of robots, molecules, digital actors, and other artifacts. International Journal of Robotics Research 18(11): 1119-1128.
46. Laumond, J.-P. 1986. Feasible trajectories for mobile robots with kinematic and environmental constraints. In Proc. Int. Conf. on Intelligent Autonomous Systems, pp. 346-354.
47. Laumond, J.-P., Jacobs., P.E., Taïx, M., and Murray, R.M. 1994. A motion planner for nonholonomic mobile robots. IEEE Transactions on Robotics and Automation 10(5):577-593.
48. LaValle, S.M., and Kuffner, J.J. 1999. Randomized kinodynamic planning. In Proc. IEEE Int. Conf. on Robotics and Automation, pp. 473-479.
49. LaValle, S.M., and Kuffner, J.J. 2001. Randomized kinodynamic planning. International Journal of Robotics Research 20(5):278-400.
50. Leven, P., and Hutchinson, S. 2000. Toward real-time path planning in changing environments. In Algorithmic and Computational Robotics: New Directions: The Fourth International Workshop on the Algorithmic Foundations of Robotics, eds. B.R. Donald et al., 363-376. Wellesley, MA: A. K. Peters.
51. Li, Z., Canny, J.F., and Heinzinger, G. 1989. Robot motion planning with nonholonomic constraints. In Robotics Research: The Fifth International Symposium, eds. H. Miura et al., 309-316. Cambridge, MA: MIT Press.
52. Lynch, K.M., and Mason, M.T. 1996. Stable pushing: Mechanics, controllability, and planning. International Journal of Robotics Research 15(6):533-556.
53. O'Rourke, J. 1997. Visibility. In Handbook of discrete and computational geometry, eds. J.E. Goodman and J. O'Rourke, 467-479. Boca Raton, FL: CRC Press.
54. Press, W.H., Teukolsky, S.A., Vetterling, W.T., and Plannery, B.P. 1992. Numerical Recipes in C. Cambridge University Press, 2nd edition.
55. Quinlan, S. 1994. Efficient distance computation between non-convex objects. In Proc. IEEE Int. Conf. on Robotics and Automation, pp. 3324-3329.
56. Reeds, J.A., and Shepp, L.A. 1990. Optimal paths for a car that goes forwards and backwards. Pacific Journal of Mathematics 145(2):367-393.
57. Reif, J.H. 1979. Complexity of the mover's problem and generalizations. In Proc. IEEE Symposium on Foundations of Computer Science, pp. 421-427.
58. Reif, J.H., and Sharir, M. 1985. Motion planning in the presence of moving obstacles. In Proc. IEEE Symposium on Foundations of Computer Science, pp. 144-154.
59. Sánchez, G. and Latombe, J.C. 2002. On delaying collision checking in PRM planning-Application to multi-robot coordination. International Journal of Robotics Research 21(1):5-26.
60. Sekhavat, S., and Laumond, J.-P. 1998. Topological property for collision-free nonholonomic motion planning: The case of sinusoidal inputs for chained form systems. IEEE Transactions on Robotics and Automation 14(5):671-680.
61. Shiller, Z., and Dubowsky, S. 1991. On computing the global time-optimal motions of robotic manipulators in the presence of obstacles. IEEE Transactions on Robotics and Automation 7(6):785-797.
62. Siméon, T., Laumond, J.P., and Lamiraux, F. 2001. Move3D: A generic platform for motion planning. In Proc. IEEE International Symposium on Assembly and Task Planning.
63. Song, G., Miller, S., and Amato, N. 2001. Customizing PRM-roadmaps at query time. In Proc. IEEE Int. Conf. on Robotics and Automation.
64. Švestka, P. 1997. Robot Motion Planning Using Probabilistic Roadmaps. PhD thesis, Dept. of Computer Science, Utrecht University, The Netherlands.
65. Švestka, P., and Overmars, M.H. 1994. Motion planning for car-like robots using a probabilistic learning approach. Technical Report RUU-CS-94-33, Dept. of Computer Science, Utrecht University, Utrecht, The Netherlands.
66. Švestka, P., and Overmars, M.H. 1998. Probabilistic path planning: Robot motion planning and control. In Lecture Notes in Control and Information Sciences, vol. 229, 225-304. Springer-Verlag.
67. Sekhavat, S., Švestka, P., Laumond, J.-P., and Overmars, M.H. 1997. Multi-level path planning for nonholonomic robots using semi-holonomic subsystems. In Algorithms for Robotic Motion and Manipulation: 1996 Workshop on the Algorithmic Foundations of Robotics, eds. J.-P. Laumond et al., 79-96. Wellesley, MA: A. K. Peters.