SEARCH · Engineering Papers

Results for “constrained 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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 577 records · Page 32

All sources NASA NTRS DOE OSTI

NASA NTRS2001

Trajectory Design Strategies for the NGST L2 Libration Point Mission

The Origins' Next Generation Space Telescope (NGST) trajectory design is addressed in light of improved methods for attaining constrained orbit parameters and their control at the exterior collinear libration point, L2. The use of a dynamical systems approach, state-space equations for initial libration orbit control, and optimization to achieve constrained orbit parameters are emphasized. The NGST trajectory design encompasses a direct transfer and orbit maintenance under a constant acceleration. A dynamical systems approach can be used to provide a biased orbit and stationkeeping maintenance method that incorporates the constraint of a single axis correction scheme.

Folta, David↗

DOE OSTI2022

Fast simultaneous feasibility testing and applications for electrical power grids

Fast simultaneous feasibility testing (SFT) for management of an electrical power grid is achieved through various innovations. The computation problem relates to evaluation of candidate solutions for external power flows into a power grid, with respect to predetermined constraints and contingencies. Storage and computations are reduced by formulating the problem in terms of transactional nodes (e.g. third party connections for generators and loads) instead of the larger number of bus nodes. Further advantages are achieved by precomputing matrices that can be reused across multiple SFT invocations, organizing matrices and operations to reduce storage and computation, and eliminating branches that have no contingency violations. The fast SFT further enables new applications for integrating SFT with a Security-Constrained Unit Commitment (SCUC) optimizer for efficient single pass solutions; operating SFT as a service to multiple SCUC solvers; or integration with Security-Constrained Economic Dispatch (SCED) optimization.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2011

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↗

NASA NTRS2017

Automation of POST Cases via External Optimizer and "Artificial p2" Calculation

During early conceptual design of complex systems, speed and accuracy are often at odds with one another. While many characteristics of the design are fluctuating rapidly during this phase there is nonetheless a need to acquire accurate data from which to down-select designs as these decisions will have a large impact upon program life-cycle cost. Therefore enabling the conceptual designer to produce accurate data in a timely manner is tantamount to program viability. For conceptual design of launch vehicles, trajectory analysis and optimization is a large hurdle. Tools such as the industry standard Program to Optimize Simulated Trajectories (POST) have traditionally required an expert in the loop for setting up inputs, running the program, and analyzing the output. The solution space for trajectory analysis is in general non-linear and multi-modal requiring an experienced analyst to weed out sub-optimal designs in pursuit of the global optimum. While an experienced analyst presented with a vehicle similar to one which they have already worked on can likely produce optimal performance figures in a timely manner, as soon as the "experienced" or "similar" adjectives are invalid the process can become lengthy. In addition, an experienced analyst working on a similar vehicle may go into the analysis with preconceived ideas about what the vehicle's trajectory should look like which can result in sub-optimal performance being recorded. Thus, in any case but the ideal either time or accuracy can be sacrificed. In the authors' previous work a tool called multiPOST was created which captures the heuristics of a human analyst over the process of executing trajectory analysis with POST. However without the instincts of a human in the loop, this method relied upon Monte Carlo simulation to find successful trajectories. Overall the method has mixed results, and in the context of optimizing multiple vehicles it is inefficient in comparison to the method presented POST's internal optimizer functions like any other gradient-based optimizer. It has a specified variable to optimize whose value is represented as optval, a set of dependent constraints to meet with associated forms and tolerances whose value is represented as p2, and a set of independent variables known as the u-vector to modify in pursuit of optimality. Each of these quantities are calculated or manipulated at a certain phase within the trajectory. The optimizer is further constrained by the requirement that the input u-vector must result in a trajectory which proceeds through each of the prescribed events in the input file. For example, if the input u-vector causes the vehicle to crash before it can achieve the orbital parameters required for a parking orbit, then the run will fail without engaging the optimizer, and a p2 value of exactly zero is returned. This poses a problem, as this "non-connecting" region of the u-vector space is far larger than the "connecting" region which returns a non-zero value of p2 and can be worked on by the internal optimizer. Finding this connecting region and more specifically the global optimum within this region has traditionally required the use of an expert analyst.

Dees, Patrick D.↗

DOE OSTI2024

A multi-objective optimization model for cropland design considering profit, biodiversity, and ecosystem services

