SlideShare a Scribd company logo
1 of 41
OPTIMAL and MULTIVARIABLE
CONTROLS
LECTURE # 11
THE VARIATIONAL APPROACH TO
OPTIMAL CONTROL PROBLEMS
Necessary Conditions for Optimal
Control
• Problem
• Assumptions
– Admissible states and controls are not bounded.
– Initial state x(t0)=x0 and initial time t0 are specified.
– x is an nx1 vector and u is mx1 vector.
Necessary Conditions for Optimal
Control
• Previously, the following problem was considered
• In control problems the trajectory is determined by the
control u
– We wish to consider functionals of n + m functions
– Only m are independent known as controls
– Function must satisfy ‘n’ different. equation constraints given in 5.1-1
• The difference between cost function given in 5.1-2 and
previously considered functional is of is term involving final
state and time i.e.,
• Assuming h is differential, it can be rewritten as
• The performance measure can now be expressed as
• Define
• To determine variation of Ja, the variations
are introduced.
Necessary Conditions for Optimal Control
• Consider the terms involving h
Necessary Conditions for Optimal Control
• In the integral term we have
Boundary Conditions
• To determine boundary conditions 5.1-18
needs to be modified accordingly.
• In all cases it is assumed that we have the n
equations
• The following boundary problems are
discussed
– Problems with fixed final time.
– Problems with free final time.
Problems with Fixed Final Time
• Different scenarios might occur such as
• CASE 1 FINAL STATE SPECIFIED
Example 5.1-1
Example 5.1-1 (a)
Example 5.1-1 (a)
Problems with Fixed Final Time
• CASE 2 FINAL STATE FREE
Example 5.1-1 (b)
Example 5.1-1 (b)
Problems with Fixed Final Time
• CASE 3 FINAL STATE LYING ON A SURFACE DEFINED
BY m(x(t))=0
• Example
– Suppose that the final state
of a second order system is
required to lie on a circle
– The admissible changes in x(tf)
are tangent to the circle at point
CASE 3 FINAL STATE LYING ON A SURFACE
DEFINED BY m(x(t))=0
• The tangent line is normal to the gradient vector
CASE 3 FINAL STATE LYING ON A
SURFACE DEFINED BY m(x(t))=0
5.1-18
CASE 3 FINAL STATE LYING ON A
SURFACE DEFINED BY m(x(t))=0
• Generalized Case
• Each component of m represents a hyper-surface in the n-dimensional
state space.
• Thus, the final state lies on the intersection of the k hyper-surfaces.
• is tangent/ normal to the each of the hyper-surface at the point
Example 5.1-1 (c)
Example 5.1-1 (c)
Problems with Free Final Time
• If final time is free several situations might occur
1. Final state fixed
2. Final state free
3. x(tf) lying on a moving point
4. Final state lying on a surface defined by
m(x(t))=0
5. Final state lying on a moving surface defined by
m(x(t))=0
Case 1 Final State Fixed with Free Final Time
Case 2 Final State Free with Free Final Time
Case 3 x(tf) lying on a moving point
with Free Final Time
Table 5-1
Case 4 Final state lying on a surface
defined by m(x(t))=0
Case 4 Final state lying on a surface
defined by m(x(t))=0
Case 4 Final state lying on a surface
defined by m(x(t))=0
Case 4 Final state lying on a surface
defined by m(x(t))=0
Generalized Case
• Each component of m describes a hyper surface in the n-
dimensional state space.
• The final state lies at the intersection of the hyper
surfaces defined by m.
• ᵟxf is (to first order) tangent to each of the hyper surfaces
at the point x*(tf,tf)
Generalized Case
• Thus, ᵟxf is normal to each of the gradient vectors
which are assumed to be linearly independent
• The (2n+k+1) equations are

More Related Content

Similar to lec11_OPTIMAL and MULTIVARIABLE CONTROLS.pptx

머피의 머신러닝: 17장 Markov Chain and HMM
머피의 머신러닝: 17장  Markov Chain and HMM머피의 머신러닝: 17장  Markov Chain and HMM
머피의 머신러닝: 17장 Markov Chain and HMM
Jungkyu Lee
 
