BIC-GA: Return-Aware Cooperative Exploration in Fragmented Environments via Directed Commitments and Gate Admission

Abstract Dual-robot exploration in fragmented unknown environments is constrained by incomplete sensing and complex free-space structure. In narrow passages, dead ends, and shared bottlenecks, frontier updates can destabilize assignments, while locally attractive targets may be infeasible once branch entry, service execution, and return requirements are considered. This study presents Branch-Intent Commitment with Gate Admission (BIC-GA) for return-feasible dual-robot target-coverage exploration. Instead of assigning raw frontier points, BIC-GA models each frontier component as a structured, directed commitment characterized by its entrance location, traversable entry orientation, expected information gain, entry difficulty, and predicted service workload. The robots select a commitment pair through a return-aware joint objective after predictive loop-budget screening, considering outbound, service, and return costs, overlap, short-prefix conflict, and workload balance. At local gates, exploratory changes require sufficient improvement over legal continuation, while an execution guard checks post-step return margins before motion to preserve modeled return feasibility. Experiments on fragmented grid maps show that, over jointly successful conditions, BIC-GA reduces mean team path length by 6.2–26.4%, turning effort by 34.9–50.4%, and composite motion cost by 7.8–27.8% relative to four tested baselines. Component tests further demonstrate more stable assignments, fewer reversals and conflict-repair interventions, and reliable exploration–return performance under budget constraints.

Authors

Institutions

Publication Details

Journal
Research Square
Published
2026-11-13
DOI
https://doi.org/10.21203/rs.3.rs-11248079/v1
Primary Topic
Robotic Path Planning Algorithms
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

BIC-GA: Return-Aware Cooperative Exploration in Fragmented Environments via Directed Commitments and Gate Admission

Chee Keong Tan, Yao Xue
Research Square
Robotic Path Planning Algorithms
preprint

BIC-GA: Return-Aware Cooperative Exploration in Fragmented Environments via Directed Commitments and Gate Admission

Chee Keong Tan, Yao Xue
preprint en

Abstract

Abstract Dual-robot exploration in fragmented unknown environments is constrained by incomplete sensing and complex free-space structure. In narrow passages, dead ends, and shared bottlenecks, frontier updates can destabilize assignments, while locally attractive targets may be infeasible once branch entry, service execution, and return requirements are considered. This study presents Branch-Intent Commitment with Gate Admission (BIC-GA) for return-feasible dual-robot target-coverage exploration. Instead of assigning raw frontier points, BIC-GA models each frontier component as a structured, directed commitment characterized by its entrance location, traversable entry orientation, expected information gain, entry difficulty, and predicted service workload. The robots select a commitment pair through a return-aware joint objective after predictive loop-budget screening, considering outbound, service, and return costs, overlap, short-prefix conflict, and workload balance. At local gates, exploratory changes require sufficient improvement over legal continuation, while an execution guard checks post-step return margins before motion to preserve modeled return feasibility. Experiments on fragmented grid maps show that, over jointly successful conditions, BIC-GA reduces mean team path length by 6.2–26.4%, turning effort by 34.9–50.4%, and composite motion cost by 7.8–27.8% relative to four tested baselines. Component tests further demonstrate more stable assignments, fewer reversals and conflict-repair interventions, and reliable exploration–return performance under budget constraints.

Research Square
Monash University Malaysia (MY)
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon