Flatland Competition 2020: MAPF and MARL for Efficient Train Coordination on a Grid World

by   Florian Laurent, et al.

The Flatland competition aimed at finding novel approaches to solve the vehicle re-scheduling problem (VRSP). The VRSP is concerned with scheduling trips in traffic networks and the re-scheduling of vehicles when disruptions occur, for example the breakdown of a vehicle. While solving the VRSP in various settings has been an active area in operations research (OR) for decades, the ever-growing complexity of modern railway networks makes dynamic real-time scheduling of traffic virtually impossible. Recently, multi-agent reinforcement learning (MARL) has successfully tackled challenging tasks where many agents need to be coordinated, such as multiplayer video games. However, the coordination of hundreds of agents in a real-life setting like a railway network remains challenging and the Flatland environment used for the competition models these real-world properties in a simplified manner. Submissions had to bring as many trains (agents) to their target stations in as little time as possible. While the best submissions were in the OR category, participants found many promising MARL approaches. Using both centralized and decentralized learning based approaches, top submissions used graph representations of the environment to construct tree-based observations. Further, different coordination mechanisms were implemented, such as communication and prioritization between agents. This paper presents the competition setup, four outstanding solutions to the competition, and a cross-comparison between them.


page 1

page 2

page 3

page 4


Signal Instructed Coordination in Team Competition

Most existing models of multi-agent reinforcement learning (MARL) adopt ...

ScheduleNet: Learn to solve multi-agent scheduling problems with reinforcement learning

We propose ScheduleNet, a RL-based real-time scheduler, that can solve v...

Scalable Rail Planning and Replanning with Soft Deadlines

The Flatland Challenge, which was first held in 2019 and reported in Neu...

Real-time tree search with pessimistic scenarios

Autonomous agents need to make decisions in a sequential manner, under p...

Flatland-RL : Multi-Agent Reinforcement Learning on Trains

Efficient automated scheduling of trains remains a major challenge for m...

Putting Ridesharing to the Test: Efficient and Scalable Solutions and the Power of Dynamic Vehicle Relocation

Ridesharing is a coordination problem in its core. Traditionally it has ...

Traffic Signs in the Wild: Highlights from the IEEE Video and Image Processing Cup 2017 Student Competition [SP Competitions]

Robust and reliable traffic sign detection is necessary to bring autonom...

Please sign up or login with your details

Forgot password? Click here to reset