Reachability-Based Safety and Goal Satisfaction of Unmanned Aerial Platoons on Air Highways

Abstract

Recently, there has been immense interest in using unmanned aerial vehicles (UAVs) for civilian operations. As a result, unmanned aerial systems traffic management is needed to ensure the safety and goal satisfaction of potentially thousands of UAVs flying simultaneously. Currently, the analysis of large multi-agent systems cannot tractably provide these guarantees if the agents' set of maneuvers is unrestricted. In this paper, platoons of UAVs flying on air highways is proposed to impose an airspace structure that allows for tractable analysis. For the air highway placement problem, the fast marching method is used to produce a sequence of air highways that minimizes the cost of flying from an origin to any destination. The placement of air highways can be updated in real-time to accommodate sudden airspace changes. Within platoons traveling on air highways, each vehicle is modeled as a hybrid system. Using Hamilton-Jacobi reachability, safety and goal satisfaction are guaranteed for all mode transitions. For a single altitude range, the proposed approach guarantees safety for one safety breach per vehicle, in the unlikely event of multiple safety breaches, safety can be guaranteed over multiple altitude ranges. We demonstrate the platooning concept through simulations of three representative scenarios.

American Institute of Aeronautics and Astronautics Journal of Guidance, Control, and Dynamics, January 30, 2017

References in corpus (2)

• Multiplayer Reach-Avoid Games via Pairwise Outcomes
• Exact and Efficient Hamilton-Jacobi-based Guaranteed Safety Analysis via System Decomposition

Cited by in corpus (14)

• Verification for Machine Learning, Autonomy, and Neural Networks Survey
• Autonomous Aerial Delivery Vehicles, a Survey of Techniques on how Aerial Package Delivery is Achieved
• Neural network architectures using min-plus algebra for solving certain high dimensional optimal control problems and Hamilton-Jacobi PDEs
• Connected and Automated Vehicle Platoon Formation Control via Differential Games
• Structured learning of safety guarantees for the control of uncertain dynamical systems
• Lax-Oleinik-type formulas and efficient algorithms for certain high-dimensional optimal control problems
• A Computationally Efficient Hamilton-Jacobi-based Formula for State-Constrained Optimal Control Problems
• A Hamilton-Jacobi-Bellman Approach to Ellipsoidal Approximations of Reachable Sets for Linear Time-Varying Systems
• Modeling Cyber-Physical Human Systems via an Interplay Between Reinforcement Learning and Game Theory
• TTR-Based Reward for Reinforcement Learning with Implicit Model Priors
• On Infusing Reachability-Based Safety Assurance within Planning Frameworks for Human-Robot Vehicle Interactions
• Hopf-type representation formulas and efficient algorithms for certain high-dimensional optimal control problems
• Guaranteed-Safe Approximate Reachability via State Dependency-Based Decomposition
• Probabilistic Reach-Avoid Reachability in Nondeterministic Systems with Time-VaryingTargets and Obstacles