Search NASA⌕ Search

SEARCH · Search NASA

Results for “ODE fitting”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

An ODE-Fitting Approach to Estimate Critical Aircraft Performance Parameters for Trajectory Prediction

Ground-based decision support tools (DST) in air traffic management (ATM) typically perform trajectory prediction based on aircraft performance model (APM) parameters, but some or all of these parameters might not be readily available. In particular, the three critical parameters required for trajectory prediction are the thrust setting, drag coefficients, and takeoff weight of the aircraft. Unfortunately, these parameters are coupled and appear together in physics-based kinetic models. Past approaches utilize data from a specific phase of flight (climb, level flight or descent), where one or more of the parameters are assumed to be known and estimate the remaining unknown parameters. This approach introduces bias/errors and also does not extend to scenarios where all of the above parameters are not known with sufficient accuracy. This paper is the first of its kind to propose a generalized framework for simultaneous estimation of all three critical APM parameters (thrust, drag, and mass). The proposed approach utilizes data from both the climb and descent phases and fits the ordinary differential equation for altitude in each phase using historical trajectory data available from radar tracks or ADS-B. The approach yields a set of optimized APM parameters that are best suited to fit each historical flight record. The methodology is applied on on sample flights from three different aircraft types, and the results demonstrate low fit error and consequently will yield a high level of prediction accuracy.

trajectory prediction, aircraft performance model,↗

An ODE-Fitting Approach to Estimate Critical Aircraft Performance Parameters for Trajectory Prediction

Ground-based decision support tools (DST) in air traffic management (ATM) typically perform trajectory prediction based on aircraft performance model (APM) parameters, but some or all of these parameters might not be readily available. In particular, the three critical parameters required for trajectory prediction are the thrust setting, drag coefficients, and takeoff weight of the aircraft. Unfortunately, these parameters are coupled and appear together in physics-based kinetic models. Past approaches utilize data from a specific phase of flight (climb, level flight or descent), where one or more of the parameters are assumed to be known and estimate the remaining unknown parameters. This approach introduces bias/errors and also does not extend to scenarios where all of the above parameters are not known with sufficient accuracy. This paper is the first of its kind to propose a generalized framework for simultaneous estimation of all three critical APM parameters (thrust, drag, and mass). The proposed approach utilizes data from both the climb and descent phases and fits the ordinary differential equation for altitude in each phase using historical trajectory data available from radar tracks or ADS-B. The approach yields a set of optimized APM parameters that are best suited to fit each historical flight record. The methodology is applied on on sample flights from three different aircraft types, and the results demonstrate low fit error and consequently will yield a high level of prediction accuracy.

trajectory prediction↗

Machine Learning based Aircraft Performance Model Estimation for Trajectory Prediction

