Airborne Conflict Resolution for Flow-Restricted Transition Airspace

Mondoloni, Stéphane; Ballin, Mark G.; Palmer, Michael T.

doi:10.2514/6.2003-6725

Cited by 8 publications

(3 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some of these methods include tactical approaches focusing on resolving immediate conflicts, with limited consideration of future postconflict routing and planning. Most of the methods are designed for enroute sectors and based on Optimization approaches to treat the CD&CR problem such as; Genetic Algorithms as in [20] where autonomous aircraft are enable to maneuver freely while maintaining separation assurance from traffic and area hazards; Other CR algorithm, which uses a combination of patternbased maneuvers and Genetic Algorithms to achieve resolution, is presented in [24]; The Ant Colony Optimization (ACO) algorithm has also been applied to solve problems involving autonomous aircraft by applying the path planning problem, [8]; or The developed a mathematical model is formulated as a mixed integer linear program in [23] using concepts based on speed control and flight-level assignments for conflict resolution over predefined routes; other approach applying Linear Programming is [21] where a system of multiple aircraft is deconflicted by applying the path planning problem among given waypoints. Semi-definite Programming is utilized in [11] where each aircraft proposes its desired heading while a centralized air traffic control authority resolves any conflict arising between aircraft.…”

Section: Previous Related Workmentioning

confidence: 99%

Integrating and sequencing flows in terminal maneuvering area by evolutionary algorithms

Zúñiga

Delahaye²,

Piera³

2011

2011 IEEE/AIAA 30th Digital Avionics Systems Conference

View full text Add to dashboard Cite

This paper presents a new approach for merging multiple aircraft flows in a Terminal Maneuvering Area (TMA). This work is motivated by the current overloaded airspace near large airports and the need of more efficient methods to help controllers. Some attempts to alleviate airspace congestion such as the minimum spacing requirements, negotiation of voluntary reductions in scheduled service, and the construction of additional runways at major airports have been done. Even though, more fundamental changes are needed to improve the use of available air capacity. Present research consists of a new approach to optimize a set of aircraft planned to land at a given airport; it is proposed to merge the incoming flows from different routes by mean of speed and path changes. Due to the high combinatoric induced by such a problem, a stochastic optimization algorithm has been developed in order to propose to each aircraft a new route and speed profile. Those changes aim to remove conflicts at merging points and to maintain separation of aircraft following the same route link according to their wake turbulence constraint. The optimization criteria is based on the minimum deviation from the initial path planning. This algorithm has been successfully applied to Gran Canaria airport in Spain with real traffic demand samples for which conflict free flow merging is produced smoothly with optimal runway feeding.

show abstract

Section: Previous Related Workmentioning

confidence: 99%

Integrating and sequencing flows in terminal maneuvering area by evolutionary algorithms

Zúñiga

Delahaye²,

Piera³

2011

2011 IEEE/AIAA 30th Digital Avionics Systems Conference

View full text Add to dashboard Cite

show abstract

“…A LOS is defined as an event in which the distance between the two aircraft becomes less than 5 nautical miles laterally and 1,000 feet vertically. Many conflict detection and resolution algorithms have been developed with approaches that range from genetic algorithms 2,3 to programming models 4,5 to force fields 6,7 and air traffic control heuristics 7 . One automated capability that is currently being tested and used for large-scale simulations is the Autoresolver, developed by the National Aeronautics and Space Administration (NASA) 9,10 .…”

Section: Introductionmentioning

confidence: 99%

A Study of Conflict Resolution Timeliness and Impact of Horizontal Maneuver Parametric Settings

Pankok

Santiago

2013

2013 Aviation Technology, Integration, and Operations Conference

View full text Add to dashboard Cite

The tradeoff between efficiency and trajectory uncertainty is considered when evaluating how early to initiate a conflict resolution maneuver. Four fast-time simulations are conducted employing a well-established prototype conflict detection and resolution algorithm to quantify the fuel and delay penalties associated with deferring resolution maneuvers in order to increase confidence in the conflict prediction. Additionally, the effects of using finer resolution when selecting conflictresolution heading maneuvers are evaluated. Results indicate that early initiation of resolution maneuvers reduces airborne delay and fuel consumption, but only slightly. This finding suggests that it may be operationally desirable to forgo the modest delay and fuel benefits associated with earlier maneuvers in order to buy down the uncertainty that is inherent in trajectory predictions with longer time horizons.

show abstract

“…The literature has subsequently expanded to include approaches based on genetic algorithms [6][7][8] and arrivaltime constraints.…”

Section: Introductionmentioning

confidence: 99%

Route planner for unmanned aerial system insertion in civil non-segregated airspace

Persiani

Bagassi

2012

Proceedings of the Institution of Mechanical Engineers, Part G:

View full text Add to dashboard Cite

One of the most interesting challenges of the next few years will be airspace system automation. This process will involve different aspects such as air traffic management, aircraft and airport operations and guidance and navigation systems. The use of unmanned aerial systems for civil missions will be one of the most important steps in this automation process. In this article, an air traffic management oriented conflict detection & resolution algorithm that models air traffic management operative technique as avoidance manoeuvres in order to self-separate the unmanned aerial vehicle from piloted air traffic is presented. As a first step, a geometric analysis identifies all possible unmanned aerial vehicle routes among the mission targets and related potential conflicts with piloted air traffic. For each potential conflict, air traffic management operative techniques are used to model different options of conflict resolution: vertical and horizontal avoidance, speed regulation, holding patterns and rerouting. The performances of a reference unmanned aerial vehicle are used to estimate the cost of each possible sub-route and, in case of conflict, the cost of each possible avoidance manoeuvre. In this way, the unmanned aerial vehicle mission is modelled as a combinatorial optimization problem that concerns the sequencing of both targets and conflict resolution options. As output, a conflict free route that minimizes the air traffic impact over the mission is provided. Simulation results over real air traffic data show how this approach could be useful for future common management of piloted and non-piloted air traffic.

show abstract

Airborne Conflict Resolution for Flow-Restricted Transition Airspace

Cited by 8 publications

References 7 publications

Integrating and sequencing flows in terminal maneuvering area by evolutionary algorithms

Integrating and sequencing flows in terminal maneuvering area by evolutionary algorithms

A Study of Conflict Resolution Timeliness and Impact of Horizontal Maneuver Parametric Settings

Route planner for unmanned aerial system insertion in civil non-segregated airspace

Contact Info

Product

Resources

About