Search NASA⌕ Search

SEARCH · Search NASA

Results for “Routing 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 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

How Accurate Are Simulations and Experiments for the Lattice Energies of Molecular Crystals?

Molecular crystals play a central role in a wide range of scientific fields, including pharmaceuticals and organic semiconductor devices. However, they are challenging systems to model accurately with computational approaches because of a delicate interplay of intermolecular interactions such as hydrogen bonding and Van der Waals dispersion forces. Here, by exploiting recent algorithmic developments, we report the first set of diffusion Monte Carlo lattice energies for all 23 molecular crystals in the popular and widely used X23 dataset. Comparisons with previous state-of-the-art lattice energy predictions (on a subset of the dataset) and a careful analysis of experimental sublimation enthalpies reveals that high-accuracy computational methods are now at least as reliable as (computationally derived) experiments for the lattice energies of molecular crystals. Overall, this work demonstrates the feasibility of high-level explicitly correlated electronic structure methods for broad benchmarking studies in complex condensed phase systems, and signposts a route towards closer agreement between experiment and simulation. Published by the American Physical Society 2024

Physics↗
DOE OSTI2020

The PAU Survey: Photometric redshifts using transfer learning from simulations

In this paper, we introduce the DEEPZ deep learning photometric redshift (photo-z) code. As a test case, we apply the code to the PAU survey (PAUS) data in the COSMOS field. DEEPZ reduces the σ68 scatter statistic by 50 percent at iAB = 22.5 compared to existing algorithms. This improvement is achieved through various methods, including transfer learning from simulations where the training set consists of simulations as well as observations, which reduces the need for training data. The redshift probability distribution is estimated with a mixture density network (MDN), which produces accurate redshift distributions. Our code includes an autoencoder to reduce noise and extract features from the galaxy SEDs. It also benefits from combining multiple networks, which lowers the photo-z scatter by 10 percent. Furthermore, training with randomly constructed coadded fluxes adds information about individual exposures, reducing the impact of photometric outliers. In addition to opening up the route for higher redshift precision with narrow bands, these machine learning techniques can also be valuable for broad-band surveys.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2016

Algorithms for Heterogeneous, Multiple Depot, Multiple Unmanned Vehicle Path Planning Problems

Unmanned vehicles, both aerial and ground, are being used in several monitoring applications to collect data from a set of targets. This article addresses a problem where a group of heterogeneous aerial or ground vehicles with different motion constraints located at distinct depots visit a set of targets. The vehicles also may be equipped with different sensors, and therefore, a target may not be visited by any vehicle. The objective is to find an optimal path for each vehicle starting and ending at its respective depot such that each target is visited at least once by some vehicle, the vehicle–target constraints are satisfied, and the sum of the length of the paths for all the vehicles is minimized. Two variants of this problem are formulated (one for ground vehicles and another for aerial vehicles) as mixed-integer linear programs and a branchand- cut algorithm is developed to compute an optimal solution to each of the variants. Computational results show that optimal solutions for problems involving 100 targets and 5 vehicles can be obtained within 300 seconds on average, further corroborating the effectiveness of the proposed approach.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2016

Mobile Emergency Generator Pre-Positioning and Real-Time Allocation for Resilient Response to Natural Disasters

Truck-mounted mobile emergency generators (MEGs) are critical flexibility resources of distribution systems (DSs) for resilient emergency response to natural disasters. However, they are currently under-utilized. For better utilization, this paper proposes dispatching MEGs as distributed generators in DSs to restore critical loads by forming multiple microgrids (MGs). As the travel time of MEGs on road networks (RNs) can greatly influence the outage duration of critical loads, a two-stage dispatch framework consisting of pre-positioning and real-time allocation is introduced, and the traffic issue is considered via the vehicle routing problem. Pre-positioning places MEGs in staging locations prior to a natural disaster, while real-time allocation sends MEGs from staging locations to restore critical loads by forming MGs in DSs after the natural disaster strikes. Specifically, with the objective of minimizing the expected outage duration of loads considering their priorities and demand sizes, pre-positioning is done via a scenario-based two-stage stochastic optimization problem, in which the first-stage pre-positioning decisions are evaluated by numbers of second-stage real-time allocation problems corresponding to considered scenarios of DS damage and RN damage/congestion. A scenario decomposition algorithm is applied to solve this problem. Illustrative cases demonstrate the effectiveness of the proposed dispatch scheme and algorithm.

Lei, Shunbo (ORCID:0000000181690821)↗
DOE OSTI2021

