Conflict Resolution and Traffic Complexity of Multiple Intersecting Flows of Aircraft

2009 IEEE/AIAA 28th Digital Avionics Systems Conference

et al. 2009

This paper presents a new methodology for rapidly generating complexity maps for various configurations taking into account the influence of some conflict avoidance algorithm at a pair-wise intersection level. The complexity maps are based on analytical expressions, validated through simulations, of the probability of conflict and the spatial distribution of aircraft. This "closed-loop" analysis explicitly considers the role of the conflict resolution algorithm, here the offset method. It gives therefore a more realistic image of the current and future health of the considered airspace as a function of the encounter and aircraft flows characteristics. Some results of the usual "open-loop" approach are also validated, while highlighting their limitations.

Section: Encounter Modeling and Conflict Avoidance Algorithmmentioning

confidence: 99%

Section: Encounter Modeling and Conflict Avoidance Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

A simplified approach to determine airspace complexity maps under automated conflict resolution

Salaün

Vela

2009 IEEE/AIAA 28th Digital Avionics Systems Conference

et al. 2009

“…To tackle this challenge, various algorithms have been proposed for conflict resolution, the core task of ATC [1]. Several recent algorithms [2]- [8] can already handle conflicts involving a large number of aircraft simultaneously. However, most of the existing algorithms are aimed at resolving conflicts locally.…”

Section: Introductionmentioning

confidence: 99%

Optimal configuration for intersecting flows of aircraft

Huang

2012 15th International IEEE Conference on Intelligent Transportation Systems

Mao

2012

This paper studies the configuration for intersecting flows of aircraft. Intersections of aircraft flows can be considered as basic building blocks for air traffic networks, and traffic networks can be designed through finding optimal arrangements of intersections whose conflict zones do not overlap. A conflict zone is defined as a minimal circular area centered at the intersection of two flows which allows aircraft approaching the intersections to resolve conflict completely within the conflict zone. This paper derives the relationship between the size of a conflict zone and the intersection angle of the two flows. Such a relationship guides to find an optimal configuration for intersecting aircraft flows. An example involving n converging flows of aircraft demonstrates the efficiency of the proposed configuration of intersections: the result of conflict resolution shows a greatly reduced traffic complexity compared with the solution derived from our previous study; the complexity metric is reduced from O(n 4 ) to O(n 2 ).

“…The process of control is typically through the use of surveillance radars, voice radio systems, limited computer support systems, and numerous complex procedures [1]. With current air traffic control techniques, increasing air traffic volume steadily increases complexity [2] and produces drawbacks such as: system bottlenecks, indirect routing, and lack of navigation freedom for airlines [3], [4], not to mention the increased workload of the ground controllers [5]. The Federal Aviation Administration (FAA) and airlines have proposed the concept of "Free Flight" [6] to eliminate restrictions imposed by the current system and allow for more navigation freedom as well as direct routing.…”

Section: Introductionmentioning

confidence: 99%

Stability of spatially distributed, intersecting aircraft flows under sequential conflict resolution schemes

Hand

Mao

Proceedings of the 2011 American Control Conference

2011

This paper discusses the effect of sequential conflict resolution maneuvers of an infinite aircraft flow through a finite control volume. Aircraft flow models are utilized to simulate traffic flows and determine stability. Pseudo-random flow geometry is considered to determine airspace stability in a more random airspace, where aircraft flows are spread over a given positive width. The use of this aircraft flow model generalizes the orthogonal flow geometry for arbitrary flow width. A set of upper bounds on the maximal aircraft deviation during conflict resolution is derived. Also with this flow geometry it is proven that these bounds are not symmetric, unlike the symmetric bounds derived in previous papers for simpler flow configurations (i.e. orthogonal flow geometry). Stability is preserved under sequential conflict resolution algorithms for all flow geometries discussed in this paper.