A Survey of Spatial Memory Representations for Efficient Robot Navigation

• URL: http://arxiv.org/abs/2604.16482v1
• Date: Mon, 13 Apr 2026 02:12:17 GMT
• Title: A Survey of Spatial Memory Representations for Efficient Robot Navigation
• Abstract summary: Survey examines the spatial memory efficiency problem across 88 references spanning 52 systems.<n>We introduce the $= M_textpeak / M_textmap$, the ratio of peak runtime memory (the total RAM or GPU memory consumed during operation) to saved map size.
• Score: 4.560386676154887
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: As vision-based robots navigate larger environments, their spatial memory grows without bound, eventually exhausting computational resources, particularly on embedded platforms (8-16GB shared memory, $<$30W) where adding hardware is not an option. This survey examines the spatial memory efficiency problem across 88 references spanning 52 systems (1989-2025), from occupancy grids to neural implicit representations. We introduce the $α= M_{\text{peak}} / M_{\text{map}}$, the ratio of peak runtime memory (the total RAM or GPU memory consumed during operation) to saved map size (the persistent checkpoint written to disk), exposing the gap between published map sizes and actual deployment cost. Independent profiling on an NVIDIA A100 GPU reveals that $α$ spans two orders of magnitude within neural methods alone, ranging from 2.3 (Point-SLAM) to 215 (NICE-SLAM, whose 47,MB map requires 10GB at runtime), showing that memory architecture, not paradigm label, determines deployment feasibility. We propose a standardized evaluation protocol comprising memory growth rate, query latency, memory-completeness curves, and throughput degradation, none of which current benchmarks capture. Through a Pareto frontier analysis with explicit benchmark separation, we show that no single paradigm dominates within its evaluation regime: 3DGS methods achieve the best absolute accuracy at 90-254,MB map size on Replica, while scene graphs provide semantic abstraction at predictable cost. We provide the first independently measured $α$ reference values and an $α$-aware budgeting algorithm enabling practitioners to assess deployment feasibility on target hardware prior to implementation.

Related papers

• MEMOBench: A Process Level Memory Benchmark for Robotic Manipulation [36.81053166644513]
  We present textbfMEMOBench, a benchmark for process level memory evaluation in robotic manipulation.<n>MEMOBench includes 30 history dependent tasks, 1,500 expert demonstrations, and 4,200 executable checkpoint instances from 84 templates.
  arXiv  Detail & Related papers  (2026-09-07T05:06:20Z)
• eMEM: A Hybrid Spatio-Temporal Memory System For Embodied Agents [1.8047694351309203]
  We present eMEM, a hybrid graph-based memory system for embodied agents operating in physical environments.<n>eMEM fills this gap with a multi-index architecture (ITE for structured storage, hlib for approximate nearest neighbour semantic search, and an R-tree for spatial queries)<n>We also introduce eMEM-Bench v1, a benchmark we construct over ProcTHOR-10K scenes for embodied memory evaluation.
  arXiv  Detail & Related papers  (2026-06-02T09:22:12Z)
• Omni-SimpleMem: Autoresearch-Guided Discovery of Lifelong Multimodal Agent Memory [76.63021613850093]
  We deploy an autonomous research pipeline to discover Omni-SimpleMem, a unified multimodal memory framework for lifelong AI agents.<n>System achieves state-of-the-art on two benchmarks, improving F1 by +411% on LoCoMo and +214% on Mem-Gallery.<n>We provide a taxonomy of six discovery types and identify four properties that make multimodal memory particularly suited for autoresearch.
  arXiv  Detail & Related papers  (2026-04-01T15:06:23Z)
• Semantic Zone-Based Map Management for Stable AI-Integrated Mobile Robots [0.552480439325792]
  We propose a semantic zone-based map management approach to stabilize dense-map utilization under memory constraints.<n>We evaluate the proposed approach in large-scale simulated indoor environments and on an NVIDIA Jetson Orin Nano under concurrent SLAM-VLM execution.
  arXiv  Detail & Related papers  (2026-03-31T11:50:14Z)
