arXiv AI By Yuzhe Han, Mingkun Xu, Yujie Wu

Compact Bellman-Grounded Cognitive Maps for Cost-Aware Navigation

Read the original on arXiv AI →

Compact Bellman-Grounded Cognitive Maps (BCM) are introduced as a new method for cost-aware navigation that reuses a single learned map for different goals without per-goal retraining. BCM grounds the map in local edge costs using a self-supervised Bellman objective and a compact coordinate encoding, achieving near-optimal performance on weighted grids up to 1600 nodes with only a 5% mean gap to exact Dijkstra search. Its memory footprint grows sublinearly with graph size, outperforming connectivity-based spectral baselines and demonstrating scalability to complex environments.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Oct 1

Do Better Goal Representations Improve Goal-Conditioned Reinforcement Learning?

The paper investigates whether enhancing goal representations improves goal-conditioned reinforcement learning (GCRL) performance. By creating an exact temporal-distance goal representation in deterministic mazes and systematically degrading its geometric quality, the authors find that changes in goal representation have little effect on performance. In contrast, degrading the agent’s current state representation more than doubles failure rates, indicating that state representation is the critical bottleneck. The study further demonstrates that simple random Fourier positional encodings can significantly boost performance on challenging navigation tasks without additional map or objective modifications.

By Syed Nazmus Sakib, Abdul Monaf Chowdhury, Nafiul Haque, Shifat E Arman, Md Mehedi Hasan
arXiv AI
Aug 25

SRMT: Shared Memory for Multi-agent Lifelong Pathfinding

The paper introduces the Shared Recurrent Memory Transformer (SRMT), a decentralized multi‑agent reinforcement learning framework that uses a global memory workspace for agents to broadcast and query each other’s learned states. SRMT is evaluated on the Partially Observable Multi‑Agent Pathfinding (PO‑MAPF) problem, showing that shared memory enables emergent coordination even with minimal reward guidance and outperforms existing baselines on the Bottleneck task and scales competitively on larger POGEMA maps. The authors provide open‑source code for training and evaluation on GitHub.

By Alsu Sagirova, Yuri Kuratov, Mikhail Burtsev
arXiv AI
Sep 17

Mem2Ego: Empowering Vision-Language Models with Global-to-Ego Memory for Long-Horizon Embodied Navigation

Mem2Ego introduces a vision‑language model for embodied navigation that combines global memory with egocentric visual inputs. By adaptively retrieving task‑relevant cues from a global memory module and aligning them with local perception, the framework improves spatial reasoning and decision‑making over long horizons. The method outperforms prior state‑of‑the‑art approaches on the HSSD and HM3D benchmarks and shows strong performance on a real robot.

By Lingfeng Zhang, Yuecheng Liu, Zhanguang Zhang, Matin Aghaei, Yixin Xiao, Yaochen Hu, Mohammad Ali Alomrani, David Gamaliel Arcos Bravo, Hongjian Gu, Zhiyuan Li, Yangzheng Wu, Zhanpeng Zhang, Raika Karimi, Atia Hamidizadeh, Guowei Huang, Haoping Xu, Tongtong Cao, Weichao Qiu, Xingyue Quan, Jianye Hao, Yuzheng Zhuang, Yingxue Zhang
arXiv AI
Oct 31

Escaping Path Mirages in Offline Goal-Conditioned Reinforcement Learning

The paper introduces Branch-aware Graph Planning (BGP), a method for offline goal-conditioned reinforcement learning that tackles the problem of path mirages in stochastic, long-horizon environments. BGP models stochastic branching by treating high-variability points as graph nodes and learns goal-conditioned edges with segmented learning to avoid unreliable branches and reduce unnecessary stochasticity. Experiments on diverse OGBench tasks demonstrate that BGP substantially outperforms existing state-of-the-art offline goal-conditioned RL approaches.

By Junhyeon Bae, Jaebak Hwang, Gwanwoo Choi, Minung Kim, Seungyul Han