Graph-Based Multi-Robot Path Finding and Planning

06/22/2022
by   Hang Ma, et al.
0

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, called Multi-Agent Path Finding (MAPF). This review surveys different categories of classic and state-of-the-art MAPF algorithms and different research attempts to tackle the challenges of generalizing MAPF techniques to real-world scenarios. Recent Findings Solving MAPF problems optimally is computationally challenging. Recent advances have resulted in MAPF algorithms that can compute collision-free paths for hundreds of robots and thousands of navigation tasks in seconds of runtime. Many variants of MAPF have been formalized to adapt MAPF techniques to different real-world requirements, such as considerations of robot kinematics, online optimization for real-time systems, and the integration of task assignment and path planning. Summary Algorithmic techniques for MAPF problems have addressed important aspects of several multi-robot applications, including automated warehouse fulfillment and sortation, automated train scheduling, and navigation of non-holonomic robots and quadcopters. This showcases their potential for real-world applications of large-scale multi-robot systems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/06/2021

Dynamic Prioritization for Conflict-Free Path Planning of Multi-Robot Systems

Planning collision-free paths for multi-robot systems (MRS) is a challen...
research
04/07/2022

Distributed Reinforcement Learning for Robot Teams: A Review

Purpose of review: Recent advances in sensing, actuation, and computatio...
research
09/17/2021

Flexible and Explainable Solutions for Multi-Agent Path Finding Problems

The multi-agent path finding (MAPF) problem is a combinatorial search pr...
research
09/09/2021

Solving Simultaneous Target Assignment and Path Planning Efficiently with Time-Independent Execution

Real-time planning for a combined problem of target assignment and path ...
research
12/15/2018

Lifelong Path Planning with Kinematic Constraints for Multi-Agent Pickup and Delivery

The Multi-Agent Pickup and Delivery (MAPD) problem models applications w...
research
02/03/2023

Online Re-Planning and Adaptive Parameter Update for Multi-Agent Path Finding with Stochastic Travel Times

This study explores the problem of Multi-Agent Path Finding with continu...
research
02/24/2019

An Efficient Scheduling Algorithm for Multi-Robot Task Allocation in Assembling Aircraft Structures

Efficient utilization of cooperating robots in the assembly of aircraft ...

Please sign up or login with your details

Forgot password? Click here to reset