Search NASA⌕ Search

SEARCH · Search NASA

Results for “heuristic algorithms”

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 163 records · Page 9

Data-Driven Event Detection of Power Systems Based on Unequal-Interval Reduction of PMU Data and Local Outlier Factor

With the deployment of phasor measurement units (PMU) and wide area measurement system (WAMS), it is feasible to have an insight into the events occurred in power systems based on measured data. Thus, a novel data-driven algorithm based on local outlier factor (LOF) is proposed in this work to detect and locate events in power systems using reduced PMU data. First, the unequal-interval reduction method is presented to reduce the scale of PMU data in sub-stations and reconstruct it in master station of WAMS, which can relieve the burden of communication systems. Then, principle component analysis (PCA)-based similarity search method is proposed to measure the differences of operation state between any two buses. Next, LOF is presented to detect the abnormal events in power systems, and employed to determine the region of the event source. Finally, six cases from the Western electricity coordinating council (WECC) 179-bus power system, a case from the South China power system (SCPS), and a case from the Guangdong power system (GDPS) are utilized to demonstrate the effectiveness of the proposed algorithm. Overall, the results show that proposed algorithm is effective and can be applied to event detection, event location, and online monitoring, which can enhance the situation awareness ability of power system operators.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Global Load Balancing with Parallel Mesh Adaption on Distributed-Memory Systems

Dynamic mesh adaption on unstructured grids is a powerful tool for efficiently computing unsteady problems to resolve solution features of interest. Unfortunately, this causes load imbalance among processors on a parallel machine. This paper describes the parallel implementation of a tetrahedral mesh adaption scheme and a new global load balancing method. A heuristic remapping algorithm is presented that assigns partitions to processors such that the redistribution cost is minimized. Results indicate that the parallel performance of the mesh adaption code depends on the nature of the adaption region and show a 35.5X speedup on 64 processors of an SP2 when 35% of the mesh is randomly adapted. For large-scale scientific computations, our load balancing strategy gives almost a sixfold reduction in solver execution times over non-balanced loads. Furthermore, our heuristic remapper yields processor assignments that are less than 3% off the optimal solutions but requires only 1% of the computational time.

Biswas, Rupak↗

Global Load Balancing with Parallel Mesh Adaption on Distributed-Memory Systems

Dynamic mesh adaptation on unstructured grids is a powerful tool for efficiently computing unsteady problems to resolve solution features of interest. Unfortunately, this causes load inbalances among processors on a parallel machine. This paper described the parallel implementation of a tetrahedral mesh adaption scheme and a new global load balancing method. A heuristic remapping algorithm is presented that assigns partitions to processors such that the redistribution coast is minimized. Results indicate that the parallel performance of the mesh adaption code depends on the nature of the adaption region and show a 35.5X speedup on 64 processors of an SP2 when 35 percent of the mesh is randomly adapted. For large scale scientific computations, our load balancing strategy gives an almost sixfold reduction in solver execution times over non-balanced loads. Furthermore, our heuristic remappier yields processor assignments that are less than 3 percent of the optimal solutions, but requires only 1 percent of the computational time.

Biswas, Rupak↗

Distributionally Safe Path Planning: Wasserstein Safe RRT

In this paper, we propose a Wasserstein metric-based random path planning algorithm. Wasserstein Safe RRT (W-Safe RRT) provides finite-sample probabilistic guarantees on the safety of a returned path in an uncertain obstacle environment. Vehicle and obstacle states are modeled as distributions based upon state and model observations. Additionally, we define limits on distributional sampling error so the Wasserstein distance between a vehicle state distribution and obstacle distributions can be bounded. This enables the algorithm to return safe paths with a confidence bound through combining finite sampling error bounds with calculations of the Wasserstein distance between discrete distributions. W-Safe RRT is compared against a baseline minimum encompassing ball algorithm, which ensures balls that minimally encompass discrete state and obstacle distributions do not overlap. The improved performance is verified in a 3D environment using single, multi, and rotating non-convex obstacle cases, with and without forced obstacle error in adversarial directions, showing that W-Safe RRT can handle poorly modeled complex environments.

42 ENGINEERING↗

Peer-to-Peer Communication Trade-Offs for Smart Grid Applications: Preprint