Erin catto numericalmethods
Erin catto numericalmethodsErin catto numericalmethods
Erin catto numericalmethods
oscarbg
 

Similar to lec11_OPTIMAL and MULTIVARIABLE CONTROLS.pptx (20)

Modern control 2
Modern control 2Modern control 2
Modern control 2
 
Laplace transform
Laplace transformLaplace transform
Laplace transform
 
Friedrichs1958
Friedrichs1958Friedrichs1958
Friedrichs1958
 
Tutorfly Review Session Math 31A
Tutorfly Review Session Math 31ATutorfly Review Session Math 31A
Tutorfly Review Session Math 31A
 
Maths 3 ppt
Maths 3 pptMaths 3 ppt
Maths 3 ppt
 
머피의 머신러닝: 17장 Markov Chain and HMM
머피의 머신러닝: 17장  Markov Chain and HMM머피의 머신러닝: 17장  Markov Chain and HMM
머피의 머신러닝: 17장 Markov Chain and HMM
 
An overview of Hidden Markov Models (HMM)
An overview of Hidden Markov Models (HMM)An overview of Hidden Markov Models (HMM)
An overview of Hidden Markov Models (HMM)
 
Recursive State Estimation AI for Robotics.pdf
Recursive State Estimation AI for Robotics.pdfRecursive State Estimation AI for Robotics.pdf
Recursive State Estimation AI for Robotics.pdf
 
Mit2 092 f09_lec07
Mit2 092 f09_lec07Mit2 092 f09_lec07
Mit2 092 f09_lec07
 
Chemical kinetics
Chemical kineticsChemical kinetics
Chemical kinetics
 
Numerical method for pricing american options under regime
Numerical method for pricing american options under regime Numerical method for pricing american options under regime
Numerical method for pricing american options under regime
 
lecture1 (9).ppt
lecture1 (9).pptlecture1 (9).ppt
lecture1 (9).ppt
 
Conversion of transfer function to canonical state variable models
Conversion of transfer function to canonical state variable modelsConversion of transfer function to canonical state variable models
Conversion of transfer function to canonical state variable models
 
Linear Transformations_part1.pdf
Linear Transformations_part1.pdfLinear Transformations_part1.pdf
Linear Transformations_part1.pdf
 
Z transfrm ppt
Z transfrm pptZ transfrm ppt
Z transfrm ppt
 
Fourier transform
Fourier transformFourier transform
Fourier transform
 
2 application
2 application2 application
2 application
 
App8
App8App8
App8
 
31A WePrep Presentation
31A WePrep Presentation31A WePrep Presentation
31A WePrep Presentation
 
Erin catto numericalmethods
Erin catto numericalmethodsErin catto numericalmethods
Erin catto numericalmethods
 

Recently uploaded

ALCOHOL PRODUCTION- Beer Brewing Process.pdf
ALCOHOL PRODUCTION- Beer Brewing Process.pdfALCOHOL PRODUCTION- Beer Brewing Process.pdf
ALCOHOL PRODUCTION- Beer Brewing Process.pdf
Madan Karki
 
Online crime reporting system project.pdf
Online crime reporting system project.pdfOnline crime reporting system project.pdf
Online crime reporting system project.pdf
Kamal Acharya
 

Recently uploaded (20)

Involute of a circle,Square, pentagon,HexagonInvolute_Engineering Drawing.pdf
Involute of a circle,Square, pentagon,HexagonInvolute_Engineering Drawing.pdfInvolute of a circle,Square, pentagon,HexagonInvolute_Engineering Drawing.pdf
Involute of a circle,Square, pentagon,HexagonInvolute_Engineering Drawing.pdf
 
Operating System chapter 9 (Virtual Memory)
Operating System chapter 9 (Virtual Memory)Operating System chapter 9 (Virtual Memory)
Operating System chapter 9 (Virtual Memory)
 