The accurate prediction of aircraft trajectory by ground-based decision support tools is a critical component of air traffic management in the US National Airspace System (NAS). Accurate predictions of where the aircraft will be in the future or when they will arrive at specific locations (e.g., fixes) is a key enabler for sequencing and efficient arrival management of flights. Traditional physics based aircraft trajectory prediction relies on a simplified point-mass total energy model whose parameters are referred to as Aircraft Performance Model (APM) parameters. Even though the performance coefficients and weight of an aircraft are a vital part of the aircraft performance model’s predictions and accuracy, these coefficients are proprietary in nature and therefore, unavailable to decision-support tools. Current approaches freeze some coefficients to default base of aircraft data (BADA) values and optimize others. However, the APM parameters are highly coupled by the flight dynamics and prioritizing one parameter over others leads to bias and skewed predictions. To alleviate this problem, we provide a combined optimization framework to predict all the critical (thrust, drag and weight) APM parameters. This paper is focused on training Machine Learning (ML) models that map historical flights to optimized APM parameters that provide the best fit (in terms of prediction error). Our dataset obtained from NASA’s Sherlock data warehouse is comprised of thousands of historical flights and includes weather and track data collected from 2019. Using different subsets of relevant features (e.g., aircraft type), we trained several ML models to estimate the aircraft’s take off weight, drag polar coefficients (both parasitic and lift induced), and thrust settings (multiplier applied to the maximum engine thrust). The chosen flights are from three of the most common aircraft types (B738, B737, and A320) arriving at four airports (LAX, DEN, MSP, and DFW). Our ML approach is comprised of two different solutions: 1- using a subset of features that are known prior to the flight departure and do not change during flight (such as engine type, current temperature at departure & destination airports, aircraft type) and 2 - using a subset of temporal features of the flight trajectory (such as cruise altitude, Mach, airspeed, and rate of climb) in addition to the pre-departure features from the first solution. The labels or target variables are the APM parameters that were obtained by an optimized ordinary differential equations (ODE) fitting process (applied to individual flights). The ODE-fitting is very time intensive and is therefore performed offline. Thus, training an ML model to learn the relationship between the flight features and ODE-generated labels enables faster estimation of the APM parameters and is therefore amenable to real-time prediction. Various ML models including linear regression, random forest, XGBoost, and neural network were trained, and the results are compared. After model validation and hyperparameter-tuning, we observed that the Random Forest model outperformed the other three models by the overall mean square error (MSE) of 2% for the first solution and 1.5% for the second solution. Finally, the ML-derived parameters are compared against default BADA APM parameters using NASA’s Autonomy Development toolkit (ADK) simulation software. The simulation results for one of each aircraft type is shown and discussed.

Aida Sharif Rohani↗

Machine Learning Approach for Aircraft Performance Model Parameter Estimation for Trajectory Prediction Applications

Inaccurate prediction of aircraft trajectory by ground-based decision support tools (DST) is a major concern in air traffic management (ATM). Aircraft trajectory prediction tools rely on a simplified point-mass aircraft performance model (APM) to make their predictions. Even though the performance coefficients and weight of an aircraft are a vital part of the APM’s predictions and accuracy, these coefficients are proprietary in nature and therefore, unavailable to DSTs. Current ATM research focuses on improving the estimate of some APM parameters by freezing all other coefficients. This simplified approach introduces unwanted sources of bias and negatively impacts the accuracy of the performance model. In this paper, we apply machine learning (ML) techniques for the simultaneous prediction of three key APM parameters (two drag coefficients and the initial aircraft weight). To accomplish this, we employ an ordinary differential equation (ODE) fitting approach to generate optimized APM parameter labels customized to each individual flight record. Subsequently, we train ML models to capture the relationship between the historical data and the optimized APM parameters. Two different ML model solutions are applied and APM coefficients are predicted for unseen flights. The results indicate that the ML models are able to capture the relationship between APM parameters and flight-related features with good accuracy.

trajectory prediction, machine learning, aircraft ↗

PBX9012 Tracker Gauge Data

Five shock-to-detonation transition (SDT) gas gun experiments for PBX 9012 were performed by Burns and Chiquete [2020]. The data from the experiments is available on the small-scale database. Here we focus on the tracker gauge data for the lead shock trajectory, x(t). In order to determine the shock speed U s (t) and the detonation transition point, a least squared fit to the shock trajectory is used based on a pair of ODEs with a fitting form for the shock acceleration developed by Hill and Gustavsen [2002].

42 ENGINEERING↗

WeakIdent: Weak formulation for identifying differential equation using narrow-fit and trimming

Data-driven identification of differential equations is an interesting but challenging problem, especially when the given data are corrupted by noise. When the governing differential equation is a linear combination of various differential terms, the identification problem can be formulated as solving a linear system, with the feature matrix consisting of linear and nonlinear terms multiplied by a coefficient vector. This product is equal to the time derivative term, and thus generates dynamical behaviors. The goal is to identify the correct terms that form the equation to capture the dynamics of the given data. We propose a general and robust framework to recover differential equations using a weak formulation with two new mechanisms, narrow-fit and trimming, for both ordinary and partial differential equations (ODEs and PDEs). The weak formulation facilitates an efficient and robust way to handle noise, and two new mechanisms, narrow-fit and trimming, improve the coefficient support and value recoveries respectively. For each sparsity level, Subspace Pursuit is utilized to find an initial set of support from the large dictionary. Then, we focus on highly dynamic regions (rows of the feature matrix), and error normalize the feature matrix in the narrow-fit step. The support is further updated via trimming the terms that contribute the least. Finally, the support set of features with the smallest Cross-Validation error is chosen as the result. A comprehensive set of numerical experiments are presented for both systems of ODEs and PDEs with various noise levels. The proposed method gives a robust recovery of the coefficients, and a significant denoising effect which can handle up to 100% noise-to-signal ratio for some equations. We compare the proposed method with several state-of-the-art algorithms for the recovery of differential equations.

