Combining an Optimal Control Program with the Time Series Processor System

A distributed parameter thermal and stress model is developed for a nuclear rocket. The resultant equations for the optimal control problem are a pair of coupled, bilinear, partial differential equations. The thermal stress constraint forms an inequality which is a function of both the state and the control. The initial conditions are steady state, and the terminal condition is that the coolant flow obtain a fixed, higher level. The distributed parameter system is discretized in the space dimension to give an arbitrary order set of ordinary differential, state equations. It is shown how a result based on the Weierstrass necessary condition and derived by Berkovitz from the calculus of variations using a slack variable technique may be applied. This condition is shown to require the optimal control to be “boundary control” with no switching. The optimal control program must make the inequality constraint an equality at some location throughout the transient. Based on the result that boundary control is the optimal control, an algorithm is developed to compute the optimal control program. The algorithm was programmed on a digital computer and numerical results are given for the optimal flow program and the resultant stress distributions for various cases.

In this paper, an infinite horizon optimal robust guaranteed cost control scheme of a class of continuous-time uncertain nonlinear systems is established based on adaptive dynamic programming. The main idea lies in that the optimal robust guaranteed cost control problem can be transformed into an optimal control problem. Actually, the optimal cost function of the nominal system is nothing but the optimal guaranteed cost of the original uncertain system. A critic neural network is constructed to help solving the modified Hamilton-Jacobi-Bellman equation corresponding to the nominal system. Then, an additional stabilizing term is introduced to reinforce the updating process of the weight vector and reduce the requirement of an initial stabilizing control. An example is provided to illustrate the effectiveness of the present control approach.

1 A Survey on Computational Optimal Control.- Issues in the Direct Transcription of Optimal Control Problems to Sparse Nonlinear Programs.- Optimization in Control of Robots.- Large-scale SQP Methods and their Application in Trajectory Optimization.- Solving Optimal Control and Pursuit-Evasion Game Problems of High Complexity.- 2 Theoretical Aspects of Optimal Control and Nonlinear Programming.- Continuation Methods In Boundary Value Problems.- Second Order Optimality Conditions for Singular Extremals.- Synthesis of Adaptive Optimal Controls for Linear Dynamic Systems.- Control Applications of Reduced SQP Methods.- Time Optimal Control of Mechanical Systems.- 3 Algorithms for Optimal Control Calculations.- Second Order Algorithm for Time Optimal Control of a Linear System.- An SQP-type Solution Method for Constrained Discrete-Time Optimal Control Problems.- Numerical Methods for Solving Differential Games, Prospective Applications to Technical Problems.- Construction of the Optimal Feedback Controller for Constrained Optimal Control Problems with Unknown Disturbances.- Repetitive Optimization for Predictive Control of Dynamic Systems under Uncertainty.- Optimal Control of Multistage Systems Described by High-Index Differential-Algebraic Equations.- A New Class of a High Order Interior Point Method for the Solution of Convex Semiinfinite Optimization Problems.- A Structured Interior Point SQP Method for Nonlinear Optimal Control Problems.- 4 Software for Optimal Control Calculations.- Automated Approach for Optimizing Dynamic Systems.- ANDECS: A Computation Environment for Control Applications of Optimization.- Application of Automatic Differentiation to Optimal Control Problems.- OCCAL: A mixed symbolic-numeric Optimal Control CALculator.- 5 Applications of Optimal Control.- A Robotic Satellite with Simplified Design.- Nonlinear Control under Constraints of a Biological System.- An Object-Oriented Approach to Optimally Describe and Specify a SCADA System Applied to a Power Network.- Near-Optimal Flight Trajectories Generated by Neural Networks.- Performance of a Feedback Method with Respect to Changes in the Air-Density during the Ascent of a Two-Stage-To-Orbit Vehicle.- Linear Optimal Control for Reentry Flight.- Steady-State Modelling of Turbine Engine with Controllers.- Shortest Paths for Satellite Mounted Robot Manipulators.- Optimal Control of the Industrial Robot Manutec r3.