Machine learning in materials science: From explainable predictions to autonomous design

The advent of big data and algorithmic developments in the field of machine learning (and artificial intelligence, in general) have greatly impacted the entire spectrum of physical sciences, including materials science. Materials data, measured or computed, combined with various techniques of machine learning have been employed to address a myriad of challenging problems, such as, development of efficient and predictive surrogate models for a range of materials properties, screening and down-selection of novel candidate materials for targeted applications, new methodologies to improve and further expedite molecular and atomistic simulations, with likely many more important developments to come in the foreseeable future. While the applications thus far have provided a glimpse of the true potential data-enabled routes have to offer, it has also become clear that further progress in this direction hinges on our ability to understand, explain and rationalize findings of a machine learning model in light of the domain-knowledge. This focused review provides an overview of the main areas where machine learning has been widely and successfully used in materials science. Subsequently, a brief discussion of several techniques that have been helpful in extracting physically-meaningful insights, causal relationships and design-centric knowledge from materials data is provided. Finally, we identify some of the imminent opportunities and challenges that materials community faces in this exciting and rapidly growing field.

36 MATERIALS SCIENCE↗
DOE OSTI2019

Accounting for errors in quantum algorithms via individual error reduction

Abstract We discuss a surprisingly simple scheme for accounting (and removal) of error in observables determined from quantum algorithms. A correction to the value of the observable is calculated by first measuring the observable with all error sources active and subsequently measuring the observable with each error source reduced separately. We apply this scheme to the variational quantum eigensolver, simulating the calculation of the ground state energy of equilibrium H 2 and LiH in the presence of several noise sources, including amplitude damping, dephasing, thermal noise, and correlated noise. We show that this scheme provides a decrease in the needed quality of the qubits by up to two orders of magnitude. In near-term quantum computing, where full fault-tolerant error correction is too expensive, this scheme provides a route to significantly more accurate calculations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

CAN-D: A Modular Four-Step Pipeline for Comprehensively Decoding Controller Area Network Data

Controller area networks (CANs) are a broadcast protocol for real-time communication of critical vehicle subsystems. Original equipment manufacturers of passenger vehicles hold secret their mappings of CAN data to vehicle signals, and these definitions vary according to make, model, and year. Without these mappings, the wealth of real-time vehicle information hidden in the CAN packets is uninterpretable, severely impeding vehicle-related research, including CAN cybersecurity and privacy studies, aftermarket tuning, efficiency and performance monitoring, and fault diagnosis to name a few. Guided by the four-part CAN signal definition, we present CAN-D (CAN-Decoder), a modular, four-step pipeline for identifying each signal's boundaries (start bit and length), endianness (byte ordering), signedness (bit-to-integer encoding), and by leveraging diagnostic standards, augmenting a subset of the extracted signals with meaningful, physical interpretation. En route to CAN-D, we provide a comprehensive review of the CAN signal reverse engineering research. All previous methods ignore endianness and signedness, rendering them incapable of decoding many standard CAN signal definitions. Incorporating endianness grows the search space from 128 to 4.72E21 signal tokenizations and introduces a web of changing dependencies. In response, we formulate, formally analyze, and provide an efficient solution to an optimization problem, allowing identification of the optimal set of signal boundaries and byte orderings. In addition, we provide two novel, state-of-the-art signal boundary classifiers—both of which are superior to previous approaches in precision and recall in three different test scenarios—and the first signedness classification algorithm, which exhibits a $>$ 97% F-score. Altogether, CAN-D is the only solution with the potential to extract any CAN signal that is also the state of the art. In evaluation on 10 vehicles of different makes, CAN-D's average $\ell ^1$ error is five times better (81% less) than all previous methods and exhibits lower average error, even when considering only signals that meet prior methods’ assumptions. Finally, CAN-D is implemented in lightweight hardware, allowing for an on-board diagnostic (OBD-II) plugin for real-time in-vehicle CAN decoding.

42 ENGINEERING↗
DOE OSTI2013

Multiple transient memories in sheared suspensions: Robustness, structure, and routes to plasticity

