Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimization problems”

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 865 records · Page 48

Shifting the closed-loop spectrum in the optimal linear quadratic regulator problem for hereditary systems

In the optimal linear quadratic regulator problem for finite dimensional systems, the method known as an alpha-shift can be used to produce a closed-loop system whose spectrum lies to the left of some specified vertical line; that is, a closed-loop system with a prescribed degree of stability. This paper treats the extension of the alpha-shift to hereditary systems. As infinite dimensions, the shift can be accomplished by adding alpha times the identity to the open-loop semigroup generator and then solving an optimal regulator problem. However, this approach does not work with a new approximation scheme for hereditary control problems recently developed by Kappel and Salamon. Since this scheme is among the best to date for the numerical solution of the linear regulator problem for hereditary systems, an alternative method for shifting the closed-loop spectrum is needed. An alpha-shift technique that can be used with the Kappel-Salamon approximation scheme is developed. Both the continuous-time and discrete-time problems are considered. A numerical example which demonstrates the feasibility of the method is included.

Gibson, J. S.↗

Search-based optimization

The problem of determining the minimum cost hypothetical ancestral sequences for a given cladogram is known to be NP-complete (Wang and Jiang, 1994). Traditionally, point estimations of hypothetical ancestral sequences have been used to gain heuristic, upper bounds on cladogram cost. These include procedures with such diverse approaches as non-additive optimization of multiple sequence alignment, direct optimization (Wheeler, 1996), and fixed-state character optimization (Wheeler, 1999). A method is proposed here which, by extending fixed-state character optimization, replaces the estimation process with a search. This form of optimization examines a diversity of potential state solutions for cost-efficient hypothetical ancestral sequences and can result in greatly more parsimonious cladograms. Additionally, such an approach can be applied to other NP-complete phylogenetic optimization problems such as genomic break-point analysis. c2003 The Willi Hennig Society. Published by Elsevier Science (USA). All rights reserved.

Non-NASA Center↗

Trajectory optimization and guidance for a hypersonic vehicle

The optimal ascent problem for a hypersonic vehicle is formulated as an inverse dynamic problem. This formulation is essential in solving the trajectory optimization problem via the nonlinear programming approach. Both minimum-fuel and minimax type of performance indices are considered. The results reveal important features of the optimal trajectory and controls, and they are subsequently used to construct a nonlinear feedback midcourse control law. This control law not only greatly simplifies the difficult constrained optimization problem and yields improved solutions, but is also suitable for onboard implementation. Finally, off-nominal trajectory guidance is addressed using combination of feedback compensation and onboard generation of control through the inverse dynamics approach.

Lu, Ping↗

Discrete-time entropy formulation of optimal and adaptive control problems

The discrete-time version of the entropy formulation of optimal control of problems developed by G. N. Saridis (1988) is discussed. Given a dynamical system, the uncertainty in the selection of the control is characterized by the probability distribution (density) function which maximizes the total entropy. The equivalence between the optimal control problem and the optimal entropy problem is established, and the total entropy is decomposed into a term associated with the certainty equivalent control law, the entropy of estimation, and the so-called equivocation of the active transmission of information from the controller to the estimator. This provides a useful framework for studying the certainty equivalent and adaptive control laws.

Tsai, Yweting A.↗

A Multilevel Approach For SolvingLarge-Scale QUBO Problems With Noisy Hybrid Quantum Approximate Optimization

Quantum approximate optimization is one ofthe promising candidates for useful quantum computation,particularly in the context of finding approximate solutionsto Quadratic Unconstrained Binary Optimization (QUBO)problems. However, the existing quantum processing units(QPUs) are of relatively small size, and canonical mappingsof QUBO via the Ising model require one qubit per vari-able, rendering direct large-scale optimization infeasible.In classical optimization, a general strategy for addressingmany large-scale problems is via multilevel/multigrid meth-ods, where the large target problem is iteratively coarsenedand the global solution is constructed from multiple small-scale optimization runs. In this work, we experimentallytest how existing QPUs perform when used as a sub-solverwithin such a multilevel strategy. To this aim, we com-bine and extend (via additional classical processing steps)the recently proposed Noise-Directed Adaptive Remapping(NDAR) and Quantum Relax&Round (QRR) algorithms.We first demonstrate the effectiveness of our heuristicextensions on Rigetti’s superconducting transmon deviceAnkaa-2. We find approximate solutions to10instances offully connected82-qubit Sherrington-Kirkpatrick graphswith random integer-valued coefficients obtaining normal-ized approximation ratios (ARs) in the range∼0.98−1.0,and the same class with real-valued coefficients (ARs∼0.94−1.0). Then, we implement the extended NDAR andQRR algorithms as subsolvers in the multilevel algorithmfor6large-scale graphs with at most∼27,000variables.In practice, the QPU (with classical post-processing steps)is used to find approximate solutions to dozens of at most82-qubit problems, which are iteratively used to constructthe global solution. We observe that quantum optimizationresults are competitive in terms of the quality of solutionswhen compared to classical heuristics used as subsolverswithin the multilevel approach.Reproducibility: source code and data are available at[TBA upon acceptance]

