This research implements a Goal-Oriented Graph framework that improves procedural reasoning in complex Minecraft tasks, suggesting a better approach for LLMs.
• A Goal-Oriented Graph (GoG) framework for LLM procedural reasoning. • Models goal dependencies to overcome fragmentation of entity-centric graphs. • Goal-driven retrieval constructs coherent reasoning chains to guide LLM agents. • Significantly outperforms state-of-the-art GraphRAG in complex Minecraft tasks. Large Language Models (LLMs) demonstrate impressive general capabilities but often struggle with step-by-step procedural reasoning, a critical challenge in complex interactive environments. While retrieval-augmented methods like GraphRAG attempt to bridge this gap, their fragmented entity-relation graphs hinder the construction of coherent, multi-step plans. In this paper, we propose a novel framework based on Goal-Oriented Graphs (GoGs), where each node represents a goal and edges encode logical dependencies between them. This structure enables the explicit retrieval of causal reasoning paths by identifying a high-level goal and recursively retrieving its prerequisites, forming a coherent chain to guide the LLM. Through extensive experiments on the Minecraft testbed, a domain that demands robust multi-step planning and provides rich procedural knowledge, we demonstrate that GoG substantially improves procedural reasoning and significantly outperforms GraphRAG and other state-of-the-art baselines.
No takes yet. Share an insight, caveat, or question.
Leung et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: