Search NASA⌕ Search

SEARCH · Search NASA

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.

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

At least 397 records · Page 22

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↗

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↗

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↗

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.↗

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↗

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↗

Multiobjective insensitive design of airplane control systems with uncertain parameters

A multiobjective computer-aided design algorithm has been developed which minimizes the sensitivity of the design objectives to uncertainties in system parameters. The more important uncertain parameters are described by a gaussian random vector with known covariance matrix, and a vector sensitivity objective function is defined as the probabilities that the design objectives will violate specified requirements constraints. Control system parameters are found which minimize the sensitivity vector in a Pareto-optimal sense, using constrained minimization algorithms. Example results are shown for lateral stability augmentation system (SAS) design for three Shuttle flight conditions.

Schy, A. A.↗

Some data processing requirements for precision Nap-Of-the-Earth (NOE) guidance and control of rotorcraft

Nap-Of-the-Earth (NOE) flight in a conventional helicopter is extremely taxing for two pilots under visual conditions. Developing a single pilot all-weather NOE capability will require a fully automatic NOE navigation and flight control capability for which innovative guidance and control concepts were examined. Constrained time-optimality provides a validated criterion for automatically controlled NOE maneuvers if the pilot is to have confidence in the automated maneuvering technique. A second focus was to organize the storage and real-time updating of NOE terrain profiles and obstacles in course-oriented coordinates indexed to the mission flight plan. A method is presented for using pre-flight geodetic parameter identification to establish guidance commands for planned flight profiles and alternates. A method is then suggested for interpolating this guidance command information with the aid of forward and side looking sensors within the resolution of the stored data base, enriching the data content with real-time display, guidance, and control purposes. A third focus defined a class of automatic anticipative guidance algorithms and necessary data preview requirements to follow the vertical, lateral, and longitudinal guidance commands dictated by the updated flight profiles and to address the effects of processing delays in digital guidance and control system candidates. The results of this three-fold research effort offer promising alternatives designed to gain pilot acceptance for automatic guidance and control of rotorcraft in NOE operations.

Clement, Warren F.↗

MIDAS - Mission design and analysis software for the optimization of ballistic interplanetary trajectories

A patched conic trajectory optimization program MIDAS is described that was developed to investigate a wide variety of complex ballistic heliocentric transfer trajectories. MIDAS includes the capability of optimizing trajectory event times such as departure date, arrival date, and intermediate planetary flyby dates and is able to both add and delete deep space maneuvers when dictated by the optimization process. Both powered and unpowered flyby or gravity assist trajectories of intermediate bodies can be handled and capability is included to optimize trajectories having a rendezvous with an intermediate body such as for a sample return mission. Capability is included in the optimization process to constrain launch energy and launch vehicle parking orbit parameters.

Sauer, Carl G., Jr.↗

Direct Fault Tolerant RLV Altitude Control: A Singular Perturbation Approach

In this paper, we present a direct fault tolerant control (DFTC) technique, where by "direct" we mean that no explicit fault identification is used. The technique will be presented for the attitude controller (autopilot) for a reusable launch vehicle (RLV), although in principle it can be applied to many other applications. Any partial or complete failure of control actuators and effectors will be inferred from saturation of one or more commanded control signals generated by the controller. The saturation causes a reduction in the effective gain, or bandwidth of the feedback loop, which can be modeled as an increase in singular perturbation in the loop. In order to maintain stability, the bandwidth of the nominal (reduced-order) system will be reduced proportionally according to the singular perturbation theory. The presented DFTC technique automatically handles momentary saturations and integrator windup caused by excessive disturbances, guidance command or dispersions under normal vehicle conditions. For multi-input, multi-output (MIMO) systems with redundant control effectors, such as the RLV attitude control system, an algorithm is presented for determining the direction of bandwidth cutback using the method of minimum-time optimal control with constrained control in order to maintain the best performance that is possible with the reduced control authority. Other bandwidth cutback logic, such as one that preserves the commanded direction of the bandwidth or favors a preferred direction when the commanded direction cannot be achieved, is also discussed. In this extended abstract, a simplistic example is proved to demonstrate the idea. In the final paper, test results on the high fidelity 6-DOF X-33 model with severe dispersions will be presented.

Zhu, J. J.↗

Spacecraft Mission Design for the Mitigation of the 2017 PDC Hypothetical Asteroid Threat

