paper-with-me

홈 › Papers

Flatland-RL : Multi-Agent Reinforcement Learning on Trains

2020-12-10 · Sharada Mohanty, Erik Nygren, Florian Laurent, Manuel Schneider, Christian Scheller, Nilabha Bhattacharya, Jeremy Watson, Adrian Egli, Christian Eichenberger, Christian Baumberger, Gereon Vienken, Irene Sturm, Guillaume Sartoretti, Giacomo Spigler

Efficient automated scheduling of trains remains a major challenge for modern railway systems. The underlying vehicle rescheduling problem (VRSP) has been a major focus of Operations Research (OR) since decades. Traditional approaches use complex simulators to study VRSP, where experimenting with a broad range of novel ideas is time consuming and has a huge computational overhead. In this paper, we introduce a two-dimensional simplified grid environment called "Flatland" that allows for faster experimentation. Flatland does not only reduce the complexity of the full physical simulation, but also provides an easy-to-use interface to test novel approaches for the VRSP, such as Reinforcement Learning (RL) and Imitation Learning (IL). In order to probe the potential of Machine Learning (ML) research on Flatland, we (1) ran a first series of RL and IL experiments and (2) design and executed a public Benchmark at NeurIPS 2020 to engage a large community of researchers to work on this problem. Our own experimental results, on the one hand, demonstrate that ML has potential in solving the VRSP on Flatland. On the other hand, we identify key topics that need further research. Overall, the Flatland environment has proven to be a robust and valuable framework to investigate the VRSP for railway networks. Our experiments provide a good starting point for further research and for the participants of the NeurIPS 2020 Flatland Benchmark. All of these efforts together have the potential to have a substantial impact on shaping the mobility of the future.

📄 PDF Abstract BibTeX arXiv:2012.05893

Code (0)

등록된 구현이 없습니다.

Tasks

Imitation LearningMulti-agent Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)Scheduling

Similar Papers 제목 키워드 기반

Flatland: a Lightweight First-Person 2-D Environment for Reinforcement Learning

2018-09-03 · Hugo Caselles-Dupré, Louis Annabi, Oksana Hagen, Michael Garcia-Ortiz 외

Flatland is a simple, lightweight environment for fast prototyping and testing of reinforcement learning agents. It is of lower complexity compared to similar 3D platforms (e.g. DeepMind Lab or VizDoom), but emulates phy…

Lifelong learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)

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

2021-03-30 · Florian Laurent, Manuel Schneider, Christian Scheller, Jeremy Watson 외

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 disrupt…

Multi-agent Reinforcement LearningScheduling

Multi-Agent Path Finding via Tree LSTM

2022-10-24 · Yuhao Jiang, Kunjie Zhang, Qimai Li, Jiaxin Chen 외

In recent years, Multi-Agent Path Finding (MAPF) has attracted attention from the fields of both Operations Research (OR) and Reinforcement Learning (RL). However, in the 2021 Flatland3 Challenge, a competition on MAPF, …

Multi-Agent Path Findingreinforcement-learningReinforcement Learning (RL)

Towards Autonomous Railway Operations: A Semi-Hierarchical Deep Reinforcement Learning Approach to the Vehicle Rescheduling Problem

2026-05-11 · Alberto Castagna, Stefan Zahlner, Adrian Egli, Christian Eichenberger 외 arxiv

Managing disruptions in railway traffic management is a major challenge. Rising traffic density and infrastructure limits increase complexity, making the Vehicle Routing and Scheduling Problem (VRSP) difficult to solve r…

Reinforcement Learning

Symmetry Breaking for k-Robust Multi-Agent Path Finding

2021-02-17 · Zhe Chen, Daniel Harabor, Jiaoyang Li, Peter J. Stuckey

During Multi-Agent Path Finding (MAPF) problems, agents can be delayed by unexpected events. To address such situations recent work describes k-Robust Conflict-BasedSearch (k-CBS): an algorithm that produces coordinated …

Multi-Agent Path Finding