Graph-based multi-robot path finding and planning
H Ma - Current Robotics Reports, 2022 - Springer
Abstract 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 …
real-world multi-robot systems and has been studied as an optimization problem on graphs …
[HTML][HTML] Priority inheritance with backtracking for iterative multi-agent path finding
Abstract In the Multi-Agent Path Finding (MAPF) problem, a set of agents moving on a graph
must reach their own respective destinations without inter-agent collisions. In practical MAPF …
must reach their own respective destinations without inter-agent collisions. In practical MAPF …
Multi-goal multi-agent pickup and delivery
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 …
agents constantly engage with new tasks and need to plan collision-free paths to execute …
Which MAPF model works best for automated warehousing?
Abstract Multi-Agent Path Finding (MAPF) algorithms and their variants can find high-quality
collision-free plans for automated warehousing under simplified assumptions about the …
collision-free plans for automated warehousing under simplified assumptions about the …
Intelligent planning for large-scale multi-agent systems
H Ma - AI Magazine, 2022 - ojs.aaai.org
This article summarizes the New Faculty Highlights talk with the same title at AAAI 2021.
Intelligent agents such as different types of robots will soon become an integral part of our …
Intelligent agents such as different types of robots will soon become an integral part of our …
Multi-agent path finding with mutex propagation
Mutex propagation is a form of efficient constraint propagation popularly used in AI planning
to tightly approximate the reachable states from a given state. We utilize this idea in the …
to tightly approximate the reachable states from a given state. We utilize this idea in the …
An adaptive agent-specific sub-optimal bounding approach for multi-agent path finding
A Multi-Agent Path Finding (MAPF) problem involves multiple agents who want to reach their
destinations without obstructing other agents. Although a MAPF problem needs to be solved …
destinations without obstructing other agents. Although a MAPF problem needs to be solved …
Standby-based deadlock avoidance method for multi-agent pickup and delivery tasks
T Yamauchi, Y Miyashita, T Sugawara - arXiv preprint arXiv:2201.06014, 2022 - arxiv.org
The multi-agent pickup and delivery (MAPD) problem, in which multiple agents iteratively
carry materials without collisions, has received significant attention. However, many …
carry materials without collisions, has received significant attention. However, many …
Optimal and bounded-suboptimal multi-goal task assignment and path finding
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 …
from theoretical and algorithmic perspectives. The MG-TAPF problem is to compute an …
Ctrms: Learning to construct cooperative timed roadmaps for multi-agent path planning in continuous spaces
Multi-agent path planning (MAPP) in continuous spaces is a challenging problem with
significant practical importance. One promising approach is to first construct graphs …
significant practical importance. One promising approach is to first construct graphs …