Search NASA⌕ Search

SEARCH · Search NASA

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 505 records · Page 28

Optimization of an Aeroservoelastic Wing with Distributed Multiple Control Surfaces

This paper considers the aeroelastic optimization of a subsonic transport wingbox under a variety of static and dynamic aeroelastic constraints. Three types of design variables are utilized: structural variables (skin thickness, stiffener details), the quasi-steady deflection scheduling of a series of control surfaces distributed along the trailing edge for maneuver load alleviation and trim attainment, and the design details of an LQR controller, which commands oscillatory hinge moments into those same control surfaces. Optimization problems are solved where a closed loop flutter constraint is forced to satisfy the required flight margin, and mass reduction benefits are realized by relaxing the open loop flutter requirements.

Stanford, Bret K.↗

Multiple element airfoils optimized for maximum lift coefficient.

Optimum airfoils in the sense of maximum lift coefficient are obtained for incompressible fluid flow at large Reynolds number. The maximum lift coefficient is achieved by requiring that the turbulent skin friction be zero in the pressure rise region on the airfoil upper surface. Under this constraint, the pressure distribution is optimized. The optimum pressure distribution is a function of Reynolds number and the trailing edge velocity. Geometries of those airfoils which will generate these optimum pressure distributions are obtained using a direct-iterative method which is developed in this study. This method can be used to design airfoils consisting of any number of elements. Numerical examples of one- and two-element airfoils are given. The maximum lift coefficients obtained range from 2 to 2.5.

Ormsbee, A. I.↗

Economic Benefits of Improved Information on Worldwide Crop Production: An Optimal Decision Model of Production and Distribution with Application to Wheat, Corn, and Soybeans

An optimal decision model of crop production, trade, and storage was developed for use in estimating the economic consequences of improved forecasts and estimates of worldwide crop production. The model extends earlier distribution benefits models to include production effects as well. Application to improved information systems meeting the goals set in the large area crop inventory experiment (LACIE) indicates annual benefits to the United States of $200 to $250 million for wheat, $50 to $100 million for corn, and $6 to $11 million for soybeans, using conservative assumptions on expected LANDSAT system performance.

Andrews, J.↗

A study of wing body blending for an advanced supersonic transport

Increases in supersonic cruise lift drag ratio were sought at Mach numbers 2.2 and 2.7 using wing body planform and thickness blending. Constrained twist and camber optimization was performed in the presence of nacelles. Wing and fuselage thickness distributions were optimized for either minimum volume wave drag or minimum total pressure wave drag. The zero leading edge suction lift drag ratios were determined for three wing planforms. The magnitude of the effect of leading edge suction on attainable lift drag ratio was defined on one planform and estimation of available leading edge suction was made.

Goebel, T. P.↗

A Distributed Model Identification Algorithm for Multi-Agent Systems: Preprint

In this study, we investigate agent-based approach for system model identification with emphasis on power distribution system applications. Departing from conventional practices of relying on historical data for offline model identification, we adopt online update approach utilizing real-time data by employing the latest data points for gradient computation. This methodology offers advantages including a large reduction in the communication network's bandwidth requirements by minimizing the data exchanged at each iteration and enabling the model to adapt in real-time to disturbances. Furthermore, we extend our model identification process from linear frameworks to more complex non-linear convex models. This extension is validated through numerical studies demonstrating improved control performance for a synthetic IEEE test case.

data-driven control↗

Cascade energy optimization for waste heat recovery in distributed energy systems

The efficiency of distributed energy systems can be significantly increased through waste heat recovery from industry or power generation. The technologies used for this process are typically dependent on the quality and temperature grades of waste heat. To maximize the efficiency of cascade heat utilization, it is important to optimize the choice of waste heat recovery technologies and their operation. Here, a detailed mixed integer linear programming optimization model is proposed for waste heat recovery in a district-scale microgrid. The model can distinguish waste heat quality for planning and operation optimization of distributed energy systems. Heat utilization technologies are formulated in this developed model and categorized in different temperature grades. The developed model is validated using four typical cases under different settings of system operation and business models. It is found that the optimization model, by distinguishing waste heat temperature, can increase energy cost savings by around 5%, compared to models that do not consider waste heat temperature grades. Additionally, the results indicate that the developed model can provide more realistic configuration and technologies dispatch.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Secure Control Regions for Distributed Stochastic Systems with Application to Distributed Energy Resource Dispatch: Preprint

