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 …

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 …

Coordinating connected and automated vehicles (CAVs) poses challenges in achieving safe
and optimal pathfinding simultaneously. In this paper, we propose safer conflict-based …

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 …

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 …

针对多智能体路径搜索算法在非指定式多车协同路径规划问题中路径冗长, 计算效率低等缺陷,
提出协同目标点分配路径规划算法Nutcracker-CBS. 首先构建紧耦合目标点分配MAPF 框架 …

多智能体路径规划(multi-agent path finding, MAPF) 是为多个智能体规划路径的问题,
关键约束是多个智能体同时沿着规划路径行进而不会发生冲突. MAPF 在物流, 军事 …

在基于冲突的搜索(conflict-based search, CBS) 算法中, 冲突的选择具有随机性, 导致CBS
算法在多智能体路径规划方面的求解效率不佳. 为此, 本文提出一种改进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 …

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 …