Robot Motion Planning: A Game-Theoretic Foundation

Abstract. Analysis techniques and algorithms for basic path planning have become quite valuable in a variety of applications such as robotics, virtual prototyping, computer graphics, and computational biology. Yet, basic path planning represents a very restricted version of general motion planning problems often encountered in robotics. Many problems can involve complications such as sensing and model uncertainties, nonholonomy, dynamics, multiple robots and goals, optimality criteria, unpredictability, and nonstationarity, in addition to standard geometric workspace constraints. This paper proposes a unified, game-theoretic mathematical foundation upon which analysis and algorithms can be developed for this broader class of problems, and is inspired by the similar benefits that were obtained by using unified configuration-space concepts for basic path planning. By taking this approach, a general algorithm has been obtained for computing approximate optimal solutions to a broad class of motion planning problems, including those involving uncertainty in sensing and control, environment uncertainties, and the coordination of multiple robots.

[1]  J. Harsanyi.  Games with Incomplete Information Played by 'Bayesian' Players, Part III. The Basic Probability Distribution of the Game , 1968 .

[2]  Steven M. LaValle,et al.  A game-theoretic framework for robot motion planning , 1996 .

[3]  Bruce Randall Donald,et al.  Provably good approximation algorithms for optimal kinodynamic planning for Cartesian robots and open chain manipulators , 1990, SCG '90.

[4]  Edmund H. Durfee,et al.  A Decision-Theoretic Approach to Coordinating Multi-agent Interactions , 1991, IJCAI.

[5]  J. Schwartz,et al.  On the Piano Movers' Problem: III. Coordinating the Motion of Several Independent Bodies: The Special Case of Circular Bodies Moving Amidst Polygonal Barriers , 1983 .

[6]  Stephen J. Buckley,et al.  Fast motion planning for multiple moving robots , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[7]  P. Kumar,et al.  On worst case design strategies , 1987 .

[8]  Russell H. Taylor,et al.  Automatic Synthesis of Fine-Motion Strategies for Robots , 1984 .

[9]  R. Bertram,et al.  Stochastic Systems , 2008, Control Theory for Physicists.

[10]  S. LaValle,et al.  Randomized Kinodynamic Planning , 2001 .

[11]  Y. Ho,et al.  Team decision theory and information structures in optimal control problems--Part II , 1972 .

[12]  Christos H. Papadimitriou,et al.  Games against nature , 1985, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[13]  Lydia E. Kavraki,et al.  Randomized preprocessing of configuration space for path planning: articulated robots , 1994, Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS'94).

[14]  James Gil de Lamadrid,et al.  Avoidance of obstacles with unknown trajectories: locally optimal paths and path complexity, Part I , 1993, Robotica.

[15]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

[16]  B. Anderson,et al.  Optimal control: linear quadratic methods , 1990 .

[17]  Wayne F. Bialas,et al.  Cooperative n-person Stackelberg games , 1989, Proceedings of the 28th IEEE Conference on Decision and Control,.

[18]  R. Bellman.  Dynamic programming. , 1957, Science.

[19]  S. LaValle.  Rapidly-exploring random trees : a new tool for path planning , 1998 .

[20]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .

[21]  Stanley Zionts,et al.  Multiple criteria mathematical programming: an updated overview and several approaches , 1988 .

[22]  Yoshiaki Shirai,et al.  Planning of vision and motion for a mobile robot using a probabilistic model of uncertainty , 1991, Proceedings IROS '91:IEEE/RSJ International Workshop on Intelligent Robots and Systems '91.

[23]  Jean-Paul Laumond,et al.  Guidelines in nonholonomic motion planning for mobile robots , 1998 .

[24]  M. Degroot.  Optimal Statistical Decisions , 1970 .

[25]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[26]  B. Donald,et al.  Kinodynamic Motion Planning 1 Kinodynamic Motion Planning 5 , 1993 .

[27]  Russell H. Taylor,et al.  Sensor-based manipulation planning as a game with nature , 1988 .

[28]  Robert E. Larson,et al.  Optimum adaptive control in an unknown environment , 1968 .

[29]  Kevin M. Lynch,et al.  Pulling by Pushing, Slip With Infinite Friction, and Perfectly Rough Surfaces , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.

[30]  Rajeev Sharma,et al.  On Motion Planning in Changing, Partially Predictable Environments , 1997, Int. J. Robotics Res..

[31]  Keith W. Hipel,et al.  Multiple participant-multiple criteria decision making , 1993, IEEE Trans. Syst. Man Cybern..

[32]  Alan D. Christiansen,et al.  Probabilistic Analysis of Manipulation Tasks: A Conceptual Framework , 1996, Int. J. Robotics Res..

