Search NASA⌕ Search

SEARCH · Search NASA

Results for “learning dynamics”

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.

At least 469 records · Page 26

Experimental verification of integrability in a Danilov-Nagaitsev lattice using machine learning

In non-linear optics, achieving integrability can enhance the dynamic aperture in storage rings. We analyze turn-by-turn phase-space data from our Danilov-Nagaitsev lattice implementation at Fermilab's Integrable Optics Test Accelerator using machine learning. AI Poincaré estimates conserved quantities from experimental data without prior knowledge of the invariant structure, showing qualitative agreement with theoretical predictions. Additionally, one of the two learned invariants exhibits comparable or better conservation compared to known theoretical expressions.

43 PARTICLE ACCELERATORS↗

Experimental Verification of Integrability in a Danilov-Nagaitsev Lattice using Machine Learning

In non-linear optics, achieving integrability can enhance the dynamic aperture in storage rings. We analyze turn-by-turn phase-space data from our Danilov-Nagaitsev lattice implementation at Fermilab's Integrable Optics Test Accelerator using machine learning. \textit{AI Poincar\'e} estimates conserved quantities from experimental data without prior knowledge of the invariant structure, showing qualitative agreement with theoretical predictions. Additionally, one of the two learned invariants exhibits comparable or better conservation compared to known theoretical expressions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Microscopic insights into the solvation of polyethylene glycol chains in water: A machine learning potential approach

Polyethylene glycol (PEG) is a structurally simple, nontoxic, and water-soluble polymer widely utilized in medical and pharmaceutical applications. Notably, when a PEG chain is immersed in water, the surrounding water molecules play a key role in driving conformational changes of this macromolecule. In this study, we explore the solvation behavior of PEG under mechanical strain using molecular dynamics simulations, with an interatomic potential obtained from machine learning. Our focus is on the transition from the favored coil-like conformation to an extended one under external force. Through analyses of radial distribution functions, hydrogen bonding, and solvation dynamics, we uncover how mechanical stretching influences the local hydration environment. Furthermore, we disentangle the enthalpic and entropic contributions to the conformational stability of PEG in water. Surprisingly, our neural network potential model identifies dewetting of PEG C-atoms, and not water H-bonding with PEG O-atoms, as the main enthalpic driving force for the coiling of PEG in water.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Machine Learned Empirical Numerical Integrator from Simulated Data

Recently, a number of state-of-the-art surrogate machine learning (ML) models have been designed for global weather and climate prediction, which have been trained using reanalysis data products. Reanalysis data products are constructed using numerical model simulations that combine numerical integration of partial differential equations and parameterization schemes. These products are typically only archived and made available using coarsened spatial and temporal resolutions. This study explores the impact of the numerical generation methods used to produce the training datasets and the temporal resolution of those datasets on machine learning surrogate models. Using the nonlinear vector autoregression (NVAR) machine as an explainable ML technique, simple dynamical systems are emulated with ML models trained on data produced by three classical numerical integration schemes. NVAR is validated as a skillful ML method, capable of producing accurate predictions and, more importantly, reconstructing both the underlying dynamics and the numerical integration scheme used to generate the training data. However, the machine fails to generalize predictions on unseen test data generated by different numerical integration schemes, despite the underlying dynamical system being the same. This result provides a word of caution for the growing field of machine learning emulation of weather and climate dynamics. Furthermore, we illustrate using NVAR that training on temporally coarsened data may increase the required complexity of ML models and potentially introduce new numerical challenges. Finally, we discover that empirical integration schemes with arbitrary time-stepping sizes can be constructed directly from the data, which implies a potential for the development of empirical numerical integration schemes.

54 ENVIRONMENTAL SCIENCES↗

Complexity for Survival of Living Systems