This paper presents a detailed mission design analysis results for the 2017 Planetary Defense Conference (PDC) Hypothetical Asteroid Impact Scenario, documented at https://cneos.jpl.nasa.gov/ pd/cs/pdc17/. The mission design includes campaigns for both reconnaissance (flyby or rendezvous) of the asteroid (to characterize it and the nature of the threat it poses to Earth) and mitigation of the asteroid, via kinetic impactor deflection, nuclear explosive device (NED) deflection, or NED disruption. Relevant scenario parameters are varied to assess the sensitivity of the design outcome, such as asteroid bulk density, asteroid diameter, momentum enhancement factor, spacecraft launch vehicle, and mitigation system type. Different trajectory types are evaluated in the mission design process from purely ballistic to those involving optimal midcourse maneuvers, planetary gravity assists, and/or lowthrust solar electric propulsion. The trajectory optimization is targeted around peak deflection points that were found through a novel linear numerical technique method. The optimization process includes constrain parameters, such as Earth departure date, launch declination, spacecraft/asteroid relative velocity and solar phase angle, spacecraft dry mass, minimum/maximum spacecraft distances from Sun and Earth, and Earth/spacecraft communications line of sight. Results show that one of the best options for the 2017 PDC deflection is solar electric propelled rendezvous mission with a single spacecraft using NED for the deflection

Barbee, Brent W.↗

Spacecraft Mission Design for the Mitigation of the 2017 PDC Hypothetical Asteroid Threat

This paper presents a detailed mission design analysis results for the 2017 Planetary Defense Conference (PDC) Hypothetical Asteroid Impact Scenario, documented at https:cneos.jpl.nasa.govpdcspdc17. The mission design includes campaigns for both reconnaissance (flyby or rendezvous) of the asteroid (to characterize it and the nature of the threat it poses to Earth) and mitigation of the asteroid, via kinetic impactor deflection, nuclear explosive device (NED) deflection, or NED disruption. Relevant scenario parameters are varied to assess the sensitivity of the design outcome, such as asteroid bulk density, asteroid diameter, momentum enhancement factor, spacecraft launch vehicle, and mitigation system type. Different trajectory types are evaluated in the mission design process from purely ballistic to those involving optimal midcourse maneuvers, planetary gravity assists, and/or low-thrust solar electric propulsion. The trajectory optimization is targeted around peak deflection points that were found through a novel linear numerical technique method. The optimization process includes constrain parameters, such as Earth departure date, launch declination, spacecraft, asteroid relative velocity and solar phase angle, spacecraft dry mass, minimum/maximum spacecraft distances from Sun and Earth, and Earth-spacecraft communications line of sight. Results show that one of the best options for the 2017 PDC deflection is solar electric propelled rendezvous mission with a single spacecraft using NED for the deflection.

Barbee, Brent W.↗

Dark Energy Survey Year 6 Results: MagLim++ Lens Sample Selection and Measurements of Galaxy Clustering

Galaxy clustering is a sensitive probe of the expansion history and growth of structure of the universe, and key degeneracies can be broken by combining these data with measurements of cosmic shear and galaxy-galaxy lensing (a so-called 3$\times$2pt analysis). The largest and least biased statistical samples of galaxies for use in clustering analyses can be collected photometrically through large imaging surveys. However, selecting clean photometric subsamples for cosmology are crucial for avoiding contamination that can bias cosmological constraints. Here we present the MagLim++ galaxy sample, selected to optimize for cosmological constraining power and incorporating an array of novel quality cuts to identify and remove residual contamination. This sample comes from the full six years of observations from the Dark Energy Survey. We present measurements of the two-point angular clustering ($w(θ)$) of 9,186,205 galaxies distributed over 4031 sq. degrees and in six tomographic redshift bins centered at $\bar{z}\approx$ [0.31, 0.44, 0.62, 0.78, 0.90, 1.01]. These measurements are used as part of the 3$\times$2pt and other DES Y6 legacy cosmological analyses in companion works. We describe the battery of null tests and mitigation schemes implemented to address observational, astrophysical, and methodological systematics in the analysis. The resulting $w(θ)$ measurements have a S/N = 149 (90.2 for linear scales only), which we use to place galaxy-clustering-only constraints on the matter density of the Universe, $Ω_m=0.311^{+0.023}_{-0.035}$, and amplitude of galaxy clustering in each redshift bin, $b_iσ_8=[1.16^{+0.04}_{-0.06},\ 1.40^{+0.04}_{-0.06},\ 1.57^{+0.04}_{-0.06},\ 1.59^{+0.04}_{-0.05},\ 1.50^{+0.04}_{-0.05},\ 1.74^{+0.06}_{-0.08}]$.