Sequential Convex Programming (SCP) has recently gained significant popularity as an effective method for solving optimal control problems and has been successfully applied in several different domains. However, the theoretical analysis of SCP has received comparatively limited attention, and it is often restricted to discrete-time formulations. In this paper, we present a unifying theoretical analysis of a fairly general class of SCP procedures for continuous-time optimal control problems. In addition to the derivation of convergence guarantees in a continuous-time setting, our analysis reveals two new numerical and practical insights. First, we show how one can more easily account for manifold-type constraints, which are a defining feature of optimal control of mechanical systems. Second, we show how our theoretical analysis can be leveraged to accelerate SCP-based optimal control methods by infusing techniques from indirect optimal control.

This article presents a unified approach to simultaneous solution of optimization and optimal control problems in batch distillation, operating under different modes of operation: variable, constant, or optimal reflux. The simplified, computationally efficient short‐cut method and a novel algorithm to solve the optimal control problems in batch distillation is the basis of this unified approach. The short‐cut method identifies the feasible region of operation essential for optimization and optimal control problems, and provides analytical partial derivatives of the model parameters crucial to the solution.The new algorithm for the solution of optimal combination of the maximum principle and NLP optimization techniques. It circumvents the problems associated with the maximum principle approach (iterative solution of a two‐point boundary value problem, undounded control variables, and inability to handle the simultaneous optimization and optimal control problem), and the coupled ODE discretization‐NLP optimization scheme for nonlinear models (higher system nonlinearities, multiplicity of solutions, sensitivity of convergence to initial guesses). This algorithm reduces the dimensionality of the problem, and the nature of the algorithm allows a common platform to optimal solutions of different operating conditions. This article also shows that different categories of the optimal control problems in batch distillation essentially involve the solution of the maximum distillate problem.

Sailplanes, when launched, need to extract energy from vertical motion of the air. The usual procedure is to circle and climb in vertical currents of limited spatial dimension (‘thermals’) under cumulus clouds and thereafter to exchange the gained height into distance by gliding out to the next cumulus cloud. While doing so, sailplane pilots will often encounter larger‐scale regions where the atmosphere moves in a vertical direction. Until recently the optimal strategy in such situations was assumed to be to fly slower through regions with upward moving air and faster through regions with downward moving air. Only a few years ago it was discovered both in theory, from energy considerations, as well as in practice, by contest pilots, that in some circumstances more energy could be extracted from the atmosphere when the loadfactor, i.e., the total aerodynamic lifting force on the wings divided by the weight, was varied. The research reported in this paper was set up to investigate this phenomenon. To that end a simple dynamic model is assumed for the sailplane, and the optimization problem is formulated as an optimal control problem with terminal constraints. This optimal control problem is solved numerically for a number of different widths and strengths of the vertical currents encountered. The computer program used for this purpose is a rather general continuous optimal control program based on the use of (conjugate) gradients in function space and a projection operation to account for the terminal constraints.

This paper builds up two equivalence theorems for different kinds of optimal control problems of internally controlled Schrodinger equations. The first one is an equivalence of the minimal norm and the minimal time control problems where the target sets are the origin of the state space. (The minimal time control problems are also called the first type of optimal time control problems.) The second one is an equivalence of three optimal control problems: optimal target control problems, optimal norm control problems, and the second type of optimal time control problems.

This paper reviews a methodical approach to solving multi-step dynamic problem of optimal integrated program management of a product portfolio structure of the enterprise. Any multiproduct manufacturing process depends on many factors, that is why the quality criteria in the economic and mathematical model of the dynamics of the product portfolio structure management of a company is a vector one, and therefore, optimization of the integrated product portfolio structure management of a company is multi-criteria optimization problem. With the help of the method of generalized criterion (method of vector criterion scalarization), a formed multicriteria problem is replaced by a one-criterion optimization problem of complex management program of product portfolio structure with a functional of quality, which is a convolution of a set (vector) of the objective functions. The transformed problem is formulated and solved as a problem of optimal terminal program control in a class of linear discrete dynamical systems. The method proposed in this paper allows developing management solutions designed to create the optimal structure of an enterprise's product lines, contributing to optimization of profits as well as maintenance of the desired level of profit for a long period of time.

