Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Minimax problem”

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 19 records

An application of a linear programing technique to nonlinear minimax problems

A differential correction technique for solving nonlinear minimax problems is presented. The basis of the technique is a linear programing algorithm which solves the linear minimax problem. By linearizing the original nonlinear equations about a nominal solution, both nonlinear approximation and estimation problems using the minimax norm may be solved iteratively. Some consideration is also given to improving convergence and to the treatment of problems with more than one measured quantity. A sample problem is treated with this technique and with the least-squares differential correction method to illustrate the properties of the minimax solution. The results indicate that for the sample approximation problem, the minimax technique provides better estimates than the least-squares method if a sufficient amount of data is used. For the sample estimation problem, the minimax estimates are better if the mathematical model is incomplete.

Schiess, J. R.↗

Chebyshev minimax problems for skip trajectories

The dimensionless equations of motion for hypersonic flight in the upper layer of the atmosphere are presented. The necessary conditions for the Chebyshev minimax problems are provided. Some important properties concerning the peak heating rate, the peak dynamic pressure and the peak altitude drop for a skip trajectory are discussed. As application of the theory, the problem of minimizing the peak altitude drop is solved. The numerical results support the theory that the nearly-grazing trajectory is useful in reducing the peak heating rate and the peak dynamic pressure.

Vinh, N. X.↗

Optimization and guidance of abort landing trajectories in a windshear

The abort landing problem for flight trajectories in the presence of windshear is considered with reference to flight in a vertical plane. The optimal trajectory (OT) problem is a minimax problem or Chebyshev problem of optimal control which can be converted into a Bolza problem through suitable transformations. Numerical results for several combinations of windshear intensities and initial altitudes are presented. A guidance trajectory (GT) law is implemented in feedback control form, subject to prescribed bounds on the angle of attack and its time derivative. Simplified guidance trajectories (SGT) are then considered, leading to a safe target altitude guidance. Conclusions derived for strong-to-severe windshear conditions include GT and SGT preserving the basic properties of OT, and the peak altitude drop of GT and SGT being less than that of the constant pitch trajectory and the maximum angle-of-attack trajectory.

Miele, A.↗

Design of bearings for rotor systems based on stability

Design of rotor systems incorporating stable behavior is of great importance to manufacturers of high speed centrifugal machinery since destabilizing mechanisms (from bearings, seals, aerodynamic cross coupling, noncolocation effects from magnetic bearings, etc.) increase with machine efficiency and power density. A new method of designing bearing parameters (stiffness and damping coefficients or coefficients of the controller transfer function) is proposed, based on a numerical search in the parameter space. The feedback control law is based on a decentralized low order controller structure, and the various design requirements are specified as constraints in the specification and parameter spaces. An algorithm is proposed for solving the problem as a sequence of constrained 'minimax' problems, with more and more eigenvalues into an acceptable region in the complex plane. The algorithm uses the method of feasible directions to solve the nonlinear constrained minimization problem at each stage. This methodology emphasizes the designer's interaction with the algorithm to generate acceptable designs by relaxing various constraints and changing initial guesses interactively. A design oriented user interface is proposed to facilitate the interaction.

Dhar, D.↗

Optimal take-off trajectories in the presence of windshear

The present consideration of takeoff trajectory optimization in eight different fundamental problems involving wind shears assumes that the power setting is held at the maximum value, and that the aircraft is controlled with respect to angle-of-attack. While the first three problems are least-squares ones of the Bolza type, the remaining five are minimax problems of the Chebyshev type which can be converted to Bolza type by means of suitable transformations. All problems are solved on the basis of the dual sequential gradient-restoration algorithm for optimal control problems. The trajectory solutions obtained are superior to constant angle-of-attack trajectories.

Miele, A.↗

Optimal trajectories for aeroassisted orbital transfer

Consideration is given to classical and minimax problems involved in aeroassisted transfer from high earth orbit (HEO) to low earth orbit (LEO). The transfer is restricted to coplanar operation, with trajectory control effected by means of lift modulation. The performance of the maneuver is indexed to the energy expenditure or, alternatively, the time integral of the heating rate. Firist-order optimality conditions are defined for the classical approach, as are a sequential gradient-restoration algorithm and a combined gradient-restoration algorithm. Minimization techniques are presented for the aeroassisted transfer energy consumption and time-delay integral of the heating rate, as well as minimization of the pressure. It is shown that the eigenvalues of the Jacobian matrix of the differential system is both stiff and unstable, implying that the sequential gradient restoration algorithm in its present version is unsuitable. A new method, involving a multipoint approach to the two-poing boundary value problem, is recommended.

Miele, A.↗

Optimal trajectories for aeroassisted, noncoplanar orbital transfer. II - LEO-to-LEO transfer

