DeepAI AI Chat
Log In Sign Up

DDM*: Fast Near-Optimal Multi-Robot Path Planning using Diversified-Path and Optimal Sub-Problem Solution Database Heuristics

04/04/2019
by   Shuai D. Han, et al.
0

We propose a novel centralized and decoupled algorithm, DDM*, for solving one-shot and dynamic optimal multi-robot path planning problems in a graph-based setting. Among other techniques, DDM* is mainly enabled through exploiting two innovative heuristics: path diversification and optimal sub-problem solution databases. The two heuristics attack two distinct phases of a decoupling-based planner: while path diversification allows more effective use of the entire workspace for robot travel, optimal sub-problem solution databases facilitate the fast resolution of local path conflicts. Extensive evaluation demonstrates that DDM* achieves both great scalability and a high level of solution optimality.

READ FULL TEXT

page 4

page 6

09/03/2022

A Novel Knowledge-Based Genetic Algorithm for Robot Path Planning in Complex Environments

In this paper, a novel knowledge-based genetic algorithm for path planni...
09/10/2021

Optimizing Space Utilization for More Effective Multi-Robot Path Planning

We perform a systematic exploration of the principle of Space Utilizatio...
02/14/2023

Adversarial Path Planning for Optimal Camera Positioning

The use of visual sensors is flourishing, driven among others by the sev...
05/31/2018

An Ontology to Support Collective Intelligence in Decentralised Multi-Robot Systems

In most multi-robot systems, conditions of the floor, battery and mechan...
02/03/2018

Path Planning for Minimizing the Expected Cost till Success

Consider a general path planning problem of a robot on a graph with edge...