Abstract
This paper considers the path planning problem for autonomous exploration of an unknown environment using multiple heterogeneous robots such as drones, wheeled, and legged robots, which have different capabilities to traverse complex terrains. A key challenge there is to intelligently allocate the robots to the unknown areas to be explored and determine the visiting order of those spaces subject to traversablity constraints, which leads to a large scale constrained optimization problem that needs to be quickly and iteratively solved every time when new space are explored. To address the challenge, we propose HEHA (Hierarchical Exploration with Heterogeneous Agents) by leveraging a recent hierarchical method that decompose the exploration into global planning and local planning. The major contribution in HEHA is its global planning, where we propose a new routing algorithm PEAF (Partial Anytime Focal search) that can quickly find bounded sub-optimal solutions to minimize the maximum path length among the agents subject to traversability constraints. Additionally, the local planner in HEHA also considers heterogeneity to avoid repeated and duplicated exploration among the robots. The experimental results show that, our HEHA can reduce up to 30% of the exploration time than the baselines.
Abstract (translated)
本文探讨了使用多种异构机器人(如无人机、轮式和腿足机器人)在未知环境中进行自主探索的路径规划问题。这些机器人的能力各异,能够穿越复杂的地形。其中的关键挑战是如何智能地分配机器人去探索未被了解的区域,并确定它们访问顺序以满足通行性约束条件,这导致了一个需要快速迭代求解的大规模受限优化问题,每当有新的空间待探索时都需要解决这一问题。 为应对上述挑战,本文提出了HEHA(基于异构代理的分层探索)方法。该方法利用了一种最近发展的分层方法,将探索过程分解为全局规划和局部规划两个阶段。HEHA的主要贡献在于其全局规划部分,我们提出了一种新的路由算法PEAF(部分任意时间焦点搜索),能够在满足通行性约束的情况下快速找到次优解以最小化代理之间的最大路径长度。 此外,在HEHA的本地规划器中也考虑了异构性的因素,以避免机器人之间重复和冗余的探索。实验结果显示,与基线方法相比,我们的HEHA可以将探索时间减少高达30%。
URL
https://arxiv.org/abs/2510.04161