Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 1,549 records · Page 86

Optimizing Process-to-Core Mappings for Application Level Multi-dimensional MPI Communications

Multi-dimensional MPI communications, where MPI communications have to be performed in each dimension of a Cartesian communicator, have been frequently used in many of today's high performance computing applications. While individual MPI collective communications for regular communicators with a one-dimensional linear-ranking of processes have been extensively studied and optimized, little optimizations have been performed for multi-dimensional MPI collective communications on multi-dimensional Cartesian topology. In this paper, we optimize multi-dimensional MPI collective communications for SMP and multi-core systems at the application level. We show that the default Cartesian topology built by the state-of-the-art MPI implementations produce sub-optimal performance for multi-dimensional MPI collective communications. We design optimal process-to-core mapping schemes for Cartesian communicators to minimize the total inter-node communications. The proposed technique improves the performance by up to 80% over the default Cartesian topology built by Cray's MPI implementation MPT 3.1.02 on the world's current second fastest supercomputer Jaguar at Oak Ridge National Laboratory.

Computer Science↗

Fourier Analysis-Based Evolutionary Multi-Objective Multiphysics Optimization of Liquid-Cooled Heat Sinks

Optimal heat dissipation in power modules can significantly increase their power density. Removing the generated heat is critical for capturing the benefits of advanced semiconductor materials and improving the reliability of the device operation. This article proposes a design optimization method for liquid-cooled heat sinks that use a Fourier analysis-based tool and an evolutionary optimization algorithm to optimize the heat sink geometry for specified objectives. The optimized heat sink geometry is then compared with state-of-the-art solutions in literature based on finite element analysis of different designs. The proposed methodology can develop complex geometries that outperform the conventional heat sink geometries.

Sahu, Raj↗

Parameter Co-optimization for Hybrid Electric Vehicles Powertrain System Leveraging V2V/V2I Information

A parameter tuning based co-optimization scheme for the hybrid electric vehicles (HEV) powertrain system is designed to maximize the fuel efficiency. The optimization controlled input parameters are chosen based on sensitivity study of powertrain control parameters. The vehicle to vehicle (V2V) and vehicle to infrastructure information is another optimization input, to have the driving conditions taking in to considerations for maximizing fuel efficiency. The catalyst temperature is considered as an additional constraint as the speed to reach light-off temperature should not decrease during optimized operation. Neural network is used to develop a simplified yet equivalent model for the optimization problem model. We have achieved an average of 9.22% fuel savings for a random driving cycle on a Toyota Prius test model.

V2V, Cooptimization↗

PowerMappeR: Power-Optimized Mapping of SNNs onto ReRAM Crossbars coupled via Packet-Switched NoCs

Many recent efforts in developing hardware-accelerated spiking neural networks (SNNs) are characterized by deep co-design between algorithms, architectures, and devices. Architectural advances overcome device constraints by coupling together many small resistive-RAM (ReRAM) crossbars via a network-on-chip (NoC) for neuromorphic component operation. Concurrently, improved SNN training methods increase accuracy and structural sparsity in networks despite growing problem sizes. Finally, compilers leverage these attributes to minimize area and inter-crossbar communication while mapping large SNNs to sophisticated architectures. However, for compiler-driven co-design to realize increasingly complex and profitable optimizations, a compile-time view of power consumption is critical. We present PowerMappeR to express and optimize over mapping-, architecture-, and device-specific power consumption information. By modeling the dynamic power of well-established components, we develop an integer linear programming (ILP)-based, encoding-agnostic, parametric power estimation model. Using this model, we demonstrate practical improvements in area and inter-crossbar communication by 0%–9.5% and 1.4%–5.1%, respectively. We also limit hotspot formation during optimization, achieving comparable or better results in targeted metrics with up to 96.4%–97.1% restriction of hotspot magnitude. Finally, we introduce profile-guided formulations to reduce worst-case and expected-case hotspot magnitude by 40.7%–69.5% and 40.6%–56.3%, respectively. Optimizing worst-case hotspot magnitude incidentally improves expected-case magnitude by 10.85%–33.45%. Reciprocally, optimizing expected-case magnitude incidentally improves worst-case magnitude by 4.33%–39.87%. Validation against hardware simulators confirms that PowerMappeR can decrease dynamic power consumption by 12.6%–27.3%.

Pohl, Devin [ORNL] (ORCID:0009000040149027)↗

NO-LESS: Near optimal curtailment strategy selection for net load balancing in micro grids

