An algorithm is described which finds a set of flyable, conflict-free trajectories for an aircraft which must fly through an environment containing obstacle aircraft whose trajectories are known. The algorithm makes systematic use of a maneuver generator and a conflict detector. The maneuver generator may embody a variety of aircraft behavior models which might, for example, take into account standard turn behavior and wind predictions. The conflict detector may embody a variety of defintions of what makes a trajectory unacceptable, and might, for example, take into account growing uncertainty in the future positions of aircraft. Correctness of solution trajectories is readily demonstrable. The algorithm is primarily intended for use in free-flight air traffic control simulations but might also be used in operational applications (ground or air-based) should conflict resolution assistance be required. In an automated simulation a solution trajectory can be chosen from the resulting set of conflict-free trajectories in accordance with optimization criteria. The algorithm may be used for prioritized planning of the motion of a number of aircraft. It may also be used to solve motion-planning problems in domains other than air traffic control.
Gears Conflict Resolution Algorithm
1997
54 pages
Report
Keine Angabe
Englisch
Air Transportation , Air traffic control , Congestion , Separation , Trajectory optimization , Flight paths , Routing , Airspace , Collision avoidance , Flight plans , Ground based control , Automated en route ATC , Free flight , Flight management systems , Conflict resolution , Algorithms , GEARS(Generic En-route Algorithmic Resolution Service) , Generic En-route Algorithmic Resolution Service , Foreign technology
The GEARS conflict resolution algorithm
AIAA | 1998
|The GEARS Conflict Resolution Algorithm
British Library Conference Proceedings | 1998
|