cs.MAMay 14, 2026

Multi-Agentic Approach for History Matching of Oil Reservoirs

Authors: Linar Samigullin, Sergei Shumilin, Evgeny Burnaev

Organizations: Skoltech, AI Center, Moscow, Russia · AIRI, Moscow, Russia

Abstract

History matching is a central inverse problem in reservoir engineering, where uncertain reservoir parameters must be calibrated against observations. Although automated history matching can reduce manual effort, practical deployment remains difficult because engineers must still configure heterogeneous workflows involving parameter selection, physically admissible bounds, optimizer choice, hyperparameter tuning, simulator execution, and diagnostic reporting. We propose PetroGraph, a multi-agent framework for intelligent reservoir history matching that decomposes this workflow into specialized agents for model review, experimental planning, parameterization, optimization, simulation, and summarization. The system combines large language model agents with domain-specific tools, retrieval-augmented access to simulator documentation, validation of modified ECLIPSE input decks, human-in-the-loop checkpoints, and an OPM Flow-based simulation backend. This design enables users to initiate and steer history matching through natural language while preserving explicit control over selected parameters and optimization settings. We evaluate PetroGraph on three reservoir models of increasing complexity: the synthetic SPE1 model, the faulted SPE9 benchmark, and the real-field Norne model. Using weighted normalized root mean square error as the objective, PetroGraph reduces the mismatch by 95% on SPE1, 69% on SPE9, and 13% on Norne. These results demonstrate that multi-agent orchestration can automate key decisions in history matching, lower the expertise barrier for operating complex simulation workflows, and provide a flexible foundation for extensible, domain-aware reservoir model adaptation.

Explore similar work

CardsList
May 1, 2026cs.AI

Towards Multi-Agent Autonomous Reasoning in Hydrodynamics

Single-agent systems (SAS) have become the default pattern for LLM-driven scientific workflows, but routing planning, tool use, and synthesis through a single context window comes with a well-known cost: as tool specifications and observational traces accumulate, the effective context available for each decision shrinks, and end-to-end reliability suffers. We present a multi-agent system (MAS) prototype for hydrodynamics in which specialized agents are coordinated through a Layer Execution Graph (LEG). A planner agent constructs query-specific execution topologies from natural-language routing heuristics that capture domain knowledge without hard-coding it as rigid control logic; specialist agents operate under strict tool allowlists and occupy complementary data-class roles. Between layers, consolidator agents fuse parallel outputs into concise briefs, and a reporter agent synthesizes the final response, while the runtime logs provenance for every tool invocation to support auditability. All benchmarks, ablations, and stress tests use Claude Sonnet~4.6 as the backbone model for both specialist and general-purpose agents. Evaluated on 37 queries spanning six complexity categories, the prototype achieves 93.6% factual precision with a 100% pass rate. Accuracy remains above 90% across runs from single-threaded to five independent parallel tracks, and under simulated loss of individual data sources the system degrades gracefully, still returning substantive partial answers. Together, these results suggest that planner-guided, graph-structured multi-agent orchestration can meaningfully alleviate the context-saturation bottlenecks that constrain monolithic single-agent architectures.
Jinpai Zhao, Albert Cerrone, Joannes Westerink +1
Multi-Agent ReasoningLlm-DrivenScientific WorkflowsConsolidationFluid Dynamics
AskPDF
Jul 26, 2026cs.AI

Focus Is All You Need: Adaptive Goal-aware Attention Orchestration for Multi-Agent Graph Systems

Large language models (LLMs) enable autonomous agents for reasoning, planning, and tool use. Recent systems increasingly organize these agents as graphs of specialized, interconnected nodes. Although graph-based orchestration supports flexible decomposition and coordination, it creates a key challenge: \textbf{attention allocation}. As workflows grow, existing approaches often execute graph components uniformly, wasting resources on irrelevant or low-impact tasks. We introduce \textbf{Attention Orchestration}, a paradigm that extends Transformer-style attention from token representations to workflow-level agent coordination. Our framework, \textbf{Adaptive Goal-aware Attention Orchestration (AGAO)}, dynamically estimates agent importance based on user objectives, graph dependencies, and computational constraints. AGAO combines three components: (1) goal-aware attention, measuring semantic relevance between user goals and agent capabilities; (2) topology-aware attention, modeling structural dependencies in agent graphs; and (3) resource-aware attention, allocating budgets and execution priorities across heterogeneous agents. Together, these mechanisms transform static agent graphs into adaptive systems that focus computation on goal-critical reasoning paths. Experiments across diverse multi-agent workloads show that AGAO improves task effectiveness while reducing unnecessary computation, latency, and token consumption compared with existing graph-based execution strategies. Our work establishes \textbf{Attention Engineering} as a direction for scalable, intelligent multi-agent systems. Code: https://github.com/MingzhouFan97/AGAO.
Mingzhou Fan, Siyuan Xu, Mingxuan Yuan
OrchestrationReasoning Paths
AskPDF
May 27, 2026cs.LG

Sequential Physics-Constrained Neural Operator Forward Modeling for the \textit{Norne} Reservoir System

We develop a comprehensive mathematical and computational framework for sequential surrogate modeling of three-phase black-oil reservoir dynamics using neural operators, with particular emphasis on Fourier Neural Operators (FNO) and their physics-informed variant (PINO). The application focus is the Norne benchmark reservoir, defined on a heterogeneous 46×112×2246\times112\times22 grid (N=113,344N=113,344 cells), with a production history spanning T=30T=30 timesteps covering 3298 days. Our theoretical contributions are organized around four interlocking problems: (1) functional-analytic formulation in a product-Sobolev-space setting, including well-posedness of the implicit timestep map and sharp local Lipschitz estimates; (2) covariate shift quantification, proving that the Wasserstein-2 distance grows as W2≤ε(Ln−1)/(L−1)W_2 \leq \varepsilon(L^n-1)/(L-1), with exponential population-risk discrepancy for L>1L>1; (3) physics-constrained spectral stability, showing PINO training with λR≥λR∗λ_R \geq λ^*_R reduces the learned Jacobian spectral radius to ρF+CλR−1/2ρ_F + Cλ_R^{-1/2}, yielding uniform-in-time rollout error ∣δn∣≤ε/(1−ρ)|δ_n| \leq \varepsilon/(1-ρ); and (4) KK-step TBPTT gradient analysis, deriving geometric bias decay O(ρK)O(ρ^K), optimal window K=O(log⁡(T/σ2))K^ = O(\log(T/σ^2)), and Adam convergence O(1/t)+O(ρK∗)O(1/\sqrt{t}) + O(ρ^{K^*}). Empirical validation confirms all theoretical predictions: autoregressive PINO surrogates sustain R2>0.99R^2>0.99 (oil), R2>0.90R^2>0.90 (gas), R2≈0.80R^2\approx 0.80 (pressure), and monotonically improving R2R^2 (water) across the full 3298-day horizon, trained on eight NVIDIA B200 GPUs in under one hour. A 1000-member ensemble runs in under one minute on a single B200 GPU, giving a ∼104×{\sim}10^4\times wall-clock speedup over the OPM finite-volume simulator.
Clement Etienam, Juntao Yang, Oleg Ovcharenko +4
Fourier Neural OperatorsNeural OperatorsSurrogate ModelingReservoirSequential
AskPDF