Search NASA⌕ Search

SEARCH · Search NASA

Results for “CONNECT algorithm”

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 901 records · Page 50
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Mathematical nuances of Gaussian process-driven autonomous experimentation

Abstract The fields of machine learning (ML) and artificial intelligence (AI) have transformed almost every aspect of science and engineering. The excitement for AI/ML methods is in large part due to their perceived novelty, as compared to traditional methods of statistics, computation, and applied mathematics. But clearly, all methods in ML have their foundations in mathematical theories, such as function approximation, uncertainty quantification, and function optimization. Autonomous experimentation is no exception; it is often formulated as a chain of off-the-shelf tools, organized in a closed loop, without emphasis on the intricacies of each algorithm involved. The uncomfortable truth is that the success of any ML endeavor, and this includes autonomous experimentation, strongly depends on the sophistication of the underlying mathematical methods and software that have to allow for enough flexibility to consider functions that are in agreement with particular physical theories. We have observed that standard off-the-shelf tools, used by many in the applied ML community, often hide the underlying complexities and therefore perform poorly. In this paper, we want to give a perspective on the intricate connections between mathematics and ML, with a focus on Gaussian process-driven autonomous experimentation. Although the Gaussian process is a powerful mathematical concept, it has to be implemented and customized correctly for optimal performance. We present several simple toy problems to explore these nuances and highlight the importance of mathematical and statistical rigor in autonomous experimentation and ML. One key takeaway is that ML is not, as many had hoped, a set of agnostic plug-and-play solvers for everyday scientific problems, but instead needs expertise and mastery to be applied successfully. Graphical abstract

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Development and Evaluation of Velocity Predictive Optimal Energy Management Strategies in Intelligent and Connected Hybrid Electric Vehicles

In this study, a thorough and definitive evaluation of Predictive Optimal Energy Management Strategy (POEMS) applications in connected vehicles using 10 to 20 s predicted velocity is conducted for a Hybrid Electric Vehicle (HEV). The presented methodology includes synchronous datasets gathered in Fort Collins, Colorado using a test vehicle equipped with sensors to measure ego vehicle position and motion and that of surrounding objects as well as receive Infrastructure to Vehicle (I2V) information. These datasets are utilized to compare the effect of different signal categories on prediction fidelity for different prediction horizons within a POEMS framework. Multiple artificial intelligence (AI) and machine learning (ML) algorithms use the collected data to output future vehicle velocity prediction models. The effects of different combinations of signals and different models on prediction fidelity in various prediction windows are explored. All of these combinations are ultimately addressed where the rubber meets the road: fuel economy (FE) enabled from POEMS. FE optimization is performed using Model Predictive Control (MPC) with a Dynamic Programming (DP) optimizer. FE improvements from MPC control at various prediction time horizons are compared to that of full-cycle DP. All FE results are determined using high-fidelity simulations of an Autonomie 2010 Toyota Prius model. The full-cycle DP POEMS provides the theoretical upper limit on fuel economy (FE) improvement achievable with POEMS but is not currently practical for real-world implementation. Perfect prediction MPC (PP-MPC) represents the upper limit of FE improvement practically achievable with POEMS. Real-Prediction MPC (RP-MPC) can provide nearly equivalent FE improvement when used with high-fidelity predictions. Constant-Velocity MPC (CV-MPC) uses a constant speed prediction and serves as a “null” POEMS. Results showed that RP-MPC, enabled by high-fidelity ego future speed prediction, led to significant FE improvement over baseline nearly matching that of PP-MPC.

33 ADVANCED PROPULSION SYSTEMS↗
NASA NTRSDate not supplied

Cooperative Clustering Techniques Applied to Contact Graph Routing