This article addresses the optimal tracking control problem with prescribed performance for uncertain nonlinear systems subject to input constraint and unknown disturbances. First, a fixed‐time monotonic convergence function is introduced to restrain tracking error, and a nonlinear mapping technique is employed to transform the constrained error into an unconstrained variable, then the fixed‐time output tracking issue is boiled down to the boundedness problem of the transformed variable. With the aid of a nonquadratic cost function, the input constraint is encoded into the optimization problem. To solve the unknown disturbances, an auxiliary system and an auxiliary disturbance policy are constructed, and the optimal control problem is formulated as a two‐player zero‐sum game. Moreover, a Hamilton–Jacobi–Isaacs (HJI) equation associated with this nonquadratic zero‐sum game is established to give the optimal control and the worst‐case disturbance policy solution. Subsequently, to avoid using knowledge of the system dynamics, three neural network approximators, namely, actor, critic, and disturbance, which are tuned online and simultaneously for approximating the solution of HJI, are constructed based on the integral reinforcement learning algorithm. Theoretical analysis shows that the reconstructed error system states and the weight estimation errors are semi‐globally uniformly ultimately bounded. Finally, the simulation study further tests the availability of the proposed control strategy.

In general, optimal control problems rely on numerically rather than analytically solving methods, due to their nonlinearities. The direct method, one of the numerically solving methods, is mainly to transform the optimal control problem into a nonlinear optimization problem with finite dimensions, via discretizing the objective functional and the forced dynamical equations directly. However, in the procedure of the direct method, the classical discretizations of the forced equations will reduce or affect the accuracy of the resulting optimization problem as well as the discrete optimal control. In view of this fact, more accurate and efficient numerical algorithms should be employed to approximate the forced dynamical equations. As verified, the discrete variational difference schemes for forced Birkhoffian systems exhibit excellent numerical behaviors in terms of high accuracy, long-time stability and precise energy prediction. Thus, the forced dynamical equations in optimal control problems, after being represented as forced Birkhoffian equations, can be discretized according to the discrete variational difference schemes for forced Birkhoffian systems. Compared with the method of employing traditional difference schemes to discretize the forced dynamical equations, this way yields faithful nonlinear optimization problems and consequently gives accurate and efficient discrete optimal control. Subsequently, in the paper we are to apply the proposed method of numerically solving optimal control problems to the rendezvous and docking problem of spacecrafts. First, we make a reasonable simplification, i.e., the rendezvous and docking process of two spacecrafts is reduced to the problem of optimally transferring the chaser spacecraft with a continuously acting force from one circular orbit around the Earth to another one. During this transfer, the goal is to minimize the control effort. Second, the dynamical equations of the chaser spacecraft are represented as the form of the forced Birkhoffian equation. Then in this case, the discrete variational difference scheme for forced Birkhoffian system can be employed to discretize the chaser spacecraft's equations of motion. With further discretizing the control effort and the boundary conditions, the resulting nonlinear optimization problem is obtained. Finally, the optimization problem is solved directly by the nonlinear programming method and then the discrete optimal control is achieved. The obtained optimal control is efficient enough to realize the rendezvous and docking process, even though it is only an approximation of the continuous one. Simulation results fully verify the efficiency of the proposed method for numerically solving optimal control problems, if the fact that the time step is chosen to be very large to limit the dimension of the optimization problem is noted.