More sustainable agricultural methods are needed to alleviate the decreases in biodiversity and ecosystem services that have occurred because of industrial agriculture. One such method is the inclusion of alternative crops into croplands that can support biodiversity, reduce erosion and chemical runoff, and sequester carbon in the soil. However, the question of where such crops should be planted to balance competing economic and environmental objectives remains open. To this end, we develop a mixed-integer quadratically constrained program to optimize the layout of a cropland considering economic, biodiversity, greenhouse gas emissions, and water quality objectives. We include spatially varying fertilization as a decision variable in addition to crop establishment location. We further include the effect of core area and edges between different crops on biodiversity. To demonstrate the applicability of the model, we apply it to an example field, showing how the optimal cropland design changes as a decision-maker prioritizes different objectives and as edges have different impacts on biodiversity.

54 ENVIRONMENTAL SCIENCES↗

NASA NTRS1985

Interactive aircraft flight control and aeroelastic stabilization

Aeroservoelastic optimization techniques were studied to determine a methodology for maximization of the stable flight envelope of an idealized, actively controlled, flexible airfoil. The equations of motion for the airfoil were developed in state-space form to include time-domain representations of aerodynamic forces and active control. The development of an optimization scheme to stabilize the aeroelastic system over a range of airspeeds, including the design airspeed is outlined. The solution approach was divided in two levels: (1) the airfoil structure, with a design variable represented by the shear center position; and (2) the control system. An objective was stated in mathematical form and a search was conducted with the restriction that each subsystem be constrained to be optimal in some sense. Analytical expressions are developed to compute the changes in the eigenvalues of the closed-loop, actively controlled system. A stability index is constructed to ensure that stability is present at the design speed and at other airspeeds away from the design speed.

Weisshaar, T. A.↗

NASA NTRS2016

Global Optimization of N-Maneuver, High-Thrust Trajectories Using Direct Multiple Shooting

The performance of impulsive, gravity-assist trajectories often improves with the inclusion of one or more maneuvers between flybys. However, grid-based scans over the entire design space can become computationally intractable for even one deep-space maneuver, and few global search routines are capable of an arbitrary number of maneuvers. To address this difficulty a trajectory transcription allowing for any number of maneuvers is developed within a multi-objective, global optimization framework for constrained, multiple gravity-assist trajectories. The formulation exploits a robust shooting scheme and analytic derivatives for computational efficiency. The approach is applied to several complex, interplanetary problems, achieving notable performance without a user-supplied initial guess.

optimization↗

NASA NTRS2015

Integration of Uncertain Ramp Area Aircraft Trajectories and Generation of Optimal Taxiway Schedules at Charlotte Douglas (CLT) Airport

The integration of aircraft maneuver characteristics into an optimal taxiway scheduling solution is challenging due to the uncertainties that are intrinsic to ramp area aircraft trajectories. To address the challenge, we build a stochastic model of ramp area aircraft trajectories that is used to generate a probabilistic measure of conflict within the Charlotte Douglas International Airport (CLT) ramp area. Parameters of the conflict distributions are estimated and passed to a Mixed Integer Linear Program that solves for an optimal taxiway schedule constrained to be conflict free in the presence of trajectory uncertainties. Here we extend our previous research by accounting for departing and arriving aircraft whereas our prior formulation only accounted for departing aircraft.

taxiway schedule↗

NASA NTRS2015

Global Optimization of N-Maneuver, High-Thrust Trajectories Using Direct Multiple Shooting

The performance of impulsive, gravity-assist trajectories often improves with the inclusion of one or more maneuvers between flybys. However, grid-based scans over the entire design space can become computationally intractable for even one deep-space maneuver, and few global search routines are capable of an arbitrary number of maneuvers. To address this difficulty a trajectory transcription allow-ing for any number of maneuvers is developed within a multi-objective, global optimization framework for constrained, multiple gravity-assist trajectories. The formulation exploits a robust shooting scheme and analytic derivatives for com-putational efficiency. The approach is applied to several complex, interplanetary problems, achieving notable performance without a user-supplied initial guess.

trajectory design↗

NASA NTRS2012

Recursive Branching Simulated Annealing Algorithm