The integration of renewable energy sources such as solar PVs into micro grids has increased in recent years. However, the intermittent and unpredictable nature of renewable energy generation makes supply uncertain, in turn requiring continuous net load balancing to ensure grid stability. One technique to achieve net load balancing is curtailment, however, selection of the optimal set of curtailment strategies to achieve a targeted curtailment is NP-hard. State-of-the-art curtailment selection techniques approach this problem by either developing computationally expensive optimal curtailment strategies or reduce accuracy to generate sub-optimal solutions quickly. In this work, we develop NO-LESS: a Near OptimaL CurtailmEnt Strategy Selection algorithm. NO-LESS is a novel Fully Polynomial Time Approximation Scheme (FPTAS) which determines bounded (near optimal) curtailment strategies in a small amount of time while simultaneously satisfying practical constraints on strategy switching overhead and curtailment fairness. We perform both theoretical analysis and practical evaluation to show that NO-LESS is a scalable solution for performing net load balancing through curtailment strategy selection in Micro Grids.

14 SOLAR ENERGY↗

A Real-time Agent Based Optimization and Control Approach for Residential Building Heating Ventilation and Air Conditioning Systems

The prevalence of the loT (Internet of Things) is fostering the development of new control options and decision making that was not previously available. This is creating a wealth of opportunities for real-time control approaches and systems that can optimize for a common goal. This paper presents a smart residential neighborhood with optimization at the residential level utilizing a system of agents. The optimization utilizes information and modeling to optimize variable speed HVAC real-time operation in actual residential buildings. Data is presented showing the performance of the optimization and conclusions are drawn on next steps for development.

Hall, Joni↗

State Dependent Optimization with Quantum Circuit Cutting

Quantum circuits can be reduced through optimization to better fit the constraints of quantum hardware. One such method, initial-state dependent optimization (ISDO), reduces gate count by leveraging knowledge of the input quantum states. Surprisingly, we found that ISDO is broadly applicable to the downstream circuits produced by circuit cutting. Circuit cutting also requires measuring upstream qubits and has some flexibility of selection observables to do reconstruction. Therefore, we propose a state-dependent optimization (SDO) framework that incorporates ISDO, our newly proposed measure-state dependent optimization (MSDO), and a biased observable selection strategy. Building on the strengths of the SDO framework and recognizing the scalability challenges of circuit cutting, we propose nonseparate circuit cutting-a more flexible approach that enables optimizing gates without fully separating them. We validate our methods on noisy simulations of QAOA, QFT, and BV circuits. Results show that our approach consistently mitigates noise and improves overall circuit performance, demonstrating its promise for enhancing quantum algorithm execution on near-term hardware.

Li, Xinpeng↗

Accelerating Traction Motor Optimization Design with AI Surrogate Models

The advancement of artificial intelligence systems enables the use of data-driven physics-based surrogate models to explore design spaces rapidly and deeply for engineering projects. This work presents a surrogate model workflow that accelerates electric traction motor design optimization by replacing finite element analysis (FEA) with an artificial neural network (ANN) and using this model in a genetic algorithm for design optimization. A baseline interior permanent-magnet motor is parameterized and sampled to generate FEA-labeled training data, after which a feed-forward ANN predicts key outputs (e.g., loss components and weight). The validated surrogate enables genetic-algorithm optimization and deep search over the design space without new FEA runs, producing Pareto-optimal trade-offs between weight and losses and set of optimized designs for rapid downselection of manufacturable motor designs.

Ribeiro, Pedro [ORNL] (ORCID:0009000921026641)↗

Importance Sampling Model-Based Diffusion for Trajectory Optimization

Trajectory optimization for robotic systems remains a challenging problem. This is especially true for robotic systems featuring nonlinear dynamics and many degrees of freedom. Data-based or model-free diffusion has recently been popularized in the fields of artificial intelligence and trajectory optimization. Model-Based Diffusion provides a data-free method of trajectory optimization, trained at runtime on a system dynamics model, suitable for high-dimensional models. This paper examines how importance sampling can enhance the performance of Model-Based Diffusion for trajectory optimization. Here, we quantify the benefits of importance sampling across three long horizon planning tasks. These results show as much as a 13x improvement in sample efficiency depending on environment and optimization parameters.

