Abstract:
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. 1 Introduction The FAA is considering a shift from the current air traffic control (ATC) system to a new system of air traffic management (ATM) based on a policy known as "Free Flight" [11]. In the current ATC system, flight paths require aircraft to travel set route segments, flight corridors in the "hig...
Citations
|
1481
|
Computational Geometry: An introduction
– Preparata, Shamos
- 1985
|
|
603
|
Computational Geometry: Algorithms and Applications
– Berg, Kreveld, et al.
- 1997
|
|
409
|
Computational Geometry in C
– O’Rourke
- 1998
|
|
310
|
Davenport-Schinzel Sequences and Their Geometric Applications
– Sharir, Agarwal
- 1995
|
|
276
|
Spatial Tessellations: Concepts and Applications of Voronoi Diagrams
– Okabe, Boots, et al.
- 1992
|
|
262
|
Computational Geometry: An Introduction Through Randomized Algorithms
– Mulmuley
- 1994
|
|
176
|
Efficient collision detection using bounding volume hierarchies of k-DOPs
– Klosowski, Held, et al.
- 1997
|
|
154
|
Voronoi diagrams and Delaunay triangulations. In Handbook of discrete and computational geometry
– Fortune
- 1997
|
|
89
|
Motion planning in the presence of moving obstacles
– Reif, Sharir
- 1985
|
|
71
|
An O(nlog n) algorithm for the allnearest-neighbors problem
– Vaidya
- 1989
|
|
43
|
Proximity problems on moving points
– BASCH, GUIBAS, et al.
- 1997
|
|
36
|
Voronoi diagrams of moving points in the plane
– Guibas, Mitchell, et al.
- 1991
|
|
27
|
Voronoi diagrams of moving points
– Albers, Guibas, et al.
- 1997
|
|
21
|
Voronoi diagrams of moving points in the plane
– Fu, Lee
- 1991
|
|
20
|
A practical evaluation of kinetic data structures
– Basch, Guibas, et al.
- 1997
|
|
19
|
A Self-Organizational Approach for Resolving Air Traffic Conflicts
– Eby
- 1994
|
|
17
|
Voronoi diagrams over dynamic scenes
– Roos
- 1993
|
|
15
|
Free flight conflict detection and resolution analysis
– Krozel, Mueller, et al.
- 1996
|
|
14
|
On maximum flows in polyhedral domains
– Mitchell
- 1990
|
|
10
|
Planning a timeminimal motion among moving obstacles
– Fujimura, Samet
- 1993
|
|
10
|
Principled negotiation between intelligent agents: A model for air traffic management
– Wangermann, Stengel
- 1994
|
|
5
|
Planar conflict resolution for air traffic control
– Chen, Hsieh, et al.
- 1990
|
|
5
|
Network routing models applied to aircraft routing problems
– Chen, Holle, et al.
- 1995
|
|
5
|
Conflict detection and resolution for future air transportation management
– Krozel, Peters, et al.
- 1997
|
|
4
|
Qualitative Reasoning in an Expert System Framework
– Cross
- 1983
|
|
3
|
Conflict resolution, one-shot problem, and air traffic control
– Inselberg
- 1989
|
|
2
|
AERA2 APR knowledge base
– Davis
- 1992
|
|
1
|
Data p. 6 for mobile data
– Basch, Guibas, et al.
- 1997
|