A review of graph-based multi-agent pathfinding solvers: From classical to beyond classical
Multi-agent pathfinding (MAPF) is a well-studied abstract model for navigation in a multi-
robot system, where every robot finds the path to its goal position without any collision. Due …
robot system, where every robot finds the path to its goal position without any collision. Due …
[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 …
[PDF][PDF] Extended Increasing Cost Tree Search for Non-Unit Cost Domains.
Multi-agent pathfinding (MAPF) has applications in navigation, robotics, games and
planning. Most work on search-based optimal algorithms for MAPF has focused on simple …
planning. Most work on search-based optimal algorithms for MAPF has focused on simple …
Coordination approaches for multi-item pickup and delivery in logistic scenarios
A Contini, A Farinelli - Robotics and Autonomous Systems, 2021 - Elsevier
We focus on the Multi-Robot pickup and delivery problem for logistic scenarios that recently
received significant attention from the research community. In particular we consider an …
received significant attention from the research community. In particular we consider an …
A distributed solver for multi-agent path finding problems
Multi-Agent Path Finding (MAPF) problems are traditionally solved in a centralized manner.
There are works focusing on completeness, optimality, performance, or a tradeoff between …
There are works focusing on completeness, optimality, performance, or a tradeoff between …
Hybrid type multi-robot path planning of a serial manipulator and SwarmItFIX robots in sheet metal milling process
S Veeramani, S Muthuswamy - Complex & Intelligent Systems, 2022 - Springer
This work investigates on the coordinated locomotion between a ceiling-mounted serial
manipulator and two SwarmItFIX robots. The former holds the machining tool as an end …
manipulator and two SwarmItFIX robots. The former holds the machining tool as an end …
Generalized and sub-optimal bipartite constraints for conflict-based search
The main idea of conflict-based search (CBS), a popular, state-of-the-art algorithm for multi-
agent pathfinding is to resolve conflicts between agents by systematically adding constraints …
agent pathfinding is to resolve conflicts between agents by systematically adding constraints …
DiMPP: a complete distributed algorithm for multi-agent path planning
SS Chouhan, R Niyogi - Journal of Experimental & Theoretical …, 2017 - Taylor & Francis
Multi-agent path planning (MAPP) is a challenging task that aims to find conflict free paths
for all the agents in a given domain. Priority-based decoupled approach is one of the several …
for all the agents in a given domain. Priority-based decoupled approach is one of the several …
[PDF][PDF] A Declarative Method for Dynamic Multi-Agent Path Finding.
The multi-agent path finding (MAPF) problem is a combinatorial search problem that aims at
finding paths for multiple agents such that no two agents collide with each other. We study a …
finding paths for multiple agents such that no two agents collide with each other. We study a …
Explanation generation for multi-modal multi-agent path finding with optimal resource utilization using answer set programming
A Bogatarkan, E Erdem - Theory and Practice of Logic Programming, 2020 - cambridge.org
The multi-agent path finding (MAPF) problem is a combinatorial search problem that aims at
finding paths for multiple agents (eg, robots) in an environment (eg, an autonomous …
finding paths for multiple agents (eg, robots) in an environment (eg, an autonomous …