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:2609.13219v1 Announce Type: cross
Abstract: Neural correlates of spatial cognitive map are well documented, yet exactly how neural circuits perform spatial navigation in complex environments -...
By Yuhang He, Junfeng Zuo, Tianhao Chu, Si Wu
arXiv:2608.29114v1 Announce Type: cross
Abstract: Vision-and-Language Navigation (VLN) requires agents to reason over accumulated observations while continuously exploring unseen regions. However, ex...
By Yuxiang Xiao, Xibei Chen, Xin Zhou, Jie Chen, Yifeng Zhang, Guillaume Sartoretti
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
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
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