Traffic Network Identification Using Trajectory Intersection Clustering

Abstract

The current airspace route system consists mainly of pre-defined routes with a low number of intersections to facilitate air traffic controllers to oversee the traffic. Our aim is a method to create an artificial and reliable route network based on planned or as-flown trajectories. The application possibilities of the resulting network are manifold, reaching from the assessment of new air traffic management (ATM) strategies or historical data to a basis for simulation systems. Trajectories are defined as sequences of common points at intersections with other trajectories. All common points of a traffic sample are clustered, and, after further optimization, the cluster centers are used as nodes in the new main-flow network. To build almost-realistic flight trajectories based on this network, additional parameters such as speed and altitude are added to the nodes and the possibility to take detours into account to avoid congested areas is introduced. As optimization criteria, the trajectory length and the structural complexity of the main-flow system are used. Based on these criteria, we develop a new cost function for the optimization process. In addition, we show how different traffic situations are covered by the network. To illustrate the capabilities of our approach, traffic is exemplarily divided into separate classes and class-dependent parameters are assigned. Applied to two real traffic scenarios, the approach was able to emulate the underlying route systems with a difference in median trajectory length of 0.2%, resp. 0.5% compared to the original routes.

Keywords

• trajectory clustering
• air traffic simulation
• DBSCAN
• airspace route network
• common points