Departure MANagement with a Reinforcement Learning Approach: Respecting CFMU Slots

This paper considers how existing Reinforcement Learning (RL) techniques can be used to model and learn solutions for large scale Multi-Agent Systems (MAS). The large scale MAS of interest is the context of the movement of departure flights in big airports, commonly known as the Departure MANagement (DMAN) problem. A particular DMAN subproblem is how to respect Central Flow Management Unit (CFMU) take-off time windows, which are time windows planned by flow management authorities to be respected for the take-off time of departure flights. A RL model to handle this problem is proposed including the Markov Decision Process (MDP) definition, the behavior of the learning agents and how the problem can be modeled using RL ranging from the simplest to the full RL problem. Several experiments are also shown that illustrate the performance of the machine learning algorithm, with a comparison on how these problems are commonly handled by airport controllers nowadays. The environment in which the agents learn is provided by the Fast Time Simulator (FTS) AirTOp and the airport case study is the John F. Kennedy International Airport in New York City, USA, one of the busiest airports in the world.


  • English

Media Info

  • Media Type: Web
  • Features: References;
  • Pagination: pp 1169-1176
  • Monograph Title: 18th International IEEE Conference on Intelligent Transportation Systems (ITSC 2015)

Subject/Index Terms

Filing Info

  • Accession Number: 01602365
  • Record Type: Publication
  • ISBN: 9781467365956
  • Files: TRIS
  • Created Date: May 2 2016 3:25PM