Search NASA⌕ Search

SEARCH · Search NASA

Results for “Calculus of Variations and 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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
NASA NTRS1993

Feedback control for unsteady flow and its application to the stochastic Burgers equation

The study applies mathematical methods of control theory to the problem of control of fluid flow with the long-range objective of developing effective methods for the control of turbulent flows. Model problems are employed through the formalism and language of control theory to present the procedure of how to cast the problem of controlling turbulence into a problem in optimal control theory. Methods of calculus of variations through the adjoint state and gradient algorithms are used to present a suboptimal control and feedback procedure for stationary and time-dependent problems. Two types of controls are investigated: distributed and boundary controls. Several cases of both controls are numerically simulated to investigate the performances of the control algorithm. Most cases considered show significant reductions of the costs to be minimized. The dependence of the control algorithm on the time-descretization method is discussed.

Choi, Haecheon↗
NASA NTRS1999

Human Mars Mission: Launch Window from Earth Orbit

The determination of orbital window characteristics is of major importance in the analysis of human interplanetary missions and systems. The orbital launch window characteristics are directly involved in the selection of mission trajectories, the development of orbit operational concepts, and the design of orbital launch systems. The orbital launch window problem arises because of the dynamic nature of the relative geometry between outgoing (departure) asymptote of the hyperbolic escape trajectory and the earth parking orbit. The orientation of the escape hyperbola asymptotic relative to the earth is a function of time. The required hyperbola energy level also varies with time. In addition, the inertial orientation of the parking orbit is a function of time because of the perturbations caused by the Earth's oblateness. Thus, a coplanar injection onto the escape hyperbola can be made only at a point in time when the outgoing escape asymptote is contained by the plane of parking orbit. Even though this condition may be planned as a nominal situation, it will not generally represent the more probable injection geometry. The general case of an escape injection maneuver performed at a time other than the coplanar time will involve both a path angle and plane change and, therefore, a delta V penalty. Usually, because of the delta V penalty the actual departure injection window is smaller in duration than that determined by energy requirement alone. This report contains the formulation, characteristics, and test cases for five different launch window modes for Earth orbit. These modes are: 1) One impulsive maneuver from a Highly Elliptical Orbit (HEO); 2) Two impulsive maneuvers from a Highly Elliptical Orbit (HEO); 3) One impulsive maneuver from a Low Earth Orbit (LEO); 4) Two impulsive maneuvers form LEO; and 5) Three impulsive maneuvers form LEO. The formulation of these five different launch window modes provides a rapid means of generating realistic parametric data for space exploration studies. Also the formulation provides vector and geometrical data sufficient for use as a good starting point in detail trajectory analysis based on calculus of variations, steepest descent, or parameter optimization program techniques.

Young, Archie↗
NASA NTRS2001

Human Exploration Missions Study Launch Window from Earth Orbit

The determination of orbital launch window characteristics is of major importance in the analysis of human interplanetary missions and systems. The orbital launch window characteristics are directly involved in the selection of mission trajectories, the development of orbit operational concepts, and the design of orbital launch systems. The orbital launch window problem arises because of the dynamic nature of the relative geometry between outgoing (departure) asymptote of the hyperbolic escape trajectory and the earth parking orbit. The orientation of the escape hyperbola asymptotic relative to earth is a function of time. The required hyperbola energy level also varies with time. In addition, the inertial orientation of the parking orbit is a function of time because of the perturbations caused by the Earth's oblateness. Thus, a coplanar injection onto the escape hyperbola can be made only at a point in time when the outgoing escape asymptote is contained by the plane of parking orbit. Even though this condition may be planned as a nominal situation, it will not generally represent the more probable injection geometry. The general case of an escape injection maneuver performed at a time other than the coplanar time will involve both a path angle and plane change and, therefore, a Delta(V) penalty. Usually, because of the Delta(V) penalty the actual departure injection window is smaller in duration than that determined by energy requirement alone. This report contains the formulation, characteristics, and test cases for five different launch window modes for Earth orbit. These modes are: (1) One impulsive maneuver from a Low Earth Orbit (LEO), (2) Two impulsive maneuvers from LEO, (3) Three impulsive maneuvers from LEO, (4) One impulsive maneuvers from a Highly Elliptical Orbit (HEO), (5) Two impulsive maneuvers from a Highly Elliptical Orbit (HEO) The formulation of these five different launch window modes provides a rapid means of generating realistic parametric data for space exploration studies. Also the formulation provides vector and geometrical data sufficient for use as a good starting point in detail trajectory analysis based on calculus of variations, steepest descent, or parameter optimization program techniques.

Young, Archie↗
NASA NTRS1978

Heliocentric interplanetary low thrust trajectory optimization program, supplement 1, part 2

