Strategic conflict detection and resolution for free flight

Krozel, Jimmy; Peters, Mark

doi:10.1109/cdc.1997.657844

Cited by 69 publications

(35 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Let the relative velocity be given byv r =v A −v B and the angle betweenr 0 andv r by φ. Then the distance and time of closest approach between A and B can be calculated using the relations derived in [38]. The time of closest approach is given by…”

Section: A Velocity Constraint For Paired Mergesmentioning

confidence: 99%

Hybrid Communication Protocols and Control Algorithms for NextGen Aircraft Arrivals

Park

Khadilkar

Balakrishnan

et al. 2014

IEEE Trans. Intell. Transport. Syst.

View full text Add to dashboard Cite

Abstract-Capacity constraints imposed by current air traffic management technologies and protocols could severely limit the performance of the Next Generation Air Transportation System (NextGen). A fundamental design decision in the development of this system is the level of decentralization that balances system safety and efficiency. A new surveillance technology called Automatic Dependent Surveillance-Broadcast (ADS-B) can potentially be used to shift air traffic control to a more distributed architecture; however, channel variations and interference with existing secondary radar replies can affect ADS-B systems. This paper presents a framework for managing arrivals at an airport using a hybrid centralized/distributed algorithm for communication and control. The algorithm combines centralized control in congested regions with distributed control in lower traffic density regions. The hybrid algorithm is evaluated through realistic simulations of operations around a major airport. The proposed strategy is shown to significantly improve air traffic control performance under various operating conditions, by adapting to the underlying communication, navigation and surveillance systems. The performance of the proposed strategy is found to be comparable to fully centralized strategies, despite requiring significantly less ground infrastructure.

show abstract

Section: A Velocity Constraint For Paired Mergesmentioning

confidence: 99%

Hybrid Communication Protocols and Control Algorithms for NextGen Aircraft Arrivals

Park

Khadilkar

Balakrishnan

et al. 2014

IEEE Trans. Intell. Transport. Syst.

View full text Add to dashboard Cite

show abstract

“…(18) and (19) to prevent spacecraft jet plumes impinging on other spacecraft. Three identical spacecraft of mass 30 kg are separated along a line in-track.…”

Section: B Multiple-satellite Plume Impingement Avoidancementioning

confidence: 99%

“…For example, randomized searches 17 were developed to nd feasible paths through elds of obstacles rapidly. In reactive schemes, 18 vehicles y a nominal trajectory and perform predetermined evasive maneuvers when con icts are detected. For aircraft, the path-planning problem can be reduced to a single heading change decision, 19 which greatly simpli es the global trajectory optimization.…”

Section: A Collision Avoidancementioning

confidence: 99%

Spacecraft Trajectory Planning with Avoidance Constraints Using Mixed-Integer Linear Programming

Richards

Schouwenaars

How

et al. 2002

Journal of Guidance, Control, and Dynamics

437

248

View full text Add to dashboard Cite

A method for nding fuel-optimal trajectories for spacecraft subjected to avoidance requirements is introduced. These include avoidance of collisions with obstacles or other vehicles and prevention of thruster plumes from one spacecraft impinging on another spacecraft. The necessary logical constraints for avoidance are appended to a fuel-optimizing linear program by including binary variables in the optimization. The resulting problem is a mixedinteger linear program (MILP) that can be solved using available software. The logical constraints can also be used to express the con guration requirements for maneuvers where only the nal relative alignment of the vehicles is important and the assignment of spacecraft within the eet is not speci ed. The collision avoidance, trajectory optimization, and eet assignment problems can be combined into a single MILP to obtain the optimal solution for these maneuvers. The MILP problem formulation, including these various avoidance constraints, is presented, and then several examples of their application to spacecraft maneuvers, including recon guration of a satellite formation and close inspection of the International Space Station by a microsatellite, are shown. These examples clearly show that the trajectory design methods presented are particularly well suited to proposed formation ying missions that involve multiple vehicles operating in close proximity. Nomenclature

show abstract

“…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%

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

Strategic conflict detection and resolution for free flight

Cited by 69 publications

References 7 publications

Hybrid Communication Protocols and Control Algorithms for NextGen Aircraft Arrivals

Hybrid Communication Protocols and Control Algorithms for NextGen Aircraft Arrivals

Spacecraft Trajectory Planning with Avoidance Constraints Using Mixed-Integer Linear Programming

Protocol-Based Conflict Resolution for Air Traffic Control

Contact Info

Product

Resources

About