Golembeski, Seth [Georgia Institute of Technology,↗

Prometheus: Coherent Exploration of Hardware and Software Optimizations using Aspen

With the dramatic increase in scale expected for Exascale computing, there is a dire need for tuning of hardware configurations and software optimizations such that they are in unison. However, the expected increase in tunable hardware parameters makes searching through the design space for optimal hardware-and-software configurations much more challenging. Towards this end, we propose a composable hardware-software optimization framework called Prometheus. Prometheus uses a combination of analytical and machine-learning techniques to capture application characteristics and subsequently determine the hardware-software configuration for near-optimal performance. We evaluate Prometheus for its efficacy using four widely used proxy applications: LULESH, CoMD, CG and CoEVP. We demonstrate that Prometheus identifies near-optimal hardwaresoftware configurations and verify the results via brute-force search of the design space.

Umar, Mariam↗

A Hierarchical Optimization Method for Electric Vertical Takeoff and Landing Aircraft Network Design

Electric vertical takeoff and landing aircraft (eVTOLs) are expected to serve urban air mobility in a station-to-station configuration, which makes the optimal network design of eVTOL stations a critical question to explore. Existing approaches often face limitations, such as the inability to interact station locations with demand or difficulty in finding the optimal solution for large study regions. Here, this paper first proposes a mathematical model to generate optimal eVTOL station locations while considering associated potential eVTOL demand, and then proposes a heuristic algorithm, Hierarchical Optimization MEthod (HOME), to efficiently solve the model. With a case study of Southern California, HOME was compared to 1) directly solving the original integer linear programming-based network design problem, and 2) employing the widely used genetic algorithm. Results suggest that HOME can find optimal solutions with limited computational resources. The proposed framework powered by HOME provides a computationally efficient way to support urban air mobility planning.

97 MATHEMATICS AND COMPUTING↗

Optimization of Error-Bounded Lossy Compression for Hard-to-Compress HPC Data

Since today’s scientific applications are producing vast amounts of data, compressing them before storage/transmission is critical. Results of existing compressors show two types of HPC data sets: highly compressible and hard to compress. In this work, we carefully design and optimize the error-bounded lossy compression for hard-tocompress scientific data. We propose an optimized algorithm that can adaptively partition the HPC data into best-fit consecutive segments each having mutually close data values, such that the compression condition can be optimized. Another significant contribution is the optimization of shifting offset such that the XOR-leading-zero length between two consecutive unpredictable data points can be maximized. We finally devise an adaptive method to select the best-fit compressor at runtime for maximizing the compression factor. We evaluate our solution using 13 benchmarks based on real-world scientific problems, and we compare it with 9 other state-of-the-art compressors. Experiments show that our compressor can always guarantee the compression errors within the user-specified error bounds. Most importantly, our optimization can improve the compression factor effectively, by up to 49% for hard-tocompress data sets with similar compression/decompression time cost.

97 MATHEMATICS AND COMPUTING↗

Optimal Decentralized Protocol for Electric Vehicle Charging

We propose a decentralized algorithm to optimally schedule electric vehicle (EV) charging. The algorithm exploits the elasticity of electric vehicle loads to fill the valleys in electric load profiles. We first formulate the EV charging scheduling problem as an optimal control problem, whose objective is to impose a generalized notion of valley-filling, and study properties of optimal charging profiles. We then give a decentralized algorithm to iteratively solve the optimal control problem. In each iteration, EVs update their charging profiles according to the control signal broadcast by the utility company, and the utility company alters the control signal to guide their updates. The algorithm converges to optimal charging profiles (that are as "flat" as they can possibly be) irrespective of the specifications (e.g., maximum charging rate and deadline) of EVs, even if EVs do not necessarily update their charging profiles in every iteration, and use potentially outdated control signal when they update. Moreover, the algorithm only requires each EV solving its local problem, hence its implementation requires low computation capability. We also extend the algorithm to track a given load profile and to real-time implementation.

Gan, LW↗

Optimal Black Start Allocation for Power System Restoration

Equipment failures, operator errors, natural disasters and cyber-attacks can and have caused extended blackouts of the electric grid. Even though such events are rare, preparedness for them is critical because extended power outages endanger human lives, compromise national security, or result in economic losses of billions of dollars. Since most of the generating units cannot restart without connecting to an energized grid, the system operator relies on a few units with the ability to start autonomously, called Black Start (BS) units, to restore the power system. Allocating and maintaining these units is costly and can severely impact the restoration security and time. We formulate an optimization problem to optimally allocate BS units in the grid, while simultaneously optimizing over the restoration sequence. We extend existing optimal allocation models by including grid considerations such as active power nodal balance, transmission switching, nodal reactive power support and voltage limits. In order to aid the branch and bound tree that solves the resulting large scale mixed integer program, we propose a randomized heuristic that is executed multiple times in parallel on a high-performance computing environment to find feasible solutions. Here, we proceed to solve the IEEE-39, the IEEE-118, and a simplified WECC system with 225 nodes and 136 generators to near optimality.