The improvements made to the HILTOP electric propulsion trajectory computer program are described. A more realistic propulsion system model was implemented in which various thrust subsystem efficiencies and specific impulse are modeled as variable functions of power available to the propulsion system. The number of operating thrusters are staged, and the beam voltage is selected from a set of five (or less) constant voltages, based upon the application of variational calculus. The constant beam voltages may be optimized individually or collectively. The propulsion system logic is activated by a single program input key in such a manner as to preserve the HILTOP logic. An analysis describing these features, a complete description of program input quantities, and sample cases of computer output illustrating the program capabilities are presented.

Mann, F. I.↗
NASA NTRS1974

A study of unmanned mission opportunities to comets and asteroids

Several unmanned multiple-target mission opportunities to comets and asteroids were studied. The targets investigated include Grigg-Skjellerup, Giacobini-Zinner, Tuttle-Giacobini-Kresak, Borrelly, Halley, Schaumasse, Geographos, Eros, Icarus, and Toro, and the trajectories consist of purely ballistic flight, except that powered swingbys and deep space burns are employed when necessary. Optimum solar electric rendezvous trajectories to the comets Giacobini-Zinner/85, Borrelly/87, and Temple (2)/83 and /88 employing the 8.67 kw Sert III spacecraft modified for interplanetary flight were also investigated. The problem of optimizing electric propulsion heliocentric trajectories, including the effects of geocentric launch asymptote declination on launch vehicle performance capability, was formulated, and a solution developed using variational calculus techniques. Improvements were made to the HILTOP trajectory optimization computer program. An error analysis of high-thrust maneuvers involving spin-stabilized spacecraft was developed and applied to a synchronous meteorological satellite mission.

Mann, F. I.↗
NASA NTRS1974

Optimum propellant usage for reaction jet systems of space vehicles

The on-off type control for reaction jet systems is proven to be the optimal fuel scheme. However, due to the nonlinear characteristics of this type control, no direct method of solution is known for this optimal process being applied to the attitude control of space vehicles. This paper will discuss the optimization of fuel usage for an attitude control of space vehicles. A computation technique is developed for the calculation of optimal control law. The method of calculus of variations is applied to the estimation of the changes of performance index as well as terminal constraints. Thus an algorithm is obtained by the steepest descent method. A numerical example is given in the paper.

Liu, T. C.↗
NASA NTRS1972

Dual characterizations of optimal systems.

The complementary variational principle developed in a Hilbert space setting provides a duality principle in the calculus of variations with dynamic constraints. This concept is adopted in this paper to investigate dual characterizations of optimal control systems. Systems under consideration include those with dynamics governed by linear ordinary differential equations, linear partial differential equations and non-linear ordinary differential equations.

Chan, W. L.↗
NASA NTRS1968

Optimal control and stability

Relation between optimal control problem and Liapunov functions, and calculus of variations and maximum principle methods of solving synthesis problems

Letov, A. M.↗
NASA NTRS1973

Optimization of multiple target electric propulsion trajectories.

Development of the mathematical basis for the generation of multiple target low-thrust trajectories. The unique trajectory shaping capabilities of electric propulsion make it ideally suited for modifying the path of the spacecraft to effect close encounters of selected asteroids with only slight penalties in performance. Each intermediate encounter with an asteroid involves the optimization of four parameters, the encounter time and the three components of the relative velocity at encounter. A second type of mission amenable to this analysis is that of asteroid or comet sample return missions. For missions of this type, both launch date and division of departure and return flight times are capable of being optimized. Use is made of the traditional calculus of variations to derive the necessary conditions that must be satisfied for both types of missions. In addition, examples are presented of both a Comet Encke rendezvous mission with multiple encounters of the asteroids Aschera and Alekto and also a sample return mission from the asteroid Flora.

Sauer, C. G., Jr.↗
NASA NTRS1993

Robust neighboring extremal guidance for the advanced launch system

With the availability of modern flight computers, realtime neighboring extremal guidance seems feasible. To overcome sensitivity to unknown system parameters and environmental uncertainties, a robust neighboring extremal guidance scheme is proposed. About the optimal trajectory, the accessory problem in the calculus of variations is formed, generating a quadratic cost criterion in the perturbed states and controls. By formulating a disturbance attenuation problem based upon the second variation cost criterion, a differential game is formulated. The game theoretic cost criterion is minimized with respect to the perturbed control but maximized with respect to the unknown parameters in the linearized dynamics. The resulting differential game problem gives rise to a two-point boundary-value problem solved using the sweep method. The sweep method solution provides a linear robust neighboring extremal guidance scheme that is applied to the Advanced Launch System.

Bain, John↗
NASA NTRS1981

Optimal trajectories in atmospheric flight

Aspects of optimization theory and switching theory are discussed, taking into account the necessary conditions for extrema, a solution subject to constraints, the calculus of variations, the Pontryagin maximum principle, the canonical transformation, Contensou's domain of maneuverability, optimal switching, a junction with singular arc, and linearized singular control. Equations of motion are considered along with aerodynamic and propulsive forces, the general properties of optimal trajectories, flight in a horizontal plane, optimal coasting flight, supersonic cruise, the supersonic turn, supersonic maneuvers in a vertical plane, energy state approximation, a modified Chapman's formulation for optimal reentry trajectories, optimal planar reentry trajectories, and an optimal glide of reentry vehicles. Orbital aerodynamic maneuvers are examined, giving attention to aerodynamic capture, a change in the apogee, a change in the eccentricity, a change in the perigee, an orbital maneuver, an aerodynamic maneuver, and a combined maneuver.

