Search NASA⌕ Search

SEARCH · Search NASA

Results for “Heuristic Optimization”

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 55 records · Page 3

Teaching Game Theory to Kids and Limits of Prediction

I have once been asked to read a lecture to a group of 6th graders on Game Theory. After agreeing to it, I realized that explaining the game theory basics to 6th graders my be difficult, given that terms such as Nash equilibrium, minimax, maximin, optimization may not resonate in a 6th grade classroom. Instead I've introduced game theory using the rock-paper-scissors (RPS) game. Turns out kids are excellent gametheoreticians. In RPS, they understood both the benefits of randomizing their own strategy and of predicting their opponent's moves. They offered a number of heuristics both for the prediction and opening move. These heuristics included optimizing against past opponent moves, such as not playing rock if the opponent just played scissors, and playing a specific opening hand, such as "paper". Visualizing the effects of such strategic choices on-the-fly would be interesting and educational. This brief essay attempts demonstrating and visualizing the value of a few different strategic options in RPS. Specifically, we would like to illustrate the following: 1) what is the value of being unpredictable?; and 2) what is the value of being able to predict your opponent? In regard to prediction of human players, the question 2) has been reflected in Jon McLoone's entry in Wolfram Blog from January 20, 2014[1]. McLoone created a predictive algorithm for playing against human opponents, that learns to beat human opponents reliably after approximately 30 - 40 games. I use McLoone's implementation to represent a predictive and random strategies. The rest of this documents 1) investigates performance of this predictive strategy against a random strategy (which is optimal in RPS) and in 2) attempts to turn this predictive power against the predictive strategy by allowing the opponent the full knowledge of the predictor's strategy (but not the choices made using the strategy). This exposes a weakness in predictions made without taking risks into account by illustrating that predictive strategy may make the predictor predictable as well.

97 MATHEMATICS AND COMPUTING↗

Inverse reinforcement learning control for building energy management

Reinforcement learning (RL) based control is widely considered a promising approach in building automation and control as it has demonstrated the potential to deal with complex objectives in adjacent domains like robotics, autonomous vehicles, gaming applications, and advertisement recommendations. When applied to any environment, model-free RL learns to improve its control performance over time without requiring a control model, by receiving and then analyzing feedback from the building environment after each control action. Operational objectives are becoming increasingly complex through the simultaneous consideration of thermal comfort, carbon emissions, grid services, and indoor air quality. In this context, conventional rule-based control approaches are proving sub-optimal, mostly heuristic, and inadequate. The model-free and self learning nature of RL appears promising and attractive as it may address the scalability issues associated with advanced control approaches. However, it suffers from long training times and unstable control behavior during the early stages of its learning process, which makes it unsuitable to be applied directly to buildings. This paper addresses these issues using an inverse reinforcement learning approach (IRL), a technique utilized to learn the objective of a controller agent which is considered an expert in its respective domain. Here, we consider a rule-based control as the expert demonstrator. IRL is different from a direct imitation (i.e., direct mapping of states to actions) of control actions as it tries to find the underlying intent of an expert's policy, providing the controller with a better-generalized policy for unseen states or environments with slightly different dynamics. This approach propels the RL controller's policy to levels similar to or better than that of a rule-based policy before it starts learning by interacting with the building. This makes RL for building energy management applications more practical as it prevents the erratic and exploratory behavior in the initial training period, simultaneously speeding up the learning process when compared to applying an untrained RL agent directly to a building environment.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

End-to-end protocol for high-quality quantum approximate optimization algorithm parameters with few shots