Insurance management system project report.pdf
Insurance management system project report.pdfInsurance management system project report.pdf
Insurance management system project report.pdf
 
15-Minute City: A Completely New Horizon
15-Minute City: A Completely New Horizon15-Minute City: A Completely New Horizon
15-Minute City: A Completely New Horizon
 
The battle for RAG, explore the pros and cons of using KnowledgeGraphs and Ve...
The battle for RAG, explore the pros and cons of using KnowledgeGraphs and Ve...The battle for RAG, explore the pros and cons of using KnowledgeGraphs and Ve...
The battle for RAG, explore the pros and cons of using KnowledgeGraphs and Ve...
 
Seismic Hazard Assessment Software in Python by Prof. Dr. Costas Sachpazis
Seismic Hazard Assessment Software in Python by Prof. Dr. Costas SachpazisSeismic Hazard Assessment Software in Python by Prof. Dr. Costas Sachpazis
Seismic Hazard Assessment Software in Python by Prof. Dr. Costas Sachpazis
 
Lesson no16 application of Induction Generator in Wind.ppsx
Lesson no16 application of Induction Generator in Wind.ppsxLesson no16 application of Induction Generator in Wind.ppsx
Lesson no16 application of Induction Generator in Wind.ppsx
 
Introduction to Arduino Programming: Features of Arduino
Introduction to Arduino Programming: Features of ArduinoIntroduction to Arduino Programming: Features of Arduino
Introduction to Arduino Programming: Features of Arduino
 
ALCOHOL PRODUCTION- Beer Brewing Process.pdf
ALCOHOL PRODUCTION- Beer Brewing Process.pdfALCOHOL PRODUCTION- Beer Brewing Process.pdf
ALCOHOL PRODUCTION- Beer Brewing Process.pdf
 
Supermarket billing system project report..pdf
Supermarket billing system project report..pdfSupermarket billing system project report..pdf
Supermarket billing system project report..pdf
 
Filters for Electromagnetic Compatibility Applications
Filters for Electromagnetic Compatibility ApplicationsFilters for Electromagnetic Compatibility Applications
Filters for Electromagnetic Compatibility Applications
 
"United Nations Park" Site Visit Report.
"United Nations Park" Site  Visit Report."United Nations Park" Site  Visit Report.
"United Nations Park" Site Visit Report.
 
Electrical shop management system project report.pdf
Electrical shop management system project report.pdfElectrical shop management system project report.pdf
Electrical shop management system project report.pdf
 
How to Design and spec harmonic filter.pdf
How to Design and spec harmonic filter.pdfHow to Design and spec harmonic filter.pdf
How to Design and spec harmonic filter.pdf
 
Online crime reporting system project.pdf
Online crime reporting system project.pdfOnline crime reporting system project.pdf
Online crime reporting system project.pdf
 
analog-vs-digital-communication (concept of analog and digital).pptx
analog-vs-digital-communication (concept of analog and digital).pptxanalog-vs-digital-communication (concept of analog and digital).pptx
analog-vs-digital-communication (concept of analog and digital).pptx
 
Instruct Nirmaana 24-Smart and Lean Construction Through Technology.pdf
Instruct Nirmaana 24-Smart and Lean Construction Through Technology.pdfInstruct Nirmaana 24-Smart and Lean Construction Through Technology.pdf
Instruct Nirmaana 24-Smart and Lean Construction Through Technology.pdf
 
Software Engineering - Modelling Concepts + Class Modelling + Building the An...
Software Engineering - Modelling Concepts + Class Modelling + Building the An...Software Engineering - Modelling Concepts + Class Modelling + Building the An...
Software Engineering - Modelling Concepts + Class Modelling + Building the An...
 
Research Methodolgy & Intellectual Property Rights Series 1
Research Methodolgy & Intellectual Property Rights Series 1Research Methodolgy & Intellectual Property Rights Series 1
Research Methodolgy & Intellectual Property Rights Series 1
 
