91 citations · 491 across the 19 of their papers we have counts for
20 papers
SACHA: Soft Actor-Critic with Heuristic-Based Attention for Partially Observable Multi-Agent Path Finding
Qiushi Lin, Hang Ma
Multi-Agent Path Finding (MAPF) is a crucial component for many large-scale robotic systems, where agents must plan their collision-free paths to their given goal positions. Recent…
Mixed Integer Programming for Time-Optimal Multi-Robot Coverage Path Planning with Efficient Heuristics
Jingtao Tang, Hang Ma
We investigate time-optimal Multi-Robot Coverage Path Planning (MCPP) for both unweighted and weighted terrains, which aims to minimize the coverage time, defined as the maximum tr…
Double-Deck Multi-Agent Pickup and Delivery: Multi-Robot Rearrangement in Large-Scale Warehouses
Baiyu Li, Hang Ma
We introduce a new problem formulation, Double-Deck Multi-Agent Pickup and Delivery (DD-MAPD), which models the multi-robot shelf rearrangement problem in automated warehouses. DD-…
Multi-Goal Multi-Agent Pickup and Delivery
Qinghong Xu, Jiaoyang Li, Sven Koenig +1
In this work, we consider the Multi-Agent Pickup-and-Delivery (MAPD) problem, where agents constantly engage with new tasks and need to plan collision-free paths to execute them. T…
Optimal and Bounded-Suboptimal Multi-Goal Task Assignment and Path Finding
Xinyi Zhong, Jiaoyang Li, Sven Koenig +1
We formalize and study the multi-goal task assignment and path finding (MG-TAPF) problem from theoretical and algorithmic perspectives. The MG-TAPF problem is to compute an assignm…
Graph-Based Multi-Robot Path Finding and Planning
Hang Ma
Purpose of Review Planning collision-free paths for multiple robots is important for real-world multi-robot systems and has been studied as an optimization problem on graphs, calle…