Efficient autonomous exploration in large-scale environments remains challenging due to the high planning computational cost and low-speed maneuvers. In this paper, we propose a fast and computationally efficient dual-layer exploration planning method. The insight of our dual-layer method is efficiently finding an acceptable long-term region routing and greedily exploring the target in the region of the first routing area with high speed. Specifically, the proposed method finds the long-term area routing through an approximate algorithm to ensure real-time planning in large-scale environments. Then, the viewpoint in the first routing region with the lowest curvature-penalized cost, which can effectively reduce decelerations caused by sharp turn motions, will be chosen as the next exploration target. To further speed up the exploration, we adopt an aggressive and safe exploration-oriented trajectory to enhance exploration continuity. The proposed method is compared to state-of-the-art methods in challenging simulation environments. The results show that the proposed method outperforms other methods in terms of exploration efficiency, computational cost, and trajectory speed. We also conduct real-world experiments to validate the effectiveness of the proposed method. The code will be open-sourced.
翻译:在大规模环境中实现高效自主探索仍面临规划计算成本高和机动速度慢的挑战。本文提出一种快速且计算高效的双层探索规划方法。该双层方法的核心思想在于高效地确定可接受的长期区域路径规划,并在首个规划区域内以高速贪婪式探索目标。具体而言,所提方法通过近似算法确定长期区域路径,以确保在大规模环境中的实时规划能力。随后,系统将选择首个规划区域内具有最低曲率惩罚成本的视点作为下一探索目标,该方法能有效减少急转弯动作导致的减速现象。为进一步加速探索过程,我们采用一种兼具激进性与安全性的探索导向轨迹以增强探索连续性。在具有挑战性的仿真环境中,所提方法与前沿方法进行了对比实验。结果表明,本方法在探索效率、计算成本和轨迹速度方面均优于其他方法。我们还通过真实世界实验验证了所提方法的有效性。相关代码将开源发布。