让机器人在不同地图下自适应规划最优探测路径
Towards Map-Agnostic Policies for Adaptive Informative Path Planning
- 提出跨地图表示的统一路径规划框架
- 在真实未知地形上表现接近专用模型性能
- 适合需要多场景适配的自主探测任务
机器人常被要求在未知地形中采集相关传感器数据。经典路径规划算法在探索过程中受限于机载计算资源,难以在线自适应重规划路径。近年来,基于学习的方法通过离线训练规划策略,实现高效在线推理,但通常针对特定地图表示设计与训练,限制了在不同地形中的应用。为此,我们提出一种统一的自适应信息路径规划新范式,适用于多种地图表示,支持在更广泛监测任务中训练和部署规划策略。实验表明,该范式可轻松集成传统非学习类规划方法且保持其性能;所训练策略表现与当前最先进的地图特异性模型相当。我们在未见过的真实地形数据集上验证了该策略的有效性。
原文摘要 · Abstract (English)
Robots are frequently tasked to gather relevant sensor data in unknown terrains. A key challenge for classical path planning algorithms used for autonomous information gathering is adaptively replanning paths online as the terrain is explored given limited onboard compute resources. Recently, learning-based approaches emerged that train planning policies offline and enable computationally efficient online replanning performing policy inference. These approaches are designed and trained for terrain monitoring missions assuming a single specific map representation, which limits their applicability to different terrains. To address these issues, we propose a novel formulation of the adaptive informative path planning problem unified across different map representations, enabling training and deploying planning policies in a larger variety of monitoring missions. Experimental results validate that our novel formulation easily integrates with classical non-learning-based planning approaches while maintaining their performance. Our trained planning policy performs similarly to state-of-the-art map-specifically trained policies. We validate our learned policy on unseen real-world terrain datasets.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。