The quantum approximate optimization algorithm (QAOA) is a quantum heuristic for combinatorial optimization that has been demonstrated to scale better than state-of-the-art classical solvers for some problems. For a given problem instance, QAOA performance depends crucially on the choice of the parameters. While average-case optimal parameters are available in many cases, meaningful performance gains can be obtained by fine-tuning these parameters for a given instance. This task is especially challenging, however, when the number of circuit executions (shots) is limited. In this work, we develop an end-to-end protocol that combines multiple parameter settings and fine-tuning techniques. We use large-scale numerical experiments to optimize the protocol for the shot-limited setting and observe that optimizers with the simplest internal model (linear) perform best. We implement the optimized pipeline on a trapped-ion processor using up to 32 qubits and 5 QAOA layers, and we demonstrate that the pipeline is robust to small amounts of hardware noise. To the best of our knowledge, these are the largest demonstrations of QAOA parameter fine-tuning on a trapped-ion processor in terms of two-qubit gate count.

quantum algorithms & computation↗

Data-Driven Voltage Regulation of Distribution Grid Using Nonlinear Autoregressive Model with Exogenous Inputs (NARX)

This article proposes data-driven control via a nonlinear autoregressive model with exogenous inputs (NARX) for real-time voltage regulation of a modified feeder using reactive power sources. Traditional voltage control strategies rely on rule-based heuristics or optimization techniques, which often require detailed system models and extensive computational resources. The NARX-based controller learns system dynamics from historical data and predicts optimal reactive power dispatch in real-time for voltage correction. The proposed approach is evaluated on a power system feeder model under varying load and network conditions. Simulation results demonstrate that the NARX-based controller achieves improved voltage regulation, offering higher adaptability to system fluctuations. This study highlights the potential of data-driven control for enhancing the reliability of power distribution networks.

Donge, Vrushabh [ORNL] (ORCID:0000000306062803)↗

Impacts of Dispatch Strategies and Forecast Errors on the Economics of Behind-the-Meter PV-Battery Systems

To assess the economic value of batteries in hybrid PV-battery systems, one must create a dispatch profile for the battery. Many analyses of battery value assume perfect forecasts of PV generation and load, determining an upper limit on the value of the battery. Prior work that accounts for forecast uncer- tainty often does so in the context of a single dispatch algorithm, which does not provide a baseline for comparison. Furthermore, when multiple dispatch algorithms are assessed with uncertainty, the benefits considered are for diesel generation in a microgrid, not retail rate savings. This work addresses the gaps in the literature by comparing the performance of both heuristic and optimal dispatch algorithms for retail rate savings under forecast uncertainty, and provides comparisons of the robustness of these algorithms and their associated estimates of economic value. We find that using a perfect forecast can overestimate the value of hybrid PV-battery systems between 1% and 8% compared to the reality of using a day-ahead forecast, depending on the dispatch algorithm used. Thus, accounting for forecast uncertainty in system design and analysis will significantly improve the accuracy of modeled system values.

batteries↗

Energy Consumption and Cost Reduction of Future Light-Duty Vehicles through Advanced Vehicle Technologies: A Modeling Simulation Study Through 2050

The U.S. Department of Energy’s (DOE’s) Vehicle Technologies Office (VTO) and Hydrogen and Fuel Cell Technologies Office (HFTO) aim to develop sustainable, affordable and efficient technologies for transportation of goods and people. Translating investments in advanced transportation component technologies and powertrains to estimate vehicle-level fuel savings potential is critical for understanding DOE’s impact. In this work, we simulated technologies funded by VTO and HFTO for light duty vehicles. The simulations were performed across: Multiple powertrain configurations (i.e., conventional, power-split, extended-range electric vehicle, battery electric drive, and fuel-cell vehicles), Vehicle classes (i.e., compact car, midsize car, small sport utility vehicle [SUV], midsize SUV, and pickup trucks); and Fuels (i.e., gasoline, diesel, hydrogen, and battery electricity). These various technologies are assessed for six different timeframes: laboratory years 2015, 2020, 2025, 2030, and 2045. A delay of 5 years is assumed between laboratory year and model year (year technology is introduced into production). Finally, uncertainties are included for both technology performance and cost aspects by considering two cases: Low case, aligned with DOE technology manager estimates of expected original equipment manufacturer (OEM) improvements based on regulations, business as usual; and High case, aligned with aggressive technology advancements based on R&D targets developed through support by VTO & HFTO. These scenarios are not intended as predictions of future performances. The energy and cost impact of different technologies were estimated using Autonomie (www.autonomie.net), Argonne vehicle system simulation tool. Autonomie is a state-of-the-art vehicle system simulation tool used to assess the energy consumption, performance and cost of multiple advanced vehicle technologies across classes (from light to heavy duty), powertrains (from conventional to HEVs, FCEVs, PHEVs and BEVs), components and control strategies. Autonomie is packaged with a complete set of vehicle models for a wide range of vehicle classes, powertrain configurations and component technologies, including vehicle level and component level controls. These controls were developed and calibrated using dynamometer test data. Autonomie has been used to support a wide range of studies including analyzing various component technologies, sizing powertrains components for different vehicle requirements, comparing the benefits of powertrain configurations, optimizing both heuristic and route based vehicle energy control and predicting transportation energy use when paired with a traffic modeling tool such as POLARIS. This report documents the assumptions and estimates the vehicle-level energy consumption benefits and associated technology costs for the various types of light duty vehicles. All details of vehicle assumptions and simulation results are available in the spreadsheets accompanying this report.

