Fast Aircraft Separation Calculations for Gradient Based Optimization of Airspace Simulations

Simulations of airspace operational concepts can play a significant role in determining future paradigms that would allow for a safe increase in airspace density. In particular, airspace simulations which are capable of handling large numbers of aircraft act as an enabling capability for the testing of proposed airspace operational concepts. Simulations allowing for gradient based optimization methods are particularly attractive, since they would potentially allow for an efficient and empirical means to derive best operational practices. These could also allow for vehicle multidisciplinary design and optimization studies to include air traffic management considerations as a discipline. But any large scale simulation of airspace operations must include some methodology for addressing airspace separation requirements, which in the most direct sense would be tracked in a manner that computationally grows as a quadratic function of the number of simulated aircraft. Efficient indirect methods have been developed in certain contexts to address this limitation. However, any means of addressing separation requirements in a gradient based optimization context should be implemented by functions which provide analytic derivative information to maximize numerical precision and computational efficiency. In this paper, a fast and differentiable separation metric is described in application to gradient based optimization of airspace operations. Rather than computing the separation distance between every pair of aircraft in a simulation, this method effectively reduces the problem to a smaller relevant set using a geometric decomposition. This method guarantees that the smallest distance at all points in simulated time is determined exactly. When used in an optimization constraint context, this guarantees that a minimum separation is maintained between all pairs of aircraft. The presented metric has logarithmic computational growth with respect to the number of simulated aircraft, and is shown to perform well in a series of notional 2D airspace optimization problems when used to enforce specified airborne separation constraints. Results show that this is notably faster than a direct pairwise distance computing metric for optimizations involving both small and large numbers of aircraft, yet enforce separation requirements to the same tolerance. It is shown that this favorable scalability is an enabling capability for more sophisticated air traffic management conceptual studies.