Maximin Approach to the Ship Collision Avoidance Problem via Multiple-Subarc Sequential Gradient-Restoration Algorithm

The ideal strategy for ship collision avoidance under emergency conditions is to maximize wrt the controls the timewise minimum distance between a host ship and an intruder ship. This is a maximin problem or Chebyshev problem of optimal control in which the performance index being maximinimized is the distance between the two ships. Based on the multiple-subarc sequential gradient-restoration algorithm, a new method for solving the maximin problem is developed.Key to the new method is the observation that, at the maximin point, the time derivative of the performance index must vanish. With the zero derivative condition being treated as an inner boundary condition, the maximin problem can be converted into a Bolza problem in which the performance index, evaluated at the inner boundary, is being maximized wrt the controls. In turn, the Bolza problem with an added inner boundary condition can be solved via the multiple-subarc sequential gradient-restoration algorithm (SGRA).The new method is applied to two cases of the collision avoidance problem: collision avoidance between two ships moving along the same rectilinear course and collision avoidance between two ships moving along orthogonal courses. For both cases, we are basically in the presence of a two-subarc problem, the first subarc corresponding to the avoidance phase of the maneuver and the second subarc corresponding to the recovery phase. For stiff systems, the robustness of the multiple-subarc SGRA can be enhanced via increase in the number of subarcs. For the ship collision avoidance problem, a modest increase in the number of subarcs from two to three (one subarc in the avoidance phase, two subarcs in the recovery phase) helps containing error propagation and achieving better convergence results.     

An extended quasilinearization algorithm

The quasilinearization algorithm for the solution of two-point boundary-value problems is extended to handle a general class of multipoint boundary value problems involving multiple subarcs, state and/or control variable inequality constraints, and discontinuous state and/or adjoint variables. The corner and final times are unspecified since they are implicitly defined by the satisfaction of subarc stopping conditions. The inequality constraints are handled directly without the use of penalty functions. The extended algorithm is applied to a discontinuous version of the brachistochrone problem, and good convergence properties are obtained.This research was supported in part by AFOSR Grant No. 72–2166.     

Existence theorems for general control problems of Bolza and Lagrange

The existence of solutions is established for a very general class of problems in the calculus of variations and optimal control involving ordinary differential equations or contingent equations. The theorems, while relatively simple to state, cover, besides the more classical cases, problems with considerably weaker assumptions of continuity or boundedness. For example, the cost functional may only be lower semicontinuous in the control and may approach + ∞ as one nears certain boundary points of the control region; both endpoints in the problem may be “free”. Earlier results of Cesari, Olech and the author are thereby extended.The development is based on the theory of convex integral functionals and their conjugates. The first step is to show that, for purposes of existence theory, the problem can be reduced to a simpler model where control variables are not present as such. This model, resembling a classical problem of Bolza in the calculus of variations, but where the functions are extended-real-valued, is then investigated using, above all, the conjugacy correspondence between generalized Lagrangians and Hamiltonians.     

Optimal Control of a Ship for Collision Avoidance Maneuvers

We consider a ship subject to kinematic, dynamic, and moment equations and steered via rudder under the assumptions that the rudder angle and rudder angle time rate are subject to upper and lower bounds. We formulate and solve four Chebyshev problems of optimal control, the optimization criterion being the maximization with respect to the state and control history of the minimum value with respect to time of the distance between two identical ships, one maneuvering and one moving in a predetermined way.Problems P1 and P2 deal with collision avoidance maneuvers without cooperation, while Problems P3 and P4 deal with collision avoidance maneuvers with cooperation. In Problems P1 and P3, the maneuvering ship must reach the final point with a given lateral distance, zero yaw angle, and zero yaw angle time rate. In Problems P2 and P4, the additional requirement of quasi-steady state is imposed at the final point.The above Chebyshev problems, transformed into Bolza problems via suitable transformations, are solved via the sequential gradient-restoration algorithm in conjunction with a new singularity avoiding transformation which accounts automatically for the bounds on rudder angle and rudder angle time rate.The optimal control histories involve multiple subarcs along which either the rudder angle is kept at one of the extreme positions or the rudder angle time rate is held at one of the extreme values. In problems where quasi-steady state is imposed at the final point, there is a higher number of subarcs than in problems where quasi-steady state is not imposed; the higher number of subarcs is due to the additional requirement that the lateral velocity and rudder angle vanish at the final point.     

