This paper introduces two algorithms which allocate optimal separated 3D-trajectories to the main traffic flows. The first approach is a 1 vs. n strategy which applies an A* algorithm iteratively to each flow. The second is a global approach using a genetic algorithm, applied to a population of trajectory sets. The algorithms are first tried on a toy problem, and then applied to real traffic data, using operational aircraft performances. The cumulated costs of the trajectory deviations are used to compare the two algorithms.
Separating air traffic flows by allocating 3D-trajectories
2004-01-01
775065 byte
Conference paper
Electronic Resource
English
Mining activity pattern trajectories and allocating activities in the network
Online Contents | 2015
|Mining activity pattern trajectories and allocating activities in the network
Online Contents | 2015
|A Reserve Capacity Model of Optimal Traffic Lane Allocating
British Library Conference Proceedings | 2009
|Fuel-Efficient Trajectories Traffic Synchronization
AIAA | 2018
|