Multiple transient memories, first discovered in charge-density-wave conductors, are a remarkable and initially counterintuitive example of how a system can store information about its driving. In this class of memories, a system can learn multiple driving inputs, nearly all of which are eventually forgotten despite their continual input. If sufficient noise is present, the system regains plasticity so that it can continue to learn new memories indefinitely. Recently, Keim and Nagel [Phys. Rev. Lett. 107, 010603 (2011)] showed how multiple transient memories could be generalized to a generic driven disordered system with noise, giving as an example simulations of a simple model of a sheared non-Brownian suspension. Here, we further explore simulation models of suspensions under cyclic shear, focusing on three main themes: robustness, structure, and overdriving. We show that multiple transient memories are a robust feature independent of many details of the model. The steady-state spatial distribution of the particles is sensitive to the driving algorithm; nonetheless, the memory formation is independent of such a change in particle correlations. Finally, we demonstrate that overdriving provides another means for controlling memory formation and retention.

42 ENGINEERING↗
DOE OSTI2022

Broadband Asymmetric Transmission of Linearly Polarized Mid‐Infrared Light Based on Quasi‐3D Metamaterials

Abstract Metamaterials consisting of subwavelength resonators offer an exciting opportunity for realizing asymmetric transmission (AT) of linearly polarized light. However, to date, only moderate/narrow‐band AT responses have been obtained in metadevices based on stacked planar nanostructures. Here, leveraging a combination of a genetic algorithm (GA) based optimization method and a membrane projection lithography (MPL) fabrication approach, a quasi‐3D metamaterial for broadband AT of linearly polarized mid‐infrared light is demonstrated. Facilitated by the customized GA, an efficient exploration of 3D plasmonic meta‐atoms with broken mirror symmetry in the light propagation direction allows the satisfaction of the rigorous conditions for AT of linearly polarized waves over a broad wavelength range. Confirmed by surface current analysis, the observed AT behavior is attributed to the resonant coupling between the plasmonic nanostructures located on the two orthogonal walls of the MPL cavities. Incorporating an advanced inverse‐design method and a state‐of‐art fabrication technique, the methodology used in the present study provides a promising route for exploiting 3D metamaterials with sophisticated functionalities via effectively exploring the high‐dimensional parametric space offered by true 3D meta‐atoms.

Whiting, Eric B.↗
DOE OSTI2023

Efficient Network Partitioning: Application for Decentralized State Estimation in Power Distribution Grids: Preprint

Increase in the proliferation of DERs requires real-time situational awareness for efficient grid operations. State estimation plays an important role for real time control and management of the power grid. As the sensing infrastructure grows, aggregating and handling high volumes of data at a centralized location is extremely difficult. To address this challenge, this paper first proposes a novel and efficient hierarchical spectral clustering-based network partition algorithm followed by a decentralized compressive sensing (DCS) based state estimation. The applicability of the proposed network partitioning algorithm is tested on IEEE-123 bus, IEEE-8500 node, and a 6204-node distribution network. The results shows that the proposed approach efficiently divides the network into multiple sub-networks with the minimum edge connections among the neighbors. Then, we perform DCS-based state estimation on the 6204-node distribution network after dividing the network into 18 optimal partitions. Simulation results show that DCS-based state estimation recovers the system states with high accuracy and low complexity.

ADMM↗
DOE OSTI2019

Machine-Learning-Based Predictive Modeling of Glass Transition Temperatures: A Case of Polyhydroxyalkanoate Homopolymers and Copolymers

Polyhydroxyalkanoate-based polymers—being ecofriendly, biosynthesizable, and economically viable and possessing a broad range of tunable properties—are currently being actively pursued as promising alternatives for petroleum-based plastics. The vast chemical complexity accessible within this class of polymers gives rise to challenges in the rational discovery of novel polymer chemistries for specific applications. Here, the burgeoning field of polymer informatics addresses this challenge via providing tools and strategies for accelerated property prediction and materials design via surrogate machine-learning models built on reliable past data. In this contribution, we use glass transition temperature T g as an example target property to demonstrate promise of the data-enabled route to accelerated learning of accurate structure–property mappings in PHA-based polymers. Our analysis uses a data set of experimentally measured T g values, polymer molecular weights, and a polydispersity index for PHA-based homo- and copolymers that was carefully assembled from the literature. A fingerprinting scheme that captures key properties based on topology, shape, and charge/polarity of specific chemical units or motifs forming the polymer backbone was devised to numerically represent the polymers. A validated statistical learning model is then developed to allow for a mapping of the polymer fingerprints onto the property space in a physically meaningful and reliable manner. Once developed, the model can not only rapidly predict the property of new PHA polymers but also provide uncertainties underlying the predictions. The model is further combined with an evolutionary-algorithm-based search strategy to efficiently identify multicomponent polymer compositions with a prespecified T g . While the present contribution is focused specifically on T g , the surrogate model development approach put forward here is general and can, in principle, be extended to a range of other properties.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