Optimal Trajectories for Spacecraft Rendezvous

The efficient execution of a rendezvous maneuver is an essential component of various types of space missions. This work describes the formulation and numerical investigation of the thrust function required to minimize the time or fuel required for the terminal phase of the rendezvous of two spacecraft. The particular rendezvous studied concerns a target spacecraft in a circular orbit and a chaser spacecraft with an initial separation distance and separation velocity in all three dimensions. First, the time-optimal rendezvous is investigated followed by the fuel-optimal rendezvous for three values of the max-thrust acceleration via the sequential gradient-restoration algorithm. Then, the time-optimal rendezvous for given fuel and the fuel-optimal rendezvous for given time are investigated. There are three controls, one determining the thrust magnitude and two determining the thrust direction in space. The time-optimal case results in a two-subarc solution: a max-thrust accelerating subarc followed by a max-thrust braking subarc. The fuel-optimal case results in a four-subarc solution: an initial coasting subarc, followed by a max-thrust braking subarc, followed by another coasting subarc, followed by another max-thrust braking subarc. The time-optimal case with fuel given and the fuel-optimal case with time given result in two, three, or four-subarc solutions depending on the performance index and the constraints. Regardless of the number of subarcs, the optimal thrust distribution requires the thrust magnitude to be at either the maximum value or zero. The coasting periods are finite in duration and their length increases as the time to rendezvous increases and/or as the max allowable thrust increases. Another finding is that, for the fuel-optimal rendezvous with the time unconstrained, the minimum fuel required is nearly constant and independent of the max available thrust. Yet another finding is that, depending on the performance index, constraints, and initial conditions, sometime the initial application of thrust must be delayed, resulting in an optimal rendezvous trajectory which starts with a coasting subarc. This research has been supported by NSF under Grant CMS-0218878.     

Necessary conditions for the neutral problem of Bolza with continuously varying time delay

This note uses Clarke's decoupling technique to obtain necessary conditions for the generalized problem of Bolza with Lipschitz continuously varying delay in both the state and velocity variables.     

Optimal Starting Conditions for the Rendezvous Maneuver, Part 1: Optimal Control Approach

We consider the three-dimensional rendezvous between two spacecraft: a target spacecraft on a circular orbit around the Earth and a chaser spacecraft initially on some elliptical orbit yet to be determined. The chaser spacecraft has variable mass, limited thrust, and its trajectory is governed by three controls, one determining the thrust magnitude and two determining the thrust direction. We seek the time history of the controls in such a way that the propellant mass required to execute the rendezvous maneuver is minimized. Two cases are considered: (i) time-to-rendezvous free and (ii) time-to-rendezvous given, respectively equivalent to (i) free angular travel and (ii) fixed angular travel for the target spacecraft. The above problem has been studied by several authors under the assumption that the initial separation coordinates and the initial separation velocities are given, hence known initial conditions for the chaser spacecraft. In this paper, it is assumed that both the initial separation coordinates and initial separation velocities are free except for the requirement that the initial chaser-to-target distance is given so as to prevent the occurrence of trivial solutions. Analyses performed with the multiple-subarc sequential gradient-restoration algorithm for optimal control problems show that the fuel-optimal trajectory is zero-bang, namely it is characterized by two subarcs: a long coasting zero-thrust subarc followed by a short powered max-thrust braking subarc. While the thrust direction of the powered subarc is continuously variable for the optimal trajectory, its replacement with a constant (yet optimized) thrust direction produces a very efficient guidance trajectory: Indeed, for all values of the initial distance, the fuel required by the guidance trajectory is within less than one percent of the fuel required by the optimal trajectory. For the guidance trajectory, because of the replacement of the variable thrust direction of the powered subarc with a constant thrust direction, the optimal control problem degenerates into a mathematical programming problem with a relatively small number of degrees of freedom, more precisely: three for case (i) time-to-rendezvous free and two for case (ii) time-to-rendezvous given. In particular, we consider the rendezvous between the Space Shuttle (chaser) and the International Space Station (target). Once a given initial distance SS-to-ISS is preselected, the present work supplies not only the best initial conditions for the rendezvous trajectory, but simultaneously the corresponding final conditions for the ascent trajectory.     