The optimization problem consists in finding an element that minimizes or maximizes the goal (or cost) functional on the set of admissible controls. The paper is devoted to the optimization problem for a pseudoparabolic equation with control in coefficients of the variational equality as well as on the right-hand side. We consider optimal control problem (parabolic initial boundary value problem) of a viscoelastic plate. The bending of a plate is described by means of the Kirchhoff model. We assume that a nonhomogeneous and anisotropic viscoelastic plate occupying a domain Ω × (—H, H) of the space ℝ3 is loaded be a transversal distributed force perpendicular to the middle plane of the plate. The viscoelastic reinforced plate with welded bars rests on a unilateral elastic foundation. The role of the control variables is played by the thickness of the viscoelastic plate and the stiffness characteristics of the elastic Winkler medium, respectively. We consider the desired moments field (the bending moments and torque) in time T as the cost functional. The control variables have to belong to a set of Lipschitz-continuous functions and to a set of continuously differentiable functions, respectively. The state problem is modelled by a pseudoparabolic variational equality, where the control variables influence both the coefficients of the linear strictly monotone operator and the Winkler functional. We derive there some apriori estimates of the state function which are useful for the problem of the existence of the optimal thickness function and the Winkler modulus, respectively, and for unicity of the optimal controls. On the basis of a general existence theorem for a class of pseudoparabolic optimization problems with the state variational equation, we prove the existence of at least one solution of the optimal control problem.

In this paper, an iterative adaptive dynamic programming (ADP) algorithm is developed to solve the optimal cooperative control problems for residential multi-battery systems. To avoid solving high-dimensional optimal control problems, we first constrain all the batteries at their worst performance, which transforms the multi-input optimal control problem into a single-input one. Based on the worst-performance optimal control law, the optimal cooperative control law for the residential multi-battery systems is obtained, where in each iteration, only a single-input optimization problem is implemented. Finally, numerical results are given to illustrate the performance of the developed algorithm.

A computational approach for understanding immune response to multiple epitopes based on optimal control formulation

An efficient method is introduced for solving optimal control and optimal parameter selection problems of nonlinear differential-algebraic systems involving general constraints. These infinite dimensional problems are converted into the finite dimensional optimization problems by using the control parametrization technique. Moreover, the transformed time locations for the control variables are included in such problems. As a result, optimal control problems become acausal optimal parameter selection problems. A modified version of differential evolution is introduced to solve these problems. The integration of the penalty functions is used to ensure the solution onto the feasible domain of the problems. Two industrial systems, a chemical reactor and a robotics arm, are used to illustrate the robustness and effectiveness of the method. The control effects can be improved by selecting the proper time locations as observed from the simulated results.

The original control problem of optimal reorientation from a state of rest to a state of rest is considered and solved. The control function is torque vector. Problem of optimal control is investigated in detail for statement when control is restricted and the used functional of optimality includes kinematical rotary energy and time of maneuver. For solving and synthesis of the optimal control program, the quaternion method and the Pontryagin’s maximum principle are applied. Analytic solution of the proposed problem is presented basing on the differential equation connecting the angular velocity vector and quaternion of spacecraft attitude. It is shown that a chosen criterion of optimality provides a turn of a spacecraft with rotation energy which does not exceed the required value. This property of proposed control increases safety of flight. The time-optimal problem was solved also. The control law is formulated in the form of an explicit dependence of the control variables on the phase coordinates. All key expressions and equations are written in quaternion form which is convenient for onboard realization and implementation. The analysis of the special control regime of the spacecraft was made. Analytical formulas were written for duration of acceleration and braking. For specific cases of spacecraft configurations (dynamically symmetric spacecraft and spheric-symmetrical spacecraft as particular cases), complete solution of optimal control problem in closed form is given. Numerical example and the results of mathematical simulation for spacecraft motion under optimal control are demonstrated. This data supplements the made theoretical descriptions, and illustrates the practical feasibility of the designed algorithm for controlling the spatial orientation of the spacecraft showing reorientation process in visual form.