A logical connection between the survivability of living systems and the complexity of their behavior (equivalently, mental complexity) has been established. This connection is an important intermediate result of continuing research on mathematical models that could constitute a unified representation of the evolution of both living and non-living systems. Earlier results of this research were reported in several prior NASA Tech Briefs articles, the two most relevant being Characteristics of Dynamics of Intelligent Systems (NPO- 21037), NASA Tech Briefs, Vol. 26, No. 12 (December 2002), page 48; and Self-Supervised Dynamical Systems (NPO- 30634) NASA Tech Briefs, Vol. 27, No. 3 (March 2003), page 72. As used here, living systems is synonymous with active systems and intelligent systems. The quoted terms can signify artificial agents (e.g., suitably programmed computers) or natural biological systems ranging from single-cell organisms at one extreme to the whole of human society at the other extreme. One of the requirements that must be satisfied in mathematical modeling of living systems is reconciliation of evolution of life with the second law of thermodynamics. In the approach followed in this research, this reconciliation is effected by means of a model, inspired partly by quantum mechanics, in which the quantum potential is replaced with an information potential. The model captures the most fundamental property of life - the ability to evolve from disorder to order without any external interference. The model incorporates the equations of classical dynamics, including Newton s equations of motion and equations for random components caused by uncertainties in initial conditions and by Langevin forces. The equations of classical dynamics are coupled with corresponding Liouville or Fokker-Planck equations that describe the evolutions of probability densities that represent the uncertainties. The coupling is effected by fictitious information-based forces that are gradients of the information potential, which, in turn, is a function of the probability densities. The probability densities are associated with mental images both self-image and nonself images (images of external objects that can include other agents). The evolution of the probability densities represents mental dynamics. Then the interaction between the physical and metal aspects of behavior is implemented by feedback from mental to motor dynamics, as represented by the aforementioned fictitious forces. The interaction of a system with its self and nonself images affords unlimited capacity for increase of complexity. There is a biological basis for this model of mental dynamics in the discovery of mirror neurons that learn by imitation. The levels of complexity attained by use of this model match those observed in living systems. To establish a mechanism for increasing the complexity of dynamics of an active system, the model enables exploitation of a chain of reflections exemplified by questions of the form, "What do you think that I think that you think...?" Mathematically, each level of reflection is represented in the form of an attractor performing the corresponding level of abstraction with more details removed from higher levels. The model can be used to describe the behaviors, not only of biological systems, but also of ecological, social, and economics ones.

Zak, Michail↗

Best Practices for Researching and Documenting Lessons Learned

Identification, resolution, and avoidance of technical and programmatic issues are important for ensuring safe and successful space missions. Although the importance of applying lessons learned to reduce risk is frequently stressed, there is little material available to help technical and management personnel research and document lessons learned. Collecting, researching, identifying, and documenting lessons learned that will be useful to current and future management and engineering personnel is not always a straightforward task. This white paper presents lessons learned and best practices concerning the research and documentation of technical and organizational lessons learned. It is intended to enable organizations to initiate or improve lessons learned research and documentation efforts. The content of this white paper is based on four technical lessons learned projects conducted by the United Space Alliance (USA) Flight Design and Dynamics Department, in support of the NASA/Johnson Space Center (JSC) Flight Design and Dynamics Division. Each project published a report, titled as follows: (1) GPS Lessons Learned From the ISS, Space Shuttle and X-38; (2) Lessons Learned From Seven Space Shuttle Missions; (3) Space Shuttle Rendezvous and Proximity Operations Experience Report; and (4) Navigation Technical History with Lessons Learned. The four projects were different in availability of subject matter experts and primary source material, subject scope, and the level of effort required to produce the final report. However, generic lessons can be drawn from all of them. The best practices will be discussed by the phases of report research and development: (1) Defining Report Requirements, Project Organization, and Schedule; (2) Collection and Analysis of Source Material; (3) Writing and Integrating the Report; and (4) Review and Revision of the Report.

Goodman, John L.↗

Scalable edge clustering of dynamic graphs via weighted line graphs

Timestamped relational datasets consisting of records (or connections) between pairs of entities are ubiquitous in network science. For applications like peer-to-peer communication, email, various social network interactions, and computer network security, it is useful to organize these records into groups based on how and when they are occurring. Weighted line graphs offer a natural way to model how records are related in such datasets but for large real-world graph topologies, building and utilizing the line graph is prohibitively expensive. Here, we present the framework to cluster the edges of a dynamic graph via the associated line graph that contains two major contributions. The first is a method to work with the line graph implicitly and the second is a distributed scale implementation of an agglomerative hierarchical graph clustering algorithm. We outline a novel hierarchical dynamic graph edge clustering approach that efficiently breaks massive relational datasets into small sets of edges containing events at various timescales. This is in stark contrast to traditional graph clustering algorithms that prioritize highly connected (clique-like) community structures. Our approach relies on constructing a sufficient subgraph of a weighted line graph and applying a hierarchical agglomerative clustering. This approach is related to scalable techniques from spatial clustering, nonlinear-dimension reduction, topological data analysis, and draws particular inspiration from HDBSCAN. As an edge clustering, this method yields an overlapping node clustering. Our algorithm is parallelizable and we demonstrate efficient clustering of a billion-scale, real-world dynamic graph into small edge sets that correlate in topology and time. The entire clustering process for a graph with tens of billions of edges takes just a few minutes of run time on 256 nodes of a distributed compute environment. We argue how the output of the edge clustering is useful for a multitude of data visualization and powerful machine learning tasks, both involving the original massive dynamic graph data and metadata associated with the nodes and edges. Finally, we describe how this approach can be extended to dynamic hypergraphs and dynamic graphs/hypergraphs with unstructured data living on vertices and edges.

Data Analysis↗

Machine learning assisted prediction of tungsten heavy alloy plasma facing component performance for fusion energy applications

Tungsten and tungsten heavy alloys (WHAs), known for their remarkably high hardness, durability, and corrosion resistance, play a critical role in the thriving development of nuclear fusion reactors in recent years. However, the exploration in tungsten alloys for the nuclear-related applications has been limited by the difficulty of manufacturing and the complexity of experiments to reproduce the environment of nuclear reaction. Therefore, this project aims to utilize nanoscale simulation methods such as density functional theory (DFT) and molecular dynamics (MD) with the help of machine learning techniques to not only understand the mechanisms of tungsten alloys but also allow us to computationally predict their mechanical behaviors under extreme environments. One critical problem of the application of WHAs in nuclear reactors is the surface melting. In the current design of the SPARC reactor, the WHA, W97Ni2.1Fe0.9 or W97NiFe, is chosen to be the first wall components to confine the plasma where the particles are fiercely moving and colliding into each other to create nuclear fusion reaction. This process will generate extremely high heat flux onto these WHA tiles, leaving high surface temperature that could possibly melt the surface of the WHA tiles, As illustrated in Fig. 1(a). a laser experiment previously done illustrates that a rough surface damage would be made after the surface melting where the matrix area mainly composed of nickel and iron as shown in Fig. 1(b), will first melt and then leave vacancies between these tungsten grains. Unfortunately, these kinds of roughness on the first-wall components could be deadly to the plasma inside a Tokmak reactor because the heat that is supposed to dissipate at a designed ratio through the tiles may in turn be excessively absorbed and accumulated on any uneven area of the surface, which will eventually make the whole nuclear reaction fail. In this project, we will introduce a machine learning potential, Allegro, based on DFT calculation and then build a MD model for W-Ni-Fe alloys.

36 MATERIALS SCIENCE↗

AI-NERD: Elucidation of relaxation dynamics beyond equilibrium through AI-informed X-ray photon correlation spectroscopy

Abstract Understanding and interpreting dynamics of functional materials in situ is a grand challenge in physics and materials science due to the difficulty of experimentally probing materials at varied length and time scales. X-ray photon correlation spectroscopy (XPCS) is uniquely well-suited for characterizing materials dynamics over wide-ranging time scales. However, spatial and temporal heterogeneity in material behavior can make interpretation of experimental XPCS data difficult. In this work, we have developed an unsupervised deep learning (DL) framework for automated classification of relaxation dynamics from experimental data without requiring any prior physical knowledge of the system. We demonstrate how this method can be used to accelerate exploration of large datasets to identify samples of interest, and we apply this approach to directly correlate microscopic dynamics with macroscopic properties of a model system. Importantly, this DL framework is material and process agnostic, marking a concrete step towards autonomous materials discovery.

