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.

SourceResearch connectionFrom yearThrough year

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

At least 379 records · Page 21

All sources NASA NTRS DOE OSTI

NASA NTRS1991

Interplanetary trajectory optimization of Mars aerobraking missions with constrained atmospheric entry velocities

Many current manned Mars mission studies are using low lift-to-drag ratio (L/D) vehicles to aerobrake at both Mars and earth. The use of these low L/D vehicles imposes constraints on the allowable velocity at the atmospheric interface. This paper will demonstrate that if these entry velocity constraints are incorporated into the interplanetary analysis, more opportunities can be achieved for a small increase in initial LEO mass. These additional opportunities result from varying the initial launch date, the encounter dates, and possibly using a powered Venus swingby on either the inbound or outbound transfer. This paper presents results for three atmospheric entry velocity ranges at Mars arrival and one velocity limitation upon Earth return. The results indicate that by carefully selecting the interplanetary trajectory, an optimum initial LEO mass mission can be found for even highly restrictive entry velocity missions in practically all of the 15 years studied.

Striepe, Scott A.↗

NASA NTRS2011

JWST Wavefront Control Toolbox

A Matlab-based toolbox has been developed for the wavefront control and optimization of segmented optical surfaces to correct for possible misalignments of James Webb Space Telescope (JWST) using influence functions. The toolbox employs both iterative and non-iterative methods to converge to an optimal solution by minimizing the cost function. The toolbox could be used in either of constrained and unconstrained optimizations. The control process involves 1 to 7 degrees-of-freedom perturbations per segment of primary mirror in addition to the 5 degrees of freedom of secondary mirror. The toolbox consists of a series of Matlab/Simulink functions and modules, developed based on a "wrapper" approach, that handles the interface and data flow between existing commercial optical modeling software packages such as Zemax and Code V. The limitations of the algorithm are dictated by the constraints of the moving parts in the mirrors.

Shin, Shahram Ron↗

NASA NTRS2011

Enhanced Fuel-Optimal Trajectory-Generation Algorithm for Planetary Pinpoint Landing

An enhanced algorithm is developed that builds on a previous innovation of fuel-optimal powered-descent guidance (PDG) for planetary pinpoint landing. The PDG problem is to compute constrained, fuel-optimal trajectories to land a craft at a prescribed target on a planetary surface, starting from a parachute cut-off point and using a throttleable descent engine. The previous innovation showed the minimal-fuel PDG problem can be posed as a convex optimization problem, in particular, as a Second-Order Cone Program, which can be solved to global optimality with deterministic convergence properties, and hence is a candidate for onboard implementation. To increase the speed and robustness of this convex PDG algorithm for possible onboard implementation, the following enhancements are incorporated: 1) Fast detection of infeasibility (i.e., control authority is not sufficient for soft-landing) for subsequent fault response. 2) The use of a piecewise-linear control parameterization, providing smooth solution trajectories and increasing computational efficiency. 3) An enhanced line-search algorithm for optimal time-of-flight, providing quicker convergence and bounding the number of path-planning iterations needed. 4) An additional constraint that analytically guarantees inter-sample satisfaction of glide-slope and non-sub-surface flight constraints, allowing larger discretizations and, hence, faster optimization. 5) Explicit incorporation of Mars rotation rate into the trajectory computation for improved targeting accuracy. These enhancements allow faster convergence to the fuel-optimal solution and, more importantly, remove the need for a "human-in-the-loop," as constraints will be satisfied over the entire path-planning interval independent of step-size (as opposed to just at the discrete time points) and infeasible initial conditions are immediately detected. Finally, while the PDG stage is typically only a few minutes, ignoring the rotation rate of Mars can introduce 10s of meters of error. By incorporating it, the enhanced PDG algorithm becomes capable of pinpoint targeting.

Acikmese, Behcet↗

DOE OSTI2024

Efficient Reformulation and Optimization for SC-ACOPF with Line Switching