33 ADVANCED PROPULSION SYSTEMS↗

A Comprehensive Simulation Study to Evaluate Future Vehicle Energy and Cost Reduction Potential

Under the umbrella of EERE’s Office of Sustainable Transportation, the U.S. Department of Energy’s (DOE) Vehicle Technologies Office (VTO) and Hydrogen and Fuel Cell Technologies Office (HFTO) seek to develop sustainable, affordable, and efficient technologies for transportation of goods and people. Translating investments in advanced transportation component technologies and powertrains to estimate the potential for vehicle-level fuel savings is critical to understanding DOE’s impact and success in this mission For this study, Argonne National Laboratory (Argonne) simulated technologies funded by VTO and HFTO for light-duty vehicles across the following: Powertrain configurations (conventional, power-split hybrid electric vehicle, extended-range electric vehicle, battery electric drive, and fuel-cell vehicles); Vehicle classes (compact car, mid-size car, small sport utility vehicle [SUV], mid-size SUV, and pickup truck); Fuels (gasoline, diesel, natural gas, hydrogen, and battery electricity). We assessed each technology for five different timeframes: laboratory years 2015 (reference), 2020, 2025, 2030, and 2045. We assumed a delay of 5 years between laboratory year and model year (i.e., the year the technology is introduced into production). Finally, we included uncertainties for both technology performance and cost by considering two cases (note that these cases are not intended as predictions of future performance): Low case , aligned with DOE technology manager estimates of expected original equipment manufacturer (OEM) improvements based on business as usual regulatory and market environments; High case , aligned with aggressive technology advancements based on research and development (R&D) targets developed through support by VTO and HFTO. We estimated the energy and cost impact of different technologies using Autonomie (Argonne undated), a state-of-the-art vehicle system simulation tool developed by Argonne and used to assess the energy consumption, performance, and cost of multiple advanced vehicle technologies. The tool comprises a complete set of vehicle models to assess impacts across a wide range of classes (from light- to heavy-duty), powertrain configurations (from conventional to hybrid electric vehicles [HEVs], fuel cell electric vehicles [FCEVs], plug-in hybrid electric vehicles [PHEVs], and battery electric vehicles [BEVs]), components, and control strategies, including vehicle-level and component-level controls developed and calibrated using dynamometer test data. Autonomie has been used to support a wide range of studies: analyzing various component technologies, sizing powertrain components to meet different vehicle requirements, comparing the benefits of powertrain configurations, optimizing both heuristic and route-based vehicle energy control, and predicting transportation energy use when paired with a traffic modeling tool such as POLARIS. This report documents the assumptions made and the vehicle-level energy consumption benefits and associated technology costs estimated for various types of light-duty vehicles. Details regarding vehicle assumptions and simulation results are available in the spreadsheets accompanying this report.

