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] Explainable multi agent path finding
S Almagor, M Lahijanian - AAMAS, 2020 - mortezalahijanian.com
ABSTRACT Multi Agent Path Finding (MAPF) is the problem of planning paths for agents to
reach their targets from their start locations, such that the agents do not collide while …
reach their targets from their start locations, such that the agents do not collide while …
New valid inequalities in branch-and-cut-and-price for multi-agent path finding
E Lam, P Le Bodic - Proceedings of the International Conference on …, 2020 - aaai.org
BCP, a state-of-the-art algorithm for optimal Multi-agent Path Finding, uses the branch-and-
cut-and-price framework to decompose the problem into (1) a master problem that selects a …
cut-and-price framework to decompose the problem into (1) a master problem that selects a …
An empirical comparison of the hardness of multi-agent path finding under the makespan and the sum of costs objectives
In the multi-agent path finding (MAPF) the task is to find non-conflicting paths for multiple
agents. Recently, existing makespan optimal SAT-based solvers for MAPF have been …
agents. Recently, existing makespan optimal SAT-based solvers for MAPF have been …
Temporal segmentation in multi agent path finding with applications to explainability
Abstract Multi-Agent Path Finding (MAPF) is the problem of planning paths for agents to
reach their targets from their start locations, such that the agents do not collide while …
reach their targets from their start locations, such that the agents do not collide while …
Persistent execution of continuous time multi-robot pathfinding
J Wang, T Wu, M Shi - 2021 China Automation Congress (CAC …, 2021 - ieeexplore.ieee.org
Many one-shot Multi-Robot Path Finding (MRPF) algorithms have been able to find collision-
free paths for hundreds or even thousands of robots moving to their respective goal …
free paths for hundreds or even thousands of robots moving to their respective goal …
Abstraction Hierarchies for Multi-Agent Pathfinding
AR Kraft - 2017 - search.proquest.com
Abstract Multi-Agent Pathfinding is an NP-Complete search problem with a branching factor
that is exponential in the number of agents. Because of this exponential feature, it can be …
that is exponential in the number of agents. Because of this exponential feature, it can be …
Genetic optimisations for satisfiability and Ramsey theory
A Barnes - 2017 - pearl.plymouth.ac.uk
The art of using evolutionary mechanisms for identifying satisfiability has produced a range
of efficient solutions to this otherwise computationally challenging problem. Since their first …
of efficient solutions to this otherwise computationally challenging problem. Since their first …