This innovation is a variation of a simulated-annealing optimization algorithm that uses a recursive-branching structure to parallelize the search of a parameter space for the globally optimal solution to an objective. The algorithm has been demonstrated to be more effective at searching a parameter space than traditional simulated-annealing methods for a particular problem of interest, and it can readily be applied to a wide variety of optimization problems, including those with a parameter space having both discrete-value parameters (combinatorial) and continuous-variable parameters. It can take the place of a conventional simulated- annealing, Monte-Carlo, or random- walk algorithm. In a conventional simulated-annealing (SA) algorithm, a starting configuration is randomly selected within the parameter space. The algorithm randomly selects another configuration from the parameter space and evaluates the objective function for that configuration. If the objective function value is better than the previous value, the new configuration is adopted as the new point of interest in the parameter space. If the objective function value is worse than the previous value, the new configuration may be adopted, with a probability determined by a temperature parameter, used in analogy to annealing in metals. As the optimization continues, the region of the parameter space from which new configurations can be selected shrinks, and in conjunction with lowering the annealing temperature (and thus lowering the probability for adopting configurations in parameter space with worse objective functions), the algorithm can converge on the globally optimal configuration. The Recursive Branching Simulated Annealing (RBSA) algorithm shares some features with the SA algorithm, notably including the basic principles that a starting configuration is randomly selected from within the parameter space, the algorithm tests other configurations with the goal of finding the globally optimal solution, and the region from which new configurations can be selected shrinks as the search continues. The key difference between these algorithms is that in the SA algorithm, a single path, or trajectory, is taken in parameter space, from the starting point to the globally optimal solution, while in the RBSA algorithm, many trajectories are taken; by exploring multiple regions of the parameter space simultaneously, the algorithm has been shown to converge on the globally optimal solution about an order of magnitude faster than when using conventional algorithms. Novel features of the RBSA algorithm include: 1. More efficient searching of the parameter space due to the branching structure, in which multiple random configurations are generated and multiple promising regions of the parameter space are explored; 2. The implementation of a trust region for each parameter in the parameter space, which provides a natural way of enforcing upper- and lower-bound constraints on the parameters; and 3. The optional use of a constrained gradient- search optimization, performed on the continuous variables around each branch s configuration in parameter space to improve search efficiency by allowing for fast fine-tuning of the continuous variables within the trust region at that configuration point.

Bolcar, Matthew↗

DOE OSTI2023

Scaling Wind Power Innovation Assessment for Rapid Energy Transition with Artificial Intelligence

Planning for energy system decarbonization requires new insights into the potential of renewable technologies, deployed at unprecedented scale, to meet urgent sustainability goals. However, limited scalability of current wind energy research tools restricts characterization of innovation impacts to isolated reference sites, challenging investment and decision making under rapid growth. We demonstrate the transformative potential of artificial intelligence (AI) to inform future technology advancement and energy systems design by leveraging a state-of-the-art surrogate model to conduct a series of fleet-wide wind plant layout optimizations for greater than 6,800 projected U.S. onshore buildout locations. We show how innovative wake steering technology can address an array of barriers to large-scale deployment and integration of wind power. Specifically, wake steering reduces required plant area by an average of 18% and could preserve upwards of 13,000 km2 for future greenfield deployment, potentially easing siting challenges associated with wind energy infrastructure. Further, by enabling reduced turbine spacing and increased energy production, flexible operations of wake steering improve levelized cost of energy, particularly for large plants and in land-constrained settings. Finally, optimizations that consider dynamic energy prices can deliver increased power production and revenue capture during high-value (often low-wind) periods, further bolstering plant economics. Our computationally efficient approach offers a pathway to accelerate nationwide geographic evaluation of innovative technologies.

graph neural networks↗

DOE OSTI2026

Exploring the fusion power plant design space: comparative analysis of positive and negative triangularity tokamaks through optimization

The optimal configuration choice between positive triangularity (PT) and negative triangularity (NT) tokamaks for fusion power plants hinges on navigating different operational constraints rather than achieving specific plasma performance metrics. This study presents a systematic comparison using constrained multi-objective optimization with the integrated FUsion Synthesis Engine (FUSE) framework. Over 200 000 integrated design evaluations were performed exploring the trade-offs between capital cost minimization and operational reliability (maximizing q 95 ) while satisfying engineering constraints including 250 ± 50 MW net electric power, tritium breeding ratio > 1.1, power exhaust limits and an hour flattop time. Both configurations achieve similar cost-performance Pareto fronts through contrasting design philosophies. PT, while demonstrating resilience to pedestal degradation (compensating for up to 40% reduction), are constrained to larger machines (R 0 > 6.5 m) by the narrow operational window between L–H threshold requirements and the research-established power exhaust limit (P sol /R < 15 MW m –1 ). This forces optimization through comparatively reduced magnetic field (∼8 T). NT configurations exploit their freedom from these constraints to access compact, high-field designs (R 0 ~ 5.5 m, B 0 >12 T), creating natural synergy with advancing HTS technology. Sensitivity analyses reveal that PT’s economic viability depends critically on uncertainties in L–H threshold scaling and power handling limits. Notably, a 50% variation in either could eliminate viable designs or enable access to the compact design space. These results suggest configuration selection should be risk-informed: PT offers the lowest-cost path when operational constraints can be confidently predicted, while NT is robust to large variations in constraints and physics uncertainties.

FUSE framework↗

NASA NTRS1976

Optimization of continuous one-dimensional structures under steady harmonic excitation