[33]  Tomás Lozano-Pérez,et al.  Deadlock-free and collision-free coordination of two robot manipulators , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[34]  Michael A. Erdmann,et al.  On Motion Planning with Uncertainty , 1984 .

[35]  Jean-Claude Latombe,et al.  Motion planning in the presence of moving obstacles , 1992 .

[36]  Mark H. Overmars,et al.  Coordinated motion planning for multiple car-like robots using probabilistic roadmaps , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[37]  Kang G. Shin,et al.  A variational dynamic programming approach to robot-path planning with a distance-safety criterion , 1988, IEEE J. Robotics Autom..

[38]  Alberto Elfes,et al.  Using occupancy grids for mobile robot perception and navigation , 1989, Computer.

[39]  John F. Canny,et al.  An exact algorithm for kinodynamic planning in the plane , 1991, Discret. Comput. Geom..

[40]  J. T. Shwartz,et al.  On the Piano Movers' Problem : III , 1983 .

[41]  S. Lavalle,et al.  Numerical Computation of Optimal Navigation Functionson , 1998 .

[42]  H. W. Corley,et al.  Some multiple objective dynamic programs , 1985 .

[43]  Yaakov Yavin,et al.  Pursuit-evasion differential games , 1987 .

[44]  J. Yong.  Differential pursuit games , 1987, 26th IEEE Conference on Decision and Control.

[45]  M. A. Girshick,et al.  Theory of games and statistical decisions , 1955 .

[46]  D. Bertsekas.  Convergence of discretization procedures in dynamic programming , 1975 .

[47]  Λυδια Καβρακη,et al.  RANDOM NETWORKS IN CONFIGURATION SPACE FOR FAST PATH PLANNING , 1994 .

[48]  Steven M. LaValle,et al.  Optimal motion planning for multiple robots having independent goals , 1998, IEEE Trans. Robotics Autom..

[49]  Steven M. LaValle,et al.  An objective-based stochastic framework for manipulation planning , 1994, Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS'94).

[50]  Dimitri P. Bertsekas,et al.  Dynamic Programming: Deterministic and Stochastic Models , 1987 .

[51]  J. Canny,et al.  Nonholonomic Motion Planning , 1992 .

[52]  T D Gillespie,et al.  Fundamentals of Vehicle Dynamics , 1992 .

[53]  Pierre A. Devijver.  Pattern recognition , 1982 .

[54]  I. Mazin,et al.  Theory , 1934 .

[55]  R. Larson,et al.  A survey of dynamic programming computational procedures , 1967, IEEE Transactions on Automatic Control.

[56]  Qiuming Zhu,et al.  Hidden Markov model for dynamic obstacle avoidance of mobile robot navigation , 1991, IEEE Trans. Robotics Autom..

[57]  Robert E. Larson,et al.  Principles of Dynamic Programming , 1978 .

[58]  Kevin M. Lynch,et al.  Pulling by Pushing, Slip With Infinite Friction, and Perfectly Rough Surfaces , 1995, Int. J. Robotics Res..

[59]  Chi-Fang Lin,et al.  Motion planning for multiple robots with multi-mode operations via disjunctive graphs , 1991, Robotica.

[60]  Christos H. Papadimitriou,et al.  An Algorithm for Shortest-Path Motion in Three Dimensions , 1985, Inf. Process. Lett..

[61]  Chee-Keng Yap,et al.  A "Retraction" Method for Planning the Motion of a Disc , 1985, J. Algorithms.

[62]  Bruce Randall Donald,et al.  Sensor interpretation and task-directed planning using perceptual equivalence classes , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[63]  Fei-Yue Wang,et al.  A cell mapping method for general optimum trajectory planning of multiple robotic arms , 1994, Robotics Auton. Syst..

[64]  John F. Canny,et al.  On computability of fine motion plans , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[65]  J. Yong.  On differential evasion games , 1988 .

[66]  Bruce Randall Donald,et al.  A Geometric Approach to Error Detection and Recovery for Robot Motion Planning with Uncertainty , 1987, Artif. Intell..

[67]  Matthew T. Mason,et al.  Automatic planning of fine motions: Correctness and completeness , 1984, ICRA.

[68]  M. D. Ardema,et al.  Dynamic game applied to coordination control of two arm robotic system , 1991 .

[69]  Michael A. Erdmann,et al.  Understanding Action and Sensing by Designing Action-Based Sensors , 1995, Int. J. Robotics Res..

[70]  O. Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[71]  Lydia E. Kavraki.  Computation of configuration-space obstacles using the fast Fourier transform , 1995, IEEE Trans. Robotics Autom..