Routing in the space internet has to face many unique challenges - from unplanned disconnections and interruptions to predictable intermittent connectivity due to high network mobility and long propagation delays. NASA’s current approach to such routing is Contact Graph Routing (CGR), using a graph formed of prescheduled communication contacts to compute routes through the network. While this approach manages to tackle issues of connectivity and propagation delays, it is a global approach that requires continuous knowledge of the entire network. In a potential future Solar Space Internet (SSI) such an approach on its own cannot scale to large networks with thousands of members. In this presentation we propose clustering as a solution to CGR scalability. Clustering has been used in many networking problems as a way to subdivide the network and allow for localized routing and better scalability. Using techniques from graph theory and game theory, we explore various existing clustering algorithms and adapt them to the Contact Graph Routing setting. Finally, we propose a way to combine multiple algorithms to create a Delay Tolerant Clustering Protocol.

Yael Kirkpatrick↗
NASA NTRSDate not supplied

Cooperative Clustering Techniques For Space Network Scalability

Routing in the space internet must face many unique challenges - from unplanned disconnections and interruptions to predictable intermittent connectivity due to high network mobility and long propagation delays. NASA’s current approach to such routing is Contact Graph Routing (CGR), using a graph formed of prescheduled communication contacts to compute routes through the network. While this approach manages to tackle issues of connectivity and propagation delays, it is a global approach that requires continuous knowledge of the entire network. In a potential future Solar Space Internet (SSI) such an approach on its own cannot scale to large networks with thousands of members. In this paper we propose clustering as a solution to CGR scalability. Clustering has been used in many networking problems as a way to subdivide the network and allow for localized routing and better scalability. Using techniques from graph theory and game theory, we explore various existing clustering algorithms and adapt them to the Contact Graph Routing setting. We propose a way to combine multiple algorithms to create a Delay Tolerant Clustering Protocol (DTCP). In addition, we explore the underlying networking mechanisms such as multicast, neighbor discovery, and software defined networking that may be used to enable DTCP.

Delay Tolerant Networking↗
DOE OSTI2021

The Tracking Machine Learning challenge : Throughput phase

This paper reports on the second "Throughput" phase of the Tracking Machine Learning (TrackML) challenge on the Codalab platform. As in the first "Accuracy" phase, the participants had to solve a difficult experimental problem linked to tracking accurately the trajectory of particles as e.g. created at the Large Hadron Collider (LHC): given O($10^5$) points, the participants had to connect them into O($10^4$) individual groups that represent the particle trajectories which are approximated helical. While in the first phase only the accuracy mattered, the goal of this second phase was a compromise between the accuracy and the speed of inference. Both were measured on the Codalab platform where the participants had to upload their software. The best three participants had solutions with good accuracy and speed an order of magnitude faster than the state of the art when the challenge was designed. Although the core algorithms were less diverse than in the first phase, a diversity of techniques have been used and are described in this paper. The performance of the algorithms are analysed in depth and lessons derived.

Amrouche, Sabrina↗
DOE OSTI2025

Traffic Control via Connected and Automated Vehicles (CAVs): An Open-Road Field Experiment with 100 CAVs

The CIRCLES project aims to reduce instabilities in traffic flow, which are naturally occurring phenomena due to human driving behavior. Also called “phantom jams” or “stop-and-go waves,” these instabilities are a significant source of wasted energy. Toward this goal, the CIRCLES project designed a control system, referred to as the MegaController by the CIRCLES team, that could be deployed in real traffic. Our field experiment, the MegaVanderTest (MVT), leveraged a heterogeneous fleet of 100 longitudinally controlled vehicles as Lagrangian traffic actuators, each of which ran a controller with the architecture described in this article. The MegaController is a hierarchical control architecture that consists of two main layers. The upper layer is called the Speed Planner and is a centralized optimal control algorithm. It assigns speed targets to the vehicles, conveyed through the LTE cellular network. The lower layer is a control layer, running on each vehicle. It performs local actuation by overriding the stock adaptive cruise controller, using the stock onboard sensors. The Speed Planner ingests live data feeds provided by third parties as well as data from our own control vehicles and uses both to perform the speed assignment. The architecture of the Speed Planner allows for the modular use of standard control techniques, such as optimal control, model predictive control (MPC), kernel methods, and others. The architecture of the local controller allows for the flexible implementation of local controllers. Corresponding techniques include deep reinforcement learning (RL), MPC, and explicit controllers. Depending on the vehicle architecture, all onboard sensing data can be accessed by the local controllers or only some. Likewise, control inputs vary across different automakers, with inputs ranging from torque or acceleration requests for some cars to electronic selection of adaptive cruise control (ACC) setpoints in others. The proposed architecture technically allows for the combination of all possible settings proposed previously, that is {Speed Planner algorithms} × {local Vehicle Controller algorithms} × {full or partial sensing} × {torque or speed control}. As a result, most configurations were tested throughout the ramp up to the MegaVandertest (MVT).

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
NASA NTRS2020

