A Comprehensive Review on Leveraging Machine Learning for Multi-Agent Path Finding
This review paper provides an in-depth analysis of the latest advancements in applying
Machine Learning (ML) to solve the Multi-Agent Path Finding (MAPF) problem. The MAPF …
Machine Learning (ML) to solve the Multi-Agent Path Finding (MAPF) problem. The MAPF …
Beyond pairwise reasoning in multi-agent path finding
Abstract In Multi-Agent Path Finding (MAPF), we are asked to plan collision-free paths for
teams of moving agents. Among the leading methods for optimal MAPF is Conflict-Based …
teams of moving agents. Among the leading methods for optimal MAPF is Conflict-Based …
Safer Conflict-Based Search: Risk-Constrained Optimal Pathfinding for Multiple Connected and Automated Vehicles
Coordinating connected and automated vehicles (CAVs) poses challenges in achieving safe
and optimal pathfinding simultaneously. In this paper, we propose safer conflict-based …
and optimal pathfinding simultaneously. In this paper, we propose safer conflict-based …
Minimizing coordination in multi-agent path finding with dynamic execution
Abstract Multi-agent Path Finding (MAPF) is an important problem in large games with many
dynamic agents that need to follow space-time trajectories without inter-agent collisions …
dynamic agents that need to follow space-time trajectories without inter-agent collisions …
On merging agents in multi-agent pathfinding algorithms
Abstract In Multi-Agent Pathfinding (MAPF), the task is to find non-colliding paths for a set of
agents. This paper focuses on search-based MAPF algorithms from the Conflict-Based …
agents. This paper focuses on search-based MAPF algorithms from the Conflict-Based …
Effective integration of weighted cost-to-go and conflict heuristic within suboptimal CBS
Abstract Conflict-Based Search (CBS) is a popular multi-agent path finding (MAPF) solver
that employs a low-level single agent planner and a high-level constraint tree to resolve …
that employs a low-level single agent planner and a high-level constraint tree to resolve …
Further improved heuristics for conflict-based search
Abstract Conflict-Based Search (CBS) is a leading two-level algorithm for optimal Multi-
Agent Path Finding (MAPF). At its high level, CBS expands nodes by resolving conflicts. In …
Agent Path Finding (MAPF). At its high level, CBS expands nodes by resolving conflicts. In …
Graph attentional neural network in multi-agent pickup and delivery problems
A Bignoli - 2021 - politesi.polimi.it
Abstract Multi Agent Path Finding problems and its lifelong versions, Multi Agent Pickup and
Delivery problems, have gained a lot of attention in recent years. Their key concept is to …
Delivery problems, have gained a lot of attention in recent years. Their key concept is to …
Effectively Incorporating Weighted Cost-to-go Heuristic in Suboptimal CBS
Abstract Conflict-Based Search (CBS) is a popular multi-agent path finding (MAPF) solver
that employs a low-level single agent planner and a high-level constraint tree to resolve …
that employs a low-level single agent planner and a high-level constraint tree to resolve …