08 HYDROGEN↗

Integrating automated structured analysis and design with Ada programming support environments

Ada Programming Support Environments (APSE) include many powerful tools that address the implementation of Ada code. These tools do not address the entire software development process. Structured analysis is a methodology that addresses the creation of complete and accurate system specifications. Structured design takes a specification and derives a plan to decompose the system subcomponents, and provides heuristics to optimize the software design to minimize errors and maintenance. It can also produce the creation of useable modules. Studies have shown that most software errors result from poor system specifications, and that these errors also become more expensive to fix as the development process continues. Structured analysis and design help to uncover error in the early stages of development. The APSE tools help to insure that the code produced is correct, and aid in finding obscure coding errors. However, they do not have the capability to detect errors in specifications or to detect poor designs. An automated system for structured analysis and design TEAMWORK, which can be integrated with an APSE to support software systems development from specification through implementation is described. These tools completement each other to help developers improve quality and productivity, as well as to reduce development and maintenance costs. Complete system documentation and reusable code also resultss from the use of these tools. Integrating an APSE with automated tools for structured analysis and design provide capabilities and advantages beyond those realized with any of these systems used by themselves.

Hecht, Alan↗

PLUM: Parallel Load Balancing for Unstructured Adaptive Meshes

Dynamic mesh adaption on unstructured grids is a powerful tool for computing large-scale problems that require grid modifications to efficiently resolve solution features. Unfortunately, an efficient parallel implementation is difficult to achieve, primarily due to the load imbalance created by the dynamically-changing nonuniform grid. To address this problem, we have developed PLUM, an automatic portable framework for performing adaptive large-scale numerical computations in a message-passing environment. First, we present an efficient parallel implementation of a tetrahedral mesh adaption scheme. Extremely promising parallel performance is achieved for various refinement and coarsening strategies on a realistic-sized domain. Next we describe PLUM, a novel method for dynamically balancing the processor workloads in adaptive grid computations. This research includes interfacing the parallel mesh adaption procedure based on actual flow solutions to a data remapping module, and incorporating an efficient parallel mesh repartitioner. A significant runtime improvement is achieved by observing that data movement for a refinement step should be performed after the edge-marking phase but before the actual subdivision. We also present optimal and heuristic remapping cost metrics that can accurately predict the total overhead for data redistribution. Several experiments are performed to verify the effectiveness of PLUM on sequences of dynamically adapted unstructured grids. Portability is demonstrated by presenting results on the two vastly different architectures of the SP2 and the Origin2OOO. Additionally, we evaluate the performance of five state-of-the-art partitioning algorithms that can be used within PLUM. It is shown that for certain classes of unsteady adaption, globally repartitioning the computational mesh produces higher quality results than diffusive repartitioning schemes. We also demonstrate that a coarse starting mesh produces high quality load balancing, at a fraction of the cost required a fine initial mesh. Results indicate that our parallel load balancing strategy will remain viable on large numbers of processors.

Oliker, Leonid↗

Parallel Tetrahedral Mesh Adaptation with Dynamic Load Balancing

The ability to dynamically adapt an unstructured grid is a powerful tool for efficiently solving computational problems with evolving physical features. In this paper, we report on our experience parallelizing an edge-based adaptation scheme, called 3D_TAG. using message passing. Results show excellent speedup when a realistic helicopter rotor mesh is randomly refined. However. performance deteriorates when the mesh is refined using a solution-based error indicator since mesh adaptation for practical problems occurs in a localized region., creating a severe load imbalance. To address this problem, we have developed PLUM, a global dynamic load balancing framework for adaptive numerical computations. Even though PLUM primarily balances processor workloads for the solution phase, it reduces the load imbalance problem within mesh adaptation by repartitioning the mesh after targeting edges for refinement but before the actual subdivision. This dramatically improves the performance of parallel 3D_TAG since refinement occurs in a more load balanced fashion. We also present optimal and heuristic algorithms that, when applied to the default mapping of a parallel repartitioner, significantly reduce the data redistribution overhead. Finally, portability is examined by comparing performance on three state-of-the-art parallel machines.

