Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Distributed 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,117 records · Page 62

Parallel Memory-Independent Communication Bounds for SYRK

In this paper, we focus on the parallel communication cost of multiplying a matrix with its transpose, known as a symmetric rank-k update (SYRK). SYRK requires half the computation of general matrix multiplication because of the symmetry of the output matrix. Recent work (Beaumont et al., SPAA '22) has demonstrated that the sequential I/O complexity of SYRK is also a constant factor smaller than that of general matrix multiplication. Inspired by this progress, we establish memory-independent parallel communication lower bounds for SYRK with smaller constants than general matrix multiplication, and we show that these constants are tight by presenting communication-optimal algorithms. The crux of the lower bound proof relies on extending a key geometric inequality to symmetric computations and analytically solving a constrained nonlinear optimization problem. Here, the optimal algorithms use a triangular blocking scheme for parallel distribution of the symmetric output matrix and corresponding computation.

Communication costs↗

Air data system optimization using a genetic algorithm

An optimization method for flush-orifice air data system design has been developed using the Genetic Algorithm approach. The optimization of the orifice array minimizes the effect of normally distributed random noise in the pressure readings on the calculation of air data parameters, namely, angle of attack, sideslip angle and freestream dynamic pressure. The optimization method is applied to the design of Pressure Distribution/Air Data System experiment (PD/ADS) proposed for inclusion in the Aeroassist Flight Experiment (AFE). Results obtained by the Genetic Algorithm method are compared to the results obtained by conventional gradient search method.

Deshpande, Samir M.↗

Multimodal Bayesian registration of noisy functions using Hamiltonian Monte Carlo

Functional data registration is a necessary processing step for many applications. The observed data can be inherently noisy, often due to measurement error or natural process uncertainty; which most functional alignment methods cannot handle. A pair of functions can also have multiple optimal alignment solutions, which is not addressed in current literature. In this paper, a flexible Bayesian approach to functional alignment is presented, which appropriately accounts for noise in the data without any pre-smoothing required. Additionally, by running parallel MCMC chains, the method can account for multiple optimal alignments via the multi-modal posterior distribution of the warping functions. To most efficiently sample the warping functions, the approach relies on a modification of the standard Hamiltonian Monte Carlo to be well-defined on the infinite-dimensional Hilbert space. In this work, this flexible Bayesian alignment method is applied to both simulated data and real data sets to show its efficiency in handling noisy functions and successfully accounting for multiple optimal alignments in the posterior; characterizing the uncertainty surrounding the warping functions.

97 MATHEMATICS AND COMPUTING↗

Unravelling the origins of shale nanoporosity using small-angle neutron scattering (SANS)

Hydrocarbon production from tight rocks is constrained by slow diffusion within the shale matrix, limited by small pore sizes and low permeability. The nanopore proportion and size distribution significantly influence matrix permeability, a key property for optimizing hydrocarbon recovery and supporting hydrogen production while minimizing environmental impacts. Small-angle neutron scattering (SANS) has been an important tool for exploring the characteristics and structure of shale nanopores. This study used SANS to analyze nanoporosity and pore size distribution (<100 nm) in tight rocks with varying compositions to determine the influence of rock heterogeneity on SANS measurements. Results showed that nanoporosity correlates with clay content, with the highest clay-rich shale (52.48 wt% clay) exhibiting 8.8 % nanoporosity. SANS also revealed more nanopores than traditional nitrogen adsorption measurements, affirming its ability to reflect bulk mineralogy and upholding the relevance of experimental findings using this technique to optimize field operational approaches.

03 NATURAL GAS↗

Distributed Energy Resource-Cognizant Upgrade Paths to the Traditional Restoration Strategy of Utilities for Improved Load Restoration

Climate change has resulted in increasingly impactful and more frequent occurrences of extreme weather events. This trend poses a significant challenge for distribution utilities and system operators to ensure that there is uninterrupted power supply to critical loads in their networks under fault scenarios; however, currently, utilities deploying the automated fault location, isolation and restoration (FLISR) function in their advanced distribution management system (ADMS) do not take into account the available generation and load-modification capabilities of distributed energy resources present in the disconnected network due to an upstream isolated fault. This results in the network reconfiguration and restoration to result in sub-optimal load restoration. Therefore, this paper presents two approaches that can upgrade the existing FLISR capabilities of distribution utilities to significantly increase the restoration of critical loads. The performance of the proposed approaches is evaluated on a numerical model of a real distribution feeder in Georgia, USA.

DER↗

Optimal Transactive Energy Trading of Electric Vehicle Charging Stations With On-Site PV Generation in Constrained Power Distribution Networks

This paper presents a two-level transactive energy market framework, that enables energy trading among electric vehicle charging stations (EVCSs). At the lower level, the discharging capability of EVs and on-site PV generation are leveraged by individual EVCS for participating in the transactive trading with their peers. Once the lower-level trading is completed, EVCSs trade energy at the upper level through the power grid network managed by the distribution system operator (DSO). The upper-level market is cleared while satisfying the power distribution network constraints. A cooperative game-based model is proposed to model the energy trading among EVCSs. To this end, the asymmetric Nash bargaining method is applied to allocate the grand coalition's payoff to each EVCS at the upper-level market, while a weighted proportional allocation method is used to allocate individual EVCS's payoff to its respective EVs at the lower-level market. In this work, the upper-level market formulation is further decomposed into two subproblems representing an energy scheduling and trading subproblem which maximizes EVCS payoffs, and a bargaining subproblem which allocates EVCS payoffs. The effectiveness of the proposed framework for incentivizing transactive trades among EVs and EVCSs is validated in case studies.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Deconflicting Wind-Optimal Aircraft Trajectories in North Atlantic Oceanic Airspace

North Atlantic oceanic airspace accommodates more than 1000 flights daily, and is subjected to very strong winds. Flying wind-optimal trajectories yields time and fuel savings for each individual flight. However, when taken together, these trajectories induce a large amount of potential en-route conflicts. This paper analyses the detected conflicts, figuring out conflict distribution in time and space. It further describes an optimization algorithm aimed at reducing the number of conflicts for a daily set of flights on strategic level. Several trajectory modification strategies are discussed, followed with simulation results. Finally, an algorithm improvement is presented aiming at better preserving the trajectory optimality.

wind-optimal trajectories↗

A Novel Multi-Agent Deep Reinforcement Learning-enabled Distributed Power Allocation Scheme for mmWave Cellular Networks

We consider the power allocation problem over shared spectrum for millimeter-Wave (mmWave) cellular downlink. Existing approaches usually find sub-optimal solutions by solving a non-convex optimization which leads to scalability issues due to centralized control. Therefore, distributed and adaptive approaches are desirable. Recently, model-free Deep Reinforcement Learning (DRL) has achieved success in such wireless resource management tasks. By modeling the radio environment as a Markov Decision Process (MDP) with the base stations (BSs) being the agents, power allocation can be automated at the agent level with comparable throughput performance to conventional centralized schemes. The multi-agent setting presents new challenges as the radio environment is impacted by the joint actions of the agents and is no longer stationary from any individual agent’s perspective. Existing literature bypasses this non-stationarity violation by ignoring it which may cause performance degradation. To tackle this issue, we propose a distributed continuous power allocation scheme based on a modified version of multi-agent Deep Deterministic Policy Gradient (MADDPG) that is tailored for the distributed multiple-agent setting. The proposed scheme employs a centralized-training distributed-execution framework where Q-functions are trained over subsets of BSs while each BS determines its transmit power based only on its own local observation. It admits constant per-BS communication and computation complexity and is thus scalable to large networks. Numerical evaluation shows that the proposed scheme adapts well to a wide range of interference conditions and can achieve comparable or better performance than several state-of-the-art non-learning approaches.

99 GENERAL AND MISCELLANEOUS↗

Uniform secondary current distribution at disk electrodes under Tafel kinetics enabled by concentric current-shielding rings

Non-uniform secondary current distribution at rotating disk electrodes (RDE) is a common problem when using resistive electrolyte media or large applied currents. In a recent publication, we have shown that auxiliary electrodes such as the ring of a rotating ring disk electrode (RRDE) can help suppress current non-uniformities at the disk enabling reliable electroanalytical measurements. However, this previous work considered linear kinetics where current distribution non-uniformities were moderate. In the present contribution, we consider current distribution non-uniformities encountered under Tafel kinetics. We show, for the case of 2,5-dihydroxy-1,4-benzoquinone (DHBQ) reduction, that optimally chosen ring conditions serve to provide effective shielding at the disk edge rendering the overall disk current distribution to be uniform. Numerical modeling and scaling analysis (using the Wagner number) are presented to aid a user in determining the optimal ring current density for achieving uniform disk current distribution under Tafel kinetics. This approach is especially useful when studying soluble-soluble redox transitions for which, unlike deposit distribution in electrodeposition, the current distribution non-uniformity is not visually apparent.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Chance-Constrained Guidance With Non-Convex Constraints

Missions to small bodies, such as comets or asteroids, require autonomous guidance for descent to these small bodies. Such guidance is made challenging by uncertainty in the position and velocity of the spacecraft, as well as the uncertainty in the gravitational field around the small body. In addition, the requirement to avoid collision with the asteroid represents a non-convex constraint that means finding the optimal guidance trajectory, in general, is intractable. In this innovation, a new approach is proposed for chance-constrained optimal guidance with non-convex constraints. Chance-constrained guidance takes into account uncertainty so that the probability of collision is below a specified threshold. In this approach, a new bounding method has been developed to obtain a set of decomposed chance constraints that is a sufficient condition of the original chance constraint. The decomposition of the chance constraint enables its efficient evaluation, as well as the application of the branch and bound method. Branch and bound enables non-convex problems to be solved efficiently to global optimality. Considering the problem of finite-horizon robust optimal control of dynamic systems under Gaussian-distributed stochastic uncertainty, with state and control constraints, a discrete-time, continuous-state linear dynamics model is assumed. Gaussian-distributed stochastic uncertainty is a more natural model for exogenous disturbances such as wind gusts and turbulence than the previously studied set-bounded models. However, with stochastic uncertainty, it is often impossible to guarantee that state constraints are satisfied, because there is typically a non-zero probability of having a disturbance that is large enough to push the state out of the feasible region. An effective framework to address robustness with stochastic uncertainty is optimization with chance constraints. These require that the probability of violating the state constraints (i.e., the probability of failure) is below a user-specified bound known as the risk bound. An example problem is to drive a car to a destination as fast as possible while limiting the probability of an accident to 10(exp -7). This framework allows users to trade conservatism against performance by choosing the risk bound. The more risk the user accepts, the better performance they can expect.

FROM↗

SURE (Science User Resource Expert): A science planning and scheduling assistant for a resource based environment

SURE (Science User Resource Expert) is one of three components that compose the SURPASS (Science User Resource Planning and Scheduling System). This system is a planning and scheduling tool which supports distributed planning and scheduling, based on resource allocation and optimization. Currently SURE is being used within the SURPASS by the UARS (Upper Atmospheric Research Satellite) SOLSTICE instrument to build a daily science plan and activity schedule and in a prototyping effort with NASA GSFC to demonstrate distributed planning and scheduling for the SOLSTICE II instrument on the EOS platform. For the SOLSTICE application the SURE utilizes a rule-based system. Development of a rule-based program using Ada CLIPS as opposed to using conventional programming, allows for capture of the science planning and scheduling heuristics in rules and provides flexibility in inserting or removing rules as the scientific objectives and mission constraints change. The SURE system's role as a component in the SURPASS, the purpose of the SURE planning and scheduling tool, the SURE knowledge base, and the software architecture of the SURE component are described.

Thalman, Nancy E.↗

Frequency Recovery in Power Grids Using High-Performance Computing

Maintaining electric power system stability is paramount, especially in extreme contingencies involving unexpected outages of multiple generators or transmission lines that are typical during severe weather events. Such outages often lead to large supply-demand mismatches followed by subsequent system frequency deviations from their nominal value. The extent of frequency deviations is an important metric of system resilience, and its timely mitigation is a central goal of power system operation and control. This paper develops a novel nonlinear model predictive control (NMPC) method to minimize frequency deviations when the grid is affected by an unforeseen loss of multiple components. Our method is based on a novel multi-period alternating current optimal power flow (ACOPF) formulation that accurately models both nonlinear electric power flow physics and the primary and secondary frequency response of generator control mechanisms. We develop a distributed parallel Julia package for solving the large-scale nonlinear optimization problems that result from our NMPC method and thereby address realistic test instances on existing high-performance computing architectures. Our method demonstrates superior performance in terms of frequency recovery over existing industry practices, where generator levels are set based on the solution of single-period classical ACOPF models.

nonlinear model predictive control↗

Discovering High Entropy Alloy Electrocatalysts in Vast Composition Spaces with Multiobjective Optimization

High entropy alloys (HEAs) are a highly promising class of materials for electrocatalysis as their unique active site distributions break the scaling relations that limit the activity of conventional transition metal catalysts. Existing Bayesian optimization (BO)-based virtual screening approaches focus on catalytic activity as the sole objective and correspondingly tend to identify promising materials that are unlikely to be entropically stabilized. Here, we overcome this limitation with a multiobjective BO framework for HEAs that simultaneously targets activity, cost-effectiveness, and entropic stabilization. With diversity-guided batch selection further boosting its data efficiency, the framework readily identifies numerous promising candidates for the oxygen reduction reaction that strike the balance between all three objectives in hitherto unchartered HEA design spaces comprising up to 10 elements.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Distributed Reinforcement Learning Yaw Control Approach for Wind Farm Energy Capture Maximization: Preprint

In this paper, we present a reinforcement-learning based distributed approach to wind farm energy capture maximization using yaw control, also known as wake steering. In order to maximize the power output of a wind farm, it is often necessary for individual turbines to decrease their own power output through yaw misalignment so as to deflect their wakes away from downstream turbines. Although using model-based methods to achieve yaw misalignment is one option, a model-free method might be better suited to incorporate factors that are difficult to model or changing conditions. We propose an algorithm that adapts concepts of temporal difference reinforcement learning distributed to a multi-agent environment that allows individual turbines to act so as to optimize overall wind farm output and react to unforeseen disturbances.

controls↗

Masked Proportional Routing

Masked proportional routing is an improved procedure for choosing links between adjacent nodes of a network for the purpose of transporting an entity from a source node ("A") to a destination node ("B"). The entity could be, for example, a physical object to be shipped, in which case the nodes would represent waypoints and the links would represent roads or other paths between waypoints. For another example, the entity could be a message or packet of data to be transmitted from A to B, in which case the nodes could be computer-controlled switching stations and the links could be communication channels between the stations. In yet another example, an entity could represent a workpiece while links and nodes could represent, respectively, manufacturing processes and stages in the progress of the workpiece towards a finished product. More generally, the nodes could represent states of an entity and the links could represent allowed transitions of the entity. The purpose of masked proportional routing and of related prior routing procedures is to schedule transitions of entities from their initial states ("A") to their final states ("B") in such a manner as to minimize a cost or to attain some other measure of optimality or efficiency. Masked proportional routing follows a distributed (in the sense of decentralized) approach to probabilistically or deterministically choosing the links. It was developed to satisfy a need for a routing procedure that 1. Does not always choose the same link(s), even for two instances characterized by identical estimated values of associated cost functions; 2. Enables a graceful transition from one set of links to another set of links as the circumstances of operation of the network change over time; 3. Is preferably amenable to separate optimization of different portions of the network; 4. Is preferably usable in a network in which some of the routing decisions are made by one or more other procedure(s); 5. Preferably does not cause an entity to visit the same node twice; and 6. Preferably can be modified so that separate entities moving from A to B do not arrive out of order.

Wolpert, David↗

Remote Sensing, Uncertainty Quantification, and a Theory of Data Systems; Workshop Report

The purpose of the workshop was to invite statisticians, applied mathematicians, computer scientists, data system architects, experts in remote sensing technology, and Climate and Earth System scientists to review, discuss, and plan research on issues related to large-scale, efficient analysis of distributed data using spatial statistical methods. Our motivation in organizing this event was to catalyze interchange among experts on the fast-emerging problem of analysis of distributed data. As part of SAMSI's 2017-2018 Program on Mathematical and Statistical Methods for Climate and the Earth System, a Working Group on Remote Sensing was established to address statistical and mathematical research problems in the analysis of remote sensing data. The Working Group has five subgroups: 1) Spatial Retrieval Methodology (the so-called \Spatial-X" subgroup); 2) Spatial Analysis for Hyperspectral Data (the so-called \Spatial-Y" subgroup); 3) Emulators for Complex Forward Models; 4) Optimization for Remote Sensing Retrievals; and 5) Theory of Data Systems (ToDS). The ToDS subgroup spent the first half of this academic year formulating a framework in which to consider the joint problem of a) optimizing statistical methods for environments where data are distributed and too large to move to a central location, and b) the design of data system infrastructures within which to implement those statistical methods. To x ideas, the Workshop focused on spatial statistical methods. To date there are many new spatial statistical methods designed with massive data sets in mind, in the literature. However, very few have been implemented for remote sensing data, and none have been implemented in operational settings like those used by NASA and NOAA. A major impediment to their use in these cases is that the data are not only massive, but are stored in different physical locations. These data must be brought together in some way in order to estimate spatial covariance functions, but moving data to a central location for analysis is tedious at best and impossible at worst. Some remote data reduction is almost certainly necessary, but how much? What are the consequences for inference? The fundamental issue underlying these questions is how to navigate the trade-space between costs and uncertainty in the estimates or inferences that are ultimately produced.

Braverman, Amy↗

Optimal operational controls for power grid

Power grid operation is facing increased penetration of renewables and distributed energy resources at both transmission and distribution levels. This presents an increased level of randomness and uncertainty for its operational quality, where the challenges are mainly how controls and optimizations can be performed so that the operational quality of the power grid can be maintained. An interesting feature is also that we need to make a good use of uncertainties embedded in the swing equation from the renewable contributions rather than simply trying to minimize the impact of uncertainties. Furthermore, this requires effective solutions on system estimation, control, and optimization. Indeed, in past decades, work has been carried out on the development of advanced controls and optimization for such complicated dynamic systems. Examples are optimal operational control for both performance and stability enhancement considering random renewables penetration, frequency, and active power control for microgrids and parameter estimation for various parts of the power grid.

24 POWER TRANSMISSION AND DISTRIBUTION↗