Planning and Optimization for Multi-robot Planetary Cave Exploration under Intermittent Connectivity Constraints

Exploring subsurface structures with autonomous robots is of growing interest in the context of planetary caves studies. Communication between robots in these environments is severely degraded which complicates coordination and information distribution. In this paper we focus on planning for mobility and communication in a cave exploration scenario where the situational awareness of a static base station is critical. We propose a notion of information-consistency where a plan itself is part of the information to be shared between robots, and propose a method for generating information-consistent plans. We discuss in detail how the resulting plan can be robustly implemented with minimal communication through local mission executives that run on individual robots. We describe preliminary results on the performance of the planning algorithm and integration of the local mission executives in a high-fidelity simulation environment.

Murray, Richard M.↗
DOE OSTI2023

Deep Learning for Multigroup Cross-Section Representation in Two-Step Core Calculations

Here we investigate using deep learning, a type of machine-learning algorithm employing multiple layers of artificial neurons, for the mathematical representation of multigroup cross sections for use in the Griffin reactor multiphysics code for two-step deterministic neutronics calculations. A three-dimensional fuel element typical of a high-temperature gas reactor as well as a two-dimensional sodium-cooled fast reactor lattice are modeled using the Serpent Monte Carlo code, and multigroup macroscopic cross sections are generated for various state parameters to produce a training data set and a separate validation data set. A fully connected, feedforward neural network is trained using the open-source PyTorch machine-learning framework, and its accuracy is compared against the standard piecewise linear interpolation model. Additionally, we provide in this work a generic technique for propagating the cross-section model errors up to the k eff using sensitivity coefficients with the first-order uncertainty propagation rule. Quantifying the eigenvalue error due to the cross-section regression errors is especially practical for appropriately selecting the mathematical representation of the cross sections. We demonstrate that the artificial neural network model produces lower errors and therefore enables better accuracy relative to the piecewise linear model when the cross sections exhibit nonlinear dependencies; especially when a coarse grid is employed, where the errors can be halved by the artificial neural network. However, for linearly dependent multigroup cross sections as found for the sodium-cooled fast reactor case, a simpler linear regression outperforms deeper networks.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
NASA NTRS2006

Highly Efficient Multilayer Thermoelectric Devices

Multilayer thermoelectric devices now at the prototype stage of development exhibit a combination of desirable characteristics, including high figures of merit and high performance/cost ratios. These devices are capable of producing temperature differences of the order of 50 K in operation at or near room temperature. A solvent-free batch process for mass production of these state-of-the-art thermoelectric devices has also been developed. Like prior thermoelectric devices, the present ones have commercial potential mainly by virtue of their utility as means of controlled cooling (and/or, in some cases, heating) of sensors, integrated circuits, and temperature-critical components of scientific instruments. The advantages of thermoelectric devices for such uses include no need for circulating working fluids through or within the devices, generation of little if any noise, and high reliability. The disadvantages of prior thermoelectric devices include high power consumption and relatively low coefficients of performance. The present development program was undertaken in the hope of reducing the magnitudes of the aforementioned disadvantages and, especially, obtaining higher figures of merit for operation at and near room temperature. Accomplishments of the program thus far include development of an algorithm to estimate the heat extracted by, and the maximum temperature drop produced by, a thermoelectric device; solution of the problem of exchange of heat between a thermoelectric cooler and a water-cooled copper block; retrofitting of a vacuum chamber for depositing materials by sputtering; design of masks; and fabrication of multilayer thermoelectric devices of two different designs, denoted I and II. For both the I and II designs, the thicknesses of layers are of the order of nanometers. In devices of design I, nonconsecutive semiconductor layers are electrically connected in series. Devices of design II contain superlattices comprising alternating electron-acceptor (p)-doped and electron-donor (n)-doped, nanometer- thick semiconductor layers.