The paper examines some questions relating to the optimal design of continuous one-dimensional structures driven by harmonically oscillating loads. Optimal-control methods are applied to a cantilever bar driven sinusoidally by an axial force at its tip to illustrate the minimum-weight design of one-dimensional structures under dynamic excitation. Realistic constraints are imposed during the optimizations, including a maximum allowable stress amplitude at any point along the bar and a minimum cross-sectional area. It is shown that in the absence of damping, the design space may contain many disjoint feasible regions, and multiple optima can exist. Detailed solutions are obtained for continuous bars with an excitation frequency less than, and then greater than, the fundamental free-vibration frequency. It is found that above a certain excitation frequency, two or more arcs with different constraints characterize the optimal designs. It is concluded that when more than two different constrained arcs characterize the optimal solution, the continuum approach may be impractical, and finite-element approximations may offer the only alternative.

Johnson, E. H.↗

DOE OSTI2023

Online Model-Free Chance-Constrained Distribution System Voltage Control Using DERs

This paper proposes an online data-driven distributed energy resource management system (DERMS) optimization method using chance-constrained formulation to address distribution system voltage regulation. This is achieved via the local sensitivity factor (LSF)-enabled reformulation of the DER control into a linear programming (LP) problem, which is easy and computationally efficient to solve. The LSF is estimated using online measurements and does not need the assumption of node load information. The latter is usually required for existing optimization-based methods but is difficult to obtain in practice. To mitigate measurement uncertainties, a scenario-based chance-constrained formulation is constructed. Compared with other control methods, the results carried out in a realistic distribution system show that the proposed method can effectively eliminate voltage violation issues.

chance-constrained optimization↗

DOE OSTI2023

Online Model-Free Chance-Constrained Distribution System Voltage Control Using DERs: Preprint

chance-constrained optimization↗

DOE OSTI2023

Automated Generation of Microkinetics for Heterogeneously Catalyzed Reactions Considering Correlated Uncertainties**

Abstract The study presents an ab‐initio based framework for the automated construction of microkinetic mechanisms considering correlated uncertainties in all energetic parameters and estimation routines. 2000 unique microkinetic models were generated within the uncertainty space of the BEEF‐vdW functional for the oxidation reactions of representative exhaust gas emissions from stoichiometric combustion engines over Pt(111) and compared to experiments through multiscale modeling. The ensemble of simulations stresses the importance of considering uncertainties. Within this set of first‐principles‐based models, it is possible to identify a microkinetic mechanism that agrees with experimental data. This mechanism can be traced back to a single exchange‐correlation functional, and it suggests that Pt(111) could be the active site for the oxidation of light hydrocarbons. The study provides a universal framework for the automated construction of reaction mechanisms with correlated uncertainty quantification, enabling a DFT‐constrained microkinetic model optimization for other heterogeneously catalyzed systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2024

Multistart algorithm for identifying all optima of nonconvex stochastic functions

Here, we propose a multistart algorithm to identify all local minima of a constrained, nonconvex stochastic optimization problem. The algorithm uniformly samples points in the domain and then starts a local stochastic optimization run from any point that is the "probabilistically best" point in its neighborhood. Under certain conditions, our algorithm is shown to asymptotically identify all local optima with high probability; this holds even though our algorithm is shown to almost surely start only finitely many local stochastic optimization runs. We demonstrate the performance of an implementation of our algorithm on nonconvex stochastic optimization problems, including identifying optimal variational parameters for the quantum approximate optimization algorithm.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Multi-Factor-Coupled, Ahead-of-Time Aggregation of Power Flexibility Under Forecast Uncertainty

The increasing penetration of distributed energy resources (DERs) is significantly reshaping the role of distribution systems under active energy management. To aggregate the active-reactive power flexibility of DERs dispersed at the feeder and provide capacity support to the transmission system, it is essential to efficiently identify feasible substation power injection trajectories. This paper introduces a novel ahead-of-time flexibility characterization method to address it. First, a polyhedral non-feeder-level power flexibility region (PFR) is constructed, accounting for various time-dependent, power-coupled, and forecast error uncertainties. Then, a polyhedral feeder-level PFR is analytically derived through a coordinate transformation, which can reveal the uncertainty propagation path, i.e., how uncertainty applies to the feeder-level PFR. To facilitate the high-level application, a tractable chance-constrained Chebyshev centering optimization model is further developed to find a ball-shaped inner approximation of the feeder-level PFR. Finally, the proposed method is validated on a modified IEEE 123-bus test system. Here, both theoretical and experimental results show that, with appropriate robustness parameter settings, the proposed method can make the approximated PFR less conservative with abundant robustness against forecast error uncertainty.

24 POWER TRANSMISSION AND DISTRIBUTION↗