Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “constraint handling”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS2012

Joint Chance-Constrained Dynamic Programming

This paper presents a novel dynamic programming algorithm with a joint chance constraint, which explicitly bounds the risk of failure in order to maintain the state within a specified feasible region. A joint chance constraint cannot be handled by existing constrained dynamic programming approaches since their application is limited to constraints in the same form as the cost function, that is, an expectation over a sum of one-stage costs. We overcome this challenge by reformulating the joint chance constraint into a constraint on an expectation over a sum of indicator functions, which can be incorporated into the cost function by dualizing the optimization problem. As a result, the primal variables can be optimized by a standard dynamic programming, while the dual variable is optimized by a root-finding algorithm that converges exponentially. Error bounds on the primal and dual objective values are rigorously derived. We demonstrate the algorithm on a path planning problem, as well as an optimal control problem for Mars entry, descent and landing. The simulations are conducted using a real terrain data of Mars, with four million discrete states at each time step.

Ono, Masahiro↗
NASA NTRS1991

Minimum fuel coplanar aeroassisted orbital transfer using collocation and nonlinear programming

The fuel optimal control problem arising in coplanar orbital transfer employing aeroassisted technology is addressed. The mission involves the transfer from high energy orbit (HEO) to low energy orbit (LEO) without plane change. The basic approach here is to employ a combination of propulsive maneuvers in space and aerodynamic maneuvers in the atmosphere. The basic sequence of events for the coplanar aeroassisted HEO to LEO orbit transfer consists of three phases. In the first phase, the transfer begins with a deorbit impulse at HEO which injects the vehicle into a elliptic transfer orbit with perigee inside the atmosphere. In the second phase, the vehicle is optimally controlled by lift and drag modulation to satisfy heating constraints and to exit the atmosphere with the desired flight path angle and velocity so that the apogee of the exit orbit is the altitude of the desired LEO. Finally, the second impulse is required to circularize the orbit at LEO. The performance index is maximum final mass. Simulation results show that the coplanar aerocapture is quite different from the case where orbital plane changes are made inside the atmosphere. In the latter case, the vehicle has to penetrate deeper into the atmosphere to perform the desired orbital plane change. For the coplanar case, the vehicle needs only to penetrate the atmosphere deep enough to reduce the exit velocity so the vehicle can be captured at the desired LEO. The peak heating rates are lower and the entry corridor is wider. From the thermal protection point of view, the coplanar transfer may be desirable. Parametric studies also show the maximum peak heating rates and the entry corridor width are functions of maximum lift coefficient. The problem is solved using a direct optimization technique which uses piecewise polynomial representation for the states and controls and collocation to represent the differential equations. This converts the optimal control problem into a nonlinear programming problem which is solved numerically by using a modified version of NPSOL. Solutions were obtained for the described problem for cases with and without heating constraints. The method appears to be more robust than other optimization methods. In addition, the method can handle complex dynamical constraints.

Shi, Yun Yuan↗
NASA NTRS1990

Optimal aeroassisted orbital transfer with plane change using collocation and nonlinear programming

The fuel optimal control problem arising in the non-planar orbital transfer employing aeroassisted technology is addressed. The mission involves the transfer from high energy orbit (HEO) to low energy orbit (LEO) with orbital plane change. The basic strategy here is to employ a combination of propulsive maneuvers in space and aerodynamic maneuvers in the atmosphere. The basic sequence of events for the aeroassisted HEO to LEO transfer consists of three phases. In the first phase, the orbital transfer begins with a deorbit impulse at HEO which injects the vehicle into an elliptic transfer orbit with perigee inside the atmosphere. In the second phase, the vehicle is optimally controlled by lift and bank angle modulations to perform the desired orbital plane change and to satisfy heating constraints. Because of the energy loss during the turn, an impulse is required to initiate the third phase to boost the vehicle back to the desired LEO orbital altitude. The third impulse is then used to circularize the orbit at LEO. The problem is solved by a direct optimization technique which uses piecewise polynomial representation for the state and control variables and collocation to satisfy the differential equations. This technique converts the optimal control problem into a nonlinear programming problem which is solved numerically. Solutions were obtained for cases with and without heat constraints and for cases of different orbital inclination changes. The method appears to be more powerful and robust than other optimization methods. In addition, the method can handle complex dynamical constraints.

Shi, Yun. Y.↗
NASA NTRS1991

