Skip to main content

Issues in the Direct Transcription of Optimal Control Problems to Sparse Nonlinear Programs

  • Chapter

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

Abstract

Direct transcription of an optimal control problem into a sparse nonlinear programming problem requires analysis of the interaction between discretization, sparsity, and algorithm efficiency. The relative merits of various discretization techniques with regard to accuracy of the solution and efficiency of the sparse linear algebra and nonlinear program will be presented. Construction of gradient and Hessian information for the nonlinear program will be described. Issues affecting the nonlinear program algorithm strategy will be discussed.

Invited Paper

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ascher, U., Christiansen, J., and Russell, R., ‘Collocation Software for Boundary-Value ODEs,’ ACM Transactions on Mathematical Software, Vol. 7, No. 2, June 1981, pp. 209–222.

    Article  MATH  Google Scholar 

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

    MATH  Google Scholar 

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

    Google Scholar 

  4. Battin, R.H. An Introduction to the Mathematics and Methods of Astrodynamics, AIAA Education Series, American Institute of Aeronautics and Astronautics, Inc., 1633 Broadway, New York, NY 10019.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  7. Betts, J.T., and Huffman, W.P., ‘The Application of Sparse Nonlinear Programming to Trajectory Optimization,’ Journal of Guidance, Control, and Dynamics, Vol. 15, No. 1, Jan-Feb, 1992.

    Google Scholar 

  8. Betts, J.T., and Huffman, W.P., ‘Path Constrained Trajectory Optimization Using Sparse Sequential Quadratic Programming,’ Journal of Guidance, Control, and Dynamics, Vol. 16, No. 1, Jan-Feb, 1993, pp. 59–68.

    Article  MATH  Google Scholar 

  9. Betts, J.T., ‘Using Sparse Nonlinear Programming to Compute Low Thrust Orbit Transfers,’ Journal of the Astronautical Sciences, to appear.

    Google Scholar 

  10. Betts, J.T. and Huffman, W.P., ‘Accuracy Refinement in Transcription Methods for Optimal Control,’ BCSTECH-93-006, Boeing Computer Services, P.O. Box 24346–0346, MS 7L-68, Seattle, WA 98124.

    Google Scholar 

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

    Google Scholar 

  12. Enright, P.J., and Conway, B.A. ’Optimal Finite-Thrust Spacecraft Trajectories Using Collocation and Nonlinear Programming,’ Journal of Guidance, Control, and Dynamics, Vol. 14, No. 5, 1991, pp. 981–985.

    Article  Google Scholar 

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

    Google Scholar 

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

    Article  MATH  Google Scholar 

  15. Kechichian, J.A., ‘Trajectory Optimization with a Modified Set of Equinoctial Orbit Elements,’ Paper AAS 91–524, AAS/AIAA Astrodynamics Specialist Conference, Durango, CO, Aug. 19–22, 1991

    Google Scholar 

  16. Kraft, D., ‘On Converting Optimal Control Problems Into Nonlinear Programming Problems,’ NATO ASI Series Vol. F15, Computational Mathematical Programming, Springer-Verlag, 1985.

    Google Scholar 

  17. Zondervan, K.P., Wood, L.J., and Caughy, T.K, ‘Optimal Low-Thrust, Three-Burn Orbit Transfers with Large Plane Changes,’ The Journal of the Astro-nautical Sciences, Vol. 32, No. 3, July-Sept., 1984, pp. 407–427.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Birkhäuser Verlag Basel

About this chapter

Cite this chapter

Betts, J.T. (1994). Issues in the Direct Transcription of Optimal Control Problems to Sparse Nonlinear Programs. In: Bulirsch, R., Kraft, D. (eds) Computational Optimal Control. ISNM International Series of Numerical Mathematics, vol 115. Birkhäuser Basel. https://doi.org/10.1007/978-3-0348-8497-6_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-8497-6_1

  • Publisher Name: Birkhäuser Basel

  • Print ISBN: 978-3-7643-5015-4

  • Online ISBN: 978-3-0348-8497-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics