Abstract

This chapter discusses the algorithms to solve trajectory optimization problems. It reviews the basic variational concepts and discusses indirect methods for the solution of optimization problems. The chapter also provides an overview on gradient methods, the second variation method, and the generalized Newton–Raphson method. It presents the comparison of the different methods and discusses the application of the latter three methods to a specific example. The mathematical rigor of theorem-proof has been compromised for a more heuristic development so that the over-all presentation is more informative to the practicing engineer. The chapter discusses singular subarcs, the Jacobi condition, corners of transversal surfaces, mixed control and state constraints, state constraints, and relaxed variational problems. It also discusses the advantages and disadvantages of indirect methods, gradient methods, second variation methods, and generalized Newton-Raphson methods.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.