Safe sequential path planning of multi-vehicle systems via double-obstacle Hamilton-Jacobi-Isaacs variational inequality

We consider the problem of planning trajectories for a group of N vehicles, each aiming to reach its own target set while avoiding danger zones of other vehicles. The analysis of problems like this is extremely important practically, especially given the growing interest in utilizing unmanned aircraft systems for civil purposes. The direct solution of this problem by solving a single-obstacle Hamilton-Jacobi-Isaacs (HJI) variational inequality (VI) is numerically intractable due to the exponential scaling of computation complexity with problem dimensionality. Furthermore, the single-obstacle HJI VI cannot directly handle situations in which vehicles do not have a common scheduled arrival time. Instead, we perform sequential path planning by considering vehicles in order of priority, modeling higher-priority vehicles as time-varying obstacles for lower-priority vehicles. To do this, we solve a double-obstacle HJI VI which allows us to obtain the reach-avoid set, defined as the set of states from which a vehicle can reach its target while staying within a time-varying state constraint set. From the solution of the double-obstacle HJI VI, we can also extract the latest start time and the optimal control for each vehicle. This is a first application of the double-obstacle HJI VI which can handle systems with time-varying dynamics, target sets, and state constraint sets, and results in computation complexity that scales linearly, as opposed to exponentially, with the number of vehicles in consideration.

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

[2]  Juan Manuel de la Fuente Sabaté,et al.  Amazon.com, Inc. , 2002 .

[3]  Richard M. Murray,et al.  DISTRIBUTED COOPERATIVE CONTROL OF MULTIPLE VEHICLE FORMATIONS USING STRUCTURAL POTENTIAL FUNCTIONS , 2002 .

[4]  E. Barron Differential games maximum cost , 1990 .

[5]  Paolo Fiorini,et al.  Motion Planning in Dynamic Environments Using Velocity Obstacles , 1998, Int. J. Robotics Res..

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

[7]  Wang Hai-bing,et al.  High-order essentially non-oscillatory schemes for Hamilton-Jacobi equations , 2006 .

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

[9]  John Lygeros,et al.  Hamilton–Jacobi Formulation for Reach–Avoid Differential Games , 2009, IEEE Transactions on Automatic Control.

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

[11]  S. Osher,et al.  Efficient implementation of essentially non-oscillatory shock-capturing schemes,II , 1989 .

[12]  Wesley M. DeBusk Unmanned Aerial Vehicle Systems for Disaster Relief: Tornado Alley , 2009 .

[13]  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.

[14]  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.

[15]  Andrea L. Bertozzi,et al.  Multi-Vehicle Flocking: Scalability of Cooperative Control Algorithms using Pairwise Potentials , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[16]  O. Bokanowski,et al.  Minimal Time Problems with Moving Targets and Obstacles , 2011 .

[17]  Dinesh Manocha,et al.  Reciprocal Velocity Obstacles for real-time multi-agent navigation , 2008, 2008 IEEE International Conference on Robotics and Automation.

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

[19]  E. Barron,et al.  The Bellman equation for minimizing the maximum cost , 1989 .

[20]  John Lygeros,et al.  Toward 4-D Trajectory Management in Air Traffic Control: A Study Based on Monte Carlo Simulation and Reachability Analysis , 2013, IEEE Transactions on Control Systems Technology.

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

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

[23]  S. Osher,et al.  High-order essentially nonsocillatory schemes for Hamilton-Jacobi equations , 1990 .

[24]  Mike M. Paglione,et al.  GENERIC METRICS FOR THE ESTIMATION OF THE PREDICTION ACCURACY OF AIRCRAFT TO AIRCRAFT CONFLICTS BY A STRATEGIC CONFLICT PROBE TOOL. , 1999 .

[25]  P. Lions,et al.  Some Properties of Viscosity Solutions of Hamilton-Jacobi Equations. , 1984 .

[26]  E. Coddington,et al.  Theory of Ordinary Differential Equations , 1955 .

[27]  Joint Planning,et al.  Unmanned Aircraft Systems (UAS) Comprehensive Plan: A Report on the Nation's UAS Path Forward , 2013 .

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

[29]  S. Shankar Sastry,et al.  Reachability calculations for automated aerial refueling , 2008, 2008 47th IEEE Conference on Decision and Control.