36 MATERIALS SCIENCE↗

NeuroCoreX: An Open-Source FPGA-Based Spiking Neural Network Emulator with On-Chip Learning

Spiking Neural Networks (SNNs) are computational models inspired by the event-driven communication and connectivity patterns of biological neural circuits. They enable high energy efficiency and natural support for diverse architectures ranging from layered networks to small-world and graphstructured topologies. In this work, we introduce NeuroCoreX, an open-source, FPGA-based spiking neural network emulator that provides real-time, on-chip learning and flexible network organization. NeuroCoreX supports both feedforward sensory inputs streamed directly from sensors or PCs via UART and recurrent on-chip connectivity, enabling simultaneous processing and learning from external stimuli and internal network dynamics-capabilities rarely available in existing FPGA SNN platforms. The system implements a Leaky Integrate-and-Fire (LIF) neuron model with current-based synapses and supports pair-based STDP learning on both feedforward and recurrent synapses. A lightweight Python interface enables interactive configuration, live monitoring, weight read-back, and experiment control. Importantly, NeuroCoreX is tightly integrated with the SuperNeuroMAT simulator, allowing SNN models to be transferred seamlessly from software to hardware for hardware-in-the-loop development. By combining real-time plasticity, flexible connectivity, and an open-source VHDL implementation, NeuroCoreX provides an extensible and accessible platform for neuromorphic research, algorithm-hardware co-design, and energy-efficient edge intelligence.

Gautam, Ashish [ORNL]↗

Coarse-Graining Conformational Dynamics with Multidimensional Generalized Langevin Equation: How, When, and Why

A data-driven ab initio generalized Langevin equation (AIGLE) approach is developed to learn and simulate high-dimensional, heterogeneous, coarse-grained (CG) conformational dynamics. Constrained by the fluctuation–dissipation theorem, the approach can build CG models in dynamical consistency (DC) with all-atom molecular dynamics. Here, we also propose practical criteria for AIGLE to enforce long-term DC. Case studies of a toy polymer, with 20 CG sites, and the alanine dipeptide, with two dihedral angles, elucidate why one should adopt AIGLE or its Markovian limit for modeling CG conformational dynamics in practice.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Comprehensive assessment of deep reinforcement learning approaches for economic dispatch in nuclear-driven microgrids

As the electrical grid integrates more variable renewable energy sources such as wind and solar, the demand for distributed and flexible systems to address this increased variability becomes critical. Nuclear-driven microgrids provide a promising solution by offering stable generation to complement intermittent renewables, ensuring grid reliability and operating efficiency. This paper proposes a recurrent deep reinforcement learning framework for optimal economic dispatch in a nuclear-powered microgrid integrating renewable energy sources, small modular reactors, battery storage systems, and balance-of-plant dynamics. A three-agent control architecture is developed, where demand and renewable energy agents act as forecasters, and a reinforcement learning-based dispatch agent performs real-time energy allocation. A nonlinear programming formulation is first used to generate an optimal baseline for benchmarking. The proposed dispatch controller, based on Proximal Policy Optimization enhanced with Long Short-Term Memory networks, exploits temporal correlations in system dynamics by taking advantage of the time series used as inputs to improve policy robustness under uncertainty. Comparative analysis against established deep reinforcement learning methods, including Proximal Policy Optimization with a feedforward architecture, Soft Actor-Critic, and Twin Delayed Deep Deterministic Policy Gradient, demonstrates superior performance. Numerical results indicate that the proposed controller achieves a 0.39% cost reduction relative to the nonlinear programming benchmark and outperforms other learning-based methods by generating additional revenue of up to 0.35%. All reinforcement learning controllers compute dispatch actions in less than 0.3 s, resulting in a computational speedup of more than three orders of magnitude over the nonlinear programming baseline. The findings of this paper highlight their applicability for real-time operation and control in nuclear-integrated microgrids under volatile operating conditions.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Population-based learning of load balancing policies for a distributed computer system

