Skip to content

Efficient Multi-Robot Cooperative Exploration for Semi-Enclosed Environments Based on Multi-Constraint Consensus

Aug 2026 · IEEE Robotics and Automation Letters · Vol 11, pp. 9986-9993 · 0 citations · 25 references
Computer Science

Abstract

Multi-robot systems enable rapid and scalable environmental exploration by distributing sensing and coverage across multiple robots. However, in semi-enclosed environments with complex connectivity (e.g., office, hospital), existing methods fail to account for local reachability and topological structure, leading to inefficient exploration. In this letter, we propose a cooperative exploration framework for such semi-enclosed environments. The framework first partitions the global mission into spatially continuous task domains using spatial correlation-aware domain fusion (SCADF). These task domains integrate topological relationships and local navigability and align the task geometry with the environment. Task assignment is then performed by a novel multi-constraint consensus-based bundle algorithm (MC-CBBA). MC-CBBA augments the classical CBBA with three constraints: inter-robot workload balance, minimum per-robot workload guarantee, and path cost minimization. A two-stage distributed consensus protocol ensures feasible and balanced allocations. Simulation experiments indicate that the proposed method reduces mission completion time by an average of 36% compared with state-of-the-art methods, while significantly enhancing load balancing and exploration efficiency. Real-world experimental results further demonstrate the robustness and effectiveness of the proposed approach.

View source

Similar papers

Conference Open access 2025

Multi-Robot Cooperative Path Planning: Theories, Algorithms, and Applications

This paper provides a thorough survey and integrative presentation of cooperative path planning for multi-robot systems operating in dynamic, cluttered, and partially observable environments and proposes research directions including learning-augmented heuristics, unified safety-aware planning, adaptive MPC – CBF filte...

Yun Pan · 0 citations
Open access Jul 2026

Adaptive A*/NSGA-II framework for multi-goal navigation of mobile robots

A softmin-based adaptive blending mechanism that automatically selects the most suitable path from the champion solutions on the Pareto front according to regional environmental conditions, thereby eliminating the need for manual user intervention is introduced.

Osman Emre Turan, Oğuz Mısır, Mustafa Özden · 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 Jul 2026

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

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.

Yovel Atia, Chen Giladi · 0 citations
Open access Sep 2026

Cost-aware global frontier matching for ROS 2 multi-robot exploration

A ROS 2 frontier-allocation layer that combines a weighted frontier cost with global one-to-one matching is presented that isolates global matching from sequential assignment while keeping the cost formulation and ROS 2 execution stack fixed.

Chu Van Cuong, Anh Tuan Tran · 0 citations

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