Boufelfel, Ali↗
DOE OSTI2024

Heat transfer optimization of uo 2 -mo fuel using genetic algorithms

Two genetic algorithm (GA) methods were applied to thermal finite element models to optimize the heat transfer efficacy of a UO 2 -Mo composite fuel pellet with typical pressurized water reactor fuel geometry. Mo additions to UO 2 have been shown to increase the thermal conductivity, thus reducing centerline temperatures and temperature gradients. Previous studies evaluated uniformly dispersed Mo or continuous Mo internal geometries (e.g., fins, plates, discs) that were selected using engineering intuition. The current study uses two different implementations of the same GA to optimize Mo placement and minimize the fuel temperature with the only constraint being a maximum 10% Mo volume fraction. One approach superimposed Mo line elements onto the monolithic UO 2 pellet model, and the other converted entire UO 2 volume elements to Mo. The former method generated 1D heat transfer connections between nodes, whereas the latter method allowed for the formation of 3D structures. Features of the optimal fuel design produced by the GAs included dispersed Mo near the centerline that shifted the peak fuel temperature outward by 0.6 mm, Mo chains in the high-heat-flux region in the mid-to-outer radial zone, and a large continuous structure that spanned the full radius and height of the pellet and accounted for 87.7 % of the total Mo in the pellet. Analysis of this design indicates that the optimal Mo configuration is a balance between creating continuous heat transfer pathways and optimally dispersing Mo to minimize the heat transfer distance through UO 2 . This architecture ultimately produced an effective thermal conductivity of 11.3 W/m·K under the assumed boundary conditions. This result is higher than any previous values from the literature. In conclusion, potential fabrication methods and challenges are discussed in addition to the implications on fuel performance.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2021

When and why PINNs fail to train: A neural tangent kernel perspective

Physics-informed neural networks (PINNs) have lately received great attention thanks to their flexibility in tackling a wide range of forward and inverse problems involving partial differential equations. However, despite their noticeable empirical success, little is known about how such constrained neural networks behave during their training via gradient descent. More importantly, even less is known about why such models sometimes fail to train at all. Here in this work, we aim to investigate these questions through the lens of the Neural Tangent Kernel (NTK); a kernel that captures the behavior of fully-connected neural networks in the infinite width limit during training via gradient descent. Specifically, we derive the NTK of PINNs and prove that, under appropriate conditions, it converges to a deterministic kernel that stays constant during training in the infinite-width limit. This allows us to analyze the training dynamics of PINNs through the lens of their limiting NTK and find a remarkable discrepancy in the convergence rate of the different loss components contributing to the total training error. To address this fundamental pathology, we propose a novel gradient descent algorithm that utilizes the eigenvalues of the NTK to adaptively calibrate the convergence rate of the total training error. Finally, we perform a series of numerical experiments to verify the correctness of our theory and the practical effectiveness of the proposed algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Artificial Intelligence for Accelerating Nuclear Applications, Science, and Technology

Artificial intelligence (AI) and machine learning (ML) methods have had significant impacts in science and technology in recent years. These methods for generating models from datasets or logic-based algorithms that emulate aspects of human performance can similarly accelerate the fields of nuclear applications, science, and technology toward the IAEA goals of contributing to peace, health, and prosperity. In order to accomplish advances with AI in general and ML in particular across these fields, IAEA can play a significant role by establishing, hosting and curating centralised resources, including databases, adhering to FAIR (findable, accessible, interoperable and reusable) principles and Open Science best practices, providing stewardship of data sharing, supporting training efforts and development of relevant workforces, as well as enabling connections among the scientific, technology, mathematics, AI and ethics communities. Many areas can benefit from the use of AI in the realm of nuclear applications. In human health, these areas include clinical research, epidemiology, nutrition, medical imaging, radiotherapy and education of health professionals. AI-based tools are also being used to facilitate different clinical tasks in imaging, computer-assisted diagnosis in mammography and lung cancer screening programmes, and dose prediction in nuclear medicine procedures. ML methods in particular may also increase the efficiency and accuracy of the analysis of computerised tomography and dual-energy absorptiometry scans for body composition and bone analysis. The application of AI methods to nuclear and related technologies in food and agriculture can lead to significant advances and improved efficiency in the optimisation of agricultural production, food product development, management of supply chains, food safety and food authenticity control. In the water and environmental sector, AI can help inform policies to mitigate the world’s water problems. The application of AI techniques to hydrology and environmental sciences is expected to improve patterns identification and enable model predictions under a changing climate.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

"Traffic Control via Connected and Automated Vehicles: An Open-Road Field Experiment with 100 CAVs"

The CIRCLES project aims to reduce instabilities in traffic flow, which are naturally occurring phenomena due to human driving behavior. These "phantom jams" or "stop-and-go waves,"are a significant source of wasted energy. Toward this goal, the CIRCLES project designed a control system referred to as the MegaController by the CIRCLES team, that could be deployed in real traffic. Our field experiment leveraged a heterogeneous fleet of 100 longitudinally-controlled vehicles as Lagrangian traffic actuators, each of which ran a controller with the architecture described in this paper. The MegaController is a hierarchical control architecture, which consists of two main layers. The upper layer is called Speed Planner, and is a centralized optimal control algorithm. It assigns speed targets to the vehicles, conveyed through the LTE cellular network. The lower layer is a control layer, running on each vehicle. It performs local actuation by overriding the stock adaptive cruise controller, using the stock on-board sensors. The Speed Planner ingests live data feeds provided by third parties, as well as data from our own control vehicles, and uses both to perform the speed assignment. The architecture of the speed planner allows for modular use of standard control techniques, such as optimal control, model predictive control, kernel methods and others, including Deep RL, model predictive control and explicit controllers. Depending on the vehicle architecture, all onboard sensing data can be accessed by the local controllers, or only some. Control inputs vary across different automakers, with inputs ranging from torque or acceleration requests for some cars, and electronic selection of ACC set points in others. The proposed architecture allows for the combination of all possible settings proposed above. Most configurations were tested throughout the ramp up to the MegaVandertest.

Lee, Jonathan↗
DOE OSTI2021

Adjoint DSMC for nonlinear Boltzmann equation constrained optimization

Applications for kinetic equations such as optimal design and inverse problems often involve finding unknown parameters through gradient-based optimization algorithms. Based on the adjoint-state method, we derive two different frameworks for approximating the gradient of an objective functional constrained by the nonlinear Boltzmann equation. While the forward problem can be solved by the DSMC method, it is difficult to efficiently solve the high-dimensional continuous adjoint equation obtained by the “optimize-then-discretize” approach. This challenge motivates us to propose an adjoint DSMC method following the “discretize-then-optimize” approach for Boltzmann-constrained optimization. We also analyze the properties of the two frameworks and their connections. Here, several numerical examples are presented to demonstrate their accuracy and efficiency.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2005

Recent Developments in Hardware-in-the-Loop Formation Navigation and Control

The Formation Flying Test-Bed (FFTB) at NASA Goddard Space Flight Center (GSFC) provides a hardware-in-the-loop test environment for formation navigation and control. The facility is evolving as a modular, hybrid, dynamic simulation facility for end-tc-end guidance, navigation, and control (GN&C) design and analysis of formation flying spacecraft. The core capabilities of the FFTB, as a platform for testing critical hardware and software algorithms in-the-loop, are reviewed with a focus on many recent improvements. Two significant upgrades to the FFTB are a message-oriented middleware (MOM) architecture, and a software crosslink for inter-spacecraft ranging. The MOM architecture provides a common messaging bus for software agents, easing integration, arid supporting the GSFC Mission Services Evolution Center (GMSEC) architecture via software bridge. Additionally, the FFTB s hardware capabilities are expanding. Recently, two Low-Power Transceivers (LPTs) with ranging capability have been introduced into the FFTB. The LPT crosslinks will be connected to a modified Crosslink Channel Simulator (CCS), which applies realistic space-environment effects to the Radio Frequency (RF) signals produced by the LPTs.