97 MATHEMATICS AND COMPUTING↗

Revisiting the ODE Method for Recursive Algorithms: Fast Convergence Using Quasi Stochastic Approximation

Several decades ago, Profs. Sean Meyn and Lei Guo were postdoctoral fellows at ANU, where they shared interest in recursive algorithms. It seems fitting to celebrate Lei Guo's 60th birthday with a review of the ODE Method and its recent evolution. The method has been regarded as a technique for algorithm analysis. It is argued that this viewpoint is backwards: The original stochastic approximation method was surely motivated by an ODE, and tools for analysis came much later (based on establishing robustness of Euler approximations). The paper presents a brief survey of recent research in machine learning that shows the power of algorithm design in continuous time, following by careful approximation to obtain a practical recursive algorithm. While these methods are usually presented in a stochastic setting, this is not a prerequisite. In fact, recent theory shows that rates of convergence can be dramatically accelerated by applying techniques inspired by quasi Monte-Carlo. Subject to conditions, the optimal rate of convergence can be obtained by applying the averaging technique of Polyak and Ruppert. The conditions are not universal, but theory suggests alternatives to achieve acceleration. The theory is illustrated with applications to gradient-free optimization, and policy gradient algorithms for reinforcement learning.

learning and adaptive systems in artificial intell↗

Physical and numerical sources of computational inefficiency in integration of chemical kinetic rate equations: Etiology, treatment and prognosis