• RoboMME: Benchmarking and Understanding Memory for Robotic Generalist Policies [54.23445842621374]
  Memory is critical for long-horizon and history-dependent robotic manipulation.<n>Recent vision-language-action (VLA) models have begun to incorporate memory mechanisms.<n>We introduce RoboMME: a large-scale standardized benchmark for evaluating and advancing VLA models.
  arXiv  Detail & Related papers  (2026-03-04T21:59:32Z)
• Memory-Efficient Structured Backpropagation for On-Device LLM Fine-Tuning [10.913120072779193]
  On-device fine-tuning enables privacy-preserving personalization of large language models.<n>Mobile devices impose severe memory constraints, typically 6--12GB shared across all workloads.<n>We propose Memory-efficient Structured Backpropagation (MeSP)<n>MeSP reduces peak memory from 361MB to 136MB for Qwen2.5-0.5B, enabling fine-tuning scenarios previously infeasible.
  arXiv  Detail & Related papers  (2026-02-13T16:24:33Z)
• Semantic Zone based 3D Map Management for Mobile Robot [0.552480439325792]
  3D maps consume substantial memory, making it difficult to maintain complete map data within limited computational resources.<n>Existing SLAM frameworks typically rely on geometric distance or temporal metrics for memory management.<n>We propose a semantic zone-based 3D map management method that shifts the paradigm from geometry-centric to semantics-centric control.
  arXiv  Detail & Related papers  (2025-12-13T07:55:40Z)
• SHARe-KAN: Holographic Vector Quantization for Memory-Bound Inference [0.0]
  Vision KANs exhibit a holographic topology, where information is distributed across the interference of splines rather than localized to specific edges.<n>We present SHARe-KAN, a framework utilizing Gain-Shape-Bias Vector Quantization to exploit functional redundancy while preserving the dense topology.
  arXiv  Detail & Related papers  (2025-12-10T04:10:13Z)
• xMem: A CPU-Based Approach for Accurate Estimation of GPU Memory in Deep Learning Training Workloads [2.2991119948183525]
  estimation of how much GPU memory a job will require is fundamental to enabling advanced scheduling and GPU sharing.<n>We propose xMem, a novel framework that leverages CPU-only dynamic analysis to accurately estimate peak GPU memory requirements.<n>The analysis of 5209 runs, which includes ANOVA and Monte Carlo results, highlights xMem's benefits.
  arXiv  Detail & Related papers  (2025-10-23T23:16:27Z)
• Rethinking Memory in AI: Taxonomy, Operations, Topics, and Future Directions [55.19217798774033]
  Memory is a fundamental component of AI systems, underpinning large language models (LLMs)-based agents.<n>In this survey, we first categorize memory representations into parametric and contextual forms.<n>We then introduce six fundamental memory operations: Consolidation, Updating, Indexing, Forgetting, Retrieval, and Compression.
  arXiv  Detail & Related papers  (2025-05-01T17:31:33Z)
• Memory-Efficient Training for Deep Speaker Embedding Learning in Speaker Verification [50.596077598766975]
  We explore a memory-efficient training strategy for deep speaker embedding learning in resource-constrained scenarios.<n>For activations, we design two types of reversible neural networks which eliminate the need to store intermediate activations.<n>For states, we introduce a dynamic quantization approach that replaces the original 32-bit floating-point values with a dynamic tree-based 8-bit data type.
  arXiv  Detail & Related papers  (2024-12-02T06:57:46Z)
• MCUNetV2: Memory-Efficient Patch-based Inference for Tiny Deep Learning [72.80896338009579]
  We find that the memory bottleneck is due to the imbalanced memory distribution in convolutional neural network (CNN) designs. We propose a generic patch-by-patch inference scheduling, which significantly cuts down the peak memory. We automate the process with neural architecture search to jointly optimize the neural architecture and inference scheduling, leading to MCUNetV2.
  arXiv  Detail & Related papers  (2021-10-28T17:58:45Z)
• ROME: Robustifying Memory-Efficient NAS via Topology Disentanglement and Gradient Accumulation [106.04777600352743]
  Differentiable architecture search (DARTS) is largely hindered by its substantial memory cost since the entire supernet resides in the memory. The single-path DARTS comes in, which only chooses a single-path submodel at each step. While being memory-friendly, it also comes with low computational costs. We propose a new algorithm called RObustifying Memory-Efficient NAS (ROME) to give a cure.
  arXiv  Detail & Related papers  (2020-11-23T06:34:07Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.