Annual Conference of KIPS (한국정보처리학회:학술대회논문집)
- 2021.05a
- /
- Pages.369-372
- /
- 2021
- /
- 2005-0011(pISSN)
- /
- 2671-7298(eISSN)
DOI QR Code
The Analysis of Flatland Challenge Winners' Multi-agent Methodologies
- Choi, BumKyu (Dept. of Electric and Electronics Engineering, Korea University) ;
- Kim, Jong-Kook (Dept. of Electric and Electronics Engineering, Korea University)
- Published : 2021.05.12
Abstract
Scheduling the movements of trains in the modern railway system is becoming essential and important. Swiss Federal Railway Company (SBB) and machine learning researchers began collaborating to make a simulation environment and held a Flatland challenge. In this paper, the methodologies of the winners of this competition are analyzed to achieve insight and research trends. This problem is similar to the Multi-Agent Path Finding (MAPF) and Vehicle Rescheduling Problem (VRSP). The potential of the attempted methods from the Flatland challenge to be applied to various transportation systems as well as railways is discussed.
Keywords