Lifelong multi-agent path finding in large-scale warehouses
Abstract Multi-Agent Path Finding (MAPF) is the problem of moving a team of agents to their
goal locations without collisions. In this paper, we study the lifelong variant of MAPF, where …
goal locations without collisions. In this paper, we study the lifelong variant of MAPF, where …
Persistent and robust execution of MAPF schedules in warehouses
Multi-agent path finding (MAPF) is a well-studied problem in artificial intelligence that can be
solved quickly in practice when using simplified agent assumptions. However, real-world …
solved quickly in practice when using simplified agent assumptions. However, real-world …
Multi-agent pathfinding with continuous time
Abstract Multi-Agent Pathfinding (MAPF) is the problem of finding paths for multiple agents
such that each agent reaches its goal and the agents do not collide. In recent years, variants …
such that each agent reaches its goal and the agents do not collide. In recent years, variants …
Multi-agent pathfinding: Definitions, variants, and benchmarks
The multi-agent pathfinding problem (MAPF) is the fundamental problem of planning paths
for multiple agents, where the key constraint is that the agents will be able to follow these …
for multiple agents, where the key constraint is that the agents will be able to follow these …
Multi-robot coordination and layout design for automated warehousing
With the rapid progress in Multi-Agent Path Finding (MAPF), researchers have studied how
MAPF algorithms can be deployed to coordinate hundreds of robots in large automated …
MAPF algorithms can be deployed to coordinate hundreds of robots in large automated …
[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-agent path finding–an overview
R Stern - Artificial Intelligence: 5th RAAI Summer School …, 2019 - Springer
Abstract Multi-Agent Pathfinding (MAPF) is the problem of finding paths for multiple agents
such that every agent reaches its goal and the agents do not collide. In recent years, there …
such that every agent reaches its goal and the agents do not collide. In recent years, there …
Multi-agent path finding with prioritized communication learning
Multi-agent pathfinding (MAPF) has been widely used to solve large-scale real-world
problems, eg, automation warehouses. The learning-based, fully decentralized framework …
problems, eg, automation warehouses. The learning-based, fully decentralized framework …
Eecbs: A bounded-suboptimal search for multi-agent path finding
Abstract Multi-Agent Path Finding (MAPF), ie, finding collision-free paths for multiple robots,
is important for many applications where small runtimes are necessary, including the kind of …
is important for many applications where small runtimes are necessary, including the kind of …
[PDF][PDF] Research challenges and opportunities in multi-agent path finding and multi-agent pickup and delivery problems
Recent years have shown a large increase in applications and research of problems that
include moving a fleet of physical robots. One particular application that is currently a multi …
include moving a fleet of physical robots. One particular application that is currently a multi …