Efficient Network Partitioning: Application for Decentralized State Estimation in Power Distribution Grids

Increase in the proliferation of distributed energy resources require real-time situational awareness for efficient grid operations. State estimation plays an important role for the real-time control and management of the power grid. As the sensing infrastructure grows, aggregating and handling high volumes of data at a centralized location is extremely difficult. To address this challenge, this paper first proposes a novel and efficient hier-archical spectral clustering-based network partitioning algorithm followed by a decentralized compressive sensing (DCS)-based state estimation. The applicability of the proposed network partitioning algorithm is tested on an IEEE 123-bus network, an IEEE 8,500-node system, and a 6,000+ node distribution network. The results shows that the proposed approach efficiently divides the network into multiple sub-networks with the minimum number of edge connections among the neighbors. Then, we perform DCS-based state estimation on the 6,000+ node distribution network after dividing the network into 18 optimal partitions. Simulation results show that the DCS-based state estimation recovers the system states with high accuracy and low complexity.

alternating direction method of multipliers↗
DOE OSTI2021

Dynamical vertex approximation for many-electron systems with spontaneously broken SU(2) symmetry

We generalize the formalism of the dynamical vertex approximation (DΓA)—a diagrammatic extension of the dynamical mean-field theory (DMFT)—to treat magnetically ordered phases. To this aim, we start by concisely illustrating the many-electron formalism for performing ladder resummations of Feynman diagrams in systems with broken SU(2) symmetry associated to ferromagnetic (FM) or antiferromagnetic (AF) order. We then analyze the algorithmic simplifications introduced by taking the local approximation of the two-particle irreducible vertex functions in the Bethe-Salpeter equations, which defines the ladder implementation of DΓA for magnetic systems. The relation of this assumption with the DMFT limit of large coordination-number/high dimensions is explicitly discussed. As a last step, we derive the expression for the ladder DΓA self-energy in the FM- and AF-ordered phases of the Hubbard model. The physics emerging in the AF-ordered case is explicitly illustrated by means of approximated calculations based on a static mean-field input for DΓA equations. The results obtained capture fundamental aspects of both metallic and insulating ground states of two-dimensional antiferromagnets, providing a reliable compass for future, more extensive applications of our approach. Furthermore, possible routes to further develop diagrammatic-based treatments of magnetic phases in correlated electron systems are briefly outlined in the Conclusions.

2-dimensional systems↗
DOE OSTI2011

Rank restriction for the variational calculation of two-electron reduced density matrices of many-electron atoms and molecules

Variational minimization of the ground-state energy as a function of the two-electron reduced density matrix (2-RDM), constrained by necessary N-representability conditions, provides a polynomial-scaling approach to studying strongly correlated molecules without computing the many-electron wave function. Here we introduce a route to enhancing necessary conditions for N representability through rank restriction of the 2-RDM. Rather than adding computationally more expensive N-representability conditions, we directly enhance the accuracy of two-particle (2-positivity) conditions through rank restriction, which removes degrees of freedom in the 2-RDM that are not sufficiently constrained. We select the rank of the particle-hole 2-RDM by deriving the ranks associated with model wave functions, including both mean-field and antisymmetrized geminal power (AGP) wave functions. Because the 2-positivity conditions are exact for quantum systems with AGP ground states, the rank of the particle-hole 2-RDM from the AGP ansatz provides a minimum for its value in variational 2-RDM calculations of general quantum systems. To implement the rank-restricted conditions, we extend a first-order algorithm for large-scale semidefinite programming. The rank-restricted conditions significantly improve the accuracy of the energies; for example, the percentages of correlation energies recovered for HF, CO, and N{sub 2} improve from 115.2%, 121.7%, and 121.5% without rank restriction to 97.8%, 101.1%, and 100.0% with rank restriction. Similar results are found at both equilibrium and nonequilibrium geometries. While more accurate, the rank-restricted N-representability conditions are less expensive computationally than the full-rank conditions.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2021

A data-driven operational model for traffic at the Dallas Fort Worth International Airport

