Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “cost function”

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 253 records · Page 14

Approximate Feedback Control for a System With Memory

Report presents algorithm for calculating feedback gain for control of hereditary dynamical systems with control delay. Problem is to approximate optimal feedback gain that minimizes cost function of state and control. Theory applicable to design of controllers for mechanical systems subject to thermal deformation, electrical systems with delay, electrical systems with plasma components, and other systems that exhibit memory.

Milman, Mark H.↗

Minimum time attitude slewing maneuvers of a rigid spacecraft

The problems of large-angle attitude maneuvers of a spacecraft have gained much consideration in recent years. The configurations of the spacecraft considered are: completely rigid, a combination of rigid and flexible parts, or gyrostat-type systems. The performance indices usually include minimum torque integration, power criterion, and frequency-shaped cost functionals. The minimum time slewing problem of a rigid spacecraft was examined. Optimal control theory (Maximum Principal) was applied to the slewing motion of a general rigid spacecraft. Control torque about all three axes was computed. The equations for the system are composed of the Euler dynamical equations in the spacecraft body axes and the quaternion kinematical equation. By introducing the costates for the quaternion and the angular velocity, the Hamiltonian of the system can be formed and the optimal control obtained. Finally the methods are applied to the SCOLE slewing motion. The control variables include three control moments on the Shuttle and two control forces on the reflector. Numerical results are discussed.

Li, Feiyue↗

A parallel algorithm for channel routing on a hypercube

A new parallel simulated annealing algorithm for channel routing on a P processor hypercube is presented. The basic idea used is to partition a set of tracks equally among processors in the hypercube. In parallel, P/2 pairs of processors perform displacements and exchanges of nets between tracks, compute the changes in cost functions, and accept moves using a parallel annealing criteria. Through the use of a unique distributed data structure, it is possible to minimize message traffic and add versatility and efficiency in a parallel routing tool. The algorithm has been implemented and is being tested on some of the popular channel problems from the literature.

Brouwer, Randall↗

Frequency-shaped large-angle maneuvers

The paper considers the problem of maneuvering a flexible spacecraft through large angles in finite time. The basic control problem is divided into two parts. The first part consists of generating a frequency-shaped open-loop solution for the nonlinear rigid body as the nominal solution. The resulting two-point boundary-value problem is solved by introducing a continuation method for altering the mass distribution and boundary conditions for the spacecraft. For the second part, a feedback control is designed by linearizing the flexible body response about several points along the rigid body nominal solution. The perturbation gains are designed by using a frequency-shaped cost functional approach. The gains are linearly interpolated to produce smooth control time-histories as the linear piecewise constant plant models change during the maneuver.

Chun, Hon M.↗

Algorithm For The Discrete-O timal-Output-Feedback Problem

Change in cost function due to change in feedback gain calculated. Algorithm for feedback control systems considers stochastic, infinite-time, discrete-output-feedback problem for time-invariant linear systems. Optimal-output-feedback problem formulates modern control-law-design problem in which only selected number of plant-state variables used.

Halyo, Nesim↗

A new method of boundary parameter estimation for a two-dimensional diffusion system under noisy observations

The purpose of this paper is to establish a method for identifying unknown parameters involved in the boundary state of a class of diffusion systems under noisy observations. A mathematical model of the system dynamics is given by a two-dimensional diffusion equation. Noisy observations are made by sensors allocated on the system boundary. Starting with the mathematical model mentioned above, an online parameter estimation algorithm is proposed within the framework of the maximum likelihood estimation. Existence of the optimal solution and related necessary conditions are discussed. By solving a local variation of the cost functional with respect to the perturbation of parameters, the estimation mechanism is proposed in a form of recursive computations. Finally, the feasibility of the estimator proposed here is demonstrated through results of digital simulation experiments.

Sunahara, Y.↗

Iterative-deepening heuristic search for optimal and semi-optimal resource allocation