This project aims to develop efficient and robust computational methods for solving the security-constrained alternating current optimal power flow problem (SC-ACOPF). The SC-ACOPF problem is a central problem in operating the electric power grids in the United States. It determines the most economically efficient way to operate the generation and transmission system to meet daily electricity demand. The solution found by solving an SC-ACOPF problem must satisfy the physics of the alternating current (AC) power flows, various generator and network operational constraints, and must maintain secure operation under various contingency scenarios, where a generator, a transmission branch, or a transformer may unexpectedly trip offline.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2008

Parallel Implementation of the Recursive Approximation of an Unsupervised Hierarchical Segmentation Algorithm

The hierarchical image segmentation algorithm (referred to as HSEG) is a hybrid of hierarchical step-wise optimization (HSWO) and constrained spectral clustering that produces a hierarchical set of image segmentations. HSWO is an iterative approach to region grooving segmentation in which the optimal image segmentation is found at N(sub R) regions, given a segmentation at N(sub R+1) regions. HSEG's addition of constrained spectral clustering makes it a computationally intensive algorithm, for all but, the smallest of images. To counteract this, a computationally efficient recursive approximation of HSEG (called RHSEG) has been devised. Further improvements in processing speed are obtained through a parallel implementation of RHSEG. This chapter describes this parallel implementation and demonstrates its computational efficiency on a Landsat Thematic Mapper test scene.

Tilton, James C.↗

DOE OSTI2025

Incorporating civilian radioxenon background estimates in anomaly detection

A nuclear explosion screening exercise in 2023 (Maurer et al., 2023) found challenges with discerning anomalous radioxenon activity concentrations relative to elevated background concentrations. Research has continued into methods to detect anomalous radioxenon concentrations by comparing samples to estimates of atmospheric radioxenon background concentrations caused by releases at nuclear reactors or medical isotope production facilities. A new approach estimates the sample concentrations using time-varying radioxenon release rates obtained using optimization techniques that constrain the facility release rates to plausible amounts based on historical data or facility knowledge. The purpose of the optimization is to determine whether any combination of plausible release rates from emitting facilities can explain a series of radioxenon measurements at one or more sampling stations. A case study uses radioxenon data collected at three locations in western Europe for a month in 2021 and considers releases from 77 locations. Fewer samples are identified as being anomalous using a simplistic flagging rule than from an application of the current International Monitoring System (IMS) activity concentration-level rule.

Environmental sciences↗

NASA NTRS1989

Chebyshev polynomials are not always optimal

The problem is that of finding among all polynomials of degree at most n and normalized to be 1 at c the one with minimal uniform norm on Epsilon. Here, Epsilon is a given ellipse with both foci on the real axis and c is a given real point not contained in Epsilon. Problems of this type arise in certain iterative matrix computations and, in this context, it is generally believed and widely referenced that suitably normalized Chebyshev polynomials are optimal for such constrained approximation problems. It is shown that this is not true in general. Moreover, sufficient conditions are derived which guarantee that Chebyshev polynomials are optimal. Some numerical examples are also presented.

Fischer, Bernd↗

NASA NTRS1997

Optimizing an Actuator Array for the Control of Multi-Frequency Noise in Aircraft Interiors

Techniques developed for selecting an optimized actuator array for interior noise reduction at a single frequency are extended to the multi-frequency case. Transfer functions for 64 actuators were obtained at 5 frequencies from ground testing the rear section of a fully trimmed DC-9 fuselage. A single loudspeaker facing the left side of the aircraft was the primary source. A combinatorial search procedure (tabu search) was employed to find optimum actuator subsets of from 2 to 16 actuators. Noise reduction predictions derived from the transfer functions were used as a basis for evaluating actuator subsets during optimization. Results indicate that it is necessary to constrain actuator forces during optimization. Unconstrained optimizations selected actuators which require unrealistically large forces. Two methods of constraint are evaluated. It is shown that a fast, but approximate, method yields results equivalent to an accurate, but computationally expensive, method.