97 MATHEMATICS AND COMPUTING↗

A Model Predictive Control Based Generator Start-Up Optimization Strategy for Restoration With Microgrids as Black-Start Resources

Microgrids (MGs) can operate in an islanded mode and serve as black-start resources for power system restoration (PSR). Here, a model predictive control (MPC) based generator start-up optimization strategy for PSR is proposed utilizing MGs as black-start resources. First, the generator start-up sequence (GSUS) optimization is formulated as a mixed integer linear programming. Then, the uncertainties of MG black-start resources (MBSRs) are modeled by discretizing the probability distribution of the forecast errors, and representative scenarios for MBSRs extracted by formulating the probability mass transportation problem. Third, the generator start-up optimization strategy considering MBSRs is proposed utilizing the MPC technique, in which the optimization objective is to maximize the energy capability of the power systems and minimize the load curtailment of the MGs in each looking-ahead interval. Simulations on the IEEE 118 bus system with MGs and Zhejiang provincial power system in China verify that the introduced strategy for PSR can successfully restore the power system and effectively determine the optimal GSUS.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Integrated Optimization of Powertrain Energy Management and Vehicle Motion Control for Autonomous Hybrid Electric Vehicles

Hybrid Electric Vehicles (HEVs) and autonomous vehicles have been widely studied recently for on-road transportation. In the study of autonomous HEVs, the control of the vehicle's external dynamics and powertrain dynamics are often treated separately. Optimizing these two problems together can significantly improve fuel economy. In this paper, an autonomous HEV following a leader is considered. First, the augmented model to integrate the abovementioned dynamics is presented. Second, the optimization problem is defined to find the optimum fuel consumption of the follower in pursuit of a leader in a drive cycle. A customized control strategy based on Approximate Dynamic Programming (ADP) is then explored in which the optimal cost-to-go at each time step is approximated using neural networks. Also, the accuracy of the optimization solution is enhanced by applying the concept of the reachable sets. At last, three case studies show that the examined integrated control strategy outperforms the one with the separated optimization method by an additional 7.4%, 4.6%, and 11.8% improvement in fuel consumption, respectively.

33 ADVANCED PROPULSION SYSTEMS↗

Optimization of the thrombin generation test components to measure potency of factor VIII concentrates

Introduction The thrombin generation test (TGT) is used both as a global haemostasis assay, and to compare activities of coagulation factor concentrates that have been spiked into patient plasma. However, TGT has not been systematically optimized to evaluate factor VIII (FVIII) product potency. Aims To improve the sensitivity of TGT to FVIII and allow a comparative analysis of the thrombin generating capacities of FVIII concentrates against reference preparations with known FVIII activity. Methods Concentrations of TGT components (analytical variables) were assessed to maximize the linearity and range of responses to the concentration of FVIII. Results We optimized the range and sensitivity of the TGT assay with respect to FVIII through the addition of FXIa to the assay. Other parameters that were adjusted, i.e. tissue factor (TF), procoagulant lipids and plasma concentrations, did not improve the ability of the assay to measure both high and very low levels of FVIII. In the optimized TF/FXIa‐activated TGT assay, all thrombin generation curve parameters were suitable for FVIII quantification, but thrombin peak height and maximal velocity demonstrated better linearity in the desired FVIII range. We found that the optimized TF/FXIa‐activated TGT has a wider range of sensitivity to FVIII than a commercially available TGT. Additionally, we demonstrated that the TF/FXIa‐activated assay performs adequately by comparing potency measurements of five commercially available FVIII products using TGT and traditional chromogenic and one‐stage clotting assays. Conclusions The optimized TGT assay can be used to quantify and compare the thrombin generating capacities of FVIII concentrates.

Jha, N. K.↗

Optimal linear reconstruction of dark matter from halo catalogues

The dark matter lumps (or "halos") that contain galaxies have locations in the Universe that are to some extent random with respect to the overall matter distributions. We investigate how best to estimate the total matter distribution from the locations of the halos. We derive the weight function w(M) to apply to dark-matter haloes that minimizes the stochasticity between the weighted halo distribution and its underlying mass density field. The optimal w(M) depends on the range of masses of halos being used. While the standard biased-Poisson model of the halo distribution predicts that bias weighting is optimal, the simple fact that the mass is comprised of haloes implies that the optimal w(M) will be a mixture of mass-weighting and bias-weighting. In N-body simulations, the Poisson estimator is up to 15× noisier than the optimal. Optimal weighting could make cosmological tests based on the matter power spectrum or cross-correlations much more powerful and/or cost effective.

79 ASTRONOMY AND ASTROPHYSICS↗