SLIDESHARE PPT-DECISION MAKING METHODS.pptx
SLIDESHARE PPT-DECISION MAKING METHODS.pptxSLIDESHARE PPT-DECISION MAKING METHODS.pptx
SLIDESHARE PPT-DECISION MAKING METHODS.pptx
 

lec11_OPTIMAL and MULTIVARIABLE CONTROLS.pptx

  • 1. OPTIMAL and MULTIVARIABLE CONTROLS LECTURE # 11 THE VARIATIONAL APPROACH TO OPTIMAL CONTROL PROBLEMS
  • 2. Necessary Conditions for Optimal Control • Problem • Assumptions – Admissible states and controls are not bounded. – Initial state x(t0)=x0 and initial time t0 are specified. – x is an nx1 vector and u is mx1 vector.
  • 3. Necessary Conditions for Optimal Control • Previously, the following problem was considered • In control problems the trajectory is determined by the control u – We wish to consider functionals of n + m functions – Only m are independent known as controls – Function must satisfy ‘n’ different. equation constraints given in 5.1-1 • The difference between cost function given in 5.1-2 and previously considered functional is of is term involving final state and time i.e., • Assuming h is differential, it can be rewritten as
  • 4. • The performance measure can now be expressed as
  • 5. • Define • To determine variation of Ja, the variations are introduced.
  • 6.
  • 7. Necessary Conditions for Optimal Control • Consider the terms involving h
  • 8. Necessary Conditions for Optimal Control • In the integral term we have
  • 9.
  • 10.
  • 11. Boundary Conditions • To determine boundary conditions 5.1-18 needs to be modified accordingly. • In all cases it is assumed that we have the n equations • The following boundary problems are discussed – Problems with fixed final time. – Problems with free final time.
  • 12. Problems with Fixed Final Time • Different scenarios might occur such as • CASE 1 FINAL STATE SPECIFIED
  • 13.
  • 15.
  • 18. Problems with Fixed Final Time • CASE 2 FINAL STATE FREE
  • 21.
  • 22. Problems with Fixed Final Time • CASE 3 FINAL STATE LYING ON A SURFACE DEFINED BY m(x(t))=0 • Example – Suppose that the final state of a second order system is required to lie on a circle – The admissible changes in x(tf) are tangent to the circle at point
  • 23. CASE 3 FINAL STATE LYING ON A SURFACE DEFINED BY m(x(t))=0 • The tangent line is normal to the gradient vector
  • 24. CASE 3 FINAL STATE LYING ON A SURFACE DEFINED BY m(x(t))=0 5.1-18
  • 25. CASE 3 FINAL STATE LYING ON A SURFACE DEFINED BY m(x(t))=0 • Generalized Case • Each component of m represents a hyper-surface in the n-dimensional state space. • Thus, the final state lies on the intersection of the k hyper-surfaces. • is tangent/ normal to the each of the hyper-surface at the point
  • 26.
  • 27.
  • 30.
  • 31. Problems with Free Final Time • If final time is free several situations might occur 1. Final state fixed 2. Final state free 3. x(tf) lying on a moving point 4. Final state lying on a surface defined by m(x(t))=0 5. Final state lying on a moving surface defined by m(x(t))=0
  • 32. Case 1 Final State Fixed with Free Final Time
  • 33. Case 2 Final State Free with Free Final Time
  • 34. Case 3 x(tf) lying on a moving point with Free Final Time
  • 36. Case 4 Final state lying on a surface defined by m(x(t))=0
  • 37. Case 4 Final state lying on a surface defined by m(x(t))=0
  • 38. Case 4 Final state lying on a surface defined by m(x(t))=0
  • 39. Case 4 Final state lying on a surface defined by m(x(t))=0
  • 40. Generalized Case • Each component of m describes a hyper surface in the n- dimensional state space. • The final state lies at the intersection of the hyper surfaces defined by m. • ᵟxf is (to first order) tangent to each of the hyper surfaces at the point x*(tf,tf)
  • 41. Generalized Case • Thus, ᵟxf is normal to each of the gradient vectors which are assumed to be linearly independent • The (2n+k+1) equations are