arXiv:2504.14440cs.ROcs.CV2025-04被引 8

无需标注数据,高效实现多智能体场景图注册

SG-Reg: Generalizable and Efficient Scene Graph Registration

  • 融合语义、拓扑与形状特征,构建可泛化的场景图编码器
  • 注册成功率显著优于传统手工特征,单帧通信仅需52KB
  • 适用于低带宽多智能体系统,适合真实复杂环境部署

本文针对自主代理在多智能体协同中需将本地地图与远程地图或先验地图进行刚性语义场景图注册的问题,提出SG-Reg方法。传统基于手工设计的语义描述子或依赖真值标注的学习方法难以适应真实环境。为此,我们设计了多模态语义节点编码网络,融合开放集语义特征、具空间感知的局部拓扑及形状特征,生成紧凑的语义节点表示,并通过粗到精的匹配层寻找对应关系。后端采用鲁棒位姿估计算法,依据匹配结果确定变换。该方法保持稀疏且分层的场景表示,显著降低GPU资源与通信开销。我们还提出一种基于视觉基础模型和语义映射模块的新数据生成方式,摆脱对真值标注的依赖。在双智能体SLAM基准上验证,其注册成功率达96.3%,显著优于手工特征基线;相比视觉回环网络,注册召回率略高,每帧仅需52 KB通信带宽。

原文摘要 · Abstract (English)

This paper addresses the challenges of registering two rigid semantic scene graphs, an essential capability when an autonomous agent needs to register its map against a remote agent, or against a prior map. The hand-crafted descriptors in classical semantic-aided registration, or the ground-truth annotation reliance in learning-based scene graph registration, impede their application in practical real-world environments. To address the challenges, we design a scene graph network to encode multiple modalities of semantic nodes: open-set semantic feature, local topology with spatial awareness, and shape feature. These modalities are fused to create compact semantic node features. The matching layers then search for correspondences in a coarse-to-fine manner. In the back-end, we employ a robust pose estimator to decide transformation according to the correspondences. We manage to maintain a sparse and hierarchical scene representation. Our approach demands fewer GPU resources and fewer communication bandwidth in multi-agent tasks. Moreover, we design a new data generation approach using vision foundation models and a semantic mapping module to reconstruct semantic scene graphs. It differs significantly from previous works, which rely on ground-truth semantic annotations to generate data. We validate our method in a two-agent SLAM benchmark. It significantly outperforms the hand-crafted baseline in terms of registration success rate. Compared to visual loop closure networks, our method achieves a slightly higher registration recall while requiring only 52 KB of communication bandwidth for each query frame. Code available at: \href{http://github.com/HKUST-Aerial-Robotics/SG-Reg}{http://github.com/HKUST-Aerial-Robotics/SG-Reg}.

场景图注册多智能体语义地图低带宽

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。