The design of a very fast, automatic black-box code for homogeneous, gas-phase chemical kinetics problems requires an understanding of the physical and numerical sources of computational inefficiency. Some major sources reviewed in this report are stiffness of the governing ordinary differential equations (ODE's) and its detection, choice of appropriate method (i.e., integration algorithm plus step-size control strategy), nonphysical initial conditions, and too frequent evaluation of thermochemical and kinetic properties. Specific techniques are recommended (and some advised against) for improving or overcoming the identified problem areas. It is argued that, because reactive species increase exponentially with time during induction, and all species exhibit asymptotic, exponential decay with time during equilibration, exponential-fitted integration algorithms are inherently more accurate for kinetics modeling than classical, polynomial-interpolant methods for the same computational work. But current codes using the exponential-fitted method lack the sophisticated stepsize-control logic of existing black-box ODE solver codes, such as EPISODE and LSODE. The ultimate chemical kinetics code does not exist yet, but the general characteristics of such a code are becoming apparent.

Pratt, D. T.↗

Exponential-fitted methods for integrating stiff systems of ordinary differential equations: Applications to homogeneous gas-phase chemical kinetics

Conventional algorithms for the numerical integration of ordinary differential equations (ODEs) are based on the use of polynomial functions as interpolants. However, the exact solutions of stiff ODEs behave like decaying exponential functions, which are poorly approximated by polynomials. An obvious choice of interpolant are the exponential functions themselves, or their low-order diagonal Pade (rational function) approximants. A number of explicit, A-stable, integration algorithms were derived from the use of a three-parameter exponential function as interpolant, and their relationship to low-order, polynomial-based and rational-function-based implicit and explicit methods were shown by examining their low-order diagonal Pade approximants. A robust implicit formula was derived by exponential fitting the trapezoidal rule. Application of these algorithms to integration of the ODEs governing homogenous, gas-phase chemical kinetics was demonstrated in a developmental code CREK1D, which compares favorably with the Gear-Hindmarsh code LSODE in spite of the use of a primitive stepsize control strategy.

Pratt, D. T.↗

An ODE-Based Wall Model for Turbulent Flow Simulations

Fully automated meshing for Reynolds-Averaged Navier-Stokes Simulations, Mesh generation for complex geometry continues to be the biggest bottleneck in the RANS simulation process; Fully automated Cartesian methods routinely used for inviscid simulations about arbitrarily complex geometry; These methods lack of an obvious & robust way to achieve near wall anisotropy; Goal: Extend these methods for RANS simulation without sacrificing automation, at an affordable cost; Note: Nothing here is limited to Cartesian methods, and much becomes simpler in a body-fitted setting.

Wall Model↗

Active Learning of Microgrid Frequency Dynamics Using Neural Ordinary Differential Equations

Accurate frequency modelling of inverter‐based resource (IBR)‐dominated power systems is crucial for ensuring stable, reliable and resilient operations, particularly given their inherent low‐inertia characteristics and fast dynamics that traditional swing equation‐based models inadequately capture. This paper explores neural ordinary differential equations (Neural ODEs) as a computationally efficient, data‐driven framework for modelling power system frequency dynamics, specifically within microgrids integrating high penetrations of distributed energy resources (DERs). The developed neural ODEs framework incorporates a neural network architecture designed to capture input dynamics. By actively perturbing the system with a known signal, the Python‐based neural ODEs framework was trained using measured system states and inputs, without the need for detailed system information. The framework, tested on a model of the Cordova, AK, microgrid, achieved a goodness of fit ranging from 60% to 99% across different state variables and maintained a mean square error in the 10 -6 p.u. range under square and step excitation signals. The proposed approach demonstrated robustness to measurement noise and initial condition variations while maintaining low computational complexity suitable for real‐time power system control applications. Furthermore, transfer learning enabled the neural ODEs model to adapt to the following changes in system topology or generator dispatch, highlighting its effectiveness for dynamic microgrids with frequently evolving configurations and diverse DERs.

Aryal, Tara [South Dakota State Univ., Brookings, ↗

A New 1-step Arrhenius Decomposition Model for PBX 9501: Calibration with Isochoric-Adiabatic High-Activation-Energy Asymptotics and Uncertainty Quantification

Here we present a new 1-step Arrhenius thermal decomposition model of PBX 9501. As opposed to previous studies, we use high-energy asymptotic theory, and previously published equations of state to parameterize the model to experimental critical-time data. The model parameters were fit to experimental data using a bootstrapping procedure to capture the effects of experimental uncertainty. Subsequent implementation of the model in a chemicalkinetics ODE solver shows good agreement of times to ignition vs initial temperature in isochoric thermal explosion calculations with the results of the high-energy asymptotic theory. We also compare the resultant ZND structures to those of one of our previously calibrated burn models.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Modeling HIV-1 Within-Host Dynamics After Passive Infusion of the Broadly Neutralizing Antibody VRC01

VRC01 is a broadly neutralizing antibody that targets the CD4 binding site of HIV-1 gp120. Passive administration of VRC01 in humans has assessed the safety and the effect on plasma viremia of this monoclonal antibody (mAb) in a phase 1 clinical trial. After VRC01 infusion, the plasma viral load in most of the participants was reduced but had particular dynamics not observed during antiretroviral therapy. In this paper, we introduce different mathematical models to explain the observed dynamics and fit them to the plasma viral load data. Based on the fitting results we argue that a model containing reversible Ab binding to virions and clearance of virus-VRC01 complexes by a two-step process that includes (1) saturable capture followed by (2) internalization/degradation by phagocytes, best explains the data. This model predicts that VRC01 may enhance the clearance of Ab-virus complexes, explaining the initial viral decay observed immediately after antibody infusion in some participants. Because Ab-virus complexes are assumed to be unable to infect cells, i.e., contain neutralized virus, the model predicts a longer-term viral decay consistent with that observed in the VRC01 treated participants. By assuming a homogeneous viral population sensitive to VRC01, the model provides good fits to all of the participant data. However, the fits are improved by assuming that there were two populations of virus, one more susceptible to antibody-mediated neutralization than the other.

60 APPLIED LIFE SCIENCES↗

Score-Based Physics-Informed Neural Networks for High-Dimensional Fokker–Planck Equations

The Fokker-Planck (FP) equation is a foundational partial differential equation (PDE) in stochastic processes involving Brownian motions. However, the curse of dimensionality (CoD) poses a formidable challenge when dealing with high-dimensional FP equations. Although Monte Carlo simulation and (vanilla) Physics-Informed Neural Networks (PINNs) have shown the potential to tackle CoD, both methods exhibit significant numerical errors in high dimensions when dealing with the probability density function (PDF) associated with Brownian motion. The point-wise PDF values tend to decrease exponentially as dimensionality increases, surpassing the precision of numerical simulations and resulting in substantial errors. In addition, due to its massive sampling, Monte Carlo fails to offer fast sampling. Modeling the logarithm likelihood (LL) via vanilla PINNs transforms the FP equation into a notoriously difficult Hamilton-Jacobi-Bellman (HJB) equation, which is impractical for PINN learning, whose error grows rapidly with dimension. To this end, we propose a novel approach utilizing a score-based solver to fit the score function in stochastic differential equations (SDEs). The score function, defined as the gradient of the LL, plays a fundamental role in inferring LL and PDF and enables fast SDE sampling, offering an effective means to overcome the CoD. Three fitting methods, Score Matching (SM), Sliced Score Matching (SSM), and Score-PINN, are introduced, each contributing unique advantages in computational complexity, accuracy, and generality. The proposed score-based SDE solver operates in two stages: first, employing score matching or Score-PINN to acquire the score function; and second, solving the LL via an ordinary differential equation (ODE) using the obtained score function. Comparative evaluations across these methods showcase varying trade-offs. The proposed methodology is evaluated across diverse SDEs, including anisotropic Ornstein-Uhlenbeck processes, geometric Brownian motion, and Brownian motion with varying eigenspace. We also test various distributions, including Gaussian, Log-normal, Laplace, and Cauchy distributions. The numerical results demonstrate the score-based SDE solver’s stability, speed, and performance across different experimental settings, solidifying its potential as a solution to CoD for high-dimensional FP equations.

97 MATHEMATICS AND COMPUTING↗

Ode to gravity: Depth/diameter for fresh craters on Mercury

Opinions conflict over the role of surface gravity in shaping impact craters on Mercury. One view holds that the effects of g are evident in measurable aspects of crater form; other investigators find little or no evidence for g's geomorphic importance. Ambiguity in the role of g and other variables in cratering on Mercury stems largely from uncertainty in identifying major geomorphic contrasts and the crater sizes at which they occur. One of these, depth/diameter (d/D), undergoes a major change at the transition from simple (bowl shaped) to complex (peaks and terraces) crater interiors. Four least-squares d/D fits for fresh craters on Mercury were attemped. The results are inconsistent. The d/D data that should resolve previous shortcomings is presented. The revised d/D distributions for simple and complex craters, which intersect at a diameter of about 5 km, support the initial thesis that g substantially influences the form of Mercury's craters.

Pike, R. J.↗

Depth and Distribution of CO2 Snow on Mars

The dynamic role of volatiles on the surface of Mars has been a subject of longstanding interest. In the pre-Viking era, much of the debate was necessarily addressed by theoretical considerations. A particularly influential treatment by Leighton and Murray put forth a simple model relying on solar energy balance, and led to the conclusion that the most prominent volatile exchanging with the atmosphere over seasonal cycles is carbon dioxide. Their model suggested that due to this exchange, atmospheric CO2 partial pressure is regulated by polar ice. While current thinking attributes a larger role to H2O ice than did the occasional thin polar coating this model predicted, the CO2 cycle appears to be essentially correct. There are a number of observational constraints on the seasonal exchange of surface volatiles with the atmosphere. The growth and retreat of polar CO2 frost is visible from Earth-based telescopes and from spacecraft in Mars orbit, both at visible wavelengths and in thermal IR properties of the surface. Recently, variations in Gamma ray and neutron fluxes have also been used to infer integrated changes in CO2 mass on the surface. Measurements made by Viking's Mars Atmospheric Water Detector experiment were sensitive to atmospheric H2O vapor abundance. Surface condensates and their transient nature were detected by the Viking landers. The study here is motivated by recent data collected by the Mars Global Surveyor, affording the opportunity to not only detect the lateral distribution of volatiles, but also to constrain the variable volumes of the reservoirs. We elaborate on a technique first employed by Smith et al. By examining averages of a large number of topographic measurements collected by the Mars Orbiter Laser Altimeter (MOLA), that study showed that the zonal pattern of deposition and sublimation of CO2 can be determined. In their first approach, reference surfaces were fit to all measurements in narrow latitude annuli, and the time dependent variations about those mean surfaces were examined. In their second approach, height measurements from pairs of tracks that cross on the surface were interpolated and differenced, forming a set of crossover residuals. These residuals were then examined as a function of time and latitude. The initial studies averaged over longitude to maximize signal and minimize noise in order to isolate the expected small signal. In this follow-up study we now attempt to extract the elevation change pattern also as a function of longitude, and we focus on the crossover approach.

Aharonson, Oded↗

Using PyBioNetFit to leverage qualitative and quantitative data in biological model parameterization and uncertainty quantification

Data generated in studies of cellular regulatory systems are often qualitative. For example, measurements of signaling readouts in the presence and absence of mutations may reveal a rank ordering of responses across conditions but not the precise extents of mutation-induced differences. Qualitative data are often ignored by mathematical modelers or are considered in an ad hoc manner, as in the study of Kocieniewski and Lipniacki (2013) [Phys Biol 10: 035006], which was focused on the roles of MEK isoforms in ERK activation. In this earlier study, model parameter values were tuned manually to obtain consistency with a combination of qualitative and quantitative data. This approach is not reproducible, nor does it provide insights into parametric or prediction uncertainties. Here, starting from the same data and the same ordinary differential equation (ODE) model structure, we generate formalized statements of qualitative observations, making these observations more reusable, and we improve the model parameterization procedure by applying a systematic and automated approach enabled by the software package PyBioNetFit. We also demonstrate uncertainty quantification (UQ), which was absent in the original study. Our results show that PyBioNetFit enables qualitative data to be leveraged, together with quantitative data, in parameterization of systems biology models and facilitates UQ. These capabilities are important for reliable estimation of model parameters and model analyses in studies of cellular regulatory systems and reproducibility.

59 BASIC BIOLOGICAL SCIENCES↗

Generative Ensemble Regression: Learning Particle Dynamics from Observations of Ensembles with Physics-informed Deep Generative Models

Here, we propose a new method for inferring the governing stochastic ordinary differential equations (SODEs) by observing particle ensembles at discrete and sparse time instants, i.e., multiple “snapshots.” Particle coordinates at a single time instant, possibly noisy or truncated, are recorded in each snapshot but are unpaired across the snapshots. By training a physics-informed generative model that generates “fake” sample paths, we aim to fit the observed particle ensemble distributions with a curve in the probability measure space, which is induced from the inferred particle dynamics. We employ different metrics to quantify the differences between distributions, e.g., the sliced Wasserstein distances and the adversarial losses in generative adversarial networks. We refer to this method as generative “ensemble-regression” (GER), in analogy to the classic “point-regression,” where we infer the dynamics by performing regression in the Euclidean space. We illustrate the GER by learning the drift and diffusion terms of particle ensembles governed by SODEs with Brownian motions and Lévy processes up to 100 dimensions. We also discuss how to treat cases with noisy or truncated observations. Apart from systems consisting of independent particles, we also tackle nonlocal interacting particle systems with unknown interaction potential parameters by constructing a physics-informed loss function. Finally, we investigate scenarios of paired observations and discuss how to reduce the dimensionality in such cases by proving a convergence theorem that provides theoretical support.

97 MATHEMATICS AND COMPUTING↗