Skip to main content

Trajectory Optimization Using Sparse Sequential Quadratic Programming

  • Chapter
Optimal Control

Part of the book series: ISNM International Series of Numerical Mathematics ((ISNM,volume 111))

Abstract

One of the most effective numerical techniques for the solution of trajectory optimization and optimal control problems is the direct transcription method. This approach combines a nonlinear programming algorithm with a discretization of the trajectory dynamics. The resulting mathematical programming problem is characterized by matrices which are large and sparse. Constraints on the path of the trajectory are then treated as algebraic inequalities to be satisfied by the nonlinear program. This paper describes a nonlinear programming algorithm which exploits the matrix sparsity produced by the transcription formulation. Numerical experience is reported for trajectories with both state and control variable equality and inequality path constraints.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Ashcraft, C.C., and Grimes, R.G. (1988). ‘The Influence of Relaxed Supernode Partitions on the Multifrontal Method,’ Boeing Computer Services Technical Report ETA-TR-60.

    Google Scholar 

  • Ascher, U., Mattheij, R., and Russell, R.D. (1988). Numerical Solution of Boundary Value Problems for Ordinary Differential Equations, Prentice Hall, Englewood Cliffs, N.J.

    Google Scholar 

  • Betts, J.T. (1990). ‘Sparse Jacobian Updates in the Collocation Method for Optimal Control Problems,’ Journal of Guidance, Control, and Dynamics, Vol. 13, No. 3, May-June.

    Google Scholar 

  • Betts, J.T., and Huffman, W.P. (1991a). ‘Trajectory Optimization on a Parallel Processor,’ Journal of Guidance, Control, and Dynamics, Vol. 14, No. 2, March-April.

    Google Scholar 

  • Betts, J.T., and Huffman, W.P. (1991b). ‘Path Constrained Trajectory Optimization Using Sparse Sequential Quadratic Programming,’ AIAA-91–2739-CP, pp 1236–1259, Proceedings of the AIAA Guidance, Navigation, and Control Conference, New Orleans, LA.

    Google Scholar 

  • Betts, J.T., and Huffman, W.P. (1992). ‘Application of Sparse Nonlinear Programming to Trajectory Optimization,’ Journal of Guidance, Control, and Dynamics, Vol 15, No. 1, January-February.

    Google Scholar 

  • Bryson, A.E., Desai, M.N., and Hoffman, W.C., (1969)]. ‘Energy-State Approximation in Performance Optimization of Supersonic Aircraft,’ Journal of Aircraft, Vol. 6, No. 6, Nov-Dec.

    Google Scholar 

  • Bulirsch, R., Montrone, F., and Pesch, H.J. (1991). ‘Abort Landing in the Presence of Windshear as a Minimax Optimal Control Problem, Part 2: Multiple Shooting and Homotopy,’ Journal of Optimization Theory and Applications, Vol 70, No. 2, pp 223–254, August.

    Google Scholar 

  • Dickmanns, E.D., (1980). ‘Efficient Convergence and Mesh Refinement Strategies for Solving General Ordinary Two-Point Boundary Value Problems by Collocated Hermite Approximation,’ 2nd IFAC Workshop on Optimisation, Oberpfaffenhofen, Sept. 15–17.

    Google Scholar 

  • Enright, P.J. (1991). ‘Optimal Finite-Thrust Spacecraft Trajectories Using Direct Transcription and Nonlinear Programming,’ Ph.D. Thesis, University of Illinois.

    Google Scholar 

  • Gill, P.E., Murray, W., and Wright, M.H., (1981). Practical Optimization, Academic Press.

    Google Scholar 

  • Gill, P.E., Murray, W., Saunders, M.A., and Wright, M.H., (1986a). ‘User’s Guide for NPSOL (Version 4.0): a Fortran package for nonlinear programming,’ Report SOL 86–2, Department of Operations Research, Stanford University.

    Google Scholar 

  • Gill, P.E., Murray, W., Saunders, M.A., and Wright, M.H., (1986b). ‘Some Theoretical Properties of an Augmented Lagrangian Merit Function’, Report SOL 86–6, Department of Operations Research, Stanford University.

    Google Scholar 

  • Gill, P.E., Murray, W., Saunders, M.A., and Wright, M.H., (1987). ‘A Schur-Complement Method for Sparse Quadratic Programming,’ Report SOL 87–12, Department of Operations Research, Stanford University.

    Google Scholar 

  • Hargraves, C.R., and S.W. Paris, (1987). ‘Direct Trajectory Optimization Using Nonlinear Programming and Collocation,’ J. of Guidance, Control, and Dynamics, Vol. 10, No.4, July-Aug, p338.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Birkhäuser Verlag

About this chapter

Cite this chapter

Betts, J.T. (1993). Trajectory Optimization Using Sparse Sequential Quadratic Programming. In: Bulirsch, R., Miele, A., Stoer, J., Well, K. (eds) Optimal Control. ISNM International Series of Numerical Mathematics, vol 111. Birkhäuser Basel. https://doi.org/10.1007/978-3-0348-7539-4_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-7539-4_9

  • Publisher Name: Birkhäuser Basel

  • Print ISBN: 978-3-0348-7541-7

  • Online ISBN: 978-3-0348-7539-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics