AriGraph: Learning Knowledge Graph World Models with Episodic Memory for LLM Agents
Petr Anokhin, Nikita Semenov, Artyom Sorokin, Dmitry Evseev, Andrey Kravchenko, Mikhail Burtsev, Evgeny Burnaev
TL;DR
This work introduces AriGraph, a memory graph that fuses semantic knowledge with episodic memories to enable structured world modeling for LLM agents. Coupled with the Ariadne cognitive architecture, it supports planning, decision-making, and graph-guided navigation in interactive environments. Empirical evaluation across TextWorld, NetHack, and multi-hop QA demonstrates that AriGraph-empowered agents outperform unstructured memory baselines and RL agents, achieving near-human performance in some tasks and competitive QA results at lower cost. The results underscore the value of integrated, graph-based memories for scalable reasoning and exploration in partially observable domains, with avenues for multimodal extensions and richer graph-search strategies.
Abstract
Advancements in the capabilities of Large Language Models (LLMs) have created a promising foundation for developing autonomous agents. With the right tools, these agents could learn to solve tasks in new environments by accumulating and updating their knowledge. Current LLM-based agents process past experiences using a full history of observations, summarization, retrieval augmentation. However, these unstructured memory representations do not facilitate the reasoning and planning essential for complex decision-making. In our study, we introduce AriGraph, a novel method wherein the agent constructs and updates a memory graph that integrates semantic and episodic memories while exploring the environment. We demonstrate that our Ariadne LLM agent, consisting of the proposed memory architecture augmented with planning and decision-making, effectively handles complex tasks within interactive text game environments difficult even for human players. Results show that our approach markedly outperforms other established memory methods and strong RL baselines in a range of problems of varying complexity. Additionally, AriGraph demonstrates competitive performance compared to dedicated knowledge graph-based methods in static multi-hop question-answering.
