A path defense approach to the multiplayer reach-avoid game

We consider a multiplayer reach-avoid game played between N attackers and N defenders moving with simple dynamics on a general two-dimensional domain. The attackers attempt to win the game by sending at least M of them (1 ≤ M ≤ N) to a target location while the defenders try to prevent the attackers from doing so by capturing them. The analysis of this game plays an important role in collision avoidance, motion planning, and aircraft control, among other applications involving cooperative agents. The high dimensionality of the game makes computing an optimal solution for either side intractable when N > 1. The solution is difficult even when N = 1. To address this issue, we present an efficient, approximate solution to the 1 vs. 1 problem. We call the approximate solution the “path defense solution”, which is conservative towards the defenders. This serves as a building block for an approximate solution of the multiplayer game. Compared to the classical Hamilton-Jacobi-Isaacs approach for solving the 1 vs. 1 game, our new method is orders of magnitude faster, and scales much better with the number of players.

[1]  Raffaello D'Andrea,et al.  A decomposition approach to multi-vehicle cooperative control , 2005, Robotics Auton. Syst..

[2]  Alexandre M. Bayen,et al.  A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games , 2005, IEEE Transactions on Automatic Control.

[3]  Claire J. Tomlin,et al.  A differential game approach to planning in adversarial scenarios: A case study on capture-the-flag , 2011, 2011 IEEE International Conference on Robotics and Automation.

[4]  Georgios C. Chasparis,et al.  Linear-programming-based multi-vehicle path planning with adversaries , 2005, Proceedings of the 2005, American Control Conference, 2005..

[5]  Ian M. Mitchell,et al.  A Toolbox of Level Set Methods , 2005 .

[6]  Hiroshi Furukawa,et al.  A flexible delegation-type interface enhances system performance in human supervision of multiple robots: empirical studies with RoboFlag , 2005, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

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

[8]  J A Sethian,et al.  A fast marching level set method for monotonically advancing fronts. , 1996, Proceedings of the National Academy of Sciences of the United States of America.

[9]  P. Varaiya,et al.  Differential games , 1971 .

[10]  Zhengyuan Zhou,et al.  A general, open-loop formulation for reach-avoid games , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[11]  Wojciech Rytter,et al.  Fast parallel algorithms for graph matching problems , 1998 .

[12]  R. D'Andrea,et al.  The RoboFlag testbed , 2003, Proceedings of the 2003 American Control Conference, 2003..

[13]  Nicholas Roy,et al.  Air-Combat Strategy Using Approximate Dynamic Programming , 2008 .

[14]  Richard M. Murray,et al.  Vehicle motion planning using stream functions , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

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

[16]  Heinz Erzberger,et al.  Automated Conflict Resolution For Air Traffic Control , 2005 .

[17]  J. Glinsky,et al.  The general. , 1982, Nursing.

[18]  Ronald Fedkiw,et al.  Level set methods and dynamic implicit surfaces , 2002, Applied mathematical sciences.

[19]  R. D'Andrea,et al.  RoboFlag games using systems based, hierarchical control , 2003, Proceedings of the 2003 American Control Conference, 2003..

[20]  J. Sprinkle,et al.  Encoding aerial pursuit/evasion games with fixed wing aircraft into a nonlinear model predictive tracking controller , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).