It is demonstrated that when iterative-deepening A asterisk (IDA asterisk) is applied to one type of resource allocation problem, it uses far less storage than A asterisk, but opens far more nodes and thus has unacceptable time complexity. This is shown to be due, at least in part, to the low-valued effective branching factor that is a characteristic of problems with real-valued cost functions. The semi-optimal, epsilon-admissible IDA asterisk sub epsilon search algorithm that the authors described was shown to open fewer nodes than both A asterisk and IDA asterisk with storage complexity proportional to the depth of the search tree.

Bridges, Susan M.↗

Experiences with serial and parallel algorithms for channel routing using simulated annealing

Two algorithms for channel routing using simulated annealing are presented. Simulated annealing is an optimization methodology which allows the solution process to back up out of local minima that may be encountered by inappropriate selections. By properly controlling the annealing process, it is very likely that the optimal solution to an NP-complete problem such as channel routing may be found. The algorithm presented proposes very relaxed restrictions on the types of allowable transformations, including overlapping nets. By freeing that restriction and controlling overlap situations with an appropriate cost function, the algorithm becomes very flexible and can be applied to many extensions of channel routing. The selection of the transformation utilizes a number of heuristics, still retaining the pseudorandom nature of simulated annealing. The algorithm was implemented as a serial program for a workstation, and a parallel program designed for a hypercube computer. The details of the serial implementation are presented, including many of the heuristics used and some of the resulting solutions.

Brouwer, Randall Jay↗

Network-Control Algorithm

Algorithm developed for optimal routing of packets of data along links of multilink, multinode digital communication network. Algorithm iterative and converges to cost-optimal assignment independent of initial assignment. Each node connected to other nodes through links, each containing number of two-way channels. Algorithm assigns channels according to message traffic leaving and arriving at each node. Modified to take account of different priorities among packets belonging to different users by using different delay constraints or imposing additional penalties via cost function.

Chan, Hak-Wai↗

Optimal aeroassisted coplanar orbital transfer using an energy model

The atmospheric portion of the trajectories for the aeroassisted coplanar orbit transfer was investigated. The equations of motion for the problem are expressed using reduced order model and total vehicle energy, kinetic plus potential, as the independent variable rather than time. The order reduction is achieved analytically without an approximation of the vehicle dynamics. In this model, the problem of coplanar orbit transfer is seen as one in which a given amount of energy must be transferred from the vehicle to the atmosphere during the trajectory without overheating the vehicle. An optimal control problem is posed where a linear combination of the integrated square of the heating rate and the vehicle drag is the cost function to be minimized. The necessary conditions for optimality are obtained. These result in a 4th order two-point-boundary-value problem. A parametric study of the optimal guidance trajectory in which the proportion of the heating rate term versus the drag varies is made. Simulations of the guidance trajectories are presented.

Halyo, Nesim↗

Optimization of rotor blades for combined structural, performance, and aeroelastic characteristics

The strategies whereby helicopter rotor blades can be optimized for combined structural, inertial, dynamic, aeroelastic, and aerodynamic performance characteristics are outlined. There are three key ingredients in the successful execution of such an interdisciplinary optimization. The first is the definition of a satisfactory performance index that combines all aspects of the problem without too many constraints. The second element is the judicious choice of computationally efficient analysis tools for the various quantitative components in both the cost functional and constraints. The third element is an effective strategy for combining the various disciplines either in parallel or sequential optimizations.

Peters, David A.↗

Multirate digital control system design

Methods for multirate digital control system design are discussed. A simple method for sampling rate selection based on control bandwidths is proposed. Methods for generating a discrete-time state model of a sampled-data plant and a discrete-time equivalent to an analog cost function for a sampled-data plant are described. The succesive loop closures and linear quadratic Gaussian synthesis methods are reviewed, and a constrained optimization synthesis method is introduced. The proposed sampling rate selection, discretization, and synthesis methods are applied to two example design problems. Multirate and single-rate compensators synthesized by the different methods are compared, based on closed-loop responses, with compensators having the same real-time computation load.

Berg, Martin C.↗

A method of boundary parameter estimation for a two-dimensional diffusion system under noisy observations

