A uniform closed solution of the variational equations for optimal trajectories during coast.
Variational equations uniform closed solution for optimal trajectories during coast without use of numerical integration
Fang, T. C.↗
SEARCH · Search NASA
Results for “solution 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.
Closed-form solutions for a class of optimal quadratic regulator problems with terminal constraints
Closed-form solutions are derived for coupled Riccati-like matrix differential equations describing the solution of a class of optimal finite time quadratic regulator problems with terminal constraints. Analytical solutions are obtained for the feedback gains and the closed-loop response trajectory. A computational procedure is presented which introduces new variables for efficient computation of the terminal control law. Two examples are given to illustrate the validity and usefulness of the theory.
Juang, J.-N.↗
Structural design using equilibrium programming formulations
Solutions to increasingly larger structural optimization problems are desired. However, computational resources are strained to meet this need. New methods will be required to solve increasingly larger problems. The present approaches to solving large-scale problems involve approximations for the constraints of structural optimization problems and/or decomposition of the problem into multiple subproblems that can be solved in parallel. An area of game theory, equilibrium programming (also known as noncooperative game theory), can be used to unify these existing approaches from a theoretical point of view (considering the existence and optimality of solutions), and be used as a framework for the development of new methods for solving large-scale optimization problems. Equilibrium programming theory is described, and existing design techniques such as fully stressed design and constraint approximations are shown to fit within its framework. Two new structural design formulations are also derived. The first new formulation is another approximation technique which is a general updating scheme for the sensitivity derivatives of design constraints. The second new formulation uses a substructure-based decomposition of the structure for analysis and sensitivity calculations. Significant computational benefits of the new formulations compared with a conventional method are demonstrated.
Scotti, Stephen J.↗
Performance tradeoffs in static and dynamic load balancing strategies
The problem of uniformly distributing the load of a parallel program over a multiprocessor system was considered. A program was analyzed whose structure permits the computation of the optimal static solution. Then four strategies for load balancing were described and their performance compared. The strategies are: (1) the optimal static assignment algorithm which is guaranteed to yield the best static solution, (2) the static binary dissection method which is very fast but sub-optimal, (3) the greedy algorithm, a static fully polynomial time approximation scheme, which estimates the optimal solution to arbitrary accuracy, and (4) the predictive dynamic load balancing heuristic which uses information on the precedence relationships within the program and outperforms any of the static methods. It is also shown that the overhead incurred by the dynamic heuristic is reduced considerably if it is started off with a static assignment provided by either of the other three strategies.
Iqbal, M. A.↗
Maximum principle solutions for time-optimal half-loop maneuvers of a high alpha fighter aircraft
An investigation was conducted of maximum principle solutions for an initial 0.6 Mach number and 15,000-ft altitude. The authors generate these solutions for a family of prescribed final times tf, starting with tf = 0.5 s. Using a nonlinear wind-tunnel model they construct maximum principle solutions. Above tf = 1.2 s some small nonlinear variations in the aerodynamic pitching moment coefficient presented difficulty with respect to numerical convergence. This was circumvented by fitting analytical models to the aerodynamic coefficients of the wind-tunnel model at Mach 0.4. Maximum principle solutions of the analytical model are shown to compare well with those obtained for tf of less than 1.2 s. Using the analytical model the authors extended the prescribed final time to a value of 13.65 s at which time the aircraft completes the half-loop maneuver. This is 0.53 s longer than that obtained using the singular perturbation feedback control law.
Stalford, Harold↗
On-board autonomous attitude maneuver planning for planetary spacecraft using genetic algorithms
A key enabling technology that leads to greater spacecraft autonomy is the capability to autonomously and optimally slew the spacecraft from and to different attitudes while operating under a number of celestial and dynamic constraints. The task of finding an attitude trajectory that meets all the constraints is a formidable one, in particular for orbiting or fly-by spacecraft where the constraints and initial and final conditions are of time-varying nature. This paper presents an approach for attitude path planning that makes full use of a priori constraint knowledge and is computationally tractable enough to be executed on-board a spacecraft. The approach is based on incorporating the constraints into a cost function and using a Genetic Algorithm to iteratively search for and optimize the solution. This results in a directed random search that explores a large part of the solution space while maintaining the knowledge of good solutions from iteration to iteration. A solution obtained this way may be used 'as is' or as an initial solution to initialize additional deterministic optimization algorithms. A number of example simulations are presented including the case examples of a generic Europa Orbiter spacecraft in cruise as well as in orbit around Europa. The search times are typically on the order of minutes, thus demonstrating the viability of the presented approach. The results are applicable to all future deep space missions where greater spacecraft autonomy is required. In addition, onboard autonomous attitude planning greatly facilitates navigation and science observation planning, benefiting thus all missions to planet Earth as well.
genetic algorithm↗
Spacecraft Attitude Maneuver Planning Using Genetic Algorithms
A key enabling technology that leads to greater spacecraft autonomy is the capability to autonomously and optimally slew the spacecraft from and to different attitudes while operating under a number of celestial and dynamic constraints. The task of finding an attitude trajectory that meets all the constraints is a formidable one, in particular for orbiting or fly-by spacecraft where the constraints and initial and final conditions are of time-varying nature. This approach for attitude path planning makes full use of a priori constraint knowledge and is computationally tractable enough to be executed onboard a spacecraft. The approach is based on incorporating the constraints into a cost function and using a Genetic Algorithm to iteratively search for and optimize the solution. This results in a directed random search that explores a large part of the solution space while maintaining the knowledge of good solutions from iteration to iteration. A solution obtained this way may be used as is or as an initial solution to initialize additional deterministic optimization algorithms. A number of representative case examples for time-fixed and time-varying conditions yielded search times that are typically on the order of minutes, thus demonstrating the viability of this method. This approach is applicable to all deep space and planet Earth missions requiring greater spacecraft autonomy, and greatly facilitates navigation and science observation planning.
Kornfeld, Richard P.↗
A comparative analysis of static and dynamic load balancing strategies
The problem of uniformly distributing the load of a parallel program over a multiprocessor system was considered. A program was analyzed whose structure permits the computation of the optimal static solution. Then four strategies for load balancing were described and their performance compared. The strategies are: (1) the optimal static assignment algorithm which is guaranteed to yield the best static solution, (2) the static binary dissection method which is very fast but suboptimal, (3) the greedy algorithm, a static fully polynomial time approximation scheme, which estimates the optimal solution to arbitrary accuracy, and (4) the predictive dynamic load balancing heuristic which uses information on the precedence relationships within the program and outperforms any of the static methods. It is also shown that the overhead incurred by the dynamic heuristic is reduced considerably if it is started off with a static assignment provided by either of the three strategies.
Iqbal, M. Ashraf↗
A Minimum (Delta)V Orbit Maintenance Strategy for Low-Altitude Missions Using Burn Parameter Optimization
Orbit maintenance is the series of burns performed during a mission to ensure the orbit satisfies mission constraints. Low-altitude missions often require non-trivial orbit maintenance (Delta)V due to sizable orbital perturbations and minimum altitude thresholds. A strategy is presented for minimizing this (Delta)V using impulsive burn parameter optimization. An initial estimate for the burn parameters is generated by considering a feasible solution to the orbit maintenance problem. An example demonstrates the dV savings from the feasible solution to the optimal solution.
Brown, Aaron J.↗
A Minimum Delta V Orbit Maintenance Strategy for Low-Altitude Missions Using Burn Parameter Optimization
Orbit maintenance is the series of burns performed during a mission to ensure the orbit satisfies mission constraints. Low-altitude missions often require non-trivial orbit maintenance Delta V due to sizable orbital perturbations and minimum altitude thresholds. A strategy is presented for minimizing this Delta V using impulsive burn parameter optimization. An initial estimate for the burn parameters is generated by considering a feasible solution to the orbit maintenance problem. An low-lunar orbit example demonstrates the Delta V savings from the feasible solution to the optimal solution. The strategy s extensibility to more complex missions is discussed, as well as the limitations of its use.
Brown, Aaron J.↗
Optimization and analysis of large chemical kinetic mechanisms using the solution mapping method - Combustion of methane
A method of systematic optimization, solution mapping, as applied to a large-scale dynamic model is presented. The basis of the technique is parameterization of model responses in terms of model parameters by simple algebraic expressions. These expressions are obtained by computer experiments arranged in a factorial design. The developed parameterized responses are then used in a joint multiparameter multidata-set optimization. A brief review of the mathematical background of the technique is given. The concept of active parameters is discussed. The technique is applied to determine an optimum set of parameters for a methane combustion mechanism. Five independent responses - comprising ignition delay times, pre-ignition methyl radical concentration profiles, and laminar premixed flame velocities - were optimized with respect to thirteen reaction rate parameters. The numerical predictions of the optimized model are compared to those computed with several recent literature mechanisms. The utility of the solution mapping technique in situations where the optimum is not unique is also demonstrated.
Frenklach, Michael↗
Fuel-Efficient Descent and Landing Guidance Logic for a Safe Lunar Touchdown
The landing of a crewed lunar lander on the surface of the Moon will be the climax of any Moon mission. At touchdown, the landing mechanism must absorb the load imparted on the lander due to the vertical component of the lander's touchdown velocity. Also, a large horizontal velocity must be avoided because it could cause the lander to tip over, risking the life of the crew. To be conservative, the worst-case lander's touchdown velocity is always assumed in designing the landing mechanism, making it very heavy. Fuel-optimal guidance algorithms for soft planetary landing have been studied extensively. In most of these studies, the lander is constrained to touchdown with zero velocity. With bounds imposed on the magnitude of the engine thrust, the optimal control solutions typically have a "bang-bang" thrust profile: the thrust magnitude "bangs" instantaneously between its maximum and minimum magnitudes. But the descent engine might not be able to throttle between its extremes instantaneously. There is also a concern about the acceptability of "bang-bang" control to the crew. In our study, the optimal control of a lander is formulated with a cost function that penalizes both the touchdown velocity and the fuel cost of the descent engine. In this formulation, there is not a requirement to achieve a zero touchdown velocity. Only a touchdown velocity that is consistent with the capability of the landing gear design is required. Also, since the nominal throttle level for the terminal descent sub-phase is well below the peak engine thrust, no bound on the engine thrust is used in our formulated problem. Instead of bangbang type solution, the optimal thrust generated is a continuous function of time. With this formulation, we can easily derive analytical expressions for the optimal thrust vector, touchdown velocity components, and other system variables. These expressions provide insights into the "physics" of the optimal landing and terminal descent maneuver. These insights could help engineers to achieve a better "balance" between the conflicting needs of achieving a safe touchdown velocity, a low-weight landing mechanism, low engine fuel cost, and other design goals. In comparing the computed optimal control results with the preflight landing trajectory design of the Apollo-11 mission, we noted interesting similarities between the two missions.
guidance logic↗
Powered Descent Guidance with General Thrust-Pointing Constraints
The Powered Descent Guidance (PDG) algorithm and software for generating Mars pinpoint or precision landing guidance profiles has been enhanced to incorporate thrust-pointing constraints. Pointing constraints would typically be needed for onboard sensor and navigation systems that have specific field-of-view requirements to generate valid ground proximity and terrain-relative state measurements. The original PDG algorithm was designed to enforce both control and state constraints, including maximum and minimum thrust bounds, avoidance of the ground or descent within a glide slope cone, and maximum speed limits. The thrust-bound and thrust-pointing constraints within PDG are non-convex, which in general requires nonlinear optimization methods to generate solutions. The short duration of Mars powered descent requires guaranteed PDG convergence to a solution within a finite time; however, nonlinear optimization methods have no guarantees of convergence to the global optimal or convergence within finite computation time. A lossless convexification developed for the original PDG algorithm relaxed the non-convex thrust bound constraints. This relaxation was theoretically proven to provide valid and optimal solutions for the original, non-convex problem within a convex framework. As with the thrust bound constraint, a relaxation of the thrust-pointing constraint also provides a lossless convexification that ensures the enhanced relaxed PDG algorithm remains convex and retains validity for the original nonconvex problem. The enhanced PDG algorithm provides guidance profiles for pinpoint and precision landing that minimize fuel usage, minimize landing error to the target, and ensure satisfaction of all position and control constraints, including thrust bounds and now thrust-pointing constraints.
Carson, John M., III↗
Asymptotic solution to the problem of optimal low-thrust energy increase.
Consideration of the problem of optimal ascent from an initial circular planetary orbit to some specified final energy level by a spacecraft equipped with a low-thrust engine. Optimal is defined as minimum time. An accurate small parameter perturbation solution is presented, and the optimal trajectory is analyzed and compared with a tangential thrust trajectory.
Jacobson, R. A.↗
Research on celestial mechanics and optimization - Second-order solution of the polar oblateness problem Final report
Second-order solution for motion of satellite about oblate earth, including second, third, and fourth zonal harmonics - celestial mechanics
CELESTIAL MECHANICS↗
The computer implementation of the tensor solution to the nonlinear optimal control problem
Explore the source record for details and available documents.
Osullivan, J. A.↗
An Analytical Solution for Yaw Maneuver Optimization on the International Space Station and Other Orbiting Space Vehicles
No abstract available
Dobrinskaya, Tatiana↗
Electrochemical Solutions for Advanced Life Support
The Oxygen Generating Assembly (OGA) on-board the International Space Station (ISS) employs a polymer electrolyte membrane (PEM) water electrolysis cell stack to electrochemically dissociate water into its two components – oxygen and hydrogen. Oxygen is provided to the cabin atmosphere for crew respiration while the hydrogen is delivered to a carbon dioxide reduction system to recover oxygen as water. The design of the OGA evolved over a number of years to arrive at the system solution that is currently operational on ISS. Future manned missions to space will require advanced technologies that eliminate the need for resupply from earth and feature in-situ resource utilization to sustain crew life and to provide useful materials to the crew. The architects planning such missions should consider all potential solutions at their disposal to arrive at an optimal vehicle solution that minimizes crew maintenance time, launch weight, installed volume and energy consumption demands. Skyre is developing new technologies through funding from NASA, the Department of Energy, and internal investment based on PEM technology that could become an integral part of these new vehicle solutions. At varying stages of Technology Readiness Level (TRL) are: an oxygen concentrator and compressor that can separate oxygen from an air stream and provide an enriched oxygen resource for crew medical use and space suit recharge without any moving parts in the pure oxygen stream; a regenerative carbon dioxide removal system featuring a PEM-based sorbent regenerator; a carbon dioxide reduction system that electrochemically produces organic compounds that could serve as fuels or as a useful intermediary to more beneficial compounds; and an electrochemical hydrogen separator and compressor for hydrogen recycle. The technical maturity of these projects is presented along with pertinent performance test data that could be beneficial in future study efforts.
Roy, Robert J.↗