Efficient Sequential Quadratic Programming Implementations for Equality-Constrained Discrete-Time Optimal Control

Efficient sequential quadratic programming (SQP) implementations are presented for equality-constrained, discrete-time, optimal control problems. The algorithm developed calculates the search direction for the equality-based variant of SQP and is applicable to problems with either fixed or free final time. Problem solutions are obtained by solving iteratively a series of constrained quadratic programs. The number of mathematical operations required for each iteration is proportional to the number of discrete times N. This is contrasted by conventional methods in which this number is proportional to N3. The algorithm results in quadratic convergence of the iterates under the same conditions as those for SQP and simplifies to an existing dynamic programming approach when there are no constraints and the final time is fixed. A simple test problem and two application problems are presented. The application examples include a satellite dynamics problem and a set of brachistochrone problems involving viscous friction.

[1]  Sidney J. Yakowitz,et al.  The application of optimal control methodology to nonlinear programming problems , 1981, Math. Program..

[2]  D. Bertsekas,et al.  Efficient dynamic programming implementations of Newton's method for unconstrained optimal control problems , 1989 .

[3]  Bruce W. Char,et al.  First Leaves: A Tutorial Introduction to Maple V , 1992 .

[4]  A projected Newton method in a Cartesian product of balls , 1988 .

[5]  J. Junkins,et al.  Optimal Continuous Torque Attitude Maneuvers , 1978 .

[6]  D. Mayne.  A Second-order Gradient Method for Determining Optimal Trajectories of Non-linear Discrete-time Systems , 1966 .

[7]  D. Jacobson,et al.  A discrete-time differential dynamic programming algorithm with application to optimal orbit transfer , 1970 .

[8]  J. Pantoja,et al.  Differential dynamic programming and Newton's method , 1988 .

[9]  Gene H. Golub,et al.  Matrix computations , 1983 .

[10]  S. Sen,et al.  Sequential rank-one/rank-two updates for Quasi-Newton differential dynamic programming , 1990 .

[11]  Philip E. Gill,et al.  Practical optimization , 1981 .

[12]  S. Yakowitz,et al.  Differential dynamic programming and Newton's method for discrete optimal control problems , 1984 .

[13]  J. Dunn.  A projected Newton method for minimization problems with nonlinear inequality constraints , 1988 .

[14]  K. Ohno.  Differential dynamic programming and separable programs , 1978 .

[15]  D. Mayne,et al.  Sequential quadratic programming algorithm for discrete optimal control problems with control inequality constraints , 1991 .

[16]  K. Ohno.  A new approach to differential dynamic programming for discrete time systems , 1978 .

[17]  L. Liao,et al.  Convergence in unconstrained discrete-time differential dynamic programming , 1991 .

[18]  S. Sen,et al.  A quasi-newton differential dynamic programming algorithm for discrete-time optimal control , 1987, Autom..

[19]  M. Forray,et al.  Variational Calculus in Science and Engineering , 1968 .

[20]  Stephen J. Wright.  Interior point methods for optimal control of discrete time systems , 1993 .

[21]  J. W. Humberston.  Classical mechanics , 1980, Nature.