OOWM: Structuring Embodied Reasoning and Planning via Object-Oriented Programmatic World Modeling

• URL: http://arxiv.org/abs/2604.09580v1
• Date: Wed, 25 Feb 2026 16:01:07 GMT
• Title: OOWM: Structuring Embodied Reasoning and Planning via Object-Oriented Programmatic World Modeling
• Abstract summary: We propose Object-Oriented World Modeling (OOWM), a novel framework that structures embodied reasoning through the lens of software engineering formalism.<n>OOWM employs Class Diagrams to ground visual perception into rigorous object hierarchies, and Activity Diagrams to operationalize planning into executable control flows.
• Score: 62.3458279176813
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Standard Chain-of-Thought (CoT) prompting empowers Large Language Models (LLMs) with reasoning capabilities, yet its reliance on linear natural language is inherently insufficient for effective world modeling in embodied tasks. While text offers flexibility, it fails to explicitly represent the state-space, object hierarchies, and causal dependencies required for robust robotic planning. To address these limitations, we propose Object-Oriented World Modeling (OOWM), a novel framework that structures embodied reasoning through the lens of software engineering formalisms. We redefine the world model not as a latent vector space, but as an explicit symbolic tuple $W = \langle S, T \rangle$: a State Abstraction ($G_\text{state}$) instantiating the environmental state $S$, coupled with a Control Policy ($G_\text{control}$) representing the transition logic $T: S \times A \rightarrow S'$. OOWM leverages the Unified Modeling Language (UML) to materialize this definition: it employs Class Diagrams to ground visual perception into rigorous object hierarchies, and Activity Diagrams to operationalize planning into executable control flows. Furthermore, we introduce a three-stage training pipeline combining Supervised Fine-Tuning (SFT) with Group Relative Policy Optimization (GRPO). Crucially, this method utilizes outcome-based rewards from the final plan to implicitly optimize the underlying object-oriented reasoning structure, enabling effective learning even with sparse annotations. Extensive evaluations on the MRoom-30k benchmark demonstrate that OOWM significantly outperforms unstructured textual baselines in planning coherence, execution success, and structural fidelity, establishing a new paradigm for structured embodied reasoning.

Related papers

• StrucTab: A Structured Optimization Framework for Table Parsing [33.4550862402289]
  StrucTab is a table parsing model learned through intermediate structural supervision and reward decomposition.<n>At the modeling level, by decomposing the parsing process into human-inspired subtasks, StrucTab progressively unifies them through a sequential reasoning strategy.<n>At the optimization level, we introduce Uni-TabRL, a unified RL framework that leverages decomposed rewards to provide stable and informative optimization signals.
  arXiv  Detail & Related papers  (2026-06-29T07:41:39Z)
• SCAIR: Schema-Conditioned Agentic Iterative Reasoning for Enterprise Knowledge Graphs [27.13201901180446]
  Knowledge Graph-based Retrieval-Augmented Generation (KG-RAG) enables natural language interaction with structured enterprise knowledge.<n>Existing agentic approaches that perform well on public benchmarks often fail to generalize to real-world enterprise Knowledge Graphs.<n>We propose SCAIR (Conditioned Agentic Iterative Reasoning), a training-free framework that integrates structured planning with controlled iterative reasoning.
  arXiv  Detail & Related papers  (2026-06-02T16:14:23Z)
• Steered Generation via Gradient-Based Optimization on Sparse Query Features [1.587869707099313]
  Prototype-Based Sparse Steering is a framework that applies Sparse Autoencoders specifically to query activations.<n>We demonstrate that sparse query representations provide the necessary disentanglement for unified, interpretable control over both logical planning and stylistic nuance.
  arXiv  Detail & Related papers  (2026-05-21T21:13:14Z)
• Beyond the Academic Monoculture: A Unified Framework and Industrial Perspective for Attributed Graph Clustering [75.50670592447219]
  Attributed Graph Clustering (AGC) is a fundamental unsupervised task that partitions nodes into cohesive groups by jointly modeling structural topology and node attributes.<n>This survey provides a comprehensive, industrially grounded review of AGC from three complementary perspectives.
  arXiv  Detail & Related papers  (2026-03-21T14:15:34Z)