Application of the sequential gradient-restoration algorithm to thermal convective instability problems

The problem of the thermal stability of a horizontal incompressible fluid layer with linear and nonlinear temperature distributions is solved by using the sequential gradient-restoration algorithm developed for optimal control problems. The hydrodynamic boundary conditions for the layer include a rigid or free upper surface and a rigid lower surface. The resulting disturbing equations are solved as a Bolza problem in the calculus of variations. The results of the study are compared with the existing works in the literature.The authors acknowledge valuable discussions with Dr. A. Miele.     

Optimal control of systems governed by a class of nonlinear evolution equations in a reflexive Banach space

The paper presents a closure theorem for the attainable trajectories of a class of control systems governed by a large class of nonlinear evolution equations in reflexive Banach spaces. Several existence theorems for optimal controls are proven that include a terminal control problem, a time-optimal control problem, and a special Bolza problem. Some results of independent interest are also presented.This work was supported in part by the National Research Council of Canada under Grant No. 7109.The authors would like to thank Professor L. Cesari for pointing out that joint continuity off is required for the setsG andR to satisfy the upper semicontinuity property (Theorems 5.1 and 5.2).     

Numerical Computation of Optimal Trajectories for Coplanar, Aeroassisted Orbital Transfer

This paper is concerned with the problem of the optimal coplanaraeroassisted orbital transfer of a spacecraft from a high Earth orbitto a low Earth orbit. It is assumed that the initial and final orbits arecircular and that the gravitational field is central and is governed by theinverse square law. The whole trajectory is assumed to consist of twoimpulsive velocity changes at the begin and end of one interior atmosphericsubarc, where the vehicle is controlled via the lift coefficient.The problem is reduced to the atmospheric part of the trajectory, thusarriving at an optimal control problem with free final time and liftcoefficient as the only (bounded) control variable. For this problem,the necessary conditions of optimal control theory are derived. Applyingmultiple shooting techniques, two trajectories with different controlstructures are computed. The first trajectory is characterized by a liftcoefficient at its minimum value during the whole atmospheric pass. For thesecond trajectory, an optimal control history with a boundary subarcfollowed by a free subarc is chosen. It turns out, that this secondtrajectory satisfies the minimum principle, whereas the first one fails tosatisfy this necessary condition; nevertheless, the characteristicvelocities of the two trajectories differ only in the sixth significantdigit.In the second part of the paper, the assumption of impulsive velocitychanges is dropped. Instead, a more realistic modeling with twofinite-thrust subarcs in the nonatmospheric part of the trajectory isconsidered. The resulting optimal control problem now describes the wholemaneuver including the nonatmospheric parts. It contains as controlvariables the thrust, thrust angle, and lift coefficient. Further,the mass of the vehicle is treated as an additional state variable. For thisoptimal control problem, numerical solutions are presented. They are comparedwith the solutions of the impulsive model.     

Epi-convergent discretization of the generalized Bolza problem in dynamic optimization

The paper is devoted to well-posed discrete approximations of the so-called generalized Bolza problem of minimizing variational functionals defined via extended-real-valued functions. This problem covers more conventional Bolza-type problems in the calculus of variations and optimal control of differential inclusions as well of parameterized differential equations. Our main goal is find efficient conditions ensuring an appropriate epi-convergence of discrete approximations, which plays a significant role in both the qualitative theory and numerical algorithms of optimization and optimal control. The paper seems to be the first attempt to study epi-convergent discretizations of the generalized Bolza problem; it establishes several rather general results in this direction. Research of B. S. Mordukhovich was partially supported by the USA National Science Foundation under grants DMS-0304989 and DMS-0603846 and by the Australian Research Council under grant DP-0451168. Research of T. Pennanen was supported by the Finnish Academy of Sciences under contract No. 3385.     