Both classical and minimax problems of optimal control arising in the study of noncoplanar, aeroassisted orbital transfer are considered and are illustrated with the example of LEO-to-LEO transfer. Trajectory control is achieved by modulation of the lift coefficient and the angle of bank. Problems considered include the minimization of the energy required for orbital transfer, maximization of the flight time during the atmospheric portion of the trajectory, and minimization of the peak heating rate. The near-grazing solution is found to be a good compromise between energy and heating requirements.

Miele, A.↗

Minimax optimal control for atmospheric fly-through trajectories

Necessary conditions for minimax problems with isolated or flat maxima are presented. Some relevant properties concerning the peak heating rate and the peak deceleration during atmospheric entry are discussed. As application of the theory, the problem of minimizing the peak heating rate of a skip trajectory is solved with special emphasis on the discussion of the continuity of the lift control at the point where the maximum occurs along the trajectory.

Lu, P.↗

Approximate solutions to minimax optimal control problems for aeroassisted orbital transfer

The maneuver considered in the present investigation involves the coplanar transfer of a spacecraft from a high earth orbit (HEO) to a low earth orbit (LEO). HEO can be a geosynchronous earth orbit (GEO). The basic concept utilized involves the hybrid combination of propulsive maneuvers in space and aerodynamic maneuvers in the sensible atmosphere. The considered type of flight is also called synergetic space flight. With respect to the atmospheric part of the maneuver, trajectory control is achieved by means of lift modulation. The Bolza problem of optimal control is stated, and the first-order optimality conditions for this problem are given. The one-arc approach, the two-arc approach, and the three-subarc approach are discussed. Attention is given to the Chebyshev problem of optimal control, details concerning aeroassisted orbital transfer (AOT), AOT optimization problems, and numerical experiments.

Miele, A.↗

Transformation techniques for minimax optimal control problems and their application to optimal flight trajectories in a windshear - Optimal abort landing trajectories

The optimal-control problem of abort-landing trajectories in the presence of low-altitude wind shear is investigated analytically. The vertical-plane Newtonian motion of a point-mass aircraft in a steady wind field is modeled, and a sequential gradient-restoration algorithm is applied. Numerical results showing the effects of wind-shear intensity, initial altitude, and power-setting rate are presented in extensive graphs and discussed in detail. Optimal trajectories for strong or severe wind shears are found to begin with a descent, followed by level flight and then an ascent after leaving the shear region.

Miele, A.↗

Necessary conditions for maximax problems with application to aeroglide of hypervelocity vehicles

This paper presents the necessary conditions for solving Chebyshev minimax (or maximax) problems with bounded control. The jump conditions obtained are applicable to problems with single or multiple maxima. By using Contensou domain of maneuverability, it is shown that when the maxima are isolated single points the control is generally continuous at the jump point in the minimax problems and discontinuous in the maximax problems in which the first time derivative of the maximax function contains the control variable. The theory is applied to the problem of maximizing the flight radius in a closed circuit glide of a hypervelocity vehicle and to a maximax optimal control problem in which the control appears explicitly with the first time derivative of the maximax function.

Vinh, N. X.↗

Optimal abort landing trajectories in the presence of windshear

The abort landing problem is considered with reference to flight in a vertical plane. It is assumed that, upon sensing that the aircraft is in a windshear, the pilot increases the power setting at a constant time rate until maximum power setting is reached; afterward, the power setting is held constant. The performance index being minimized is the peak value of the altitude drop; the resulting optimization problem is a minimax or Chebyshev problem of optimal control. It is found that, for strong-to-severe windshears, the optimal trajectory includes three branches: a descending flight branch followed by a nearly horizontal flight branch, followed by an ascending flight branch after the aircraft has passed through the shear region. The peak altitude drop depends on the windshear intensity, the initial altitude, and the power setting rate; it increases as the windshear intensity increases and the initial altitude increases, and it decreases as the power setting rate increases.

Miele, A.↗

Sufficiently informative functions and the minimax feedback control of uncertain dynamic systems.

The problem of optimal feedback control of uncertain discrete-time dynamic systems is considered where the uncertain quantities do not have a stochastic description but instead are known to belong to given sets. The problem is converted to a sequential minimax problem and dynamic programming is suggested as a general method for its solution. The notion of a sufficiently informative function, which parallels the notion of a sufficient statistic of stochastic optimal control, is introduced, and conditions under which the optimal controller decomposes into an estimator and an actuator are identified.

Bertsekas, D. P.↗

On the minimax feedback control of uncertain dynamic systems.

In this paper the problem of optimal feedback control of uncertain discrete-time dynamic systems is considered where the uncertain quantities do not have a stochastic description but instead are known to belong to given sets. The problem is converted to a sequential minimax problem and dynamic programming is suggested as a general method for its solution. The notion of a sufficiently informative function, which parallels the notion of a sufficient statistic of stochastic optimal control, is introduced, and conditions under which the optimal controller decomposes into an estimator and an actuator are identified.

Bertsekas, D. P.↗