Vinh, N. X.↗
NASA NTRS2002

Trajectories for High Specific Impulse High Specific Power Deep Space Exploration

Flight times and deliverable masses for electric and fusion propulsion systems are difficult to approximate. Numerical integration is required for these continuous thrust systems. Many scientists are not equipped with the tools and expertise to conduct interplanetary and interstellar trajectory analysis for their concepts. Several charts plotting the results of well-known trajectory simulation codes were developed and are contained in this paper. These charts illustrate the dependence of time of flight and payload ratio on jet power, initial mass, specific impulse and specific power. These charts are intended to be a tool by which people in the propulsion community can explore the possibilities of their propulsion system concepts. Trajectories were simulated using the tools VARITOP and IPOST. VARITOP is a well known trajectory optimization code that involves numerical integration based on calculus of variations. IPOST has several methods of trajectory simulation; the one used in this paper is Cowell's method for full integration of the equations of motion. An analytical method derived in the companion paper was also evaluated. The accuracy of this method is discussed in the paper.

Polsgrove, Tara↗
NASA NTRS2002

Simulation of Trajectories for High Specific Impulse Deep Space Exploration

Difficulties in approximating flight times and deliverable masses for continuous thrust propulsion systems have complicated comparison and evaluation of proposed propulsion concepts. These continuous thrust propulsion systems are of interest to many groups, not the least of which are the electric propulsion and fusion communities. Several charts plotting the results of well-known trajectory simulation codes were developed and are contained in this paper. These charts illustrate the dependence of time of flight and payload ratio on jet power, initial mass, specific impulse and specific power. These charts are intended to be a tool by which people in the propulsion community can explore the possibilities of their propulsion system concepts. Trajectories were simulated using the tools VARITOP and IPOST. VARITOP is a well known trajectory optimization code that involves numerical integration based on calculus of variations. IPOST has several methods of trajectory simulation; the one used in this paper is Cowell's method for full integration of the equations of motion. The analytical method derived in the companion paper was also used to simulate the trajectory. The accuracy of this method is discussed in the paper.

Polsgrove, Tara↗
NASA NTRS1962

Interplanetary Trajectory Optimization with Powerlimited Propulsion Systems

A trajectory-optimization process is described in which the optimum­ thrust equations are derived using the calculus of variations. The mag­nitude of the thrust is constrained within an upper and a lower bound, but the thrust direction is arbitrary. This formulation allows both the constant-thrust program and the variable-thrust program to be con­sidered. For the constant-thrust program, certain propulsion-system parameters are optimized for maximum final vehicle mass. This theory has been used to study interplanetary missions to Venus and Mars using a power-limited propulsion system. Both one-way and round­ trip rendezvous trajectories are considered. The analysis employs a two-body inverse-square force-field model of three dimensions. An iterative routine used to solve the two-point boundary-value problem is described in the Appendix.

TRAJECTORY↗
NASA NTRS1973

An historical survey of computational methods in optimal control.

Review of some of the salient theoretical developments in the specific area of optimal control algorithms. The first algorithms for optimal control were aimed at unconstrained problems and were derived by using first- and second-variation methods of the calculus of variations. These methods have subsequently been recognized as gradient, Newton-Raphson, or Gauss-Newton methods in function space. A much more recent addition to the arsenal of unconstrained optimal control algorithms are several variations of conjugate-gradient methods. At first, constrained optimal control problems could only be solved by exterior penalty function methods. Later algorithms specifically designed for constrained problems have appeared. Among these are methods for solving the unconstrained linear quadratic regulator problem, as well as certain constrained minimum-time and minimum-energy problems. Differential-dynamic programming was developed from dynamic programming considerations. The conditional-gradient method, the gradient-projection method, and a couple of feasible directions methods were obtained as extensions or adaptations of related algorithms for finite-dimensional problems. Finally, the so-called epsilon-methods combine the Ritz method with penalty function techniques.

Polak, E.↗
NASA NTRS1988

A variational dynamic programming approach to robot-path planning with a distance-safety criterion

An approach to robot-path planning is developed by considering both the traveling distance and the safety of the robot. A computationally-efficient algorithm is developed to find a near-optimal path with a weighted distance-safety criterion by using a variational calculus and dynamic programming (VCDP) method. The algorithm is readily applicable to any factory environment by representing the free workspace as channels. A method for deriving these channels is also proposed. Although it is developed mainly for two-dimensional problems, this method can be easily extended to a class of three-dimensional problems. Numerical examples are presented to demonstrate the utility and power of this method.

Suh, Suk-Hwan↗