Peer-to-peer energy management systems for smart grids require developers to consider the trade-offs between the amount of communication traffic generated and the quality and speed of convergence of the control algorithms that are deployed. Employing a fully connected communication causes messages to scale exponentially with the number of nodes, while using a sparse connectivity causes less information dissemination leading to degradation of the algorithm performance. The best communication topology for a particular application lies somewhere in between and often requires empirical evaluation by application designers. Existing methods do not put focus on the needs for smart grid applications, which is information dissemination throughout the network and they do not provide a flexible solution for application developers to prototype and deploy different topologies without modifying the application code. This paper introduces a configurable virtual communication topology framework TopLinkMgr, allowing users to specify any chosen communication topology and deploy peer-to-peer applications using it. It also introduces a self-adaptive, fault-tolerant topology management algorithm, Bounded Path Dissemination that can ensure the dissemination of information to all peers within a specified threshold for a sparsely connected topology. Experiments show that the algorithm improves on convergence speed and accuracy over state-of-the-art methods and is also robust against node failures. The results indicate the possibility of achieving a close-to optimal convergence without overloading the network allowing the realization of peer-to-peer control platforms covering larger and more complex power systems.

Bounded Path Dissemination↗

Recent Development of Frequency Estimation Methods for Future Smart Grid

The frequency estimated by the Phasor Measurement Unit (PMU) is a critical index of power system status and supports many smart grid applications. The future smart grid features high penetration of renewables and more fast-moving power electronics inverters but raises challenges to the reliable frequency estimation. This article presents three methods to address these challenges. First, an enhanced zero-crossing algorithm was developed to track the fast-changing frequency in system dynamics. Second, we propose a technology that can tolerate the system transient and suppress the outliers. Third, an algorithm was developed to export high time-resolution frequency estimations with minimum computational effort. All of the proposed methods are realized in hardware and compared with classical frequency estimation methods. The testing results indicate that the proposed methods have excellent performance. They can be used in future PMUs and provide reliable and high time resolution data for smart grid applications.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Accurate Consensus-based Distributed Averaging with Variable Time Delay in Support of Distributed Secondary Control Algorithms

We report that distributed secondary control has been widely used in hierarchical control structures, where multiple distributed generators (DGs) need to coordinate to regulate system voltage and frequency. In these systems, consensus algorithms determine the average of a group of dynamic states (e.g. voltages measured by a group of DGs). To be useful, consensus algorithms must be computationally efficient, stable and accurate. In practice, numerous practical implementation challenges significantly affect the consensus equilibrium. In this paper, we quantify the accuracy deviations of the distributed average observer algorithms proposed in the literature to demonstrate the problems with the state-of-the-art distributed averaging techniques. A novel approach is proposed that achieves accurate average tracking in the presence of time-varying communication delays among agents. In our implementation, time synchronization of all distributed controllers is enabled by a novel software platform, called Resilient Information Architecture Platform for the Smart Grid (RIAPS). The proposed distributed average observer is implemented on hardware controllers and its effectiveness is validated in a controller hardware-in-the-loop testbed.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Long-term strategic planning of inter-city fast charging infrastructure for battery electric vehicles

Here, this study introduces a multistage mixed integer modeling framework for long-term strategic planning of the battery electric vehicle (BEV) inter-city fast charging infrastructure. In response to the growing BEV inter-city travel demand, the framework integrates both an optimization model for decisions on where and when to build charging stations and a stochastic queuing model to determine how many chargers are needed for each station. A genetic algorithm based heuristic method is developed to efficiently solve the problem. The model is applied to investigate the long-term infrastructure requirement in the state of California where significant growth in BEV demand is expected in coming decades. Our findings indicate that the charging infrastructure is expanded in both network coverage (number of stations) and service capacity (number of chargers per station) as the BEV demand grows. We also found that the infrastructure requirement is dependent on many factors, such as the BEV electrified range, the required level of service at charging stations, and the range anxiety cost. For most simulated scenarios, the results show that it is beneficial to invest in the inter-city fast charging infrastructure, even though the range anxiety cost is at its low end.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

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↗

Design, Preparation, and Execution of the 100-AV Field Test for the CIRCLES Consortium: Methodology and Implementation of the Largest Mobile Traffic Control Experiment to Date