The purpose of this paper is to establish a method for identifying unknown parameters involved in the boundary state of a class of diffusion systems under noisy observations. A mathematical model of the system dynamics is given by a two-dimensional diffusion equation. Noisy observations are made by sensors allocated on the system boundary. Starting with the mathematical model mentioned above, an online parameter estimation algorithm is proposed within the framework of the maximum likelihood estimation. Existence of the optimal solution and related necessary conditions are discussed. By solving a local variation of the cost functional with respect to the perturbation of parameters, the estimation mechanism is proposed in a form of recursive computations. Finally, the feasibility of the estimator proposed here is demonstrated through results of digital simulation experiments.

Sunahara, Y.↗

Objective analysis of pseudostress over the Indian Ocean using a direct-minimization approach

A technique not previously used in objective analysis of meteorological data is used here to produce monthly average surface pseudostress data over the Indian Ocean. An initial guess field is derived and a cost functional is constructed with five terms: approximation to initial guess, approximation to climatology, a smoothness parameter, and two kinematic terms. The functional is minimized using a conjugate-gradient technique, and the weight for the climatology term controls the overall balance of influence between the climatology and the initial guess. Results from various weight combinations are presented for January and July 1984. Quantitative and qualitative comparisons to the subject analysis are made to find which weight combination provides the best results. The weight on the approximation to climatology is found to balance the influence of the original field and climatology.

Legler, David M.↗

A design procedure for the handling qualities optimization of the X-29A aircraft

The techniques used to improve the pitch-axis handling qualities of the X-29A wing-canard-planform fighter aircraft are reviewed. The aircraft and its FCS are briefly described, and the design method, which works within the existing FCS architecture, is characterized in detail. Consideration is given to the selection of design goals and design variables, the definition and calculation of the cost function, the validation of the mathematical model on the basis of flight-test data, and the validation of the improved design by means of nonlinear simulations. Flight tests of the improved design are shown to verify the simulation results.

Bosworth, John T.↗

Self-tuning Generalized Predictive Control applied to terrain following flight

Generalized Predictive Control (GPC) describes an algorithm for the control of dynamic systems in which a control input is generated which minimizes a quadratic cost function consisting of a weighted sum of errors between desired and predicted future system output and future predicted control increments. The output predictions are obtained from an internal model of the plant dynamics. Self-tuning GPC refers to an implementation of the GPC algorithm in which the parameters of the internal model(s) are estimated on-line and the predictive control law tuned to the parameters so identified. The self-tuning GPC algorithm is applied to a problem of rotorcraft longitudinal/vertical terrain-following flight. The ability of the algorithm to tune to the initial vehicle parameters and to successfully adapt to a stability augmentation failure is demonstrated. Flight path performance is compared to a conventional, classically designed flight path control system.

Hess, R. A.↗

A variable-gain output feedback control design approach

A multi-model design technique to find a variable-gain control law defined over the whole operating range is proposed. The design is formulated as an optimal control problem which minimizes a cost function weighing the performance at many operating points. The solution is obtained by embedding into the Multi-Configuration Control (MCC) problem, a multi-model robust control design technique. In contrast to conventional gain scheduling which uses a curve fit of single model designs, the optimal variable-gain control law stabilizes the plant at every operating point included in the design. An iterative algorithm to compute the optimal control gains is presented. The methodology has been successfully applied to reconfigurable aircraft flight control and to nonlinear flight control systems.

Haylo, Nesim↗

Design of optimally normal minimum gain controllers by continuation method

A measure of the departure from normality is investigated for system robustness. An attractive feature of the normality index is its simplicity for pole placement designs. To allow a tradeoff between system robustness and control effort, a cost function consisting of the sum of a norm of weighted gain matrix and a normality index is minimized. First- and second-order necessary conditions for the constrained optimization problem are derived and solved by a Newton-Raphson algorithm imbedded into a one-parameter family of neighboring zero problems. The method presented allows the direct computation of optimal gains in terms of robustness and control effort for pole placement problems.

Lim, K. B.↗