With the increasing connectedness and interdependence of systems that are stochastic in nature, the issue of how to manage and coordinate them for safe operation has evidently become more important. In many networked system architectures, the system-wide output has to be delicately managed; often within a prescribed set of bounds. In this paper, a novel control framework is proposed where the bounds on the outputs are translated into independent bounds on the controllable inputs of each subsystem. The main benefit of this framework is that respecting the individual control bounds suffices to guarantee that the system-wide outputs will remain within safe boundaries. Since the systems are assumed to be stochastic, the bounds on the output are introduced as probabilistic chance constraints. The benefits of this framework are demonstrated by applying it to the control of distributed energy resources in a distribution networks where main goal is to keep the voltage magnitudes with their prescribed bounds. The control bounds are evaluated using real data on an IEEE test system.

chance constrained optimization↗

Secure Control Regions for Distributed Stochastic Systems with Application to Distributed Energy Resource Dispatch

With the increasing connectedness and interdependence of systems that are stochastic in nature, the issue of how to manage and coordinate them for safe operation has evidently become more important. In many networked system architectures, the system-wide output must be delicately managed, often within a prescribed set of bounds. In this paper, a novel control framework is proposed where the bounds on the outputs are translated into independent bounds on the controllable inputs of each subsystem. The main benefit of this framework is that respecting the individual control bounds suffices to guarantee that the system-wide outputs will remain within safe boundaries. Because the systems are assumed to be stochastic, the bounds on the output are introduced as probabilistic chance constraints. The benefits of this framework are demonstrated by applying it to the control of distributed energy resources in a distribution network where the main goal is to keep the voltage magnitudes within their prescribed bounds. The control bounds are evaluated using real data on an IEEE test system.

chance constrained optimization↗

Distributionally robust facility location problem under decision-dependent stochastic demand

While the traditional facility location problem considers exogenous demand, in some applications, locations of facilities could affect the willingness of customers to use certain types of services, e.g., carsharing, and therefore they also affect realizations of random demand. Moreover, a decision maker may not know the exact distribution of such endogenous demand and how it is affected by location choices. In this paper, we consider a distributionally robust facility location problem, in which we interpret the moments of stochastic demand as functions of facility-location decisions. We reformulate a two-stage decision-dependent distributionally robust optimization model as a monolithic formulation, and then derive exact mixed-integer linear programming reformulation as well as valid inequalities when the means and variances of demand are piecewise linear functions of location solutions. We conduct extensive computational studies, in which we compare our model with a decision-dependent deterministic model, as well as stochastic programming and distributionally robust models without the decision-dependent assumption. Here, the results show superior performance of our approach with remarkable improvement in profit and quality of service under various settings, in addition to computational speed-ups given by formulation enhancements. These results draw attention to the need of considering the impact of location decisions on customer demand within this strategic-level planning problem.

97 MATHEMATICS AND COMPUTING↗

Optimizing the shape of photometric redshift distributions with clustering cross-correlations

We present an optimization method for the assignment of photometric galaxies to a chosen set of redshift bins. This is achieved by combining simulated annealing, an optimization algorithm inspired by solid-state physics, with an unsupervised machine learning method, a self-organizing map (SOM) of the observed colours of galaxies. Starting with a sample of galaxies that is divided into redshift bins based on a photometric redshift point estimate, the simulated annealing algorithm repeatedly reassigns SOM-selected subsamples of galaxies, which are close in colour, to alternative redshift bins. We optimize the clustering cross-correlation signal between photometric galaxies and a reference sample of galaxies with well-calibrated redshifts. Depending on the effect on the clustering signal, the reassignment is either accepted or rejected. By dynamically increasing the resolution of the SOM, the algorithm eventually converges to a solution that minimizes the number of mismatched galaxies in each tomographic redshift bin and thus improves the compactness of their corresponding redshift distribution. This method is demonstrated on the synthetic Legacy Survey of Space and Time cosmoDC2 catalogue. We find a significant decrease in the fraction of catastrophic outliers in the redshift distribution in all tomographic bins, most notably in the highest redshift bin with a decrease in the outlier fraction from 57 percent to 16 percent.

79 ASTRONOMY AND ASTROPHYSICS↗

Fast Tuning-Free Distributed Algorithm for Solving the Network-Constrained Economic Dispatch

With the increasing penetration of distributed energy resources (DERs) and their participation in the electricity market, it becomes more desirable to apply distributed algorithms for resource allocation in order to address the resulting computational and communicational challenges. Most of the existing distributed algorithms for solving the network-constrained economic dispatch (NCED) problem require the tuning of certain auxiliary parameters. As a result, the robustness of these algorithms against the varieties in DERs is greatly undermined. In this paper, a new distributed algorithm, optimality condition consensus (OCC), is proposed to solve the NCED problem by using distributed power flow (DPF) and ratio consensus as fundamental tools. It inherits the advantages of existing distributed algorithms for the NCED problem but removes the need for parameter tuning to improve performance in practice. In conclusion, the effectiveness of the proposed distributed algorithm in terms of efficiency, scalability, and robustness is demonstrated through detailed case studies.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Design of Matching Optics Unit (MOU) for coaxial ITER gyrotron

