Path Planning Games

Path planning is a fundamental and extensively explored problem in robotic control. We present a novel economic perspective on path planning. Specifically, we investigate strategic interactions among path planning agents using a game theoretic path planning framework. Our focus is on economic tension between two important objectives: efficiency in the agents' achieving their goals, and safety in navigating towards these. We begin by developing a novel mathematical formulation for path planning that trades off these objectives, when behavior of other agents is fixed. We then use this formulation for approximating Nash equilibria in path planning games, as well as to develop a multi-agent cooperative path planning formulation. Through several case studies, we show that in a path planning game, safety is often significantly compromised compared to a cooperative solution.

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

[2]  Lydia E. Kavraki,et al.  Path planning using lazy PRM , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[3]  Brian Goldiez,et al.  A Survey of Commercial & Open Source Unmanned Vehicle Simulators , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[4]  Steven M. LaValle,et al.  Quasi-randomized path planning , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[5]  Ronald C. Arkin,et al.  Motor Schema — Based Mobile Robot Navigation , 1989, Int. J. Robotics Res..

[6]  David Hsu,et al.  The bridge test for sampling narrow passages with probabilistic roadmap planners , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[7]  D. Schmeidler.  Equilibrium points of nonatomic games , 1973 .

[8]  Mathijs de Weerdt,et al.  A better-response strategy for self-interested planning agents , 2017, Applied Intelligence.

[9]  Mark H. Overmars,et al.  Eurographics/ACM SIGGRAPH Symposium on Computer Animation (2004) , 2022 .

[10]  Mark H. Overmars,et al.  Motion planning for camera movements , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[11]  Steven M. LaValle,et al.  Robot Motion Planning: A Game-Theoretic Foundation , 2000, Algorithmica.

[12]  Tim Roughgarden,et al.  How bad is selfish routing? , 2002, JACM.

[13]  Fritz Wysotzki,et al.  Risk-Sensitive Reinforcement Learning Applied to Control under Constraints , 2005, J. Artif. Intell. Res..

[14]  Manuela M. Veloso,et al.  Multiagent Systems: A Survey from a Machine Learning Perspective , 2000, Auton. Robots.

[15]  Pekka Isto,et al.  Constructing probabilistic roadmaps with powerful local planning and path optimization , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[16]  Mark H. Overmars,et al.  The Gaussian sampling strategy for probabilistic roadmap planners , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[17]  Mo Chen,et al.  A path defense approach to the multiplayer reach-avoid game , 2014, 53rd IEEE Conference on Decision and Control.

[18]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[19]  Lydia E. Kavraki,et al.  A framework for using the workspace medial axis in PRM planners , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[20]  Lydia E. Kavraki,et al.  Probabilistic roadmaps for path planning in high-dimensional configuration spaces , 1996, IEEE Trans. Robotics Autom..

[21]  Avinash C. Kak,et al.  Vision for Mobile Robot Navigation: A Survey , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[22]  Vijay Kumar,et al.  Aerial Robotics and the Quadrotor [From the Guest Editors] , 2012, IEEE Robotics Autom. Mag..

[23]  A. C. Pigou.  Economics of welfare , 1920 .

[24]  Mo Chen,et al.  Multiplayer reach-avoid games via low dimensional solutions and maximum matching , 2014, 2014 American Control Conference.

[25]  J. Wardrop.  ROAD PAPER. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH. , 1952 .

[26]  Michael Rovatsos,et al.  Scaling Up Multiagent Planning: A Best-Response Approach , 2011, ICAPS.

[27]  Hui X. Li,et al.  A probabilistic approach to optimal robust path planning with obstacles , 2006, 2006 American Control Conference.

[28]  C. B. Mcguire,et al.  Studies in the Economics of Transportation , 1958 .

[29]  Dietrich Braess,et al.  Über ein Paradoxon aus der Verkehrsplanung , 1968, Unternehmensforschung.

[30]  Nancy M. Amato,et al.  MAPRM: a probabilistic roadmap planner with sampling on the medial axis of the free space , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[31]  Mark H. Overmars,et al.  AUTOMATIC CONSTRUCTION OF ROADMAPS FOR PATH PLANNING IN GAMES , 2004 .

[32]  Dan Shen,et al.  A Game Theoretic Data Fusion Aided Path Planning Approach for Cooperative UAV ISR , 2008, 2008 IEEE Aerospace Conference.

[33]  Ricardo Carelli,et al.  Agricultural Robotics: Unmanned Robotic Service Units in Agricultural Tasks , 2013, IEEE Industrial Electronics Magazine.

[34]  Thierry Siméon,et al.  Visibility based probabilistic roadmaps , 1999, Proceedings 1999 IEEE/RSJ International Conference on Intelligent Robots and Systems. Human and Environment Friendly Robots with High Intelligence and Emotional Quotients (Cat. No.99CH36289).

[35]  Mark H. Overmars,et al.  Coordinated path planning for multiple robots , 1998, Robotics Auton. Syst..

[36]  Mark H. Overmars,et al.  Path Finding for the Animation of Walking Characters , 2005 .

[37]  Lydia E. Kavraki,et al.  Randomized preprocessing of configuration for fast path planning , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[38]  Eduardo Alonso Fernández,et al.  Rules of encounter: designing conventions for automated negotiation among computers , 1995 .

[39]  Manfred Morari,et al.  A tractable approximation of chance constrained stochastic MPC based on affine disturbance feedback , 2008, 2008 47th IEEE Conference on Decision and Control.

[40]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[41]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

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