Cooperative multi-agent path finding: Beyond path planning and collision avoidance
N Greshler, O Gordon, O Salzman… - … symposium on multi …, 2021 - ieeexplore.ieee.org
We introduce the Cooperative Multi-Agent Path Finding (Co-MAPF) problem, an extension to
the classical MAPF problem, where cooperative behavior is incorporated. In this setting, a …
the classical MAPF problem, where cooperative behavior is incorporated. In this setting, a …
AI buzzwords explained: multi-agent path finding (MAPF)
Kiva Systems was founded in 2003 to develop robot technology that automates the fetching
of goods in order-fulfillment centers. It was acquired by Amazon in 2012 and changed its …
of goods in order-fulfillment centers. It was acquired by Amazon in 2012 and changed its …
Multi-agent path finding with priority for cooperative automated valet parking
Shortage of parking lots has been a serious problem due to the rapid population growth in
urban areas. Cooperative Automated Valet Parking (Co-AVP) is a promising approach to …
urban areas. Cooperative Automated Valet Parking (Co-AVP) is a promising approach to …
Iterative refinement for real-time multi-robot path planning
We study the iterative refinement of path planning for multiple robots, known as multi-agent
pathfinding (MAPF). Given a graph, agents, their initial locations, and destinations, a solution …
pathfinding (MAPF). Given a graph, agents, their initial locations, and destinations, a solution …
Answer set planning: a survey
Answer Set Planning refers to the use of Answer Set Programming (ASP) to compute plans,
that is, solutions to planning problems, that transform a given state of the world to another …
that is, solutions to planning problems, that transform a given state of the world to another …
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 …
Lifelong multi-agent path finding in a dynamic environment
Q Wan, C Gu, S Sun, M Chen… - 2018 15th International …, 2018 - ieeexplore.ieee.org
In tradition, the problem of Multi-Agent Path Finding is to find paths for the agents without
conflicts, and each agent execute one-shot task, a travel from a start position to its …
conflicts, and each agent execute one-shot task, a travel from a start position to its …