26 citations · 54 across the 12 of their papers we have counts for
4 papers · 1 filter
New Mechanisms in Flex Distribution for Bounded Suboptimal Multi-Agent Path Finding
Shao-Hung Chan, Thomy Phan, Jiaoyang Li +1
Multi-Agent Path Finding (MAPF) is the problem of finding a set of collision-free paths, one for each agent in a shared environment. Its objective is to minimize the sum of path co…
ITA-ECBS: A Bounded-Suboptimal Algorithm for the Combined Target-Assignment and Path-Finding Problem
Yimin Tang, Sven Koenig, Jiaoyang Li
Multi-Agent Path Finding (MAPF), i.e., finding collision-free paths for multiple robots, plays a critical role in many applications. Sometimes, assigning a target to each agent als…
Flatland Competition 2020: MAPF and MARL for Efficient Train Coordination on a Grid World
Florian Laurent, Manuel Schneider, Christian Scheller +24
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 th…
Pairwise Symmetry Reasoning for Multi-Agent Path Finding Search
Jiaoyang Li, Daniel Harabor, Peter J. Stuckey +1
Multi-Agent Path Finding (MAPF) is a challenging combinatorial problem that asks us to plan collision-free paths for a team of cooperative agents. In this work, we show that one of…