A parallel trajectory optimization tool for aerospace plane guidance

A parallel trajectory optimization algorithm is being developed. One possible mission is to provide real-time, on-line guidance for the National Aerospace Plane. The algorithm solves a discrete-time problem via the augmented Lagrangian nonlinear programming algorithm. The algorithm exploits the dynamic programming structure of the problem to achieve parallelism in calculating cost functions, gradients, constraints, Jacobians, Hessian approximations, search directions, and merit functions. Special additions to the augmented Lagrangian algorithm achieve robust convergence, achieve (almost) superlinear local convergence, and deal with constraint curvature efficiency. The algorithm can handle control and state inequality constraints such as angle-of-attack and dynamic pressure constraints. Portions of the algorithm have been tested. The nonlinear programming core algorithm performs well on a variety of static test problems and on an orbit transfer problem. The parallel search direction algorithm can reduce wall clock time by a factor of 10 for this part of the computation task.

Psiaki, Mark L.↗
NASA NTRS1984

A numerical analysis of contact and limit-point behavior in a class of problems of finite elastic deformation

Finite element methods for the analysis of bifurcations, limit-point behavior, and unilateral frictionless contact of elastic bodies undergoing finite deformation are presented. Particular attention is given to the development and application of Riks-type algorithms for the analysis of limit points and exterior penalty methods for handling the unilateral constraints. Applications focus on the problem of finite axisymmetric deformations, snap-through, and inflation of thick rubber spherical shells.

Endo, T.↗
NASA NTRS2016

Fast, Safe, Propellant-Efficient Spacecraft Motion Planning Under Clohessy-Wiltshire-Hill Dynamics

This paper presents a sampling-based motion planning algorithm for real-time and propellant-optimized autonomous spacecraft trajectory generation in near-circular orbits. Specifically, this paper leverages recent algorithmic advances in the field of robot motion planning to the problem of impulsively actuated, propellant- optimized rendezvous and proximity operations under the Clohessy-Wiltshire-Hill dynamics model. The approach calls upon a modified version of the FMT* algorithm to grow a set of feasible trajectories over a deterministic, low-dispersion set of sample points covering the free state space. To enforce safety, the tree is only grown over the subset of actively safe samples, from which there exists a feasible one-burn collision-avoidance maneuver that can safely circularize the spacecraft orbit along its coasting arc under a given set of potential thruster failures. Key features of the proposed algorithm include 1) theoretical guarantees in terms of trajectory safety and performance, 2) amenability to real-time implementation, and 3) generality, in the sense that a large class of constraints can be handled directly. As a result, the proposed algorithm offers the potential for widespread application, ranging from on-orbit satellite servicing to orbital debris removal and autonomous inspection missions.

spacecraft relative motio↗
NASA NTRS2024

Future of the Search for Life: Workshop Report

The 2-week, virtual Future of the Search for Life science and engineering workshop brought together more than 100 scientists, engineers, and technologists in March and April 2022 to provide their expert opinion on the interconnections between life-detection science and technology. Participants identified the advances in measurement and sampling technologies they believed to be necessary to perform in situ searches for life elsewhere in our Solar System, 20 years or more in the future. Among suggested measurements for these searches, those pertaining to three potential indicators of life termed “dynamic disequilibrium,” “catalysis,” and “informational polymers” were identified as particularly promising avenues for further exploration. For these three indicators, small breakout groups of participants identified measurement needs and knowledge gaps, along with corresponding constraints on sample handling (acquisition and processing) approaches for a variety of environments on Enceladus, Europa, Mars, and Titan. Despite the diversity of these environments, sample processing approaches all tend to be more complex than those that have been implemented on missions or envisioned for mission concepts to date. The approaches considered by workshop breakout groups progress from nondestructive to destructive measurement techniques, and most involve the need for fluid (especially liquid) sample processing. Sample processing needs were identified as technology gaps. These gaps include technology and associated sampling strategies that allow the preservation of the thermal, mechanical, and chemical integrity of the samples upon acquisition; and to optimize the sample information obtained by operating suites of instruments on common samples. Crucially, the interplay between science-driven life-detection strategies and their technological implementation highlights the need for an unprecedented level of payload integration and extensive collaboration between scientists and engineers, starting from concept formulation through mission deployment of life-detection instruments and sample processing systems.

Marc Neveu↗
NASA NTRS1989

