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 307 records · Page 17
All sourcesNASA NTRSDOE OSTI
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.↗
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↗
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.↗
NASA NTRS1981

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

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

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

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

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

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

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

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↗
NASA NTRS1991

Homotopy approach to optimal, linear quadratic, fixed architecture compensation

Optimal linear quadratic Gaussian compensators with constrained architecture are a sensible way to generate good multivariable feedback systems meeting strict implementation requirements. The optimality conditions obtained from the constrained linear quadratic Gaussian are a set of highly coupled matrix equations that cannot be solved algebraically except when the compensator is centralized and full order. An alternative to the use of general parameter optimization methods for solving the problem is to use homotopy. The benefit of the method is that it uses the solution to a simplified problem as a starting point and the final solution is then obtained by solving a simple differential equation. This paper investigates the convergence properties and the limitation of such an approach and sheds some light on the nature and the number of solutions of the constrained linear quadratic Gaussian problem. It also demonstrates the usefulness of homotopy on an example of an optimal decentralized compensator.

Mercadal, Mathieu↗