DeepAI AI Chat
Log In Sign Up

Roadmap-Optimal Multi-robot Motion Planning using Conflict-Based Search

by   Irving Solis, et al.
University of Illinois at Urbana-Champaign

Multi-Agent Pathfinding (MAPF) is the problem of finding a set of feasible paths for a set of agents with specific individual start and goal poses. It is considered computationally hard to solve. Conflict-based search (CBS) has shown optimality in developing solutions for multi-agent pathfinding problems in discrete spaces. However, neither CBS nor other discrete MAPF techniques can be directly applied to solve Multi-Agent Motion Planning (MAMP) problems, the continuous version on multi-agent pathfinding. In this work, we present the extension of the CBS discrete approach to solve Sampling-based Motion planning problems, and we show its capabilities to produce roadmap-optimal solutions for multi-robot motion planning problems.


Quick Multi-Robot Motion Planning by Combining Sampling and Search

We propose a novel algorithm to solve multi-robot motion planning (MRMP)...

Conflict-based Search for Multi-Robot Motion Planning with Kinodynamic Constraints

Multi-robot motion planning (MRMP) is the fundamental problem of finding...

Efficient Multi-Agent Motion Planning in Continuous Workspaces Using Medial-Axis-Based Swap Graphs

We present an algorithm for homogeneous, labeled, and disk-shaped multi-...

Multi-Agent Pathfinding (MAPF) with Continuous Time

MAPF is the problem of finding paths for multiple agents such that every...

Multi-Agent Motion Planning using Deep Learning for Space Applications

State-of-the-art motion planners cannot scale to a large number of syste...

Space-Time Conflict Spheres for Constrained Multi-Agent Motion Planning

Multi-agent motion planning (MAMP) is a critical challenge in applicatio...

SOCIALMAPF: Optimal and Efficient Multi-Agent Path Finding with Strategic Agents for Social Navigation

We propose an extension to the MAPF formulation, called SocialMAPF, to a...