【全集】2000 MCM A 空间交通管制 特等奖论文 教程

huashi3483

Problem A: Air traffic Control
$ D# n! U7 q% H8 Z" aTo improve safety and reduce air traffic controller workload, the Federal Aviation Agency (FAA) is considering adding software to the air traffic control system that would automatically detect potential aircraft flight path conflicts and alert the controller. To that end, an analyst at the FAA 　r traffic control system that would automatically detect potential aircraft flight path conflicts and alert the controller. To that end, an analyst at the FAA 　has posed the following problems
, j7 e5 D5 {8 g9 ERequirement A: Given two airplanes flying in space, when should the air traffic controller 　ld the air traffic controllerconsider the objects to be too close and to require intervention?
5 z& B' {& ~- F8 U& L3 a, t, R4 x　 Requirement B: An airspace sector is the section of three-dimensional airspace that one air 　Requirement B: An airspace sector is the section of three-dimensional airspace that one air 　 traffic controller controls. Given any airspace sector, how we measure how complex it is from an air traffic workload perspective? To what extent is complexity determined by the number of 　 we measure how complex it is from an air traffic workload perspective? To what extent is complexity determined by the number of 　aircraft simultaneously passing through that sector (1) at any one instant? (2) during any given interval of time?(3) durina particular time of day? How does the number of potential conflicts arising during those periods affect complexity?
Does the presence of additional software tools to automatically predict conflicts and alert the controller reduce or add to this complexity?
7 O. p& X2 b' Z7 \8 W. u; r* `$ iIn addition to the guidelines for your report, write a summary (no more than two pages) that the 　In addition to the guidelines for your report, write a summary (no more than two pages) that the 　　 FAA analyst can present to Jane Garvey, the FAA Administrator, to defend your conclusions
, @7 C1 [) x% {( A# `　
问题A: 空间交通管制
: A& t' _3 ^. W, f为加强安全并减少空中交通指挥员的工作量，联邦航空局(FAA)考虑对空中交通管制系统添加软件，以便自动探测飞行器飞行路线可能的冲突，并提醒指挥员。为完成此项工作，FAA的分析员提出了下列问题。
. y  I# h' q. @6 P9 I要求A: 对于给定的两架空中飞行的飞机，空中交通指挥员应在什么时候把该目标视为太靠近，并予以干预。
要求B: 空间扇形是指某个空中交通指挥员所控制的三维空间部分。给定任意一个空间扇形，我们怎样从空中交通工作量的方位来估量它是否复杂？当几个飞行器同时通过该扇形时,在下面情形所确定的复杂性会达到什么程度：（1）在任一时刻？（2）在任意给定的时间范围内？（3）在一天的特别时间内？在此期间可能出现的冲突总数是怎样影响着复杂性来的？
提出所添加的软件工具对于自动预告冲突并提醒指挥员，这是否会减少或增加此种复杂性？
在作出你的报告方案的同时，写出概述（不多于二页）使FAA分析员能提交给FAA当局Jane Garvey ，并对你的结论进行答辩。

huashi3483

1、Duke University, Durham, NC — MAA Prize Recipient
5 r, t8 {& e& g' a* L, j
Advisor: David P. Kraines
; o' }% u$ h9 [Team Members: Samuel Westmoreland Malone, Jeffrey Abraham Mermin, Daniel Bertrand Neill
. j' }: M5 \: H0 o9 j" B2 N" H


, L! N5 f' r2 I2 O3 ]

6 l' i  P6 [; B2、Governor’s School, Richmond, VA
/ Z7 F$ _: y6 J" k/ M0 H' E2 OAdvisor: Crista Hamilton
9 F1 B0 U$ D7 k& oTeam Members: Finale Doshi, Rebecca Lessem, David Mooney



8 d8 i6 U' s" x& n  k1 B3、U.S. Military Academy, West Point, NY — SIAM Prize Recipient

Advisor:  Cpt. David Bailey
Team Members: Kevin Arnett, Jonathan S. Gibbs, John J. Horton

/ a+ n! }! u7 W& P( [' [

4、University of Colorado, Boulder, CO — INFORMS Prize Recipient
# P- H$ T+ A1 l6 @4 K
0 d6 O. E6 }/ Z7 k+ K  EAdvisor:  Anne M. Dougherty
Team Members: Richard D. Younger, Martin B. Linck, William P. Woesner

% ]5 j* q% D# J7 G


; Q1 |- v  e3 u* D4 E! @+ U: m4 E

huashi3483

一等奖



9 T6 Z0 A* B. Y6 H% ^! P7 ]
6 A2 l2 S7 R. S3 _, i. T
! r. K3 B& x3 F5 v, x9 x

评论

  h1 f( L0 g: W4 _3 G9 s, m/ f" _
( J' U: M+ n' w6 f9 M
$ o( ]+ C0 z8 n$ p2 y& H3 q. O0 q

cathytony

好东西值得来看看

qzawsxedcrftvgy

zwxerctvfbnim

qzawsxedcrftvgy

qazwxecdrvtgyhumi,o

xieling990208

谢谢

ilmare0401

mcm对编程要求极高。。。。。。

lyxingyueming

谢谢您了,辛苦LS!

薇然乘风

好贵呀！！！