Abort landing in the presence of windshear as a minimax optimal control problem,part 1: Necessary conditions

The landing of a passenger aircraft in the presence of windshear is a threat to aviation safety. The present paper is concerned with the abort landing of an aircraft in such a serious situation. Mathematically, the flight maneuver can be described by a minimax optimal control problem. By transforming this minimax problem into an optimal control problem of standard form, a state constraint has to be taken into account which is of order three. Moreover, two additional constraints, a first-order state constraint and a control variable constraint, are imposed upon the model. Since the only control variable appears linearly, the Hamiltonian is not regular. Thus, well-known existence theorems about the occurrence of boundary arcs and boundary points cannot be applied. Numerically, this optimal control problem is solved by means of the multiple shooting method in connection with an appropriate homotopy strategy. The solution obtained here satisfies all the sharp necessary conditions including those depending on the sign of certain multipliers. The trajectory consists of bang-bang and singular subarcs, as well as boundary subarcs induced by the two state constraints. The occurrence of boundary arcs is known to be impossible for regular Hamiltonians and odd-ordered state constraints if the order exceeds two. Additionally, a boundary point also occurs where the third-order state constraint is active. Such a situation is known to be the only possibility for odd-ordered state constraints to be active if the order exceeds two and if the Hamiltonian is regular. Because of the complexity of the optimal control, this single problem combines many of the features that make this kind of optimal control problems extremely hard to solve. Moreover, the problem contains nonsmooth data arising from the approximations of the aerodynamic forces and the distribution of the wind velocity components. Therefore, the paper can serve as some sort of user's guide to solve inequality constrained real-life optimal control problems by multiple shooting.An extended abstract of this paper was presented at the 8th IFAC Workshop on Control Applications of Nonlinear Programming and Optimization, Paris, France, 1989 (see Ref. 1).This paper is dedicated to Professor Hans J. Stetter on the occasion of his 60th birthday.     

Abort landing in windshear: Optimal control problem with third-order state constraint and varied switching structure

Optimal abort landing trajectories of an aircraft under different windshear-downburst situations are computed and discussed. In order to avoid an airplane crash due to severe winds encountered by the aircraft during the landing approach, the minimum altitude obtained during the abort landing maneuver is to be maximized. This maneuver is mathematically described by a Chebyshev optimal control problem. By a transformation to an optimal control problem of Mayer type, an additional state variable inequality constraint for the altitude has to be taken into account; here, its order is three. Due to this altitude constraint, the optimal trajectories exhibit, depending on the windshear parameters, up to four touch points and also up to one boundary arc at the minimum altitude level. The control variable is the angle of attack time rate which enters the equations of motion linearly; therefore, the Hamiltonian of the problem is nonregular. The switching structures also includes up to three singular subarcs and up to two boundary subarcs of an angle of attack constraint of first order. This structure can be obtained by applying some advanced necessary conditions of optimal control theory in combination with the multiple-shooting method. The optimal solutions exhibit an oscillatory behavior, reaching the minimum altitude level several times. By the optimization, the maximum survival capability can also be determined; this is the maximum wind velocity difference for which recovery from windshear is just possible. The computed optimal trajectories may serve as benchmark trajectories, both for guidance laws that are desirable to approach in actual flight and for optimal trajectories may then serve as benchmark trajectories both for guidance schemes and also for numerical methods for problems of optimal control.This paper is dedicated to Professor George Leitmann on the occasion of his seventieth birthday.     

Anchoring conditions for the sequential gradient-restoration algorithm and the modified quasilinearization algorithm for optimal control problems with bounded state

