Algorithms for computing numerical optimal feedback motion strategies

International Journal of Robotics Research

Volumn 20, Issue 9, 2001, Pages 729-752

  LaValle, Steven M ^a   Konkimalla, Prashanth ^b  

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

^b Iowa State University   (United States)

Author keywords

Algorithms; Dynamic programming; Mobile robotics; Motion planning; Navigation functions; Nonholonomic planning; Optimal control

Indexed keywords

EID: 0347270428     PISSN: 02783649     EISSN: None     Source Type: Journal    
DOI: 10.1177/02783640122067633     Document Type: Article

References (95)

1. Adams, M. D., Hu, H., and Roberts, P. J. 1990. Towards a real-time architecture for obstacle avoidance and path planning in mobile robots. IEEE International Conference on Robotics and Automation, May, pp. 584-589.
2. Agarwal, P. K., Latombe, J.-C., Motwani, R., and Raghavan, P. 1997. Nonholonomic path planning for pushing a disk among obstacles. IEEE International Conference on Robotics and Automation.
3. Agarwal, P. K., Raghavan, P., and Tamaki, H. 1995. Motion planning for a steering constrained robot through moderate obstacles. Proceedings of the ACM Symposium on Computational Geometry.
4. Amato, N. M., and Wu, Y. 1996. A randomized roadmap method forpath and manipulation planning. IEEE International Conference on Robotics and Automation, pp. 113-120.
5. Balkcom, D., and Mason, M. 2000. Geometric construction of time optimal trajectories for differential drive robots. Preprints of the 4th Workshop on Algorithmic Foundations of Robotics, Hanover, NH.
6. Barraquand, J., and Latombe, J.-C. 1990. A Monte-Carlo algorithm for path planning with many degrees of freedom. IEEE International Conference on Robotics and Automation, pp. 1712-1717.
7. Barraquand, J., and Latombe, J.-C. 1993. Nonholonomic multibody mobile robots: Controllability and motion planning in the presence of obstacles. Algorithmica 10:121-155.
8. Bellman, R. E. 1957. Dynamic Programming. Princeton, NJ: Princeton University Press.
9. Bellman, R. E., and Dreyfus, S. E. 1962. Applied Dynamic Programming. Princeton, NJ: Princeton University Press.
10. Bernard, J., Shannan, J., and Vanderploeg, M. 1989. Vehicle rollover on smooth surfaces. Proceedings of the SAE Passenger Car Meeting and Exposition, Dearborn, MI.
11. Bertsekas, D. P. 1975. Convergence in discretization procedures in dynamic programming. IEEE Transactions on Automation and Control 20:415-419.
12. Betts, J. T. 1998. Survey of numerical methods for trajectory optimization. Journal of Guidance, Control, and Dynamics 21:193-207.
13. Boissonnat, J. D., and Lazard, S. 1996. A polynomial-time algorithm for computing a shortest path of bounded curvature amidst moderate obstacles. Proceedings of the ACM Symposium on Computational Geometry, pp. 242-251.
14. Borenstein, J., and Koren, Y. 1989. Real-time obstacle avoidance for fast mobile robots. IEEE Transactions on Systems, Man and Cybernetics 19:1179-1187.
15. Bullo, F. 2001. Series expansions for the evolution of mechanical control systems. SIAM Journal of Control and Optimization 40:166-190.
16. Burridge, R. R., Rizzi, A. A., and Koditschek, D. E. 1999. Sequential composition of dynamically dexterous robot behaviors. International Journal of Robotics Research 18:534-555.
17. Bushnell, L. G., Tilbury, D. M., and Sastry, S. S. 1995. Steering three-input nonholonomic systems: The fire truck example. International Journal of Robotics Research 14:366-381.
18. Canny, J., Rege, A., and Reif, J. 1991. An exact algorithm for kinodynamic planning in the plane. Discrete and Computational Geometry 6:461-484.
19. Cherif, M. 1999. Kinodynamic motion planning for allterrain wheeled vehicles. IEEE International Conference on Robotics and Automation.
20. Connolly, C., Grupen, R., and Souccar, K. 1995. A Hamiltonian framework for kinodynamic planning. Proceedings of the IEEE International Conference on Robotics and Automation (ICRA'95), Nagoya, Japan.
21. Connolly, C. I., Burns, J. B., and Weiss, R. 1990. Path planning using Laplace's equation. IEEE International Conference on Robotics and Automation, May, pp. 2102-2106.
22. Coxeter, H.S.M. 1973. Regular Polytopes. New York: Dover.
23. De Luca, A., Oriolo, G., and Samson, C. 1998. Feedback control of a nonholonomic car-like robot. In Robot Motion Planning and Control, ed. J.-P. Laumond, 171-253. Berlin: Springer-Verlag.
24. Donald, B., and Xavier, P. 1995a. Provably good approximation algorithms for optimal kinodynamic planning for Cartesian robots and open chain manipulators. Algorithmica 14:480-530.
25. Donald, B., and Xavier, P. 1995b. Provably good approximation algorithms for optimal kinodynamic planning: Robots with decoupled dynamics bounds. Algorithmica 14:443-479.
26. Donald, B.R., Xavier, P.G., Canny, J., and Reif, J. 1993. Kinodynamic planning. Journal of the ACM 40:1048-1066.
27. Dubins, L. E. 1957. On curves of minimal length with a constraint on average curvature, and with prescribed initial and terminal positions and tangents. American Journal of Mathematics 79:497-516.
28. Erdmann, M. A. 1984. On motion planning with uncertainty. Master's thesis, Massachusetts Institute of Technology.
29. Ferbach, P. 1996. A method of progressive constraints for nonholonomic motion planning. IEEE International Conference on Robotics and Automation, pp. 2949-2955.
30. Fliess, M., Levine, J., Martin, P., and Rouchon, P. 1993. Flatness and defect of nonlinear systems. International Journal of Control 61:1327-1361.
31. Fortune, S., and Wilfong, G. 1988. Planning constrained motion. STOCS, pp. 445-459.
32. Fraichard, T. 1993. Dynamic trajectory planning with dynamic constraints: A "state-time space" approach. IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 1393-1400.
33. Frazzoli, E., Dahleh, M. A., and Feron, E. 1999. Robust hybrid control for autonomous vehicles motion planning. Technical Report No. LIDS-P-2468, Laboratory for Information and Decision Systems, Massachusetts Institute of Technology.
34. Heinzinger, G., Jacobs, P., Canny, J., and Paden, B. 1990. Time-optimal trajectories for a robotic manipulator: A provably good approximation algorithm. IEEE International Conference on Robotics and Automation, Cincinnati, OH, pp. 150-155.
35. Hershberger, J., and Suri, S. 1995. Efficient computation of Euclidean shortest paths in the plane. Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, pp. 508-517.
36. Hsu, D., Latombe, J.-C., and Motwani, R. 1999. Path planning in expansive configuration spaces. International Journal of Comput. Geom. Appl. 4:495-512.
37. Isidori, A. 1989. Nonlinear Control Systems. Berlin: Springer-Verlag.
38. Jacobs, P., and Canny, J. 1989. Planning smooth paths for mobile robots. IEEE International Conference on Robotics and Automation, pp. 2-7.
39. Jacobs, P., Laumond, J. P., and Taix, M. 1991. Efficient motion planners for nonholonomic mobile robots. IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 1229-1235.
40. Kavraki, L.E. 1994. Random networks in configuration space for fast path planning. Ph.D. thesis, Stanford University.
41. Kavraki, L. E. 1995. Computation of configuration-space obstacles using the fast Fourier transform. IEEE Transactions on Robotics and Automation 11:408-413.
42. Kavraki, L. E., Svestka, 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:566-580.
43. Khatib, O. 1980. Commande dynamique dans l'espace opérational des robots manipulateurs en présence d'obstacles. Ph.D. thesis, Ecole Nationale de la Statistique et de l'Administration Economique.
44. Khatib, O. 1986. Real-time obstacle avoidance for manipulators and mobile robots. International Journal of Robotics Research 5(1):90-98.
45. Kimmel, R., Kiryati, N., and Bruckstein, A. M. 1998. Multivalued distance maps for motion planning on surfaces with moving obstacles. IEEE Transactions on Robotics and Automation 14:427-435.
46. Kindel, R., Hsu, D., Latombe, J.-C., and Rock, S. 2000. Kinodynamic motion planning amidst moving obstacles. IEEE International Conference on Robotics and Automation.
47. Konkimalla, P. 1999. Efficient computation of optimal navigation functions for nonholonomic planning. Master's thesis, Iowa State University.
48. Konkimalla, P., and LaValle, S. M. 1999. Efficient computation of optimal navigation functions for nonholonomic planning. Proceedings of the First IEEE International Workshop on Robot Motion and Control, pp. 187-192.
49. Krogh, B. H. 1984. A generalized potential field approach to obstacle avoidance control. Proceedings of the SME Conference on Robotics Research, August.
50. Kuffner, J. J., and LaValle, S. M. 2000. RRT-connect: An efficient approach to single-query path planning. IEEE International Conference on Robotics and Automation, pp. 995-1001.
51. Laffierriere, G., and Sussman, H. J. 1991. Motion planning for controllable systems without drift. IEEE International Conference on Robotics and Automation.
52. Larson, R. E. 1967. A survey of dynamic programming computational procedures. IEEE Transactions on Automation and Control 12:767-774.
53. Larson, R. E., and Casti, J. L. 1982. Principles of Dynamic Programming, Part II. New York: Dekker.
54. Latombe, J.-C. 1991. Robot Motion Planning. Boston: Kluwer Academic.
55. Latombe, J.-C., Lazanas, A., and Shekhar, S. 1991. Robot motion planning with uncertainty in control and sensing. Artificial Intelligence 52:1-47.
56. Laumond, J. P. 1986. Trajectories for mobile robots with kinematic and environment constraints. Proceedings of the International Conference on Intelligent Autonomous Systems, pp. 346-354.
57. Laumond, J. P., Sekhavat, S., and Lamiraux, F. 1998. Guidelines in nonholonomic motion planning for mobile robots. In Robot Motion Planning and Control, ed. J.-P. Laumond, 1-53. Berlin: Springer-Verlag.
58. Laumond, J. P., and Siméon, T. 1989. Motion planning for a two degrees of freedom mobile robot with towing. Technical Report No. 89-148, Laboratoire d' Analyse et d'Architecture des Systemes/Centre National de la Recherche Scientifique, Toulouse, France.
59. Laumond, J. P., Siméon, T., Chatila, R., and Giralt, G. 1988. Trajectory planning and motion control of mobile robots. Proceedings of the IUTAM/IFAC Symposium, pp. 351-366.
60. Laumond, J. P., and Souéres, P. 1993. Metric induced by the shortest paths for a car-like robot. IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 1299-1303.
61. LaValle, S. M. 1995. A game-theoretic framework for robot motion planning. Ph.D. thesis, University of Illinois at Urbana-Champaign.
62. LaValle, S. M. 1998a. Numerical computation of optimal navigation functions on a simplicial complex. In Robotics: The Algorithmic Perspective, ed. P. Agarwal, L. Kavraki, and M. Mason. Wellesley, MA: A. K. Peters, pp. 339-350.
63. LaValle, S. M. 1998b. Rapidly-exploring random trees: A new tool for path planning. Report No. TR 98-11, Computer Science Department, Iowa State University.
64. LaValle, S. M., and Hutchinson, S. A. 1998. An objective-based framework for motion planning under sensing and control uncertainties. International Journal of Robotics Research 17(1): 19-42.
65. LaValle, S. M., and Kuffner, J. J. 1999. Randomized kinodynamic planning. Proceedings of the IEEE International Conference on Robotics and Automation, pp. 473-479.
66. LaValle, S. M., and Sharma, R. 1997. On motion planning in changing, partially-predictable environments. International Journal of Robotics Research 16:775-805.
67. Lee, C. W. 1997. Subdivisions and Triangulations of Polytopes. Boca Raton, FL CRC Press.
68. Li, Z., and Canny, J. F. 1989. Robot motion planning with nonholonomic constraints. Technical report, Electronics Research Laboratory, University of California.
69. Li, Z., and Canny, J. F. 1993. Nonholonomic Motion Planning. Boston: Kluwer Academic.
70. Li, Z., Canny, J. F., and Sastry, S. S. 1989. On motion planning for dextrous manipulation, part i: The problem formulation. IEEE International Conference on Robotics and Automation, pp. 775-780.
71. Lozano-Pérez, T., Mason, M. T., and Taylor, R. H. 1984. Automatic synthesis of fine-motion strategies for robots. International Journal of Robotics Research 3(1):3-24.
72. Lynch, K.M. 1999. Controllability of a planar body with unilateral thrusters. IEEE Transactions on Automatic Control 44:1206-1211.
73. Lynch, K. M., and Mason, M. T. 1996. Stable pushing: Mechanics, controllability, and planning. International Journal of Robotics Research 15:533-556.
74. Mazer, E., Ahuactzin, J. M., and Bessière, P. 1998. The Ariadne's clew algorithm. Journal of Artificial Intelligence Research 9:295-316.
75. Mitchell, J.S.B. 1986. Planning shortest paths. Ph.D. thesis, Stanford University.
76. Murray, R. M., Rathinam, M., and Sluis, W. M. 1995. Differential flatness of mechanical control systems. Proceedings of the ASME International Congress and Exposition.
77. Murray, R. M., and Sastry, S. 1993. Nonholonomic motion planning: Steering using sinusoids. Transactions on Automatic Control 38:700-716.
78. Nakamura, Y., and Mukherjee, R. 1989. Nonholonomic path planning of space robots. IEEE International Conference on Robotics and Automation, pp. 1050-1055.
79. Newman, W. S., and Hogan, N. 1987. High speed robot control and obstacle avoidance using dynamic potential functions. IEEE International Conference on Robotics and Automation, pp. 14-24.
80. O'Dunlaing, C. 1987. Motion planning with inertial constraints. Algorithmica 2:431-475.
81. Reeds, J. A., and Shepp, L. A. 1990. Optimal paths for a car that goes both forwards and backwards. Pacific Journal of Mathematics 145:367-393.
82. Reif, J., and Wang, H. 1997. Non-uniform discretization approximations for kinodynamic motion planning. In Algorithms for Robotic Motion and Manipulation, ed. J.P. Laumond and M. Overmars, 97-112. Wellesley, MA: A. K. Peters.
83. Rimon, E., and Koditschek, D. E. 1992. Exact robot navigation using artificial potential fields. IEEE Transactions on Robotics and Automation 8:501-518.
84. Rotman, J. J. 1988. Introduction to Algebraic Topology. Berlin: Springer-Verlag.
85. Sahar, G., and Hollerbach, J. M. 1986. Planning minimum-time trajectories for robot arms. International Journal of Robotics Research 5(3):97-140.
86. Sethian, J. A. 1996. Level Set Methods: Evolving Interfaces in Geometry, Fluid Mechanics, Computer Vision, and Materials Science. Cambridge, UK: Cambridge University Press.
87. Shkel, A. M., and Lumelsky, V. J. 1997. Incorporating body dynamics into sensor-based motion planning: The maximum turn strategy. IEEE Transactions on Robotics and Automation 13:873-880.
88. Souéres, P., and Laumond, J. P. 1996. Shortest paths synthesis for a car-like robot. IEEE Transactions on Automatic Control, pp. 672-688.
89. Struemper, H. K. 1997. Motion control for nonholonomic systems on matrix Lie groups. Ph.D. thesis, University of Maryland.
90. Sundar, S., and Shiller, Z. 1997. Optimal obstacle avoidance based on the Hamilton-Jacobi-Bellman equation. IEEE Transactions on Robotics and Automation 13:305-310.
91. Sussmann, H., and Tang, G. 1991. Shortest paths for the Reeds-Shepp car: A worked out example of the use of geometric techniques in nonlinear optimal control. Technical Report No. SYNCON 91-10, Department of Mathematics, Rutgers University.
92. Taix, M. 1991. Planification de mouvement pour robot mobile non-holonome. Ph.D. thesis, Laboratoire d'Analyse et d'Architecture des Systemes, Toulouse, France.
93. Tilove, R. B. 1990. Local obstacle avoidance for mobile robots based on the method of artificial potentials. IEEE International Conference on Robotics and Automation, May, pp. 566-571.
94. Yang, L., and LaValle, S. M. 2000. A framework for planning feedback motion strategies based on a random neighborhood graph. Proceedings of the IEEE International Conference on Robotics and Automation, pp. 544-549.
95. Yu, Y., and Gupta, K. 1998. On sensor-based roadmap: A framework for motion planning for a manipulator arm in unknown environments. IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 1919-1924.