Oliker, Leonid↗

A Practical Approach to Obstacle Field Route Planning for Unmanned Rotorcraft

Autonomous helicopter operations in the near-earth environment will require robust and efficient obstacle field route planning. A method for obstacle field route planning is presented, which is composed of a mesh generation phase, a graph search phase, and a route refinement phase. The method mixes optimization and heuristics to obtain a satisfactory solution quickly. Simulations based on an unmanned helicopter model are presented.

Howlet, Jason K.↗

Optimizing spacecraft design - optimization engine development : progress and plans

At JPL and NASA, a process has been developed to perform life cycle risk management. This process requires users to identify: goals and objectives to be achieved (and their relative priorities), the various risks to achieving those goals and objectives, and options for risk mitigation (prevention, detection ahead of time, and alleviation). Risks are broadly defined to include the risk of failing to design a system with adequate performance, compatibility and robustness in addition to more traditional implementation and operational risks. The options for mitigating these different kinds of risks can include architectural and design choices, technology plans and technology back-up options, test-bed and simulation options, engineering models and hardware/software development techniques and other more traditional risk reduction techniques.

risk↗

Massively Parallel Dantzig-Wolfe Decomposition Applied to Traffic Flow Scheduling

Optimal scheduling of air traffic over the entire National Airspace System is a computationally difficult task. To speed computation, Dantzig-Wolfe decomposition is applied to a known linear integer programming approach for assigning delays to flights. The optimization model is proven to have the block-angular structure necessary for Dantzig-Wolfe decomposition. The subproblems for this decomposition are solved in parallel via independent computation threads. Experimental evidence suggests that as the number of subproblems/threads increases (and their respective sizes decrease), the solution quality, convergence, and runtime improve. A demonstration of this is provided by using one flight per subproblem, which is the finest possible decomposition. This results in thousands of subproblems and associated computation threads. This massively parallel approach is compared to one with few threads and to standard (non-decomposed) approaches in terms of solution quality and runtime. Since this method generally provides a non-integral (relaxed) solution to the original optimization problem, two heuristics are developed to generate an integral solution. Dantzig-Wolfe followed by these heuristics can provide a near-optimal (sometimes optimal) solution to the original problem hundreds of times faster than standard (non-decomposed) approaches. In addition, when massive decomposition is employed, the solution is shown to be more likely integral, which obviates the need for an integerization step. These results indicate that nationwide, real-time, high fidelity, optimal traffic flow scheduling is achievable for (at least) 3 hour planning horizons.

Rios, Joseph Lucio↗

Integrated Traffic Flow Management Decision Making

A generalized approach is proposed to support integrated traffic flow management decision making studies at both the U.S. national and regional levels. It can consider tradeoffs between alternative optimization and heuristic based models, strategic versus tactical flight controls, and system versus fleet preferences. Preliminary testing was accomplished by implementing thirteen unique traffic flow management models, which included all of the key components of the system and conducting 85, six-hour fast-time simulation experiments. These experiments considered variations in the strategic planning look-ahead times, the replanning intervals, and the types of traffic flow management control strategies. Initial testing indicates that longer strategic planning look-ahead times and re-planning intervals result in steadily decreasing levels of sector congestion for a fixed delay level. This applies when accurate estimates of the air traffic demand, airport capacities and airspace capacities are available. In general, the distribution of the delays amongst the users was found to be most equitable when scheduling flights using a heuristic scheduling algorithm, such as ration-by-distance. On the other hand, equity was the worst when using scheduling algorithms that took into account the number of seats aboard each flight. Though the scheduling algorithms were effective at alleviating sector congestion, the tactical rerouting algorithm was the primary control for avoiding en route weather hazards. Finally, the modeled levels of sector congestion, the number of weather incursions, and the total system delays, were found to be in fair agreement with the values that were operationally observed on both good and bad weather days.