Effective load-balancing policies use dynamic resource information to schedule tasks in a distributed computer system. We present a novel method for automatically learning such policies. At each site in our system, we use a comparator neural network to predict the relative speedup of an incoming task using only the resource-utilization patterns obtained prior to the task's arrival. Outputs of these comparator networks are broadcast periodically over the distributed system, and the resource schedulers at each site use these values to determine the best site for executing an incoming task. The delays incurred in propagating workload information and tasks from one site to another, as well as the dynamic and unpredictable nature of workloads in multiprogrammed multiprocessors, may cause the workload pattern at the time of execution to differ from patterns prevailing at the times of load-index computation and decision making. Our load-balancing policy accommodates this uncertainty by using certain tunable parameters. We present a population-based machine-learning algorithm that adjusts these parameters in order to achieve high average speedups with respect to local execution. Our results show that our load-balancing policy, when combined with the comparator neural network for workload characterization, is effective in exploiting idle resources in a distributed computer system.

Mehra, Pankaj↗

Active and Transfer Learning of High-Dimensional Neural Network Potentials for Transition Metals

Classical molecular dynamics (MD) simulations represent a very popular and powerful tool for materials modeling and design. The predictive power of MD hinges on the ability of the interatomic potential to capture the underlying physics and chemistry. There have been decades of seminal work on developing interatomic potentials, albeit with a focus predominantly on capturing the properties of bulk materials. Such physics-based models, while extensively deployed for predicting the dynamics and properties of nanoscale systems over the past two decades, tend to perform poorly in predicting nanoscale potential energy surfaces (PESs) when compared to high-fidelity first-principles calculations. These limitations stem from the lack of flexibility in such models, which rely on a predefined functional form. Machine learning (ML) models and approaches have emerged as a viable alternative to capture the diverse size-dependent cluster geometries, nanoscale dynamics, and the complex nanoscale PESs, without sacrificing the bulk properties. Here, in this study, we introduce an ML workflow that combines transfer and active learning strategies to develop high-dimensional neural networks (NNs) for capturing the cluster and bulk properties for several different transition metals with applications in catalysis, microelectronics, and energy storage, to name a few. Our NN first learns the bulk PES from the high-quality physics-based models in literature and subsequently augments this learning via retraining with a higher-fidelity first-principles training data set to concurrently capture both the nanoscale and bulk PES. Our workflow departs from status-quo in its ability to learn from a sparsely sampled data set that nonetheless covers a diverse range of cluster configurations from near-equilibrium to highly nonequilibrium as well as learning strategies that iteratively improve the fingerprinting depending on model fidelity. All the developed models are rigorously tested against an extensive first-principles data set of energies and forces of cluster configurations as well as several properties of bulk configurations for 10 different transition metals. Our approach is material agnostic and provides a methodology to transfer and build upon the learnings from decades of seminal work in molecular simulations on to a new generation of ML-trained potentials to accelerate materials discovery and design.

36 MATERIALS SCIENCE↗

Mars Science Laboratory Sample Acquisition, Sample Processing and Handling: Subsystem Design and Test Challenges

The Sample Acquisition/Sample Processing and Handling subsystem for the Mars Science Laboratory is a highly-mechanized, Rover-based sampling system that acquires powdered rock and regolith samples from the Martian surface, sorts the samples into fine particles through sieving, and delivers small portions of the powder into two science instruments inside the Rover. SA/SPaH utilizes 17 actuated degrees-of-freedom to perform the functions needed to produce 5 sample pathways in support of the scientific investigation on Mars. Both hardware redundancy and functional redundancy are employed in configuring this sampling system so some functionality is retained even with the loss of a degree-of-freedom. Intentional dynamic environments are created to move sample while vibration isolators attenuate this environment at the sensitive instruments located near the dynamic sources. In addition to the typical flight hardware qualification test program, two additional types of testing are essential for this kind of sampling system: characterization of the intentionally-created dynamic environment and testing of the sample acquisition and processing hardware functions using Mars analog materials in a low pressure environment. The overall subsystem design and configuration are discussed along with some of the challenges, tradeoffs, and lessons learned in the areas of fault tolerance, intentional dynamic environments, and special testing

