Computational Methods In Optimal Control Problems(1st Edition)

Authors:

I H Mufti

Type:Hardcover/ PaperBack / Loose Leaf
Condition: Used/New

In Stock: 1 Left

Shipment time

Expected shipping within 2 - 3 Days
Access to 35 Million+ Textbooks solutions Free
Ask Unlimited Questions from expert AI-Powered Answers 30 Min Free Tutoring Session
7 days-trial

Total Price:

$0

List Price: $54.99 Savings: $54.99 (100%)
Access to 30 Million+ solutions
Ask 50 Questions from expert AI-Powered Answers 24/7 Tutor Help Detailed solutions for Computational Methods In Optimal Control Problems

Price:

$9.99

/month

Book details

ISBN: 3540049517, 978-3540049517

Book publisher: Springer

Offer Just for You!: Buy 2 books before the end of January and enter our lucky draw.

Book Price $0 : The Purpose Of This Modest Report Is To Present In A Simplified Manner Some Of The Computational Methods That Have Been Developed In The Last Ten Years For The Solution Of Optimal Control Problems. Only Those Methods That Are Based On The Minimum (maximum) Principle Of Pontriagin Are Discussed Here. The Autline Of The Report Is As Follows: In The First Two Sections A Control Problem Of Bolza Is Formulated And The Necessary Conditions In The Form Of The Minimum Principle Are Given. The Method Of Steepest Descent And A Conjugate Gradient-method Are Dis­ Cussed In Section 3. In The Remaining Sections, The Successive Sweep Method, The Newton-Raphson Method And The Generalized Newton-Raphson Method (also Called Quasilinearization Method) Ar~ Presented From A Unified Approach Which Is Based On The Application Of Newton­ Raphson Approximation To The Necessary Conditions Of Optimality. The Second-variation Method And Other Shooting Methods Based On Minimizing An Error Function Are Also Considered. TABLE OF CONTENTS 1. 0 INTRODUCTION 1 2. 0 NECESSARY CONDITIONS FOR OPTIMALITY �������� 2 3. 0 THE GRADIENT METHOD 4 3. 1 Min H Method And Conjugate Gradient Method �. ���������. . . . ������. ��������. � 8 3. 2 Boundary Constraints �����������. ����. � 9 3. 3 Problems With Control Constraints ��. �� 15 4. 0 SUCCESSIVE SWEEP METHOD �������������������� 18 4. 1 Final Time Given Implicitly ����. ������ 22 5. 0 SECOND-VARIATION METHOD �������������������� 23 6. 0 SHOOTING METHODS ��������������������������� 27 6. 1 Newton-RaphsonMethod ����������������� 27 6.