Winning Solution of the AIcrowd SBB Flatland Challenge 2019-2020

11/11/2021
by   Mugurel-Ionut Andreica, et al.
0

This report describes the main ideas of the solution which won the AIcrowd SBB Flatland Challenge 2019-2020, with a score of 99 average, 99 allotted time steps). The details of the task can be found on the competition's website. The solution consists of 2 major components: 1) A component which (re-)generates paths over a time-expanded graph for each agent 2) A component which updates the agent paths after a malfunction occurs, in order to try to preserve the same agent ordering of entering each cell as before the malfunction. The goal of this component is twofold: a) to (try to) avoid deadlocks b) to bring the system back to a consistent state (where each agent has a feasible path over the time-expanded graph). I am discussing both of these components, as well as a series of potentially promising, but unexplored ideas, below.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/09/2022

Multi-Agent Path Finding on Strongly Connected Digraphs: feasibility and solution algorithms

On an assigned graph, the problem of Multi-Agent Pathfinding (MAPF) cons...
research
09/10/2020

Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering

We introduce multi-goal multi agent path finding (MAPF^MG) which general...
research
10/24/2022

Multi-Agent Path Finding via Tree LSTM

In recent years, Multi-Agent Path Finding (MAPF) has attracted attention...
research
08/26/2022

Computing Maximum Fixed Point Solutions over Feasible Paths in Data Flow Analyses

The control flow graph (CFG) representation of a procedure used by virtu...
research
03/16/2021

On Linear Solution of "Cherry Pickup II". Max Weight of Two Disjoint Paths in Node-Weighted Gridlike DAG

"Minimum Falling Path Sum" (MFPS) is classic question in programming - "...
research
08/03/2021

Design and Evaluation of a Hair Combing System Using a General-Purpose Robotic Arm

This work introduces an approach for automatic hair combing by a lightwe...
research
06/08/2015

Stay on path: PCA along graph paths

We introduce a variant of (sparse) PCA in which the set of feasible supp...

Please sign up or login with your details

Forgot password? Click here to reset