arXiv:2607.15589cs.ROcs.AI2026-07中稿 · IEEE/ACM ESWEEK被引 1

为机器人导航设计自适应记忆验证机制,提升安全与效率。

MemoGuard: An Adaptive Runtime for Guarding Against Memory Traps in Communication-Limited Robot Navigation

论文配图:MemoGuard: An Adaptive Runtime for Guarding Against Memory Traps in Communication-Limited Robot Navigation
图 1 · 摘自论文原文
  • 引入拓扑、资源、结果三重合约验证记忆有效性
  • 减少76.6%电池安全违规,降低21.4%冗余推理调用
  • 适合资源受限的灾后搜救等关键任务场景

在通信受限的灾后巡查与搜救等关键任务中,机器人需在无远程支持下做出可靠本地决策。利用情景记忆复用是低成本备用方案,但高相似性记忆未必可执行有效——因拓扑变化、电量不足或历史结果不可靠,可能导致安全隐患。这类高相似但无效的记忆称为‘记忆陷阱’。这形成了安全与效率的权衡:仅按相似性复用成本低但不安全,始终调用本地推理更安全但耗能高。本文提出MemoGuard,一种轻量级自适应运行时,在复用记忆前验证其拓扑、资源和结果合约,仅当验证失败时才触发回退。在基于图的走廊巡查模拟器中,相比仅按相似性取最相近记忆(top-1),MemoGuard将电池安全违规减少76.6%;相比始终推理,减少21.4%的回退调用。在NVIDIA Jetson AGX Xavier上使用本地llama3.2:3b推理作为回退,每轮试验可避免3.67秒推理延迟与36.97焦耳能耗。代码已开源:https://github.com/hetheiin/memoguard。

原文摘要 · Abstract (English)

Communication-limited robots in mission-critical scenarios such as disaster inspection and search-and-rescue must make reliable onboard decisions without access to remote operators or high-capacity reasoning services. Episodic memory reuse is an attractive low-cost fallback, but retrieval similarity does not guarantee execution validity, i.e., a retrieved action may match the current context yet be unsafe due to changed topology, insufficient battery margin, or unreliable prior outcomes. We call such high-similarity but execution-invalid episodes memory traps. This creates a safety-efficiency design space where similarity only reuse minimizes fallback cost but can be unsafe, while always invoking local reasoning improves safety at high computational and energy cost. This paper presents MemoGuard, a lightweight adaptive runtime that validates episodic memories against topology, resource, and outcome contracts before reuse, invoking fallback only when validation fails. In a graph-based corridor-inspection simulator, MemoGuard reduces battery safety violations by 76.6% over similarity-only top-1 reuse while reducing fallback calls by 21.4% over always reasoning. On an NVIDIA Jetson AGX Xavier with local llama3.2:3b fallback reasoning, this corresponds to 3.67 s and 36.97 J of avoided fallback-reasoning overhead per trial. We open-source MemoGuard at https://github.com/hetheiin/memoguard.

机器人导航记忆验证轻量化运行时

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