Xue Yao, Tan Chee Keong, Peng Wong Wai
School of Information Technology, Monash University Malaysia, Jalan Lagoon Selatan, Bandar Sunway, Selangor, Malaysia.
Monash Climate-Resilient Infrastructure Research Hub (M-CRInfra), School of Engineering, Monash University Malaysia, Jalan Lagoon Selatan, Bandar Sunway, Selangor, Malaysia.
PLoS One. 2025 May 22;20(5):e0322980. doi: 10.1371/journal.pone.0322980. eCollection 2025.
In post-disaster scenarios, effective rescue operations hinge on deploying robots equipped with sophisticated path planning algorithms capable of navigating through complex and unknown environments, facilitating an exhaustive search for survivors. The inherent limitations of traditional Coverage Path Planning (CPP) algorithms, particularly their struggle to adapt to the highly dynamic and unpredictable nature of post-disaster environments characterized by collapsed structures, shifting debris fields, and unforeseen obstacles, hinder their effectiveness in time-sensitive rescue operations. To address the challenges, this paper introduces an innovative three-stage online CPP method, termed Ant Colony Optimization based Robot Exploration with Escape Mechanism (AntBot-EX). Our three-stage approach leverages the strengths of different algorithms. Firstly, we utilize a modified Ant Colony Optimization algorithm to explore the unknown environment efficiently, prioritizing uncharted territories and avoiding potential dead ends using an escape mechanism. Secondly, the remaining unexplored areas are segmented, enabling targeted path planning with the [Formula: see text] algorithm to maximize coverage. Thirdly, to address computational limitations in large and complex environments, a configurable boundary-aware and a score-based threshold are introduced to simplify paths by strategically disregarding irrelevant regions, optimizing search efficiency. Simulation results show that our method can basically achieve complete coverage in complex and unknown environments.
在灾后场景中,有效的救援行动取决于部署配备先进路径规划算法的机器人,这些算法能够在复杂且未知的环境中导航,以便全面搜索幸存者。传统覆盖路径规划(CPP)算法存在固有限制,尤其是它们难以适应灾后环境的高度动态性和不可预测性,这种环境具有建筑物倒塌、残骸场移动以及出现意外障碍物等特点,这阻碍了它们在对时间敏感的救援行动中的有效性。为应对这些挑战,本文介绍了一种创新的三阶段在线CPP方法,称为基于蚁群优化的带逃逸机制的机器人探索(AntBot-EX)。我们的三阶段方法利用了不同算法的优势。首先,我们使用一种改进的蚁群优化算法高效探索未知环境,利用逃逸机制优先探索未知区域并避免潜在的死胡同。其次,对剩余未探索区域进行分割,使用[公式:见原文]算法进行有针对性的路径规划,以实现最大覆盖。第三,为解决大型复杂环境中的计算限制,引入了可配置的边界感知和基于分数的阈值,通过策略性地忽略无关区域来简化路径,优化搜索效率。仿真结果表明,我们的方法能够在复杂且未知的环境中基本实现完全覆盖。