[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 …
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 …
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 …
Search-based optimal solvers for the multi-agent pathfinding problem: Summary and challenges
Multi-agent pathfinding (MAPF) is an area of expanding research interest. At the core of this
research area, numerous diverse search-based techniques were developed in the past 6 …
research area, numerous diverse search-based techniques were developed in the past 6 …
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 …
Pairwise symmetry reasoning for multi-agent path finding search
Abstract 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 …
us to plan collision-free paths for a team of cooperative agents. In this work, we show that …
Branch-and-cut-and-price for multi-agent path finding
Abstract The Multi-Agent Path Finding problem aims to find a set of collision-free paths that
minimizes the total cost of all paths. The problem is extensively studied in artificial …
minimizes the total cost of all paths. The problem is extensively studied in artificial …
[PDF][PDF] Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search.
Abstract Conflict-Based Search (CBS) and its enhancements are among the strongest
algorithms for Multi-Agent Path Finding. Recent work introduced an admissible heuristic to …
algorithms for Multi-Agent Path Finding. Recent work introduced an admissible heuristic to …
Multi-agent path finding for large agents
Abstract Multi-Agent Path Finding (MAPF) has been widely studied in the AI community. For
example, Conflict-Based Search (CBS) is a state-of-the-art MAPF algorithm based on a …
example, Conflict-Based Search (CBS) is a state-of-the-art MAPF algorithm based on a …
Distributed heuristic multi-agent path finding with communication
Multi-Agent Path Finding (MAPF) is essential to large-scale robotic systems. Recent
methods have applied reinforcement learning (RL) to learn decentralized polices in partially …
methods have applied reinforcement learning (RL) to learn decentralized polices in partially …