• LOGIGEN: Logic-Driven Generation of Verifiable Agentic Tasks [4.6880826836662814]
  We introduce textbfLOGIGEN, a logic-driven framework that synthesizes verifiable training data.<n>On $2$-Bench, LOGIGEN-32B(RL) achieves a textbf79.5% success rate, substantially outperforming the base model.
  arXiv  Detail & Related papers  (2026-02-28T08:35:30Z)
• PILOT: Planning via Internalized Latent Optimization Trajectories for Large Language Models [51.43746425777865]
  Large Language Models (LLMs) often lack the capacity to formulate global strategies, leading to error propagation in long-horizon tasks.<n>We propose PILOT, a framework designed to internalize the strategic oversight of large models into intrinsic Latent Guidance.
  arXiv  Detail & Related papers  (2026-01-07T12:38:56Z)
• Executable Analytic Concepts as the Missing Link Between VLM Insight and Precise Manipulation [70.8381970762877]
  Vision-Language Models (VLMs) have demonstrated remarkable capabilities in semantic reasoning and task planning.<n>We introduce GRACE, a novel framework that grounds VLM-based reasoning through executable analytic concepts.<n>G GRACE provides a unified and interpretable interface between high-level instruction understanding and low-level robot control.
  arXiv  Detail & Related papers  (2025-10-09T09:08:33Z)
• Dynamic Generation of Multi-LLM Agents Communication Topologies with Graph Diffusion Models [99.85131798240808]
  We introduce a novel generative framework called textitGuided Topology Diffusion (GTD)<n>Inspired by conditional discrete graph diffusion models, GTD formulates topology synthesis as an iterative construction process.<n>At each step, the generation is steered by a lightweight proxy model that predicts multi-objective rewards.<n>Experiments show that GTD can generate highly task-adaptive, sparse, and efficient communication topologies.
  arXiv  Detail & Related papers  (2025-10-09T05:28:28Z)
• UML-CoT: Structured Reasoning and Planning with Unified Modeling Language for Robotic Room Cleaning [18.505621596668163]
  Chain-of-Thought (CoT) prompting improves reasoning in large language models (LLMs), but its reliance on unstructured text limits interpretability and executability in embodied tasks.<n>We propose a structured reasoning and planning framework that leverages Unified Modeling Language (UML) to generate symbolic CoTs and executable action plans.
  arXiv  Detail & Related papers  (2025-09-26T17:51:46Z)
• Unveiling the Potential of Diffusion Large Language Model in Controllable Generation [36.05635830551406]
  Even state-of-the-art autoregressive Large Language Models (LLMs) exhibit unreliability when required to generate structured output.<n>Inspired by the current new diffusion-based large language models (dLLM), we realize that the architectural difference may be the key to unlock next-level controllable generation.<n>We propose Self-adaptive Scaffolding, a novel framework that enables dLLM to stably generate reliable structured outputs.
  arXiv  Detail & Related papers  (2025-07-06T18:41:34Z)
• Deliberate Planning in Language Models with Symbolic Representation [5.869782631289138]
  We introduce SymPlanner, a novel framework that equips large language models with structured planning capabilities.<n>Rather than relying purely on natural language reasoning, SymPlanner grounds the planning process in a symbolic state space.<n>Iterative Correction (IC) refines previously proposed actions by leveraging feedback from the symbolic environment.<n>Contrastive Ranking (CR) enables fine-grained comparison of candidate plans by evaluating them jointly.
  arXiv  Detail & Related papers  (2025-05-02T15:18:03Z)
• On The Planning Abilities of OpenAI's o1 Models: Feasibility, Optimality, and Generalizability [59.72892401927283]
  We evaluate the planning capabilities of OpenAI's o1 models across a variety of benchmark tasks. Our results reveal that o1-preview outperforms GPT-4 in adhering to task constraints.
  arXiv  Detail & Related papers  (2024-09-30T03:58:43Z)
• Autoregressive Structured Prediction with Language Models [73.11519625765301]
  We describe an approach to model structures as sequences of actions in an autoregressive manner with PLMs. Our approach achieves the new state-of-the-art on all the structured prediction tasks we looked at.
  arXiv  Detail & Related papers  (2022-10-26T13:27:26Z)

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.