Conflict Detection and Resolution for Free Flight

Krozel, Jimmy; Peters, Mark

doi:10.2514/atcq.5.3.181

Cited by 74 publications

(73 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then, a new protocol for exact and inexact conflicts can be obtained from equation (9) with the new safety distance in equation (25). For example, if we consider a B747 cruising with M=8 at 40, 000ft altitude and the maximum allowable time discrepancy both at a resolution starting point and at a new waypoint is τ 1 = 10sec and τ 2 = 10sec respectively, then a new safety distance is R saf e = 7.53nm.…”

Section: Robustness Analysis With Respect To Asynchronous Maneuversmentioning

confidence: 99%

“…Several recent papers have focused on solving CD&R problems [4,13,20,24,31,26,33,25,27,14,21,16,10,6,29,2,34,3,7,23,18,11,39,1,12,9,15,8,36,37]. In a recent comprehensive survey, Kuchar and Yang [26] consider the problems of conflict detection and resolution separately; we focus on conflict resolution in this paper.…”

Section: Introductionmentioning

confidence: 99%

“…First, optimized conflict resolution produces a resolution maneuver which minimizes a given cost, a function of deviation from the original trajectory, flight time, fuel consumption, or energy. [33,25,27,13,14,21,16,10,6,20,29,2,15,1]. Menon et al [29] consider conflict resolution as a multi-participant optimal control problem, which they solve using parameter optimization and state-constrained trajectory optimization.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Protocol-Based Conflict Resolution for Air Traffic Control

Hwang

Kim

Tomlin

2007

Air Traffic Control Quarterly

View full text Add to dashboard Cite

This paper proposes a method for multiple-aircraft conflict avoidance. We assume that aircraft cruise at constant altitude with varying velocities and that conflicts are resolved in the horizontal plane using heading change, velocity change, or a combination thereof. We assume that each aircraft's position, heading, and velocity are available to all aircraft involved in the conflict, we constrain the maneuver to be two straight paths of equal length, and we assume that all aircraft initiate conflict resolution maneuvers at the same time and that once an aircraft has initiated a maneuver, its velocity along the maneuver remains constant. Our multiple-aircraft conflict resolution methodology is presented in two steps; first, we consider an unrealistic but geometrically simple exact conflict, in which the original trajectories of all aircraft collide at a point, in order to derive a closed-form analytic solution for the required heading change, and then we consider a realistic inexact conflict, in which conflict points of multiple aircraft do not coincide. Heading change is a main control input for conflict resolution, yet velocity change is also used for an inexact conflict. We then construct a finite partition of the airspace around the conflict, and using our analytic solution, we derive a protocol for resolving the worst-case conflict within each partition. The result is a multiple-aircraft conflict resolution protocol, or a simple rule which is easily understandable and

show abstract

Section: Robustness Analysis With Respect To Asynchronous Maneuversmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Protocol-Based Conflict Resolution for Air Traffic Control

Hwang

Kim

Tomlin

2007

Air Traffic Control Quarterly

View full text Add to dashboard Cite

show abstract

“…Typically, conflicts are resolved by resorting to three different actions: turn, climb/descend, and accelerate/decelerate, which affect the aircraft heading, altitude, and speed, respectively. Resolution strategies adopting one of these actions or a combination of them are analyzed and compared in terms of cost and efficacy in 16 . It is found that climb/descend is the most efficient action for resolving short-term conflicts, since the horizontal separation requirement is much more stringent than the vertical one.…”

Section: Introductionmentioning

confidence: 99%

Optimal Coordinated Maneuvers for Three-Dimensional Aircraft Conflict Resolution

Prandini

Sastry

2002

Journal of Guidance, Control, and Dynamics

129

View full text Add to dashboard Cite

In this paper, we study the problem of designing optimal coordinated maneuvers for multiple aircraft conflict resolution. We propose an energy function to select among all the conflict-free maneuvers the optimal one. The introduced cost function incorporates a priority mechanism that favors those maneuvers where aircraft with lower priority assume more responsibility in resolving the predicted conflicts. The energy-minimizing resolution maneuvers may involve changes of heading and speed, as well as of altitude. However, vertical maneuvers are penalized with respect to horizontal ones for the sake of passenger comfort. A geometric construction and a numerical algorithm for computing the optimal resolution maneuvers are given in the two aircraft case. As for the multiaircraft case, an approximation scheme is proposed to compute a suboptimal two-legged solution. Extensive examples are presented to illustrate the effectiveness of the proposed algorithms.

show abstract

“…Related Work: There has been considerable previous work on conflict prediction and resolution; we do not attempt to survey it here, but refer the reader to the recent report of Krozel, Peters, and Hunter [19]. Briefly, we refer to the work of Cross [7] and Davis [8], who considered knowledge-based system approaches, the work of Eby [10], who considered a potential fields method of resolution, the work of Wangermann and Stengel [29], who considered agent-based and principled negotiation methods, and the work of Krozel, Mueller, and Hunter [18], who used optimal control theory to devise tactical alert zones to identify control strategies to prevent conflicts.…”

Section: Introductionmentioning

confidence: 99%

Geometric algorithms for conflict detection/resolution in air traffic management

Chiang

Klosowski

Lee

et al.

Proceedings of the 36th IEEE Conference on Decision and Control

View full text Add to dashboard Cite

We consider the problems of conflict detection and resolution in air traffic management (ATM) from the perspective of computational geometry and give algorithms for solving these problems efficiently. For conflict resolution, we propose a simple method that can route multiple aircraft, conflict-free, through a cluttered airspace, using a prioritized routing scheme in space-time. Our algorithms have been implemented into a simulation system that tracks a large set of flights, having multiple conflicts, and proposes modified routes to resolve them. We report on the preliminary results from an extensive set of experiments that are under way to determine the effectiveness of our methods.

show abstract

Conflict Detection and Resolution for Free Flight

Cited by 74 publications

References 8 publications

Protocol-Based Conflict Resolution for Air Traffic Control

Protocol-Based Conflict Resolution for Air Traffic Control

Optimal Coordinated Maneuvers for Three-Dimensional Aircraft Conflict Resolution

Geometric algorithms for conflict detection/resolution in air traffic management

Contact Info

Product

Resources

About