The paper presents the design of a MOU for the coaxial ITER gyrotron. Corrugated waveguides are used to transmit the high power mm-waves generated by gyrotrons to the plasma Electron Cyclotron Resonance Heating (ECRH) and Current Drive (CD). The MOU contains two focusing mirrors, which are used to convert the gyrotron output into a Gaussian distribution with optimal parameters to improve the coupling efficiency of the TEM{sub 00} Gaussian distribution to the HE{sub 11} mode of the corrugated wave guide. The calculation results reveal that the coupling efficiency of the Gaussian beam to the HE{sub 11} mode is approximately 96.33%. (author)

43 PARTICLE ACCELERATORS↗

Robust Restoration From Cyber-Physical Attacks in Active Distribution Grids With Grid-Edge IBRs

The inverter-based resources (IBRs) have enabled the integration of renewable energy at the grid edge with enhanced control capabilities to support the reliable operation of power grids. Different control frameworks, such as hierarchical or distributed architecture, have been proposed with the expansion of cyber networks for real-time monitoring and control. This evolution of critical infrastructure into cyber-physical systems also brings more vulnerabilities for the broadened attack surfaces, and significantly increases the possibility of physical system failures or outages caused by cyberattacks. Among tremendous efforts in the defense-in-depth approach, it remains challenging to provide prompt detection and accurate location of attack entry points or paths. Therefore, the prevailing restoration framework may struggle to fully consider the cyber-physical interdependence, successfully isolate the compromised cyber and physical components, and safely recover the systems without the potential risks leading to secondary outages. This paper is motivated to develop a cyber-physical restoration framework for distribution grids to recover from cyber attacks by harnessing grid-edge IBRs. The framework is first built on the operational guidelines of IBRs considering the compromised cyber layer. Then, an ambiguity set is established to represent the uncertainty of attack scenarios and their possibility levels. Next, a distributionally robust optimization model is developed to provide the optimal load restoration strategy across all scenarios. The effectiveness of the proposed model is demonstrated through various use cases on the modified IEEE 13-node and 123-node test systems. Finally, simulation results demonstrate the effectiveness and advancement of developed post-attack restoration strategies.

Cybersecurity↗

A Short-Term and High-Resolution System Load Forecasting Approach Using Support Vector Regression with Hybrid Parameters Optimization

This work proposes an approach for distribution system load forecasting, which aims to provide highly accurate short-term load forecasting with high resolution utilizing a support vector regression (SVR) based forecaster and a two-step hybrid parameters optimization method. Specifically, because the load profiles in distribution systems contain abrupt deviations, a data normalization is designed as the pretreatment for the collected historical load data. Then an SVR model is trained by the load data to forecast the future load. For better performance of SVR, a two-step hybrid optimization algorithm is proposed to determine the best parameters. In the first step of the hybrid optimization algorithm, a designed grid traverse algorithm (GTA) is used to narrow the parameters searching area from a global to local space. In the second step, based on the result of the GTA, particle swarm optimization (PSO) is used to determine the best parameters in the local parameter space. After the best parameters are determined, the SVR model is used to forecast the short-term load deviation in the distribution system.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Digital twin advanced distribution management systems (ADMS) and methods

Advanced Distribution Management Systems not generally optimize over the entire feeder because there are few high-fidelity distribution circuit models and real-time distribution-connected sensors are rare. The limited observability at the distribution level makes it difficult to globally optimize distribution operations and issue control setpoints to power systems equipment or Distributed Energy Resources (DER) to perform grid-support services. For example, setpoints can be issued to DER based on results from an optimization module that incorporates a static or time-series feeder simulation. Feeder simulation initial conditions are populated with photovoltaic (PV) and load forecasts, state estimation results, and/or digital twin measurements or state output. The real-time (RT) digital twin runs a model of the feeder to generate state estimation pseudo-measurements since there are limited live feeder measurements.

Johnson, Jay Tillay↗

A Neural Network Aero Design System for Advanced Turbo-Engines

An inverse design method calculates the blade shape that produces a prescribed input pressure distribution. By controlling this input pressure distribution the aerodynamic design objectives can easily be met. Because of the intrinsic relationship between pressure distribution and airfoil physical properties, a neural network can be trained to choose the optimal pressure distribution that would meet a set of physical requirements. The neural network technique works well not only as an interpolating device but also as an extrapolating device to achieve blade designs from a given database. Two validating test cases are discussed.

Sanz, Jose M.↗