Weaverdyck, N. [BCCP, Berkeley; UC, Berkeley; LBL,↗

Leveraging Optimal Sparse Sensor Placement to Aggregate a Network of Digital Twins for Nuclear Subsystems

Nuclear power plants (NPPs) require continuous monitoring of various systems, structures, and components to ensure safe and efficient operations. The critical safety testing of new fuel compositions and the analysis of the effects of power transients on core temperatures can be achieved through modeling and simulations. They capture the dynamics of the physical phenomenon associated with failure modes and facilitate the creation of digital twins (DTs). Accurate reconstruction of fields of interest (e.g., temperature, pressure, velocity) from sensor measurements is crucial to establish a two-way communication between physical experiments and models. Sensor placement is highly constrained in most nuclear subsystems due to challenging operating conditions and inherent spatial limitations. This study develops optimized data-driven sensor placements for full-field reconstruction within reactor and steam generator subsystems of NPPs. Optimized constrained sensors reconstruct field of interest within a tri-structural isotropic (TRISO) fuel irradiation experiment, a lumped parameter model of a nuclear fuel test rod and a steam generator. The optimization procedure leverages reduced-order models of flow physics to provide a highly accurate full-field reconstruction of responses of interest, noise-induced uncertainty quantification and physically feasible sensor locations. Accurate sensor-based reconstructions establish a foundation for the digital twinning of subsystems, culminating in a comprehensive DT aggregate of an NPP.

42 ENGINEERING↗

Efficient derivative computation for unsteady fatigue-constrained nonlinear aero-structural wind turbine blade optimization

Gradient-based optimization offers significant efficiency advantages for wind turbine blade design, but its application has often been limited by the cost and accuracy of finite-difference derivative calculations, especially when fatigue constraints are considered. In this work, we systematically compare and evaluate four differentiation techniques, namely algorithmic differentiation, implicit differentiation, sparsity exploitation, and parallelization, to determine their effectiveness in computing accurate gradients through time-domain aero-structural simulations. By integrating these techniques with unsteady nonlinear aerodynamic and structural models, we develop software designed for accurate gradient computation. We show that combining these techniques addresses memory and runtime challenges associated with long simulations required by design load cases. Specifically, the most effective combination reduces derivative computation wall time by over an order of magnitude compared to finite differencing while maintaining superior accuracy. We demonstrate this approach in a proof-of-concept aero-structural optimization of a wind turbine blade that improves the cost of energy by 12.78 %. This comparative study establishes a viable approach for fatigue-aware blade design that balances computational efficiency with modeling accuracy.

17 WIND ENERGY↗

Solution of nonlinear multivariable constrained systems using a gradient projection digital algorithm that is insensitive to the initial state

Optimal digital control of nonlinear multivariable constrained systems was studied. The optimal controller in the form of an algorithm was improved and refined by reducing running time and storage requirements. A particularly difficult system of nine nonlinear state variable equations was chosen as a test problem for analyzing and improving the controller. Lengthy analysis, modeling, computing and optimization were accomplished. A remote interactive teletype terminal was installed. Analysis requiring computer usage of short duration was accomplished using Tuskegee's VAX 11/750 system.

Hargrove, A.↗

Analytical investigations in aircraft and spacecraft trajectory optimization and optimal guidance

A collection of analytical studies is presented related to unconstrained and constrained aircraft (a/c) energy-state modeling and to spacecraft (s/c) motion under continuous thrust. With regard to a/c unconstrained energy-state modeling, the physical origin of the singular perturbation parameter that accounts for the observed 2-time-scale behavior of a/c during energy climbs is identified and explained. With regard to the constrained energy-state modeling, optimal control problems are studied involving active state-variable inequality constraints. Departing from the practical deficiencies of the control programs for such problems that result from the traditional formulations, a complete reformulation is proposed for these problems which, in contrast to the old formulation, will presumably lead to practically useful controllers that can track an inequality constraint boundary asymptotically, and even in the presence of 2-sided perturbations about it. Finally, with regard to s/c motion under continuous thrust, a thrust program is proposed for which the equations of 2-dimensional motion of a space vehicle in orbit, viewed as a point mass, afford an exact analytic solution. The thrust program arises under the assumption of tangential thrust from the costate system corresponding to minimum-fuel, power-limited, coplanar transfers between two arbitrary conics. The thrust program can be used not only with power-limited propulsion systems, but also with any propulsion system capable of generating continuous thrust of controllable magnitude, and, for propulsion types and classes of transfers for which it is sufficiently optimal the results of this report suggest a method of maneuvering during planetocentric or heliocentric orbital operations, requiring a minimum amount of computation; thus uniquely suitable for real-time feedback guidance implementations.

Markopoulos, Nikos↗