In Refs. 1–2, the sequential gradient-restoration algorithm and the modified quasilinearization algorithm were developed for optimal control problems with bounded state. These algorithms have a basic property: for a subarc lying on the state boundary, the state boundary equations are satisfied at every iteration, if they are satisfied at the beginning of the computational process. Thus, the subarc remains anchored on the state boundary. In this paper, the anchoring conditions employed in Refs. 1–2 are derived.This research was supported by the Office of Scientific Research, Office of Aerospace Research, United States Air Force, Grant No. AF-AFOSR-72-2185.     

An extended beam theory for smart materials applications part I: Extended beam models,duality theory,and finite element simulations

An extended theory for elastic and plastic beam problems is studied. By introducing new dependent and independent variables, the standard Timoshenko beam model is extended to take account of shear variation in the lateral direction. The dynamic governing equations are established via Hamilton's principle, and existence and uniqueness results for the solution of the static problem are proved. Using the theory of convex analysis, the duality theory for the extended beam model is developed. Moreover, the extended theory for rigid-perfectly plastic beams is also established. Based on the extended model, a finite-element method is proposed and numerical results are obtained indicating the usefulness of the extended theory in applications.The work of the first author was supported in part by National Science Foundation under Grant DMS9400565.     

Riccati equations for generalized singular estimate control systems

We consider the Bolza problem associated with boundary/point control systems governed by strongly continuous semigroups. In continuation of our work in Lasiecka and Tuffaha [I. Lasiecka and A. Tuffaha, Riccati equations for the Bolza problem arising in boundary/point control problems governed by C ₀–semigroups satisfying a singular estimate, J. Optim. Theory Appl. 136 (2008), pp. 229–246; I. Lasiecka and A. Tuffaha, A Bolza optimal synthesis problem for singular estimate control systems, Control Cybernet 38(4B) (2009), pp. 1429–1460], we yet extend the theory to a more general class of control problems that are not analytic providing sharp blow-up rates for the regularity. Solvability of the associated Riccati equations and an optimal feedback synthesis are established. The presence of unbounded control actions, such as boundary/point controls, naturally lead to a singularity at the terminal point t?=?T of the optimal control and of the corresponding feedback operator as before. The class of control systems considered in this article is a generalization to the class usually referred to in the literature as ‘Singular Estimate Control Systems’. The prototype is still that of a PDE system consisting of coupled hyperbolic parabolic dynamics interacting on an interface with point/boundary control. The distinct feature of the class considered in this article is that the degree of unboundedness in the control is stronger than that allowed in the usual singular estimate control system configuration, giving rise to less regular optimal state trajectories.     

Recent advances in gradient algorithms for optimal control problems