Conceptual design for aerospace vehicles

The designers of aircraft and more recently, aerospace vehicles have always struggled with the problems of evolving their designs to produce a machine which would perform its assigned task(s) in some optimum fashion. Almost invariably this involved dealing with more variables and constraints than could be handled in any computationally feasible way. With the advent of the electronic digital computer, the possibilities for introducing more variable and constraints into the initial design process led to greater expectations for improvement in vehicle (system) efficiency. The creation of the large scale systems necessary to achieve optimum designs has, for many reason, proved to be difficult. From a technical standpoint, significant problems arise in the development of satisfactory algorithms for processing of data from the various technical disciplines in a way that would be compatible with the complex optimization function. Also, the creation of effective optimization routines for multi-variable and constraint situations which could lead to consistent results has lagged. The current capability for carrying out the conceptual design of an aircraft on an interdisciplinary bases was evaluated to determine the need for extending this capability, and if necessary, to recommend means by which this could be carried out. Based on a review of available documentation and individual consultations, it appears that there is extensive interest at Langley Research Center as well as in the aerospace community in providing a higher level of capability that meets the technical challenges. By implication, the current design capability is inadequate and it does not operate in a way that allows the various technical disciplines to participate and cooperately interact in the design process. Based on this assessment, it was concluded that substantial effort should be devoted to developing a computer-based conceptual design system that would provide the capability needed for the near-term as well as framework for development of more advanced methods to serve future needs.

Gratzer, Louis B.↗
NASA NTRS1973

Function space quasi-Newton algorithms for optimal control problems with bounded controls and singular arcs

Two existing function space algorithms, Davidon and projected gradient, are modified so that they may handle directly control variable inequality constraints. A third quasi-Newton type algorithm developed by C. G. Broyden is extended to optimal control problems. The Broyden algorithm is further modified so that it also may handle directly control variable inequality constraints. These methods along with a pure gradient and two conjugate gradient algorithms are simulated on three relatively simple yet representative bounded control problems, two of which have singular subarcs. Overall the Broyden algorithm was found to be superior. The most notable result of the study was the clear superiority of the Broyden and Davidon algorithms in producing a sharp interior control subarc.

Edge, E. R.↗
NASA NTRS1992

Truss topology optimization with simultaneous analysis and design

Strategies for topology optimization of trusses for minimum weight subject to stress and displacement constraints by Simultaneous Analysis and Design (SAND) are considered. The ground structure approach is used. A penalty function formulation of SAND is compared with an augmented Lagrangian formulation. The efficiency of SAND in handling combinations of general constraints is tested. A strategy for obtaining an optimal topology by minimizing the compliance of the truss is compared with a direct weight minimization solution to satisfy stress and displacement constraints. It is shown that for some problems, starting from the ground structure and using SAND is better than starting from a minimum compliance topology design and optimizing only the cross sections for minimum weight under stress and displacement constraints. A member elimination strategy to save CPU time is discussed.

Sankaranarayanan, S.↗
NASA NTRS1988

Experiences in applying optimization techniques to configurations for the Control Of Flexible Structures (COFS) Program

Optimization procedures are developed to systematically provide closely-spaced vibration frequencies. A general-purpose finite-element program for eigenvalue and sensitivity analyses is combined with formal mathematical programming techniques. Results are presented for three studies. The first study uses a simple model to obtain a design with two pairs of closely-spaced frequencies. Two formulations are developed: an objective function-based formulation and constraint-based formulation for the frequency spacing. It is found that conflicting goals are handled better by a constraint-based formulation. The second study uses a detailed model to obtain a design with one pair of closely-spaced frequencies while satisfying requirements on local member frequencies and manufacturing tolerances. Two formulations are developed. Both the constraint-based and the objective function-based formulations perform reasonably well and converge to the same results. However, no feasible design solution exists which satisfies all design requirements for the choices of design variables and the upper and lower design variable values used. More design freedom is needed to achieve a fully satisfactory design. The third study is part of a redesign activity in which a detailed model is used. The use of optimization in this activity allows investigation of numerous options (such as number of bays, material, minimum diagonal wall thicknesses) in a relatively short time. The procedure provides data for judgments on the effects of different options on the design.

Walsh, Joanne L.↗
NASA NTRS1989

Experiences in applying optimization techniques to configurations for the Control of Flexible Structures (COFS) program