This article presents the comprehensive design, setup, execution, and evaluation of the MegaVanderTest (MVT) experiment conducted by the Congestion Impacts Reduction via CAV-in-the-Loop Lagrangian Energy Smoothing (CIRCLES) Consortium, which aimed to mitigate traffic congestion using partially autonomous vehicles (AVs) (see “Summary”). The experiment involved 100 vehicles on Nashville’s Interstate 24 (I-24) highway, utilizing various control algorithms to smooth stop-and-go traffic waves. The execution of the MVT experiment required a coordinated effort from multiple teams. This article details the meticulous planning process, the coordinated efforts of multiple teams, and the innovative use of a dynamic agent-based simulation framework for traffic evaluation. Here, the contributions of this work include demonstrating and providing a detailed roadmap for large-scale live traffic experiments, illustrating the lessons learned from the MVT experiment, and introducing the other articles in this issue and their complementary relationship in the MVT experiment.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DyG-DPCD: A Distributed Parallel Community Detection Algorithm for Large-Scale Dynamic Graphs

Dynamic (Temporal) graphs capture the valuable evolution of real-world systems, from the continuously evolving patterns of social interactions and genetic pathways to the dynamic fluctuations of economic forces. Detecting communities for such evolving networks poses unique challenges. Detecting and analyzing the evolution of communities within dynamic graphs unlocks valuable insights into the underlying structural and temporal patterns of real-world systems. However, the sheer volume of modern graph data and the inherent complexity of the temporal dimension pose significant challenges to scalable community detection algorithms. Addressing this gap, our work explores the limited landscape of scalable distributed-memory parallel methods specifically designed for dynamic network community detection. We propose a novel parallel algorithm, DyG-DPCD (Dynamic Graph Distributed Parallel Community Detection), to detect communities in dynamic networks using the Message Passing Interface (MPI) framework. We present a vertex-centric approach, allowing us to detect communities through local optimization. Furthermore, we enhance our baseline algorithm by incorporating three heuristics, which improve the algorithm’s performance significantly while maintaining the quality of the solutions. We demonstrate the efficiency of our algorithm by experimenting on several real-world large-scale networks with hundreds of millions of edges spanning diverse domains. Notably, DyG-DPCD achieves speedups between 25× and 30× for large networks that we experimented on using NERSC compute nodes. In conclusion, our algorithm outperforms the STINGER parallel re-agglomeration algorithm by 30×.

97 MATHEMATICS AND COMPUTING↗

K-Spin Hamiltonian for Quantum-Resolvable Markov Decision Processes

The Markov decision process is the mathematical formalization underlying the modern field of reinforcement learning when transition and reward functions are unknown. We derive a pseudo-Boolean cost function that is equivalent to a K-spin Hamiltonian representation of the discrete, finite, discounted Markov decision process with infinite horizon. This K-spin Hamiltonian furnishes a starting point from which to solve for an optimal policy using heuristic quantum algorithms such as adiabatic quantum annealing and the quantum approximate optimization algorithm on near-term quantum hardware. In arguing that the variational minimization of our Hamiltonian is approximately equivalent to the Bellman optimality condition for a prevalent class of environments we establish an interesting analogy with classical field theory. Along with proof-of-concept calculations to corroborate our formulation by simulated and quantum annealing against classical Q-Learning, we analyze the scaling of physical resources required to solve our Hamiltonian on quantum hardware.

Hamiltonian↗

Incorporating energy storage and user experience in isolated microgrid dispatch using a multi-objective model

In order to coordinate multiple different scheduling objectives from the perspectives of economy, environment, and users, a practical multi-objective dynamic optimal dispatch model incorporating energy storage and user experience is proposed for isolated microgrids. In this model, besides microturbine units, energy storage is employed to provide spinning reserve services for microgirds; and furthermore, from the perspective of demand side management, a consumer satisfaction indicator is developed to measure the quality of user experience. A two-step solution methodology incorporating multi-objective optimisation and decision analysis is put forward to address this model. First, a powerful heuristic optimisation algorithm, called the -dominance based evolutionary algorithm, is used to find a well-distributed set of Pareto-optimal solutions of the problem. Thereby, the best compromise solutions are identified from the entire solutions with the use of decision analysis by integrating fuzzy C-means clustering and grey relation projection. The simulation results on the modified Oak Ridge National Laboratory Distributed Energy Control and Communication lab microgrid test system demonstrate the effectiveness of the proposed approach.

Li, Yang↗

Implementation of Bin Packing Model for Reed Switch Production Planning

