TY - GEN
T1 - Adaptive Exploration-Exploitation Balancing for Robotic Gas Source Seeking via Time Progress and Spatial Dispersion
AU - Wang, Miao
AU - Xin, Bin
AU - Qu, Yun
N1 - Publisher Copyright:
© 2026 IEEE.
PY - 2026
Y1 - 2026
N2 - Gas source localization is critical for industrial safety monitoring, disaster rescue, and environmental protection. This paper presents an adaptive source-seeking planner that explicitly balances exploration and exploitation under uncertainty. At each step, the robot samples candidate goal points and scores them by combining (i) an exploitation term derived from a Gaussian-like dispersion model and (ii) an exploration term computed as frontier-based information gain. To avoid search stagnation, a time-dependent penalization is introduced to reduce the attractiveness of early sampled goals, discouraging long-distance revisits. Moreover, the explorationexploitation weight is adapted online using the spatial variance of a high-probability candidate set: dispersed candidates trigger stronger exploration, while concentrated candidates promote rapid exploitation toward the source. Simulation and real-robot experiments demonstrate that the proposed algorithm improves search efficiency in complex environments.
AB - Gas source localization is critical for industrial safety monitoring, disaster rescue, and environmental protection. This paper presents an adaptive source-seeking planner that explicitly balances exploration and exploitation under uncertainty. At each step, the robot samples candidate goal points and scores them by combining (i) an exploitation term derived from a Gaussian-like dispersion model and (ii) an exploration term computed as frontier-based information gain. To avoid search stagnation, a time-dependent penalization is introduced to reduce the attractiveness of early sampled goals, discouraging long-distance revisits. Moreover, the explorationexploitation weight is adapted online using the spatial variance of a high-probability candidate set: dispersed candidates trigger stronger exploration, while concentrated candidates promote rapid exploitation toward the source. Simulation and real-robot experiments demonstrate that the proposed algorithm improves search efficiency in complex environments.
UR - https://www.scopus.com/pages/publications/105047340710
U2 - 10.1109/ICCA69928.2026.11618018
DO - 10.1109/ICCA69928.2026.11618018
M3 - Conference contribution
AN - SCOPUS:105047340710
T3 - IEEE International Conference on Control and Automation, ICCA
SP - 822
EP - 827
BT - 2026 IEEE 20th International Conference on Control and Automation, ICCA 2026
PB - IEEE Computer Society
T2 - 20th IEEE International Conference on Control and Automation, ICCA 2026
Y2 - 16 June 2026 through 19 June 2026
ER -