Jandura, Louise↗

Risk-Aware Reinforcement Learning Framework for User-Centric O-RAN

The evolution of Open Radio Access Networks (O-RAN) presents an opportunity to enhance network performance by enabling dynamic orchestration of configuration and optimization parameters (COPs) through online learning methods. However, leveraging this potential requires overcoming the limitations of traditional cell-centric RAN architectures, which lack the necessary flexibility. On the other hand, despite their recent popularity, the practical deployment of online learning frameworks, such as Deep Reinforcement Learning (DRL)-based COP optimization solutions, remains limited due to their risk of deteriorating network performance during the exploration phase. In this article, we propose and analyze a novel risk-aware DRL framework for user-centric RAN (UC-RAN), which offers both the architectural flexibility and COP optimization to exploit this flexibility. We investigate and identify UC-RAN COPs that can be optimized via a soft actor-critic algorithm implementable as an O-RAN application (rApp) to jointly maximize latency satisfaction, reliability satisfaction, area spectral efficiency, and energy efficiency. We use the offline learning on UC-RAN to reliably accelerate DRL training, thus minimizing the risk of DRL deteriorating cellular network performance. Results show that our proposed solution approaches near-optimal performance in just a few hundred iterations with a decrease in risk score by a factor of ten.

6G and beyond↗

Learning thermodynamic master equations for open quantum systems

The characterization of Hamiltonians and other components of open quantum dynamical systems plays a crucial role in quantum computing and other applications. Scientific machine learning techniques have been applied to this problem in a variety of ways, including by modeling with deep neural networks. However, the majority of mathematical models describing open quantum systems are linear, and the natural nonlinearities in learnable models have not been incorporated using physical principles. We present a data-driven model for open quantum systems that includes learnable, thermodynamically consistent terms. The trained model is interpretable, as it directly estimates the system Hamiltonian and linear components of coupling to the environment. We validate the model on synthetic two and three-level data, as well as experimental two-level data collected from a quantum device at Lawrence Livermore National Laboratory.

Mathematics and Computing↗

Prediction of hydration energies of adsorbates at Pt(111) and liquid water interfaces using machine learning

Aqueous phase heterogeneous catalysis is important to various industrial processes, including biomass conversion, Fischer–Tropsch synthesis, and electrocatalysis. Accurate calculation of solvation thermodynamic properties is essential for modeling the performance of catalysts for these processes. Explicit solvation methods employing multiscale modeling, e.g., involving density functional theory and molecular dynamics have emerged for this purpose. Although accurate, these methods are computationally intensive. This study introduces machine learning (ML) models to predict solvation thermodynamics for adsorbates on a Pt(111) surface, aiming to enhance computational efficiency without compromising accuracy. In particular, ML models are developed using a combination of molecular descriptors and fingerprints and trained on previously published water–adsorbate interaction energies, energies of solvation, and free energies of solvation of adsorbates bound to Pt(111). These models achieve root mean square error values of 0.09 eV for interaction energies, 0.04 eV for energies of solvation, and 0.06 eV for free energies of solvation, demonstrating accuracy within the standard error of multiscale modeling. Feature importance analysis reveals that hydrogen bonding, van der Waals interactions, and solvent density, together with the properties of the adsorbate, are critical factors influencing solvation thermodynamics. Furthermore, these findings suggest that ML models can provide rapid and reliable predictions of solvation properties. This approach not only reduces computational costs but also offers insights into the solvation characteristics of adsorbates at Pt(111)–water interfaces.

Adsorption↗