Search arXiv⌕ Search

arXiv · 2610.06254

Fast and Stable Nonlinear Emulation of TIEGCM Using an Autoregressive SINDy Framework

Abstract

The ever-growing number of satellites and resident space objects in low Earth orbit keeps increasing the risk of collision between these objects. To mitigate this risk, the development of new space situational awareness tools and a new generation of probabilistic emulators of the thermosphere is increasingly felt by the community of operators and scientists. We previously built a Reduced Order Probabilistic Emulator based on 3 steps: dimensionality reduction, dynamic modeling, and uncertainty quantification. Here we further develop the dynamic modeling side within ROPE using a class of stable and autoregressive nonlinear models inspired by SINDy, a framework for the identification of the nonlinear dynamics. We use this framework, which we call SINDy-AR, to emulate the thermospheric density simulated by TIEGCM. This is also the first time a SINDy-AR framework is applied to such a high dimensional system as the thermospheric emulation because of its complexity. The dynamical emulators are selected on stability and accuracy criteria, so that they can be relied on in operations and space situational awareness applications. Building surrogate models with SINDy-AR can show dynamical differences between the learned emulations. The state-dependent structure of the TIEGCM emulation shows compatibility with the presence of terdiurnal, 27-day linked to solar rotation, semiannual, and annual tidal waves. The execution speedup of the whole SINDy-AR pipeline with respect to TIEGCM 2.0 is about 90,000 times, which makes the new framework capable of being deployed on board a satellite given the low computational constraints it would be subjected to.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Daniele Sicoli, Sriram Narayanan, Piyush M. Mehta. 2026-10-05. Fast and Stable Nonlinear Emulation of TIEGCM Using an Autoregressive SINDy Framework. https://arxiv.org/abs/2610.06254

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

KEEP EXPLORING

Related papers

Residual Bias Compensation Dual Extended Kalman Filter for Physics-Based SOC Estimation in Lithium Iron Phosphate Batteries

This paper addresses state of charge (SOC) estimation for lithium iron phosphate (LFP) batteries, where the relatively flat open-circuit voltage (OCV-SOC) characteristic reduces observability. A residual bias compensation dual extended Kalman filter (RBC-DEKF) is developed. Unlike conventional bias compensation methods that treat the bias as an augmented state within a single filter, the proposed dual-filter structure decouples residual bias estimation from electrochemical state estimation. One EKF estimates the system states of a control-oriented parameter-grouped single particle model with thermal effects, while the other EKF estimates a residual bias that continuously corrects the voltage observation equation, thereby refining the model-predicted voltage in real time. Unlike bias-augmented single-filter schemes that enlarge the covariance coupling, the decoupled bias estimator refines the voltage observation without perturbing electrochemical state dynamics. Validation is conducted on an LFP cell from a public dataset under three representative operating conditions: US06 at 0 degC, DST at 25 degC, and FUDS at 50 degC. Compared with a conventional EKF using the same model and identical state filter settings, the proposed method reduces the average SOC RMSE from 3.75% to 0.20% and the voltage RMSE between the filtered model voltage and the measured voltage from 32.8 mV to 0.8 mV. The improvement is most evident in the mid-SOC range where the OCV-SOC curve is flat, confirming that residual bias compensation significantly enhances accuracy for model-based SOC estimation of LFP batteries across a wide temperature range.

eess.SY↗

Distributed Coordination Algorithms with Efficient Communication for Open Multi-Agent Systems with Dynamic Communication Links and Processing Delays: Extended Version

In this paper we focus on the distributed quantized average consensus problem in open multi-agent systems consisting of dynamic directed communication links among active nodes. We propose three communication-efficient distributed algorithms designed for different scenarios. Our first algorithm solves the quantized averaging problem over the currently active node set under finite network openness (i.e., when the active set eventually stabilizes). Our second algorithm extends the aforementioned approach for the case where nodes suffer from arbitrary bounded processing delays. Our third algorithm operates over indefinitely open multi-agent networks with dynamic communication links (i.e., with continuous node arrivals and departures), computing the average that incorporates both active and historically active nodes. We analyze our algorithms' operation, establish their correctness, and present novel necessary and sufficient topological conditions ensuring their finite-time convergence. Numerical simulations on distributed sensor fusion for environmental monitoring demonstrate fast finite-time convergence and robustness across varying network sizes, departure/arrival rates, and processing delays. Finally, it is shown that our proposed algorithms compare favorably to algorithms in the existing literature.

eess.SY↗

Toward Single-Step MPPI via Differentiable Predictive Control

Model predictive path integral (MPPI) is a sampling-based method for solving complex model predictive control (MPC) problems, but its real-time implementation is challenged by computational and sample requirements that grow with the prediction horizon, as well as sensitivity to manually tuned sampling parameters. To address these issues, we propose Step-MPPI, a framework that learns a sampling distribution and MPPI parameters for efficient single-step lookahead MPPI. Specifically, a neural network parameterizes the MPPI sampling mean and covariance at each time step, while the single-step cost weights and temperature are jointly learned in a self-supervised manner over long horizons using the MPC cost, constraint penalties, and maximum-entropy regularization. By embedding long-horizon objectives into the learned cost and sampling policy, Step-MPPI achieves the foresight of multi-step optimization with the millisecond-level latency of single-step lookahead. We demonstrate its efficiency across challenging tasks involving high-dimensional systems and/or long control horizons.

eess.SY↗