Application of Multi-Agent Markov Decision Processes to Gate Assignment Problem

Gate assignment Problem (GAP) is an important subject of airport management to ensure smooth traffic operations. However, flights schedule may undergo some stochastic events such as delays that usually occur and have to be considered in the planning. Our approach considers the representation of gates as collaborative agents trying to complete a set of flights assignment tasks as given by a centralized controller. That will allow giving a new model for the GAP based on Multi Agent Markov Decision Processes (MMDP). The aim of this work is to give to controllers at the airport a robust priory solution instead of taking the risk of online schedule modifications to handle uncertainty. The solution of this problem will be a set of optimal decisions to be taken in every case of traffic disturbance.