This paper presents a form to resolve a real problem of efficient material election in reed switch manufacturing. The carrying out of the consumer demands depends on the stochastic results of the classification process where each lot of switches is distributed into bins according to an electric measure value. Various glass types are employed for the switch manufacturing. The effect caused by the glass type variation on the switch classification results was investigated. Based on real data statistic analysis, the problem is reduced to the lot number minimizing taking into consideration the glass type, and interpreted as a bin packing problem generalization. On difference to the classic bin packing problem, in the considered case, an item represents a set of pieces; a container is divided into a number of bins (sub-containers); the bin capacity is variable; there are the assignment restrictions between bins and sets of pieces; the items are allowed to be fragmented into bins and containers. The problem has a high complexity. A heuristic offline algorithm is proposed to find the quantity, types and packing sequence of containers, the item fragments associated with containers and bins. The bin capacities do not affect the algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Drive-pressure optimization in ramp-wave compression experiments through differential evolution

Ramp-wave dynamic-compression experiments are used to examine quasi-isentropic loading paths in materials. The gradual and continuous increase in pressure created by ramp waves make these types of experiments ideal for studying nonequilibrium material behavior, such as solidification kinetics. In ramp-wave compression experiments, the input drive pressure to the experimental setup may be exerted through one of a number of different mechanisms (e.g., magnetic fields, gas-gun-driven impactors, or high-energy lasers) and is generally required for simulating such experiments. Yet, regardless of the specific mechanism, this drive pressure cannot be measured directly (measurements are generally taken at a location near the back of the experimental setup through a transparent window), leading to an inverse problem where one must determine the drive pressure at the front of the experimental setup (i.e., the input) that corresponds to the particle velocity (the output) measured near the back of the experimental setup. Furthermore, we solve this inverse problem using a heuristic optimization algorithm, known as differential evolution, coupled with a multiphysics, hydrodynamics code that simulates the compression of the experimental setup. By running many rounds of forward simulations of the experimental setup, our optimization process iteratively searches for a drive pressure that is optimized to closely reproduce the experimentally measured particle velocity near the back of the experimental setup. While our optimization methodology requires a significant number of hydrodynamics simulations to be conducted, many of these can be performed in parallel, which greatly reduces the time cost of our methodology. One novel aspect of our method for determining the drive pressure is that it does not require physical modeling of the drive mechanism and can thus be broadly applied to many types of ramp-compression experiments, regardless of the drive mechanism.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Diabatic quantum annealing for the frustrated ring model

Abstract Quantum annealing (QA) is a continuous-time heuristic quantum algorithm for solving or approximately solving classical optimization problems. The algorithm uses a schedule to interpolate between a driver Hamiltonian with an easy-to-prepare ground state and a problem Hamiltonian whose ground state encodes solutions to an optimization problem. The standard implementation relies on the evolution being adiabatic: keeping the system in the instantaneous ground state with high probability and requiring a time scale inversely related to the minimum energy gap between the instantaneous ground and excited states. However, adiabatic evolution can lead to evolution times that scale exponentially with the system size, even for computationally simple problems. Here, we study whether non-adiabatic evolutions with optimized annealing schedules can bypass this exponential slowdown for one such class of problems called the frustrated ring model. For sufficiently optimized annealing schedules and system sizes of up to 39 qubits, we provide numerical evidence that we can avoid the exponential slowdown. Our work highlights the potential of highly-controllable QA to circumvent bottlenecks associated with the standard implementation of QA.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Spoofing Cross-Entropy Measure in Boson Sampling

Cross-entropy (XE) measure is a widely used benchmark to demonstrate quantum computational advantage from sampling problems, such as random circuit sampling using superconducting qubits and boson sampling (BS). We present a heuristic classical algorithm that attains a better XE than the current BS experiments in a verifiable regime and is likely to attain a better XE score than the near-future BS experiments in a reasonable running time. The key idea behind the algorithm is that there exist distributions that correlate with the ideal BS probability distribution and that can be efficiently computed. The correlation and the computability of the distribution enable us to postselect heavy outcomes of the ideal probability distribution without computing the ideal probability, which essentially leads to a large XE. Our method scores a better XE than the recent Gaussian BS experiments when implemented at intermediate, verifiable system sizes. Much like current state-of-the-art experiments, we cannot verify that our spoofer works for quantum-advantage-size systems. However, we demonstrate that our approach works for much larger system sizes in fermion sampling, where we can efficiently compute output probabilities. Finally, we provide analytic evidence that the classical algorithm is likely to spoof noisy BS efficiently.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