quantum computing↗

Dynamic Reconstruction and Multivariable Control for Force-Actuated, Thin Facesheet Adaptive Optics

The Multiple Mirror Telescope (MMT) under development at the University of Arizona takes a new approach in adaptive optics placing a large (0.65 m) force-actuated, thin facesheet deformable mirror at the secondary of an astronomical telescope, thus reducing the effects of emissivity which are important in IR astronomy. However, The large size of the mirror and low stiffness actuators used drive the natural frequencies of the mirror down into the bandwidth of the atmospheric distortion. Conventional adaptive optics takes a quasi-static approach to controlling the, deformable mirror. However, flexibility within the control bandwidth calls for a new approach to adaptive optics. Dynamic influence functions are used to characterize the influence of each actuator on the surface of the deformable mirror. A linearized model of atmospheric distortion is combined with dynamic influence functions to produce a dynamic reconstructor. This dynamic reconstructor is recognized as an optimal control problem. Solving the optimal control problem for a system with hundreds of actuators and sensors is formidable. Exploiting the circularly symmetric geometry of the mirror, and a suitable model of atmospheric distortion, the control problem is divided into a number of smaller decoupled control problems using circulant matrix theory. A hierarchic control scheme which seeks to emulate the quasi-static control approach that is generally used in adaptive optics is compared to the proposed dynamic reconstruction technique. Although dynamic reconstruction requires somewhat more computational power to implement, it achieves better performance with less power usage, and is less sensitive than the hierarchic technique.

Grocott, Simon C. O.↗

Spline approximations for nonlinear hereditary control systems

A sline-based approximation scheme is discussed for optimal control problems governed by nonlinear nonautonomous delay differential equations. The approximating framework reduces the original control problem to a sequence of optimization problems governed by ordinary differential equations. Convergence proofs, which appeal directly to dissipative-type estimates for the underlying nonlinear operator, are given and numerical findings are summarized.

Daniel, P. L.↗

Algorithms for Maneuvering Spacecraft Around Small Bodies

A document describes mathematical derivations and applications of autonomous guidance algorithms for maneuvering spacecraft in the vicinities of small astronomical bodies like comets or asteroids. These algorithms compute fuel- or energy-optimal trajectories for typical maneuvers by solving the associated optimal-control problems with relevant control and state constraints. In the derivations, these problems are converted from their original continuous (infinite-dimensional) forms to finite-dimensional forms through (1) discretization of the time axis and (2) spectral discretization of control inputs via a finite number of Chebyshev basis functions. In these doubly discretized problems, the Chebyshev coefficients are the variables. These problems are, variously, either convex programming problems or programming problems that can be convexified. The resulting discrete problems are convex parameter-optimization problems; this is desirable because one can take advantage of very efficient and robust algorithms that have been developed previously and are well established for solving such problems. These algorithms are fast, do not require initial guesses, and always converge to global optima. Following the derivations, the algorithms are demonstrated by applying them to numerical examples of flyby, descent-to-hover, and ascent-from-hover maneuvers.

Acikmese, A. Bechet↗

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

Optimal three finger grasps

Consideration is given to the problem of optimal force distribution among three point fingers holding a planar object. A scheme that reduces the nonlinear optimization problem to an easily solved generalized eigenvalue problem is proposed. This scheme generalizes and simplifies results of Ji and Roth (1988). The generalizations include all possible geometric arrangements and extensions to three dimensions and to the case of variable coefficients of friction. For the two-dimensional case with constant coefficients of friction, it is proved that, except for some special cases, the optimal grasping forces (in the sense of minimizing the dependence on friction) are those for which the angles with the corresponding normals are all equal (in absolute value).

