Robot motion planning: A game-theoretic foundation

Algorithmica (New York)

Volumn 26, Issue 3-4, 2000, Pages 430-465

  Lavalle, S M ^a  

^a Iowa State University   (United States)

Author keywords

Dynamic programming; Game theory; Geometric reasoning; Motion planning; Path planning; Robotics

Indexed keywords

EID: 0000945925     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004539910020     Document Type: Article

References (114)

1. N. M. Amato and Y. Wu. A randomized roadmap method for path and manipulation planning. In Proc. IEEE Internat. Conf. Robotics Automat., pages 113-120, 1996.
2. B. D. Anderson and J. B. Moore, Optimal Control: Linear-Quadratic Methods. Prentice-Hall, Englewood Cliffs, NJ, 1990.
3. M. D. Ardema and J. M. Skowronski. Dynamic game applied to coordination control of two arm robotic system. In R. P. Hämäläinen and H. K. Ehtamo, editors, Differential Games - Developments in Modelling and Computation, pages 118-130. Springer-Verlag, Berlin, 1991.
4. T. Başar and P. R. Kumar. On worst case design strategies. Comput. Math. Appl., 13(1-3):239-245, 1987.
5. T. Başar and G. J. Olsder. Dynamic Noncooperative Game Theory. Academic Press, London, 1982.
6. J. Barraquand, P. Ferbach. A penalty function method for constrained motion planning. In Proc. IEEE Internat. Conf. Robotics Automat., pages 1235-1242, 1994.
7. J. Barraquand and P. Ferbach. Motion planning with uncertainty: the information space approach. In Proc. IEEE Internat. Conf. Robotics Automat., pages 1341-1348, 1995.
8. J. Barraquand, B. Langlois, and J. C. Latombe. Numerical potential field techniques for robot path planning. IEEE Trans. Systems Man Cybernet., 22(2):224-241, 1992.
9. J. Barraquand and J.-C. Latombe. A Monte-Carlo algorithm for path planning with many degrees of freedom. In Proc. IEEE Internat. Conf. Robotics Automat., pages 1712-1717, 1990.
10. J. Barraquand and J.-C. Latombe. Nonholonomic multibody mobile robots: controllability and motion planning in the presence of obstacles. Algorithmica, 10:121-155, 1993.
11. R. E. Bellman. Dynamic Programming. Princeton University Press, Princeton, NJ, 1957.
12. D. P. Bertsekas. Convergence in discretization procedures in dynamic programming. IEEE Trans. Automat. Control, 20(3):415-419, June 1975.
13. D. P. Bertsekas. Dynamic Programming: Deterministic and Stochastic Models. Prentice-Hall, Englewood Cliffs, NJ, 1987.
14. W. F. Bialas. Cooperative n-person Stackelberg games. In Proc. IEEE Conf. Decision Control, pages 2439-2444, Tampa, FL, December 1989.
15. Z. Bien and J. Lee. A minimum-time trajectory planning method for two robots. IEEE Trans. Robotics Automat., 8(3):414-418, June 1992.
16. D. Blackwell and M. A. Girshik. Theory of Games and Statistical Decisions. Dover, New York, NY, 1979.
17. R. C. Brost and A. D. Christiansen. Probabilistic analysis of manipulation tasks: a computational framework. Internat. J. Robotics Res., 15(1): 1-23, February 1996.
18. A. E. Bryson and Y.-C. Ho. Applied Optimal Control. Hemisphere, New York, 1975.
19. S. J. Buckley. Fast motion planning for multiple moving robots. In Proc. IEEE Internat. Conf. Robotics Automat., pages 322-326, 1989.
20. L. G. Bushnell, D. M. Tilbury, and S. S. Sastry. Steering three-input nonholonomic systems: the fire truck example. Internat. J. Robotics Res., 14(4):366-381, 1995.
21. J. Canny, A. Rege, and J. Reif. An exact algorithm for kinodynamic planning in the plane. Discrete Comput. Geom., 6:461-484, 1991.
22. J. Canny and J. Reif. New lower bound techniques for robot motion planning problems. In Proc. IEEE Conf. Found. Comput. Sci., pages 49-60, 1987.
23. J. F. Canny. On computability of fine motion plans. In Proc. IEEE Internat. Conf. Robotics Automat., pages 177-182, 1989.
24. C.-T. Chen. Linear System Theory and Design. Holt, Rinehart, and Winston, New York, 1984.
25. K.-C. Chu. Team decision theory and information structures in optimal control problems-part II. IEEE Trans. Automat. Control, 17(1):22-28, February 1972.
26. H. W. Corley. Some multiple objective dynamic programs. IEEE Trans. Automat. Control, 30(12):1221-1222, December 1985.
27. J. Gil de Lamadrid and J. Zimmerman. Avoidance of obstacles with unknown trajectories: locally optimal paths and path complexity, part I. Robotica, 11:299-308 1993.
28. M. H. DeGroot. Optimal Statistical Decisions. McGraw-Hill, New York, 1970.
29. P. A. Devijver and J. Kittler. Pattern Recognition: A Statistical Approach. Prentice-Hall, Englewood Cliffs, NJ, 1982.
30. B. R. Donald. Error Detection and Recovery for Robot Motion Planning with Uncertainty. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA, 1987.
31. B. R. Donald. Planning multi-step error detection and recovery strategies. Internat. J. Robotics Res., 9(1):3-60, 1990.
32. B. R. Donald. On information invariants in robotics. Artificial Intelligence, 72:217-304, 1995.
33. B. R. Donald and J. Jennings. Sensor interpretation and task-directed planning using perceptual equivalence classes. In Proc. IEEE Internat. Conf. Robotics Automat., pages 190-197, Sacramento, CA, April 1991.
34. B. R. Donald and P. G. Xavier. Provably good approximation algorithms for optimal kinodynamic planning for Cartesian robots and open-chain manipulators. Algorithmica, 14(6):480-530, 1995.
35. B. R. Donald, P. G. Xavier, J. Canny, and J. Reif. Kinodynamic planning. Journal of the ACM, 40:1048-66, November 1993.
36. A. Elfes. Using occupancy grids for mobile robot perception and navigation. IEEE Trans. Comput., 22(6):46-57, June 1989.
37. M. Erdmann. Randomization in robot tasks. Internat. J. Robotics Res., 11(5):399-436, October 1992.
38. M. Erdmann. Randomization for robot tasks: using dynamic programming in the space of knowledge states. Algorithmica, 10:248-291, 1993.
39. M. Erdmann. Understanding action and sensing by designing action-based sensors. Internat. J. Robotics Res., 14(5):483-509, 1995.
40. M. Erdmann and T. Lozano-Perez. On multiple moving objects. In Proc. IEEE Internat. Conf. Robotics Automat., pages 1419-1424, 1986.
41. M. Erdmann and T. Lozano-Pérez. On multiple moving objects. Algorithmica, 2:477-521, 1987.
42. M. A. Erdmann. On motion planning with uncertainty. Master's thesis, Massachusetts Institute of Technology, Cambridge, MA, August 1984.
43. P. Ferbach. A method of progressive constraints for nonholonomic motion planning. In Proc. IEEE Internat. Conf. Robotics Automat., pages 2949-2955, 1996.
44. E. G. Gilbert and D. W. Johnson. Distance functions and their application to robot path planning in the presence of obstacles. IEEE Trans. Robotics Automat., 1(1):21-30, March 1985.
45. T. N. Gillespie. Fundamentals of Vehicle Dynamics. Society of Automotive Engineers, Warrendale, PA, 1992.
46. P. J. Gmytrasiewicz, E. H. Durfee, and D. K. Wehe. A decision-theoretic approach to coordinating multi-agent interations. In Proc. Internat. Joint Conf. on Artif. Intell., pages 62-68, 1991.
47. K. Y. Goldberg. Orienting polygonal parts without sensors. Algorithmica, 10:201-225, 1993.
48. K. Y. Goldberg and M. T. Mason. Bayesian grasping. In Proc. IEEE Internat. Conf. Robotics Automat., 1990.
49. O. Hájek. Pursuit Games. Academic Press, New York, 1975.
50. J. C. Harsanyi. Games with incomplete information played by Bayesian players. Management Sci., 14(3):159-182, November 1967.
51. K. W. Hipel, K. J. Radford, and L. Fang. Multiple participant-multiple criteria decision making. IEEE Trans. Systems Man Cybernet., 23(4):1184-1189, 1993.
52. Y.-C. Ho and K.-C. Chu. Team decision theory and information structures in optimal control problems-parti. IEEE Trans. Automat. Control, 17:15-22, 1972.
53. H. Hu and M. Brady. A Bayesian approach to real-time obstacle avoidance for a mobile robot. Autom. Robots, 1(1):69-92, 1994.
54. H. Hu, M. Brady, and P. Probert. Coping with uncertainty in control and planning for a mobile robot. In Proc. IEEE/RSJ Internat. Workshop Intell. Robots Systems, pages 1025-1030, Osaka, November 1991.
55. I. Kamon, E. Rivlin, and E. Rimon. Range-sensor based navigation in three dimensions. In Proc. IEEE Internat. Conf. Robotics Automat., 1999.
56. L. E. Kavraki, P. Svestka, J.-C. Latombe, and M. H. Overmars. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans. Robotics Automat., 12(4):566-580, June 1996.
57. R. Isaacs. Differential Games. Wiley, New York, 1965.
58. A. Isidori. Nonlinear Control Systems. Springer-Verlag, Berlin, 1989.
59. K. Kant and S. W. Zucker. Toward efficient trajectory planning: the path-velocity decomposition. Internat. J. Robotics Res., 5(3):72-89, 1986.
60. L. Kavraki and J.-C. Latombe. Randomized preprocessing of configuration space for path planning. In Proc. IEEE Internat. Conf. Robotics Automat., pages 2138-2139, 1994.
61. L. E. Kavraki. Random Networks in Configuration Space for Fast Path Planning. Ph.D. thesis, Stanford University, Stanford, CA, 1994.
62. L. E. Kavraki. Computation of configuration-space obstacles using the Fast Fourier Transform. IEEE Trans. Robotics Automat., 11(3):408-413, 1995.
63. O. Khatib. Real-time obstacle avoidance for manipulators and mobile robots. Internat. J. Robotics Res., 5(1):90-98, 1986.
64. K. H. Kim and F. W. Roush. Team Theory. Ellis Horwood, Chichester, 1987.
65. P. R. Kumar and P. Varaiya. Stochastic Systems. Prentice-Hall, Englewood Cliffs, NJ, 1986.
66. R. E. Larson. A survey of dynamic programming computational procedures. IEEE Trans. Automat. Control, 12(6):767-774, December 1967.
67. R. E. Larson and J. L.Casti. Principles of Dynamic Programming, Part II. Marcel Dekker, New York, 1982.
68. R. E. Larson and W. G. Keckler. Optimum adaptive control in an unknown environment. IEEE Trans. Automat. Control, 13(4):438-439, August 1968.
69. J.-C. Latombe. Robot Motion Planning. Kluwer, Boston, MA, 1991.
70. J.-C. Latombe, A. Lazanas, and S. Shekhar. Robot motion planning with uncertainty in control and sensing. Artificial Intelligtence, 52:1-47, 1991.
71. J.-P. Laumond. Singularities and topological aspects in nonholonomic motion planning. In Z. Li and J. F. Canny, editors, Nonholonomic Motion Planning, pages 149-200. Kluwer, Boston, MA, 1993.
72. J. P. Laumond, S. Sekhavat, and F. Lamiraux. Guidelines in nonholonomic motion planning for mobile robots. In J.-P. Laumond, editor, Robot Motion Planning and Control, pages 1-53. Springer-Verlag, Berlin, 1998.
73. S. M. LaValle. Numerical computation of optimal navigation functions on a simplicial complex. In P. Agarwal, L. Kavraki, and M. Mason, editors, Robotics: The Algorithmic Perspective. A K Peters, Wellesley, MA, 1998.
74. S. M. LaValle. Rapidly-exploring random trees: A new tool for path planning. Computer Science Dept., Iowa State University, , Oct. 1998.
75. S. M. LaValle. A Game-Theoretic Framework for Robot Motion Planning. Ph.D. thesis, University of Illinois, Urbana, IL, July, 1995.
76. S. M. LaValle and S. A. Hutchinson. An objective-based stochastic framework for manipulation planning. In Proc. IEEE/RSJ/GI Internat. Conf. Intell. Robots Systems, pages 1772-1779, September 1994.
77. S. M. LaValle and S. A. Hutchinson. Optimal motion planning for multiple robots having independent goals. In Proc. IEEE Internat. Conf. Robotics Automat., pages 2847-2852, April 1996.
78. S. M. LaValle and S. A. Hutchinson. An objective-based framework for motion planning under sensing and control uncertainties. Internat. J. Robotics Res., 17(1):19-42, January 1998.
79. S. M. LaValle and J. J. Kuffner. Randomized kinodynamic planning. In Proc. IEEE Internat. Conf. Robotics Automat., 1999.
80. S. M. LaValle, D. Lin, L. J. Guibas, J.-C. Latombe, and R. Motwani. Finding an unpredictable target in a workspace with obstacles. In Proc. IEEE Internat. Conf. Robotics Automat., pages 737-742, 1997.
81. S. M. LaValle, H. H. González-Ba nos, C. Becker, and J.-C. Latombe. Motion strategies for maintaining visibility of a moving target. In Proc. IEEE Internat. Conf. Robotics Automat., pages 731-736, 1997.
82. S. M. LaValle and R. Sharma. On motion planning in changing, partially-predictable environments. Internat. J. Robotics Res., 16(6):775-805, December 1997.
83. Z. Li and J. F. Canny. Nonholonomic Motion Planning. Kluwer, Boston, MA, 1993.
84. C.-F. Lin and W.-H. Tsai. Motion planning for multiple robots with multi-mode operations via disjunctive graphs. Robotica, 9:393-408 1990.
85. T. Lozano-Pérez. Spatial planning: a configuration space approach. IEEE Trans. Comput., 32(2):108-120, 1983.
86. T. Lozano-Pérez, M. T. Mason, and R. H. Taylor. Automatic systhesis of fine-motion strategies for robots. Internat. J. Robotics Res., 3(1):3-24, 1984.
87. 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.
88. K. M. Lynch and M. T. Mason. Pulling by pushing, slip with infinite friction, and perfectly rough surfaces. Internat. J. Robotics Res., 14(2):174-183, 1995.
89. M. T. Mason. Automatic planning of fine motions: Correctness and completeness. In Proc. IEEE Internat. Conf. Robotics Automat., pages 492-503, 1984.
90. J. Miura and Y. Shirai. Planning of vision and motion for a mobile robot using a probabilistic model of uncertainty. In Proc. IEEE/RSJ Internat. Workshop on Intell. Robots Systems, pages 403-408, Osaka, May 1991.
91. P. A. O'Donnell and T. Lozano-Pérez. Deadlock-free and collision-free coordination of two robot manipulators. In IEEE Internat. Conf. Robotics Automat., pages 484-489, 1989.
92. C. O'Dunlaing and C. K. Yap. A retraction method for planning the motion of a disc. J. Algorithms, 6:104-111, 1982.
93. G. Owen. Game Theory. Academic Press, New York, 1982.
94. C. H. Papadimitriou. An algorithm for shortest-path planning in three dimensions. Inform. Process. Lett., 20(5):259-263, 1985.
95. C. H. Papadimitriou. Games against nature. J. Comput. System Sci., 31:288-301, 1985.
96. J. H. Reif. Complexity of the mover's problem and generalizations. In Proc. IEEE Symp. Found. Comput. Sci., pages 421-427, 1979.
97. J. H. Reif and M. Sharir. Motion planning in the presence of moving obstacles. In Proc. IEEE Symp. Found. Comput. Sci., pages 144-154, 1985.
98. J. H. Reif and S. R. Tate. Continuous alternation: the complexity of pursuit in continuous domains. Algorithmica, 10:157-181, 1993.
99. E. Rimon and D. E. Koditschek. Exact robot navigation using artificial potential fields. IEEE Trans. Robotics Automat., 8(5):501-518, 1992.
100. Y. Sawaragi, H. Nakayama, and T. Tanino. Theory of Multiobjective Optimization. Academic Press, New York, 1985.
101. J. T. Schwartz and M. Sharir. On the piano movers' problem: II. General techniqies for computing topological properties of algebraic manifolds. Comm. Pure Appl. Math., 36:345-398, 1983.
102. J. T. Schwartz and M. Sharir. On the piano movers' problem: III. Coordinating the motion of several independent bodies. Internat. J. Robotics Res., 2(3):97-140 1983.
103. R. Sharma, S. M. LaValle, and S. A. Hutchinson. Optimizing robot motion strategies for assembly with stochastic models of the assembly process. IEEE Trans. Robotics Automat., 12(2):160-174, April 1996.
104. K. G. Shin and Q. Zheng. Minimum-time collision-free trajectory planning for dual-robot systems. IEEE Trans. Robotics Automat., 8(5):641-644, 1992.
105. A. Stentz. Optimal and efficient path planning for partially-known environments. In Proc. IEEE Internat. Conf. Robotics Automat., pages 3310-3317, 1994.
106. S.-H. Suh and K. G. Shin. A variational dynamic programming approach to robot-path planning with a distance-safety criterion. IEEE Trans. Robotics Automat., 4(3):334-349, June 1988.
107. P. Svestka and M. H. Overmars. Coordinated motion planning for multiple car-like robots using probabilistic roadmaps. In Proc. IEEE Internat. Conf. Robotics Automat., pages 1631-1636, 1995.
108. R. H. Taylor, M. T. Mason, and K. Y. Goldberg. Sensor-based manipulation planning as a game with nature. In Proc. Fourth Internat. Symp. Robotics Res., pages 421-429, 1987.
109. F.-Y. Wang and P. J. A. Lever. A cell mapping method for general optimum trajectory planning of multiple robotic arms. Robots Anton. Systems, 12:15-27, 1994.
110. Y. Yavin and M. Pachter. Pursuit-Evasion Differential Games. Pergamon Press, Oxford, 1987.
111. J. Yong. On differential evasion games. SIAM J. Control Optim., 26(1):1-22, January 1988.
112. J. Yong. On differential pursuit games. SIAM J. Control Optim., 26(2):478-495, March 1988.
113. Q. Zhu. Hidden Markov model for dynamic obstacle avoidance of mobile robot navigation. IEEE Trans. Robotics Automat., 7(3):390-397, June 1991.
114. S. Zionts. Multiple criteria mathematical programming: an overview and several approaches. In P. Serafini, editor, Mathematics of Multi-Objective Optimization, pages 227-273. Springer-Verlag, Berlin, 1985.