基于GVD的拓扑图更新方法,提升机器人探索时的实时性与路径灵活性。
GVD-TG: Topological Graph based on Fast Hierarchical GVD Sampling for Robot Exploration
- 用分层GVD采样控制精度,结合覆盖地图避免重叠,提升结构准确性。
- 通过连通性约束聚类与切换机制,减少不可达节点,提高探索效率。
- 采用形态学膨胀提取可到达前沿,支持实时视角切换,增强适应性。
拓扑地图比度量地图更适用于机器人探索任务,但实时构建准确且细节丰富的环境拓扑地图仍具挑战。本文提出一种基于广义维诺图(GVD)的拓扑地图更新方法。首先,对新观测区域进行去噪,防止低效的GVD节点误导拓扑结构;随后设计多粒度分层GVD生成方法,在全局与局部层面控制采样粒度,既保证拓扑结构精度,又增强细节捕捉能力,减少路径回溯概率,并通过维护覆盖地图确保各GVD无重叠,提升利用效率。其次,设计带连通性约束的节点聚类方法及基于切换机制的连通性恢复方法,避免障碍物吸引导致的不可达或错误节点生成;使用特殊缓存结构存储全部连通性信息,提升探索效率。最后,针对GVD单元内障碍物引起的前沿误判问题,提出基于形态学膨胀的前沿提取方法,有效保障前沿可达性;在此基础上,采用轻量级代价函数实时评估并切换至下一视点,使机器人在出现路径回溯迹象时能快速调整策略,摆脱困境,提升探索灵活性。系统在探索任务上的性能通过与当前最优方法(SOTA)的对比实验得到验证。
原文摘要 · Abstract (English)
Topological maps are more suitable than metric maps for robotic exploration tasks. However, real-time updating of accurate and detail-rich environmental topological maps remains a challenge. This paper presents a topological map updating method based on the Generalized Voronoi Diagram (GVD). First, the newly observed areas are denoised to avoid low-efficiency GVD nodes misleading the topological structure. Subsequently, a multi-granularity hierarchical GVD generation method is designed to control the sampling granularity at both global and local levels. This not only ensures the accuracy of the topological structure but also enhances the ability to capture detail features, reduces the probability of path backtracking, and ensures no overlap between GVDs through the maintenance of a coverage map, thereby improving GVD utilization efficiency. Second, a node clustering method with connectivity constraints and a connectivity method based on a switching mechanism are designed to avoid the generation of unreachable nodes and erroneous nodes caused by obstacle attraction. A special cache structure is used to store all connectivity information, thereby improving exploration efficiency. Finally, to address the issue of frontiers misjudgment caused by obstacles within the scope of GVD units, a frontiers extraction method based on morphological dilation is designed to effectively ensure the reachability of frontiers. On this basis, a lightweight cost function is used to assess and switch to the next viewpoint in real time. This allows the robot to quickly adjust its strategy when signs of path backtracking appear, thereby escaping the predicament and increasing exploration flexibility. And the performance of system for exploration task is verified through comparative tests with SOTA methods.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。