International audienceIn large transportation networks, real-time traffic management is essential to minimize disruptions and maximize punctuality. This is especially true for railway systems, where delays can easily propagate from one train to the next due to infrastructure constraints. We propose novel algorithms to tackle this problem, using the Flatland challenge as a testing ground
This paper presents a stochastic motion planning algorithm and its application to traffic navigation...
Missed transfers affect public transport (PT) operations by increasing passenger’s waiting and trave...
The real-time railway traffic management problem (rtRTMP) aims to solve time-overlapping conflicting...
Multi-Agent Path Finding (MAPF) is the combinatorial problem of finding collision-free paths for mul...
Multi-Agent Path Finding (MAPF) is the combinatorial problem of finding collision-free paths for mul...
Train delays occur often in daily railway operations due to a variety of incidents in railway circum...
Abstract We introduce a novel generic algorithmic problem in directed acyclic graphs, motivated by o...
Rescheduling disrupted railway traffic is computationally hard even for small problem instances. Dis...
We introduce a novel generic algorithmic problem in directed acyclic graphs, motivated by our train ...
The real-time railway rescheduling problem is a crucial challenge for human operators since many fac...
Rail line interruptions are rare but very costly events, as they require a complete re-definition no...
International audienceRouting delivery vehicles to serve customers in dynamic and uncertain environm...
This paper proposes a multi-agent deep reinforcement learning approach for the train timetabling pro...
International audienceThis paper analyses how train delays propagate in a metro network due to distu...
Multi-Train Path Finding (MTPF) is a coordination problem that asks us to plan collision-free paths ...
This paper presents a stochastic motion planning algorithm and its application to traffic navigation...
Missed transfers affect public transport (PT) operations by increasing passenger’s waiting and trave...
The real-time railway traffic management problem (rtRTMP) aims to solve time-overlapping conflicting...
Multi-Agent Path Finding (MAPF) is the combinatorial problem of finding collision-free paths for mul...
Multi-Agent Path Finding (MAPF) is the combinatorial problem of finding collision-free paths for mul...
Train delays occur often in daily railway operations due to a variety of incidents in railway circum...
Abstract We introduce a novel generic algorithmic problem in directed acyclic graphs, motivated by o...
Rescheduling disrupted railway traffic is computationally hard even for small problem instances. Dis...
We introduce a novel generic algorithmic problem in directed acyclic graphs, motivated by our train ...
The real-time railway rescheduling problem is a crucial challenge for human operators since many fac...
Rail line interruptions are rare but very costly events, as they require a complete re-definition no...
International audienceRouting delivery vehicles to serve customers in dynamic and uncertain environm...
This paper proposes a multi-agent deep reinforcement learning approach for the train timetabling pro...
International audienceThis paper analyses how train delays propagate in a metro network due to distu...
Multi-Train Path Finding (MTPF) is a coordination problem that asks us to plan collision-free paths ...
This paper presents a stochastic motion planning algorithm and its application to traffic navigation...
Missed transfers affect public transport (PT) operations by increasing passenger’s waiting and trave...
The real-time railway traffic management problem (rtRTMP) aims to solve time-overlapping conflicting...