Back to the Future: Efficient, Time-Consistent Solutions in Reach-Avoid Games

We study the class of reach-avoid dynamic games in which multiple agents interact noncooperatively, and each wishes to satisfy a distinct target condition while avoiding a failure condition. Reach-avoid games are commonly used to express safety-critical optimal control problems found in mobile robot motion planning. While a wide variety of approaches exist for these motion planning problems, we focus on finding time-consistent solutions, in which planned future motion is still optimal despite prior suboptimal actions. Though abstract, time consistency encapsulates an extremely desirable property: namely, time-consistent motion plans remain optimal even when a robot’s motion diverges from the plan early on due to, e.g., intrinsic dynamic uncertainty or extrinsic environment disturbances. Our main contribution is a computationally-efficient algorithm for multi-agent reach-avoid games which renders time-consistent solutions. We demonstrate our approach in twoand three-player simulated driving scenarios, in which our method provides safe control strategies for all agents.

[1]  Alberto Bemporad,et al.  Predictive Control for Linear and Hybrid Systems , 2017 .

[2]  Hasnaa Zidani,et al.  Reachability and Minimal Times for State Constrained Nonlinear Problems without Any Controllability Assumption , 2010, SIAM J. Control. Optim..

[3]  S. Sastry.  Nonlinear Systems: Analysis, Stability, and Control , 1999 .

[4]  Bowen Alpern,et al.  Defining Liveness , 1984, Inf. Process. Lett..

[5]  D K Smith,et al.  Numerical Optimization , 2001, J. Oper. Res. Soc..

[6]  Ian M. Mitchell.  The Flexible, Extensible and Efficient Toolbox of Level Set Methods , 2008, J. Sci. Comput..

[7]  E. Todorov,et al.  A generalized iterative LQG method for locally-optimal feedback control of constrained nonlinear stochastic systems , 2005, Proceedings of the 2005, American Control Conference, 2005..

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

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

[10]  David Fridovich-Keil,et al.  Encoding Defensive Driving as a Dynamic Nash Game , 2020, 2021 IEEE International Conference on Robotics and Automation (ICRA).

[11]  Andrew G. Lamperski,et al.  Newton’s Method and Differential Dynamic Programming for Unconstrained Nonlinear Dynamic Games , 2019, 2019 IEEE 58th Conference on Decision and Control (CDC).

[12]  Jur P. van den Berg,et al.  Iterated LQR smoothing for locally-optimal feedback control of systems with non-linear dynamics and non-quadratic cost , 2014, 2014 American Control Conference.

[13]  David Fridovich-Keil,et al.  Approximate Solutions to a Class of Reachability Games , 2020, ArXiv.

[14]  Emanuel Todorov,et al.  Convex and analytically-invertible dynamics with contacts and constraints: Theory and implementation in MuJoCo , 2014, 2014 IEEE International Conference on Robotics and Automation (ICRA).

[15]  S. Shankar Sastry,et al.  On the Characterization of Local Nash Equilibria in Continuous Games , 2014, IEEE Transactions on Automatic Control.

[16]  David Fridovich-Keil,et al.  The Computation of Approximate Generalized Feedback Nash Equilibria , 2021, ArXiv.

[17]  Emilio Frazzoli,et al.  Sampling-based algorithms for optimal motion planning , 2011, Int. J. Robotics Res..

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

[19]  David Q. Mayne,et al.  Differential dynamic programming , 1972, The Mathematical Gazette.

[20]  Mo Chen,et al.  Reach-avoid problems with time-varying dynamics, targets and constraints , 2014, HSCC.

[21]  Anca D. Dragan,et al.  Efficient Iterative Linear-Quadratic Approximations for Nonlinear Multi-Player General-Sum Differential Games , 2019, 2020 IEEE International Conference on Robotics and Automation (ICRA).

[22]  P. Souganidis,et al.  Differential Games and Representation Formulas for Solutions of Hamilton-Jacobi-Isaacs Equations. , 1983 .

[23]  P. Schrimpf,et al.  Dynamic Programming , 2011 .