Latest revision as of 17:24, 28 January 2021

Abstract

traffic flow management is one of the fundamental challenges facing the Federal Aviation Administration (FAA) today. The FAA estimates that in 2005 alone, there were over 322,000 hours of delays at a cost to the industry in excess of three billion dollars. Finding reliable and adaptive solutions to the flow management problem is of paramount importance if the Next Generation Air Transportation Systems are to achieve the stated goal of accommodating three times the current traffic volume. This problem is particularly complex as it requires the integration and/or coordination of many factors including: new data (e.g., changing weather info), potentially conflicting priorities (e.g., different airlines), limited resources (e.g., air traffic controllers) and very heavy traffic volume (e.g., over 40,000 flights over the US airspace).   In this paper we use FACET -- an air traffic flow simulator developed at NASA and used extensively by the FAA and industry -- to test a multi-agent algorithm for traffic flow management. An agent is associated with a fix (a specific location in 2D space) and its action consists of setting the separation required among the airplanes going though that fix. Agents use reinforcement learning to set this separation and their actions speed up or slow down traffic to manage congestion. Our FACET based results show that agents receiving personalized rewards reduce congestion by up to 45% over agents receiving a global reward and by up to 67% over a current industry approach (Monte Carlo estimation).

Original document

The different versions of the original document can be found in:

• http://dx.doi.org/10.1145/1329125.1329434

• http://web.engr.oregonstate.edu/~ktumer/publications/files/tumer-agogino_aamas07.pdf

• https://dl.acm.org/citation.cfm?id=1329434,

https://dblp.uni-trier.de/db/conf/atal/aamas2007.html#TumerA07,

https://core.ac.uk/display/24663507,

https://doi.acm.org/10.1145/1329125.1329434,

https://doi.org/10.1145/1329125.1329434,

http://portal.acm.org/citation.cfm?doid=1329125.1329434,

https://academic.microsoft.com/#/detail/1980358463

• http://dl.acm.org/ft_gateway.cfm?id=1329434&ftid=494009&dwn=1,

http://dx.doi.org/10.1145/1329125.1329434