[72]  Arthur E. Bryson,et al.  Applied Optimal Control , 1969 .

[73]  Héctor H. González-Baños,et al.  Motion strategies for maintaining visibility of a moving target , 1997, Proceedings of International Conference on Robotics and Automation.

[74]  James Gil de Lamadrid,et al.  Avoidance of obstacles with unknown trajectories: locally optimal paths and path complexity, Part I , 1993, Robotica.

[75]  Jean-Paul Laumond,et al.  Singularities and Topological Aspects in Nonholonomic Motion Planning , 1993 .

[76]  Anthony Stentz,et al.  Optimal and efficient path planning for partially-known environments , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[77]  Ehud Rivlin,et al.  Range-sensor based navigation in three dimensions , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[78]  Kenneth Y. Goldberg,et al.  Bayesian grasping , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[79]  A. Isidori.  Nonlinear Control Systems , 1985 .

[80]  Steven M. LaValle,et al.  An Objective-Based Framework for Motion Planning under Sensing and Control Uncertainties , 1998, Int. J. Robotics Res..

[81]  Bruce Randall Donald,et al.  On Information Invariants in Robotics , 1995, Artif. Intell..

[82]  Michael Erdmann,et al.  Randomization in Robot Tasks , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[83]  S. Shankar Sastry,et al.  Steering Three-Input Nonholonomic Systems: The Fire Truck Example , 1995, Int. J. Robotics Res..

[84]  T. Başar,et al.  Dynamic Noncooperative Game Theory , 1982 .

[85]  Pierre Ferbach,et al.  A method of progressive constraints for nonholonomic motion planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[86]  Bruce Randall Donald.  Planning Multi-Step Error Detection and Recovery Strategies , 1990, Int. J. Robotics Res..

[87]  Jean-Claude Latombe,et al.  Nonholonomic multibody mobile robots: Controllability and motion planning in the presence of obstacles , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[88]  Jean-Claude Latombe,et al.  Robot Motion Planning with Uncertainty in Control and Sensing , 1991, Artif. Intell..

[89]  Michael Brady,et al.  A bayesian approach to real-time obstacle avoidance for a mobile robot , 1995, Auton. Robots.

[90]  Jean-Claude Latombe,et al.  Numerical potential field techniques for robot path planning , 1991, Fifth International Conference on Advanced Robotics 'Robots in Unstructured Environments.

[91]  Anthony Stentz.  Optimal and efficient path planning for partially-known environments , 1994 .

[92]  E. Angel,et al.  Principles of dynamic programming part 1 , 1980, Proceedings of the IEEE.

[93]  Nancy M. Amato,et al.  A randomized roadmap method for path and manipulation planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[94]  Kang G. Shin,et al.  Minimum-time collision-free trajectory planning for dual-robot systems , 1992, IEEE Trans. Robotics Autom..

[95]  John F. Canny,et al.  New lower bound techniques for robot motion planning problems , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[96]  M. Shubik,et al.  Theory of Games and Statistical Decisions. , 1955 .

[97]  Hirotaka Nakayama,et al.  Theory of Multiobjective Optimization , 1985 .

[98]  Tomás Lozano-Pérez,et al.  On multiple moving objects , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[99]  Daniel E. Koditschek,et al.  Exact robot navigation using artificial potential functions , 1992, IEEE Trans. Robotics Autom..

[100]  Chi-Tsong Chen,et al.  Linear System Theory and Design , 1995 .

[101]  Leonidas J. Guibas,et al.  Finding an unpredictable target in a workspace with obstacles , 1997, Proceedings of International Conference on Robotics and Automation.

[102]  Jean-Claude Latombe,et al.  A Monte-Carlo algorithm for path planning with many degrees of freedom , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[103]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

[104]  Elmer G. Gilbert,et al.  Distance functions and their application to robot path planning in the presence of obstacles , 1985, IEEE J. Robotics Autom..

[105]  Jérôme Barraquand,et al.  A penalty function method for constrained motion planning , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[106]  Jihong Lee,et al.  A minimum-time trajectory planning method for two robots , 1992, IEEE Trans. Robotics Autom..

[107]  Jérôme Barraquand,et al.  Motion planning with uncertainty: the information space approach , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[108]  S. Zucker,et al.  Toward Efficient Trajectory Planning: The Path-Velocity Decomposition , 1986 .

[109]  Josef Kittler,et al.  Pattern recognition : a statistical approach , 1982 .

[110]  Penny Probert Smith,et al.  Coping with uncertainty in control and planning for a mobile robot , 1991, Proceedings IROS '91:IEEE/RSJ International Workshop on Intelligent Robots and Systems '91.

[111]  John H. Reif,et al.  Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).