This paper summarizes recent advances in the area of gradient algorithms for optimal control problems, with particular emphasis on the work performed by the staff of the Aero-Astronautics Group of Rice University. The following basic problem is considered: minimize a functionalI which depends on the statex(t), the controlu(t), and the parameter π. Here,I is a scalar,x ann-vector,u anm-vector, and π ap-vector. At the initial point, the state is prescribed. At the final point, the statex and the parameter π are required to satisfyq scalar relations. Along the interval of integration, the state, the control, and the parameter are required to satisfyn scalar differential equations. First, the sequential gradient-restoration algorithm and the combined gradient-restoration algorithm are presented. The descent properties of these algorithms are studied, and schemes to determine the optimum stepsize are discussed. Both of the above algorithms require the solution of a linear, two-point boundary-value problem at each iteration. Hence, a discussion of integration techniques is given. Next, a family of gradient-restoration algorithms is introduced. Not only does this family include the previous two algorithms as particular cases, but it allows one to generate several additional algorithms, namely, those with alternate restoration and optional restoration. Then, two modifications of the sequential gradient-restoration algorithm are presented in an effort to accelerate terminal convergence. In the first modification, the quadratic constraint imposed on the variations of the control is modified by the inclusion of a positive-definite weighting matrix (the matrix of the second derivatives of the Hamiltonian with respect to the control). The second modification is a conjugate-gradient extension of the sequential gradient-restoration algorithm. Next, the addition of a nondifferential constraint, to be satisfied everywhere along the interval of integration, is considered. In theory, this seems to be only a minor modification of the basic problem. In practice, the change is considerable in that it enlarges dramatically the number and variety of problems of optimal control which can be treated by gradient-restoration algorithms. Indeed, by suitable transformations, almost every known problem of optimal control theory can be brought into this scheme. This statement applies, for instance, to the following situations: (i) problems with control equality constraints, (ii) problems with state equality constraints, (iii) problems with equality constraints on the time rate of change of the state, (iv) problems with control inequality constraints, (v) problems with state inequality constraints, and (vi) problems with inequality constraints on the time rate of change of the state. Finally, the simultaneous presence of nondifferential constraints and multiple subarcs is considered. The possibility that the analytical form of the functions under consideration might change from one subarc to another is taken into account. The resulting formulation is particularly relevant to those problems of optimal control involving bounds on the control or the state or the time derivative of the state. For these problems, one might be unwilling to accept the simplistic view of a continuous extremal arc. Indeed, one might want to take the more realistic view of an extremal arc composed of several subarcs, some internal to the boundary being considered and some lying on the boundary. The paper ends with a section dealing with transformation techniques. This section illustrates several analytical devices by means of which a great number of problems of optimal control can be reduced to one of the formulations presented here. In particular, the following topics are treated: (i) time normalization, (ii) free initial state, (iii) bounded control, and (iv) bounded state.     

Transversality condition and optimization of higher order ordinary differential inclusions

In the present paper, a Bolza problem of optimal control theory with a fixed time interval given by convex and nonconvex second-order differential inclusions (P_H) is studied. Our main goal is to derive sufficient optimality conditions for Cauchy problem of sth-order differential inclusions. The sufficient conditions including distinctive transversality condition are proved incorporating the Euler–Lagrange and Hamiltonian type inclusions. The basic concepts involved in obtaining optimality conditions are the locally adjoint mappings. Furthermore, the application of these results is demonstrated by solving the problems with third-order differential inclusions.     

On the Relation Between Two Approaches to Necessary Optimality Conditions in Problems with State Constraints

We consider a class of optimal control problems with a state constraint and investigate a trajectory with a single boundary interval (subarc). Following R.V. Gamkrelidze, we differentiate the state constraint along the boundary subarc, thus reducing the original problem to a problem with mixed control-state constraints, and show that this way allows one to obtain the full system of stationarity conditions in the form of A.Ya. Dubovitskii and A.A. Milyutin, including the sign definiteness of the measure (state constraint multiplier), i.e., the nonnegativity of its density and atoms at junction points. The stationarity conditions are obtained by a two-stage variation approach, proposed in this paper. At the first stage, we consider only those variations, which do not affect the boundary interval, and obtain optimality conditions in the form of Gamkrelidze. At the second stage, the variations are concentrated on the boundary interval, thus making possible to specify the stationarity conditions and obtain the sign of density and atoms of the measure.     

Function-space quasi-Newton algorithms for optimal control problems with bounded controls and singular arcs

Two existing function-space quasi-Newton algorithms, the Davidon algorithm and the projected gradient algorithm, are modified so that they may handle directly control-variable inequality constraints. A third quasi-Newton-type algorithm, developed by Broyden, is extended to optimal control problems. The Broyden algorithm is further modified so that it may handle directly control-variable inequality constraints. From a computational viewpoint, dyadic operator implementation of quasi-Newton methods is shown to be superior to the integral kernel representation. The quasi-Newton methods, along with the steepest descent method and two conjugate gradient algorithms, are simulated on three relatively simple (yet representative) bounded control problems, two of which possess singular subarcs. Overall, the Broyden algorithm was found to be superior. The most notable result of the simulations was the clear superiority of the Broyden and Davidon algorithms in producing a sharp singular control subarc.This research was supported by the National Science Foundation under Grant Nos. GK-30115 and ENG 74-21618 and by the National Aeronautics and Space Administration under Contract No. NAS 9-12872.