Skip to content
Open access

Environment-Specific Route-Library Adaptation for Decentralized Multi-Robot Navigation via Hybrid RRT and Behavior Cloning in Grid-Based Industrial Environments

Jul 2026 · Robotics · Vol 15, pp. 141 · 0 citations · 52 references

TL;DR

This work studies a hybrid framework pairing an offline Rapidly-Exploring Random Tree expert with a Behavior Cloning local policy and route reuse, evaluated in a reproducible simulator, and results are a quantitative analysis of environment-specific route-library adaptation.

Abstract

Decentralized multi-robot navigation in grid-based industrial environments must reach goals and avoid collisions without centralized control or direct communication. We study a hybrid framework pairing an offline Rapidly-Exploring Random Tree (RRT) expert with a Behavior Cloning (BC) local policy and route reuse, evaluated in a reproducible simulator; collisions are predicted blocked-move events, not physical contacts. Our central result is a quantitative analysis of environment-specific route-library adaptation: a route library generated for one map and deployed on another leaves robots blocked by unfamiliar obstacles, whereas regenerating it on the deployment map cuts collisions by 38–85% and task failures by 43–70% across two- to ten-robot fleets, and replicates on a third corridor layout (30 seeds; Mann–Whitney p<10−5; permutation pperm<0.001). Simpler remedies, filtering or repairing invalid routes, recover most of this gain, and a non-learning scripted connector matches the trained policy: the effect lives in the route library itself. A centralized prioritized-planning baseline bounds all communication-free variants from above; capping the online RRT baseline’s planning budget preserves its per-task collision quality but sharply raises task failures. A collision-history-sharing add-on coordinating through a shared map rather than messaging gives a limited, layout-dependent benefit not surviving multiple-comparison correction.

Read PDF

Similar papers

Open access Sep 2026

Hybrid path planning for mobile robots in complex environments: Fusing improved BI-RRT and enhanced DWA

A hybrid path planning algorithm that integrates an improved Bidirectional Rapidly-exploring Random Tree (BI-RRT) for global guidance with an enhanced Dynamic Window Approach (DWA) for local execution that improves search efficiency and maintains 100% success rate across tested environments.

Guogang Wang, Hong-Wei Sun, Zi-Chao Feng · 0 citations
Open access Aug 2026

Safety-aware multi-robot coordination in industrial cyber-physical systems using potential fields and handcrafted communication

The findings demonstrate the limitations of the current heuristic integration and support further research on dynamic task assignment, controlled component evaluation, stronger collision-avoidance mechanisms, learned communication, and end-to-end MARL training.

B. Kyiewu, Clinton Amponsah, Linda Bessa-Simons et al. · 0 citations
Open access Aug 2024

LSTP-Nav: Lightweight Spatiotemporal Policy for Map-Free Multi-Agent Navigation With LiDAR

This paper proposes LSTP-Nav, a lightweight, decentralized navigation framework built on LSTP-Net that maps stacked 2D LiDAR observations, goal information, and velocity feedback directly to action and introduces an HS reward to provide smooth, heading-aware safety feedback, and develops PhysReplay-SimLab to improve tr...

Xingrong Diao, Zhi-Qiang Sun, Jian-Wei Peng et al. · 0 citations
Open access Oct 2026

Deadlock-Resistant Safety-Critical Mobile Robot Navigation Using Guiding Vector Fields and Model Predictive Control

This paper investigates the safe navigation of mobile robots in complex-static-obstacle environments and proposes a deadlock-resistant navigation control method. First, convex polygonal obstacles are modeled using the Log-Sum-Exp (LSE) function. Goal and obstacle avoidance guiding vector fields (GVFs) are then construc...

Liang Gao, Yong-Feng Gao, Xin-Hui Zhao et al. · 0 citations
Open access Sep 2026

Solving the Multi-Agent Path Finding Problem Using a Hierarchical Multi-Resolution Planner

Multi-Agent Path Finding (MAPF) studies how to compute collision-free routes for multiple robots moving simultaneously on a shared map, a setting in which naive shortest-path behavior often leads to bottlenecks, deadlocks, and costly replanning. This paper proposes a hierarchical, reservation-based, multi-resolution pl...

Gicu Rata, Liviu Octavian Mafteiu-Scai · 0 citations
Preprint Sep 2026

Decentralized Multi-Robot Exploration with Probabilistic Peer Intent and Multi-hop Plan Propagation

Efficient coordination under limited communication remains a key challenge in decentralized multi-robot exploration. While centralized approaches benefit from global information sharing, they are often impractical in large-scale or communication-constrained environments. Existing Monte Carlo Tree Search (MCTS)-based ap...

Saurbh Singh Jamwal, Nived Chebrolu, Shivaram Kalyanakrishnan · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.