Optimization procedures are developed to systematically provide closely-spaced vibration frequencies. A general purpose finite-element program for eigenvalue and sensitivity analyses is combined with formal mathematical programming techniques. Results are presented for three studies. The first study uses a simple model to obtain a design with two pairs of closely-spaced frequencies. Two formulations are developed: an objective function-based formulation and constraint-based formulation for the frequency spacing. It is found that conflicting goals are handled better by a constraint-based formulation. The second study uses a detailed model to obtain a design with one pair of closely-spaced frequencies while satisfying requirements on local member frequencies and manufacturing tolerances. Two formulations are developed. Both the constraint-based and the objective function-based formulations perform reasonably well and converge to the same results. However, no feasible design solution exists which satisfies all design requirements for the choices of design variables and the upper and lower design variable values used. More design freedom is needed to achieve a fully satisfactory design. The third study is part of a redesign activity in which a detailed model is used.

Walsh, Joanne L.↗
NASA NTRS1989

Computational neural learning formalisms for manipulator inverse kinematics

An efficient, adaptive neural learning paradigm for addressing the inverse kinematics of redundant manipulators is presented. The proposed methodology exploits the infinite local stability of terminal attractors - a new class of mathematical constructs which provide unique information processing capabilities to artificial neural systems. For robotic applications, synaptic elements of such networks can rapidly acquire the kinematic invariances embedded within the presented samples. Subsequently, joint-space configurations, required to follow arbitrary end-effector trajectories, can readily be computed. In a significant departure from prior neuromorphic learning algorithms, this methodology provides mechanisms for incorporating an in-training skew to handle kinematics and environmental constraints.

Gulati, Sandeep↗
NASA NTRS1991

An active set algorithm for tracing parametrized optima

Optimization problems often depend on parameters that define constraints or objective functions. It is often necessary to know the effect of a change in a parameter on the optimum solution. An algorithm is presented here for tracking paths of optimal solutions of inequality constrained nonlinear programming problems as a function of a parameter. The proposed algorithm employs homotopy zero-curve tracing techniques to track segments where the set of active constraints is unchanged. The transition between segments is handled by considering all possible sets of active constraints and eliminating nonoptimal ones based on the signs of the Lagrange multipliers and the derivatives of the optimal solutions with respect to the parameter. A spring-mass problem is used to illustrate all possible kinds of transition events, and the algorithm is applied to a well-known ten-bar truss structural optimization problem.

Rakowska, J.↗
NASA NTRS1998

Lunar prospector mission design and trajectory support

The Lunar Prospector mission is the first dedicated NASA lunar mapping mission since the Apollo Orbiter program which was flown over 25 years ago. Competitively selected under the NASA Discovery Program, Lunar Prospector was launched on January 7, 1998 on the new Lockheed Martin Athena 2 launch vehicle. The mission design of Lunar Prospector is characterized by a direct minimum energy transfer trajectory to the moon with three scheduled orbit correction maneuvers to remove launch and cislunar injection errors prior to lunar insertion. At lunar encounter, a series of three lunar orbit insertion maneuvers and a small circularization burn were executed to achieve a 100 km altitude polar mapping orbit. This paper will present the design of the Lunar Prospector transfer, lunar insertion and mapping orbits, including maneuver and orbit determination strategies in the context of mission goals and constraints. Contingency plans for handling transfer orbit injection and lunar orbit insertion anomalies are also summarized. Actual flight operations results are discussed and compared to pre-launch support analysis.

Lozier, David↗
NASA NTRS1976

Function-space quasi-Newton algorithms for optimal control problems with bounded controls and singular arcs

Two existing function-space quasi-Newton algorithms, the Davidon algorithm and the projected gradient algorithm, are modified so that they may handle directly control-variable inequality constraints. A third quasi-Newton-type algorithm, developed by Broyden, is extended to optimal control problems. The Broyden algorithm is further modified so that it may handle directly control-variable inequality constraints. From a computational viewpoint, dyadic operator implementation of quasi-Newton methods is shown to be superior to the integral kernel representation. The quasi-Newton methods, along with the steepest descent method and two conjugate gradient algorithms, are simulated on three relatively simple (yet representative) bounded control problems, two of which possess singular subarcs. Overall, the Broyden algorithm was found to be superior. The most notable result of the simulations was the clear superiority of the Broyden and Davidon algorithms in producing a sharp singular control subarc.

Edge, E. R.↗