Grabbe, Shon R.↗

Impacts of Dispatch Strategies and Forecast Errors on the Economics of Behind-the-Meter PV-Battery Systems

To assess the economic value of batteries in hybrid PV-battery systems, one must create a dispatch profile for the battery. Many analyses of battery value assume perfect forecasts of PV generation and load, determining an upper limit on the value of the battery. Prior work that accounts for forecast uncertainty often does so in the context of a single dispatch algorithm, which does not provide a baseline for comparison. Furthermore, when multiple dispatch algorithms are assessed with uncertainty, the benefits considered are for diesel generation in a microgrid, not retail rate savings. This work addresses the gaps in the literature by comparing the performance of both heuristic and optimal dispatch algorithms for retail rate savings under forecast uncertainty, and provides comparisons of the robustness of these algorithms and their associated estimates of economic value. We find that using a perfect forecast can overestimate the value of hybrid PV-battery systems between 1% and 8% compared to the reality of using a day-ahead forecast, depending on the dispatch algorithm used. Thus, accounting for forecast uncertainty in system design and analysis will significantly improve the accuracy of modeled system values.

batteries↗

Impacts of Dispatch Strategies and Forecast Errors on the Economics of Behind-the-Meter PV-Battery Systems: Preprint

To assess the economic value of batteries in hybrid PV-battery systems, one must create a dispatch profile for the battery. Many analyses of battery value assume perfect forecasts of PV generation and load, determining an upper limit on the value of the battery. Prior work that accounts for forecast uncertainty often does so in the context of a single dispatch algorithm, which does not provide a baseline for comparison. Furthermore, when multiple dispatch algorithms are assessed with uncertainty, the benefits considered are for diesel generation in a microgrid, not retail rate savings. This work addresses the gaps in the literature by comparing the performance of both heuristic and optimal dispatch algorithms for retail rate savings under forecast uncertainty, and provides comparisons of the robustness of these algorithms and their associated estimates of economic value. We find that using a perfect forecast can overestimate the value of hybrid PV-battery systems between 1% and 8% compared to the reality of using a day-ahead forecast, depending on the dispatch algorithm used. Thus, accounting for forecast uncertainty in system design and analysis will significantly improve the accuracy of modeled system values.

batteries↗

OCTOKV: An Agile Network-Based Key-Value Storage System with Robust Load Orchestration

In this paper, we propose OctoKV, an innovative network-based key-value storage system. OctoKV addresses the repetitive address translation overhead associated with traditional key-value stores running on file systems on the client side. To mitigate this overhead, we implemented the key-value store on the server side using NVMe-oF and a user-level NVMe driver. In particular, we employed fine-grained resource monitoring and load balancing based on heuristics to optimize I/O performance. OctoKV is deployed on a Linux cluster with Intel SPDK. The extensive evaluation shows that OctoKV achieves lower I/O response times in comparison to traditional approaches where key-value stores run on the client side. Also, the proposed load balancing strategies efficiently enhance I/O response times by equally distributing the workload from overloaded cores to other cores.

Khan, Awais↗

Coordinated distribution network control of tap changer transformers, capacitors and PV inverters

A power distribution system operates most efficiently with voltage deviations along a feeder kept to a minimum and must ensure all voltages remain within specified limits. Recently with the increased integration of photovoltaics, the variable power output has led to increased voltage fluctuations and violation of operating limits. This study proposes an optimization model based on a recently developed heuristic search method, grey wolf optimization, to coordinate the various distribution controllers. Several different case studies on IEEE 33 and 69 bus test systems modified by including tap changing transformers, capacitors and photovoltaic solar panels are performed. Simulation results are compared to two other heuristic-based optimization methods: harmony search and differential evolution. Finally, the simulation results show the effectiveness of the method and indicate the usage of reactive power outputs of PVs facilitates better voltage magnitude profile.

24 POWER TRANSMISSION AND DISTRIBUTION↗