美国数学建模竞赛特等奖论文——2000 A O Air Traffic Control【数学建模】.pdfVIP

Air Traffic Control 241 Air Traffic Control Samuel Westmoreland Malone Jeffrey Abraham Mermin Daniel Bertrand Neill Duke University Durham, NC Advisor: David P. Kraines Introduction We propose five models. Each gives a metric for measuring eventual dan- ger and a threshold such that controller intervention becomes necessary. An immediate danger metric prioritizes problems for a controller. We test the models on several different sample cases. The Close-Approach model matches most closely our intuitive understanding of the situations. We present an algorithm that models the decision process of a controller detecting and solving conflicts. The time-complexity of scanning for potential conflicts varies quadratically with the number of airplanes, though this could be reduced by clustering the airplanes by proximity. We argue that conflict resolution for a cluster of n airplanes is an NP-complete problem with worst- n(n+1)/2 case complexity 2 . Assumptions and Hypotheses • A near mid-air collision (sometimes called a near miss) is defined by the FAA as an incident in which two airplanes pass within 500 ft of each other [Federal Aviation Administration 2000]. 3 • The airspace can be represented by a convex subset of R . • Air-traffic controllers have established protocols to prevent airplanes from colliding when crossing airspace boundaries in opposite directions. • We know the position and velocity of every airplane in the airspace, with negligible error. c The UMAP Journal 21 (3) (2000) 241–256. Copyright 2000 by COMAP, Inc. All rights reserved. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee pro