Demmel, J.↗

A linear stochastic model of the human operator

A linear stochastic model of the human operator is developed and applied to the problem of piloted control of an aircraft. The pilot and aircraft are modeled as linear time-invariant systems containing both process and measurement noise. The loop closure by the pilot is determined by formulating the problem as an optimal stochastic control problem. The solution to the optimal control problem yields not only the pilot's optimal control output which he uses to control the vehicle, but also the optimal combination of his observations of the vehicle states upon which the pilot bases his control. A method is presented so that, using experimental pilot vehicle data, the cost functional which is minimized in the optimal control problem will be numerically equal to the pilot rating that the pilot would associate with the given vehicle and task.

Durrett, J. C.↗

Structural optimization of rotor blades with integrated dynamics and aerodynamics

The problem of structural optimization of helicopter rotor blades with integrated dynamic and aerodynamic design considerations is addressed. Results of recent optimization work on rotor blades for minimum weight with constraints on multiple coupled natural flap-lag frequencies, blade autorotational inertia and centrifugal stress has been reviewed. A strategy has been defined for the ongoing activities in the integrated dynamic/aerodynamic optimization of rotor blades. As a first step, the integrated dynamic/airload optimization problem has been formulated. To calculate system sensitivity derivatives necessary for the optimization recently developed, Global Sensitivity Equations (GSE) are being investigated. A need for multiple objective functions for the integrated optimization problem has been demonstrated and various techniques for solving the multiple objective function optimization are being investigated. The method called the Global Criteria Approach has been applied to a test problem with the blade in vacuum and the blade weight and the centrifugal stress as the multiple objectives. The results indicate that the method is quite effective in solving optimization problems with conflicting objective functions.

Chattopadhyay, Aditi↗

Structural optimization of rotor blades with integrated dynamics and aerodynamics

The problem of structural optimization of helicopter rotor blades with integrated dynamic and aerodynamic design considerations is addressed. Results of recent optimization work on rotor blades for minimum weight with constraints on multiple coupled natural flap-lag frequencies, blade autorotational inertia and centrifugal stress has been reviewed. A strategy has been defined for the ongoing activities in the integrated dynamic/aerodynamic optimization of rotor blades. As a first step, the integrated dynamic/airload optimization problem has been formulated. To calculate system sensitivity derivatives necessary for the optimization recently developed, Global Sensitivity Equations (GSE) are being investigated. A need for multiple objective functions for the integrated optimization problem has been demonstrated and various techniques for solving the multiple objective function optimization are being investigated. The method called the Global Criteria Approach has been applied to a test problem with the blade in vacuum and the blade weight and the centrifugal stress as the multiple objectives. The results indicate that the method is quite effective in solving optimization problems with conflicting objective functions.

Chattopadhyay, Aditi↗

A Convex Guidance Algorithm for Formation Reconfiguration

In this paper, a reconfiguration guidance algorithm for formation flying spacecraft is presented. The formation reconfiguration guidance problem is first formulated as a continuous-time minimum-fuel or minimum-energy optimal control problem with collision avoidance and control constraints. The optimal control problem is then discretized to obtain a finite dimensional parameter optimization problem. In this formulation, the collision avoidance constraints are imposed via separating planes between each pair of spacecraft. A heuristic is introduced to choose these separating planes that leads to the convexification of the collision avoidance constraints. Additionally, convex constraints are imposed to guarantee that no collisions occur between discrete time samples. The resulting finite dimensional optimization problem is a second order cone program, for which standard algorithms can compute the global optimum with deterministic convergence and a prescribed level of accuracy. Consequently, the formation reconfiguration algorithm can be implemented onboard a spacecraft for real-time operations.

formation reconfiguration↗

Computational alternatives to obtain time optimal jet engine control

Two computational methods to determine an open loop time optimal control sequence for a simple single spool turbojet engine are described by a set of nonlinear differential equations. Both methods are modifications of widely accepted algorithms which can solve fixed time unconstrained optimal control problems with a free right end. Constrained problems to be considered have fixed right ends and free time. Dynamic programming is defined on a standard problem and it yields a successive approximation solution to the time optimal problem of interest. A feedback control law is obtained and it is then used to determine the corresponding open loop control sequence. The Fletcher-Reeves conjugate gradient method has been selected for adaptation to solve a nonlinear optimal control problem with state variable and control constraints.

Basso, R. J.↗