Abstract Purpose of Review Planning collision-free paths for multiple robots is important for
real-world multi-robot systems and has been studied as an optimization problem on graphs …

We formulate the problem of multi-robot path planning with due times (MRPP-DT), which is a
variant of the classical path planning problem with task due times explicitly considered. The …

We investigate time-optimal Multi-Robot Coverage Path Planning (MCPP) for both
unweighted and weighted terrains, which aims to minimize the coverage time, defined as the …

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 …

The use of multiple mobile robots has grown significantly over the past few years in logistics,
manufacturing and public services. Conflict–free route planning is one of the major research …

Collision-free path planning is indispensable for the multi-robot system. Many existing multi-
robot path planning algorithms may no longer work properly in the narrow-lane environment …

Abstract In Lifelong Multi-Agent Path Finding (L-MAPF) a team of agents performs a stream
of tasks consisting of multiple locations to be visited by the agents on a shared graph while …

多智能体路径搜寻(Multi-agent Path Finding, MAPF) 问题是多智能体系统中的核心基本问题,
被广泛应用于自动化智能仓储, 自动驾驶, 群体机器人等实际场景. 从问题属性来看 …

Coordinating multiple robots is crucial for various real-life applications. Many Multi-Agent
Path Finding (MAPF) algorithms have been proven to be successful in addressing this …

Scheduling collision-free paths for a large number of robots in dense environments with high
efficiency is achieved in this work. We propose an algorithm, OMPP (One-way Multi-robot …