Search arXivSearch

arXiv · 2609.05356

Data-Driven Generator Transient Prediction for Digital Twin Decision Support

Abstract

This paper develops a calibrated transient forecasting surrogate model for generator digital twin (DT) decision support that evaluates planned active- and reactive power load commands before they are applied. The proposed event-conditioned Hankel Dynamic Mode Decomposition with Control (Hankel-DMDc) model combines delay-coordinate lifting, command-event memory features, and an event-weighted Hankel basis so that sparse load-transition dynamics influence the reduced representation and fitted dynamics. This design targets intervals where voltage/frequency deviations and recovery behavior determine whether a candidate load command keeps the system within acceptable limits. To provide operator-facing confidence information, a split-conformal calibration layer is applied to the frozen surrogate model to form event-conditioned joint prediction bands for voltage and frequency. The experimental results show event-window root-mean-square errors of 1.058 V and 0.155 Hz. For a nominal 90% target, the bands attain 90.17% pointwise joint voltage-frequency coverage, with mean band widths of 3.55 V and 0.566 Hz. A 50-s open-loop rollout is computed in 181 ms on a single CPU core, approximately 280 times faster than real time, with forecast accuracy evaluated over horizons up to 5 s. These results demonstrate a computationally efficient advisory framework for generator DTs that combines transient prediction with calibrated uncertainty.

Explore related subjects

Keep this discovery

BibTeXRIS

Emad Sadeghi, Emerson Miller, Kerry Sado, Adel Nasiri. 2026-09-04. Data-Driven Generator Transient Prediction for Digital Twin Decision Support. https://arxiv.org/abs/2609.05356

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

A simple derivation of the Kalman filter

In this lecture note, we present a concise and self-contained derivation of the discrete-time Kalman filter equations that requires only a basic understanding of least squares estimation. The treatment is designed to minimize mathematical overhead while preserving both rigor and generality.

math.OC

Constrained Parameter Update Law for Adaptive Control

In this paper, constrained parameter update laws for adaptive control are developed using barrier constraints. An interpretation of the parameter update law from a constrained optimization problem, in which a regularized Barrier saddle function is formulated to incorporate parameter constraints using inverse and logarithmic barrier functions from interior-point methods. The resulting constrained update law is integrated with an adaptive trajectory tracking controller, enabling online learning of the unknown system model parameters. Forward invariance of the parameter estimate is established and Lyapunov stability of the closed-loop system with the constrained parameter update law is derived. The effectiveness of the proposed constrained adaptive control law is demonstrated through simulations, which validate its ability to maintain parameter estimates within prescribed bounds while ensuring convergence to the true parameter values and achieving steady state tracking performance.

math.OC

Biased Backpressure Routing for Multihop Wireless Networks with Heterogeneous Interfaces

Heterogeneous-interface multihop wireless networks (Het-MuNets) are emerging as a promising paradigm for tactical networks and for infrastructure-light applications such as vehicular communications, wireless backhaul, and non-terrestrial connectivity. To exploit the diverse profiles of heterogeneous communication technologies in penetration, interference, and bandwidth, packet-to-interface assignment must be determined on a per-hop basis, making routing and scheduling highly complex. In this work, we develop a unified framework for joint packet routing, link scheduling, and interface assignment in Het-MuNets with multiple concurrent flows. By modeling packet-to-interface assignment as transmission between virtual subnodes, we transform interface assignment into intra-device virtual routing, which is solved jointly with physical routing and scheduling under a unified multi-layer shortest path-biased Backpressure (SP-BP) scheme. Numerical results demonstrate that the proposed framework outperforms SP-BP operating on other baseline graph models and non-backpressure routing schemes in goodput, latency, and packet delivery rate.

cs.NI