On the optimal angular velocity control of asymmetrical space vehicles
Inverse problem of optimal control for reducing angular velocities of space vehicle to zero
SEARCH · Engineering Papers
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.
Inverse problem of optimal control for reducing angular velocities of space vehicle to zero
The general problem of optimization with arbitrary merit and constraint functions, which could be convex, concave, monotonic, or non-monotonic, is treated using stochastic methods. To improve the efficiency of the random search methods, a genetic algorithm for the search phase and a discriminant function for the constraint-control phase were utilized. The validity of the technique is demonstrated by comparing the results to published test problem results. Numerical experimentation indicated that for cases where a quick near optimum solution is desired, a general, user-friendly optimization code can be developed without serious penalties in both total computer time and accuracy.
In the present treatment of optimal control problems arising in the study of coplanar aeroassisted orbital transfer, the hybrid combination of propulsive parameters in space and aerodynamic maneuvers employing lift modulation in the sensible atmosphere indicates that the optimal energy-viewpoint solution is the grazing trajectory; this trajectory is characterized by favorable values of the peak heating rate and the peak dynamic pressure. Numerical solutions are obtained by means of the sequential gradient restoration algorithm for optimal control problems. It is found that nearly-grazing trajectories yielding the least-square value of the path inclination have desirable characteristics from the standpoints of energy, heating rate, and dynamic pressure.
Averaging methods are applied to analyzing the transient response associated with adaptive control of large space structures. Using a dominant mode approximation to the plant, an analytical bound is found on the envelope of the adaptive response, characterizing many of the features of the response useful for control design (e.g., peak values, quadratic costs, settling times, etc.). An optimal adaptive design problem is formulated based on minimizing the product of the settling time and peak torque requirement. The resulting nonlinear constrained optimization problem is solved in closed form, and several properties of the optimal adaptive design are discussed.
The class of all piecewise time-continuous controllers tracking a given hypersurface in the state space of a dynamical system can be split by the present transformation technique into two disjoint classes; while the first of these contains all controllers which track the hypersurface in finite time, the second contains all controllers that track the hypersurface asymptotically. On this basis, a reformulation is presented for optimal control problems involving state-variable inequality constraints. If the state constraint is regarded as 'soft', there may exist controllers which are asymptotic, two-sided, and able to yield the optimal value of the performance index.
Frequency domain solution compared to state-space solution for optimal regulator problems
Research related to reliable aircraft design is summarized. Topics discussed include systems reliability optimization, failure detection algorithms, analysis of nonlinear filters, design of compensators incorporating time delays, digital compensator design, estimation for systems with echoes, low-order compensator design, descent-phase controller for 4-D navigation, infinite dimensional mathematical programming problems and optimal control problems with constraints, robust compensator design, numerical methods for the Lyapunov equations, and perturbation methods in linear filtering and control.
Mathematical models for optimizing learning process, showing instructional problems reformulation as theory of optimization problems
Astronauts are required to interface with complex systems that require sophisticated displays to communicate effectively. Lightweight, head-mounted real-time displays that present holographic images for comfortable viewing may be the ideal solution. We describe an implementation of a liquid crystal television (LCTV) as a spatial light modulator (SLM) for the display of holograms. The implementation required the solution of a complex set of problems. These include field calculations, determination of the LCTV-SLM complex transmittance characteristics and a precise knowledge of the signal mapping between the LCTV and frame grabbing board that controls it. Realizing the hologram is further complicated by the coupling that occurs between the phase and amplitude in the LCTV transmittance. A single drive signal (a gray level signal from a framegrabber) determines both amplitude and phase. Since they are not independently controllable (as is true in the ideal SLM) one must deal with the problem of optimizing (in some sense) the hologram based on this constraint. Solutions for the above problems have been found. An algorithm has been for field calculations that uses an efficient outer product formulation. Juday's MEDOF 7 (Minimum Euclidean Distance Optimal Filter) algorithm used for originally for filter calculations has been successfully adapted to handle metrics appropriate for holography. This has solved the problem of optimizing the hologram to the constraints imposed by coupling. Two laboratory methods have been developed for determining an accurate mapping of framegrabber pixels to LCTV pixels. A friendly software system has been developed that integrates the hologram calculation and realization process using a simple set of instructions. The computer code and all the laboratory measurement techniques determining SLM parameters have been proven with the production of a high quality test image.
A new, near-optimal feedback control technique is introduced that is shown to provide excellent vibration attenuation for those distributed parameter systems that are often encountered in the areas of aeroservoelasticity and large space systems. The technique relies on a novel solution methodology for the classical optimal control problem. Specifically, the quadratic regulator control problem for a flexible vibrating structure is first cast in a weak functional form that admits an approximate solution. The necessary conditions (first-order) are then solved via a time finite-element method. The procedure produces a low dimensional, algebraic parameterization of the optimal control problem that provides a rigorous basis for a discrete controller with a first-order like hold output. Simulation has shown that the algorithm can successfully control a wide variety of plant forms including multi-input/multi-output systems and systems exhibiting significant nonlinearities. In order to firmly establish the efficacy of the algorithm, a laboratory control experiment was implemented to provide planar (bending) vibration attenuation of a highly flexible beam (with a first clamped-free mode of approximately 0.5 Hz).
The linear optimal control problem of an nth-order time-invariant dynamic system with a quadratic performance functional is usually solved by the Hamilton-Jacobi approach. This leads to the solution of the differential matrix Riccati equation with a terminal condition. The bulk of the computation for the optimal control problem is related to the solution of this equation. There are various algorithms in the literature for solving the matrix Riccati equation. However, computational complexities and storage requirements as a function of numbers of state variables, control variables, and sensors are not available for all these algorithms. In this work, the computational complexities and storage requirements for some of these algorithms are given. These expressions show the immensity of the computational requirements of the algorithms in solving the Riccati equation for large-order systems such as the control of highly flexible space structures. The expressions are also needed to compute the speedup and efficiency of any implementation of these algorithms on concurrent machines.
This investigation is an extension of a project dealing with the problem of optimal use of ground resources for future space missions. This problem was formulated as a linear programming problem using an indirect approach. Instead of minimizing the inventory level of needed ground resources, the overlapping periods during which the same types of resources are used by various flights are minimized. The model was built upon the assumption that during the time interval under consideration, the costs of various needed resources remain constant. Under other assumptions concerning costs of resources, the objective function, in general, assumes a non-linear form. In this study, one case where the form of the objective function turns out to be quadratic is considered. Also, disadvantages and limitations of the approach used are briefly discussed.
The appearance of touch points in state constrained optimal control problems with general vector-valued control is studied. Under the assumption that the Hamiltonian is regular, touch points for first-order state inequalities are shown to exist only under very special conditions. In many cases of practical importance these conditions can be used to exclude touch points a priori without solving an optimal control problem. The results are demonstrated on a simple example.
A complete theory of necessary and sufficient conditions is discussed for a control to be superior with respect to a nonscalar-valued performance criterion. The latter maps into a finite dimensional, integrally closed directed, partially ordered linear space. The applicability of the theory to the analysis of dynamic vector estimation problems and to a class of uncertain optimal control problems is demonstrated.
This paper reports a reasonably complete theory of necessary and sufficient conditions for a control to be superior with respect to a nonscalar-valued performance criterion. The latter maps into a finite-dimensional integrally closed directed partially ordered linear space. The applicability of the theory to the analysis of dynamic vector estimation problems and to a class of uncertain optimal control problems is demonstrated.
This paper, assuming steady wind and zero sideslip, presents a discrete-time mathematical model to obtain a control law and three-dimensional flight path to guide an aircraft in a given time from a given initial state (position, velocity and heading) to a prescribed final state subject to the constraints on airspeed acceleration, and pitch and bank angles of the aircraft. For ease in implementing the control law, the control inputs are assumed to be delayed and are applied in a sequential fashion. The guidance problem is formulated as a discrete nonlinear optimal control problem with time delays in dynamics and a cost functional of Bolza form. With a quadratic penalty function to handle terminal constraints on velocity and heading, a solution technique to the control problem based on conjugate gradient algorithm is investigated. Numerical examples are presented to illustrate the applicability of this approach to solution of a terminal area guidance problem in an automated air traffic control environment.
Recently, Differential Dynamic Programming (DDP) and other similar algorithms have become the solvers of choice when performing non-linear Model Predictive Control (nMPC) with modern robotic devices. The reason is that they have a lower computational cost per iteration when compared with off-the-shelf Non-Linear Programming (NLP) solvers, which enables its online operation. However, they cannot handle constraints, and are known to have poor convergence capabilities. In this paper, we propose a method to solve the optimal control problem with control bounds through a squashing function (i.e., a sigmoid, which is bounded by construction). It has been shown that a naive use of squashing functions damage the convergence rate. To tackle this, we first propose to add a quadratic barrier that avoids the difficulty of the plateau produced by the sigmoid. Second, we add an outer loop that adapts both the sigmoid and the barrier; it makes the optimal control problem with the squashing function converge to the original control-bounded problem. To validate our method, we present simulation results for different types of platforms including a multi-rotor, a biped, a quadruped and a humanoid robot.
The first part of the paper presents some closed-form solutions to the optimal two-impulse transfer between fixed position and velocity vectors on Keplerian orbits when some constraints are imposed on the magnitude of the initial and final impulses. Additionally, a numerically-stable gradient-free algorithm with guaranteed convergence is presented for the minimum delta-v two-impulse transfer. In the second part of the paper, cooperative bargaining theory is used to solve some two-impulse transfer problems when the initial and final impulses are carried by different vehicles or when the goal is to minimize the delta-v and the time-of-flight at the same time.