Airports are on the front line of significant innovations, allowing the movement of more people and goods faster, cheaper, and with greater convenience. As air travel continues to grow, airports will face challenges in responding to increasing passenger vehicle traffic, which leads to lower operational efficiency, poor air quality, and security concerns. This paper evaluates methods for traffic demand forecasting combined with traffic microsimulation, which will allow airport operations staff to accurately predict traffic and congestion. Using two years of detailed data describing individual vehicle arrivals and departures, aircraft movements, and weather at Dallas-Fort Worth (DFW) International Airport, we evaluate multiple prediction methods including the Auto Regressive Integrated Moving Average (ARIMA) family of models, traditional machine learning models, and DeepAR, a modern recurrent neural network (RNN). We find that these algorithms are able to capture the diurnal trends in the surface traffic, and all do very well when predicting the next 30 minutes of demand. Longer forecast horizons are moderately effective, demonstrating the challenge of this problem and highlighting promising techniques as well as potential areas for improvement. Traffic demand is not the only factor that contributes to terminal congestion, because temporary changes to the road network, such as a lane closure, can make benign traffic demand highly congested. Combining a demand forecast with a traffic microsimulation framework provides a complete picture of traffic and its consequences. The result is an operational intelligence platform for exploring policy changes, as well as infrastructure expansion and disruption scenarios. To demonstrate the value of this approach, we present results from a case study at DFW Airport assessing the impact of a policy change for vehicle routing in high demand scenarios. This framework can assist airports like DFW as they tackle daily operational challenges, as well as explore the integration of emerging technology and expansion of their services into long term plans.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2012

A first-principles theoretical approach to heterogeneous nanocatalysis

A theoretical approach to heterogeneous catalysis by sub-nanometre supported metal clusters and alloys is presented and discussed. Its goal is to perform a computational sampling of the reaction paths in nanocatalysis via a global search in the phase space of structures and stoichiometry combined with filtering which takes into account the given experimental conditions (catalytically relevant temperature and reactant pressure), and corresponds to an incremental exploration of the disconnectivity diagram of the system. The approach is implemented and applied to the study of propylene partial oxidation by Ag3 supported on MgO(100). First-principles density-functional theory calculations coupled with a Reactive Global Optimization algorithm are performed, finding that: (1) the presence of an oxide support drastically changes the potential energy landscape of the system with respect to the gas phase, favoring configurations which interact positively with the electrostatic field generated by the surface; (2) the reaction energy barriers for the various mechanisms are crucial in the competition between thermodynamically and kinetically favored reaction products; (3) a topological database of structures and saddle points is produced which has general validity and can serve for future studies or for deriving general trends; (4) the MgO(100) surface captures some major features of the effect of an oxide support and appears to be a good model of a simple oxide substrate; (5) strong cooperative effects are found in the co-adsorption of O2 and other ligands on small metal clusters. The proposed approach appears as a viable route to advance the role of predictive computational science in the field of heterogeneous nanocatalysis.

Chemistry↗
DOE OSTI2023

Minimal Energy Routing of a Leader and a Wingmate with Periodic Connectivity

We consider a route planning problem in which two unmanned vehicles are required to complete a set of tasks present at distinct locations, referred to as targets, with minimum energy consumption. The mission environment is hazardous, and to ensure a safe operation, the UVs are required to communicate with each other at every target they visit. The problem objective is to determine the allocation of the tasks to the UVs and plan tours for the UVs to visit the targets such that the weighted sum of the distances traveled by the UVs and the distances traveled by the communicating signals between them is minimized. We formulate this problem as an Integer program and show that naively solving the problem using commercially available off-the-shelf solvers is insufficient in determining scalable solutions efficiently. To address this computational challenge, we develop an approximation and a heuristic algorithm, and employ them to compute high-quality solutions to a special case of the problem where equal weights are assigned to the distances traveled by the vehicles and the communicating signals. For this special case, we show that the approximation algorithm has a fixed approximation ratio of 3.75. We also develop lower bounds to the optimal cost of the problem to evaluate the performance of these algorithms on large-scale instances. We demonstrate the performance of these algorithms on 500 randomly generated instances with the number of targets ranging from 6 to 100, and show that the algorithms provide high-quality solutions to the problem swiftly; the average computation time of the algorithmic solutions is within a fraction of a second for instances with at most 100 targets. Finally, we show that the approximation ratio has a variable ratio for the weighted case of the problem. Specifically, if ρ denotes the ratio of the weights assigned to the distances representing the communication and travel costs, the algorithm has an a posteriori ratio of $3 + \frac{3ρ}{4}$ when ρ ≥ 1, and $\frac{3}{ρ}$ + $\frac{3}{4}$ when ρ ≤ 1.

42 ENGINEERING↗