Mitchell, Jason W.↗
NASA NTRSDate not supplied

Designing the Imaging and Breadboard System for FBCE-TL Project

This presentation outlines the support work done on designing the imaging and breadboard system of the Transfer Line (TL) project, which is the third module for the Flow Boiling and Condensation Experiment (FBCE) operating in the Fluids Integrated Rack on-board the International Space Station (ISS). The goal of the FBCE is to serve as a facility for flow boiling and condensation investigating two-phase flow and heat transfer data in microgravity. The TL module aims use existing FBCE hardware to study cryogenic chilldown, a large component of cryogenic propellant tank transfer research. The TL test module will perform chilldown studies with normal-perfluorohexane (nPFH), a cryogenic simulant, flowing through a super-heated line, which is heated through the process of Joule-heating. SolidWorks and Creo were used to create electrically conductive pipe junctions that connect and seal several Indium Tin Oxide (ITO) coated sapphire tube sections together to allow for low leak probability fluid flow and circumferentially uniform electrical current density. It is necessary to understand and calculate the thermal expansion of the tubing sections such that the junctions would not leak at anticipated operating temperatures and pressures, would maintain electrical contact, and not crack the crystalline tubes. Optical imaging techniques were used to build an experimentally validated image remapping process for flight-like setups of cylindrical tubes. Then MATLAB was used to create an algorithm that distorts an image based on the refraction of light passing through the mediums we were imaging through to accurately visualize the cryogenic chilldown that is of scientific interest. This research will assist NASA to move forward with long-duration spaceflight missions where knowledge of efficient heat transfer processes becomes more critical.

imaging system↗
DOE OSTI2022

Real-Time On-Ramp Merging Control of Connected and Automated Vehicles using Pseudospectral Convex Optimization

Highway on-ramp merging can be a challenging task for human drivers due to the complex vehicle negotiations and interactions in limited time and space. Connected and automated vehicles (CAVs) have great potential to address the problem and offer many benefits in terms of safety, traffic efficiency, and fuel economy. However, real-time optimal control of CAVs still faces many challenges, including nonlinear dynamics, complex inter-vehicle interactions, and a highly dynamic and uncertain traffic environment. To address these challenges, we develop a novel control approach that balances the solution optimality and computational efficiency to determine optimal merging speed profiles in real time. Specifically, by employing a pseudospectral method and a sequential convex programming approach, two algorithms are proposed and implemented within the model predictive control (MPC) framework to enable real-time generation of optimal solutions for potential on-vehicle applications. The convergence and optimality of the proposed algorithms are validated by comparing with a general-purpose solver under different traffic scenarios.

Shi, Yang↗
NASA NTRS1978

On least squares approximations to indefinite problems of the mixed type

A least squares method is presented for computing approximate solutions of indefinite partial differential equations of the mixed type such as those that arise in connection with transonic flutter analysis. The method retains the advantages of finite difference schemes namely simplicity and sparsity of the resulting matrix system. However, it offers some great advantages over finite difference schemes. First, the method is insensitive to the value of the forcing frequency, i.e., the resulting matrix system is always symmetric and positive definite. As a result, iterative methods may be successfully employed to solve the matrix system, thus taking full advantage of the sparsity. Furthermore, the method is insensitive to the type of the partial differential equation, i.e., the computational algorithm is the same in elliptic and hyperbolic regions. In this work the method is formulated and numerical results for model problems are presented. Some theoretical aspects of least squares approximations are also discussed.

Fix, G. J.↗