Practical Direct Collocation Methods for Computational Optimal Control

The development of numerical methods for optimal control and, specifically, trajectory optimisation, has been correlated with advances in the fields of space exploration and digital computing. Space exploration presented scientists and engineers with challenging optimal control problems. Specialised numerical methods implemented in software that runs on digital computers provided the means for solving these problems. This chapter gives an introduction to direct collocation methods for computational optimal control. In a direct collocation method, the state is approximated using a set of basis functions, and the dynamics are collocated at a given set of points along the time interval of the problem, resulting in a sparse nonlinear programming problem. This chapter concentrates on local direct collocation methods, which are based on low-order basis functions employed to discretise the state variables over a time segment. This chapter includes sections that discuss important practical issues such as multi-phase problems, sparse nonlinear programming solvers, efficient differentiation, measures of accuracy of the discretisation, mesh refinement, and potential pitfalls. A space relevant example is given related to a four-phase vehicle launch problem.

[1]  Suresh P. Sethi,et al.  A Survey of the Maximum Principles for Optimal Control Problems with State Constraints , 1995, SIAM Rev..

[2]  William W. Hager,et al.  Runge-Kutta methods in optimal control and the transformed adjoint system , 2000, Numerische Mathematik.

[3]  Michael A. Saunders,et al.  SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization , 2005, SIAM Rev..

[4]  M. Powell,et al.  On the Estimation of Sparse Jacobian Matrices , 1974 .

[5]  David Benson,et al.  A Gauss pseudospectral transcription for optimal control , 2005 .

[6]  Stephen L. Campbell,et al.  Adjoint estimation using direct transcription multipliers: compressed trapezoidal method , 2008 .

[7]  G. Thompson,et al.  Optimal Control Theory: Applications to Management Science and Economics , 2000 .

[8]  Arthur E. Bryson,et al.  Applied Optimal Control , 1969 .

[9]  Victor M. Becerra,et al.  Solving complex optimal control problems at no cost with PSOPT , 2010, 2010 IEEE International Symposium on Computer-Aided Control System Design.

[10]  Lorenz T. Biegler,et al.  On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming , 2006, Math. Program..

[11]  Anil V. Rao,et al.  Practical Methods for Optimal Control Using Nonlinear Programming , 1987 .

[12]  Ernst Hairer,et al.  Solving Ordinary Differential Equations I: Nonstiff Problems , 2009 .

[13]  John T. Betts,et al.  Optimal Low Thrust Trajectories to the Moon , 2003, SIAM J. Appl. Dyn. Syst..

[14]  D. Luenberger Optimization by Vector Space Methods , 1968 .

[15]  John T. Betts,et al.  Practical Methods for Optimal Control and Estimation Using Nonlinear Programming , 2009 .

[16]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[17]  Gamal N. Elnagar,et al.  The pseudospectral Legendre method for discretizing optimal control problems , 1995, IEEE Trans. Autom. Control..

[18]  Robert J. Vanderbei,et al.  An Interior-Point Algorithm for Nonconvex Nonlinear Programming , 1999, Comput. Optim. Appl..