让机器人持续学习走哪能走、哪不能走,还能记住新环境不遗忘。
IMOST: Incremental Memory Mechanism with Online Self-Supervision for Continual Traversability Learning
- 用类人记忆机制动态存新场景,保持知识多样性
- 实时生成完整可通行区域标注,降低训练负担
- 适合在真实机器人上在线学习,适应复杂变化环境
可通行性估计是通用导航系统路径规划的基础。然而,复杂动态环境给基于自监督学习(SSL)的最新方法带来挑战:现有方法生成的标注稀疏,缺乏细节边界;且聚焦难样本快速适应,导致遗忘和预测偏差。本文提出IMOST框架,包含两个核心模块:增量动态记忆(IDM)与自监督标注(SSA)。IDM模仿人类记忆机制,依据信息扩展准则将新数据分配至新簇,并按多样性规则更新簇结构,确保新场景表征代表性,提升场景感知的知识多样性同时保持紧凑内存。SSA模块结合FastSAM,利用点提示实时生成完整标注,显著降低训练复杂度。IMOST已在四足机器人上成功部署,实验结果表明,在公开与自采数据集上均优于当前最先进方法,具备强鲁棒性与多场景适应能力。代码已开源:https://github.com/SJTU-MKH/OCLTrav。
原文摘要 · Abstract (English)
Traversability estimation is the foundation of path planning for a general navigation system. However, complex and dynamic environments pose challenges for the latest methods using self-supervised learning (SSL) technique. Firstly, existing SSL-based methods generate sparse annotations lacking detailed boundary information. Secondly, their strategies focus on hard samples for rapid adaptation, leading to forgetting and biased predictions. In this work, we propose IMOST, a continual traversability learning framework composed of two key modules: incremental dynamic memory (IDM) and self-supervised annotation (SSA). By mimicking human memory mechanisms, IDM allocates novel data samples to new clusters according to information expansion criterion. It also updates clusters based on diversity rule, ensuring a representative characterization of new scene. This mechanism enhances scene-aware knowledge diversity while maintaining a compact memory capacity. The SSA module, integrating FastSAM, utilizes point prompts to generate complete annotations in real time which reduces training complexity. Furthermore, IMOST has been successfully deployed on the quadruped robot, with performance evaluated during the online learning process. Experimental results on both public and self-collected datasets demonstrate that our IMOST outperforms current state-of-the-art method, maintains robust recognition capabilities and adaptability across various scenarios. The code is available at https://github.com/SJTU-MKH/OCLTrav.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。