Palumbo, D. L.↗

NASA NTRS1989

Chebyshev Polynomials Are Not Always Optimal

The authors are concerned with the problem of finding among all polynomials of degree at most n and normalized to be 1 at c the one with minimal uniform norm on Epsilon. Here, Epsilon is a given ellipse with both foci on the real axis and c is a given real point not contained in Epsilon. Problems of this type arise in certain iterative matrix computations, and, in this context, it is generally believed and widely referenced that suitably normalized Chebyshev polynomials are optimal for such constrained approximation problems. In this note, the authors show that this is not true in general. Moreover, the authors derive sufficient conditions which guarantee that Chebyshev polynomials are optimal. Also, some numerical examples are presented.

CHEBYSHEV APPROXIMATION↗

NASA NTRS2015

Constraining Black Carbon Aerosol over Asia using OMI Aerosol Absorption Optical Depth and the Adjoint of GEOS-Chem

Accurate estimates of the emissions and distribution of black carbon (BC) in the region referred to here as Southeastern Asia (70degE-l50degE, 11degS-55degN) are critical to studies of the atmospheric environment and climate change. Analysis of modeled BC concentrations compared to in situ observations indicates levels are underestimated over most of Southeast Asia when using any of four different emission inventories. We thus attempt to reduce uncertainties in BC emissions and improve BC model simulations by developing top-down, spatially resolved, estimates of BC emissions through assimilation of OMI observations of aerosol absorption optical depth (AAOD) with the GEOS-Chem model and its adjoint for April and October of 2006. Overwhelming enhancements, up to 500%, in anthropogenic BC emissions are shown after optimization over broad areas of Southeast Asia in April. In October, the optimization of anthropogenic emissions yields a slight reduction (1-5%) over India and parts of southern China, while emissions increase by 10-50% over eastern China. Observational data from in situ measurements and AERONET observations are used to evaluate the BC inversions and assess the bias between OMI and AERONET AAOD. Low biases in BC concentrations are improved or corrected in most eastern and central sites over China after optimization, while the constrained model still underestimates concentrations in Indian sites in both April and October, possibly as a. consequence of low prior emissions. Model resolution errors may contribute up to a factor of 2.5 to the underestimate of surface BC concentrations over northern India. We also compare the optimized results using different anthropogenic emission inventories and discuss the sensitivity of top-down constraints on anthropogenic emissions with respect to biomass burning emissions. In addition, the impacts of brown carbon, the formulation of the observation operator, and different a priori constraints on the optimization are investigated. Overall, despite these limitations and uncertainties, using OMI AAOD to constrain BC sources improves model representation of BC distributions, particularly over China.

Aerosols↗

DOE OSTI2024

Integrated floating wind farm layout design and mooring system optimization to increase annual energy production

As we cluster wind turbines in wind farms to gain energy from sites with high wind speeds, wake losses occur within the wind farm. Wake loss is a term used to describe the lower energy production of a downwind turbine that is totally or partially in the wake of an upwind turbine. To decrease wake losses inside the wind farm, the wind farm’s layout is optimized. However, a variety of factors constrain the wind farm layout optimization, such as the size of the lease area relative to the number of turbines to be placed, or the shape of the lease area. Therefore, many wind farms end up with a regular grid layout, such as the Horns Rev 1 wind farm in the North Sea. The ability of a floating offshore wind turbine (FOWT) to change its position based on the wind direction and its mooring system design presents an opportunity to further decrease wake losses in floating wind farms. In this work, we integrate the design of the FOWT mooring systems with the floating wind farm layout design with the goal of increasing the farm’s annual energy production. We use the Horns Rev 1 wind farm as a case study to demonstrate our method. The results show that allowing the FOWT to relocate can decrease wake losses up to 18%. Moreover, the newly developed mooring systems are less stiff and therefore allow larger motion of the FOWT; hence, the material cost of the mooring system decreases by an estimated 17%.

17 WIND ENERGY↗

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↗

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↗