SlideShare a Scribd company logo
1 of 56
Download to read offline
1
‫ﺗﻌﺎﻟﯽ‬ ‫ﺑﺎﺳﻤﻪ‬
‫اﻓﺰار‬ ‫ﻧﺮم‬ ‫ﮐﺎرﺑﺮد‬ ‫ﺑﻪ‬ ‫ﻧﮕﺎﻫﯽ‬Matlab
‫در‬
‫ﻣﺪرن‬ ‫ﮐﻨﺘﺮل‬
)‫ﮐﺘﺎب‬ ‫ﺿﻤﯿﻤﮥ‬”‫ﻣﺪرن‬ ‫ﮐﻨﺘﺮل‬ ‫اﺻﻮل‬“‫ﺻﺪﯾﻖ‬ ‫ﺧﺎﮐﯽ‬ ‫ﻋﻠﯽ‬ ‫دﮐﺘﺮ‬ ‫ﺗﺄﻟﯿﻒ‬(
‫ﮐﻨﻨﺪه‬ ‫ﺗﻬﯿﻪ‬:‫اﻣﺎﻧﯽ‬ ‫ﻣﺮادی‬ ‫ﻋﻠﯽ‬
2
‫ﺑﻬﺎر‬1382
3
‫ﻓﻬﺮﺳﺖ‬
1-‫ﻣﻘﺪﻣﻪ‬
2-‫ﺑﺮرﺳﯽ‬‫اﻓﺰار‬ ‫ﻧﺮم‬ ‫دﺳﺘﻮرﻫﺎی‬Matlab‫ﻣﺮﺗﺒﻂ‬‫ﻣﺪرن‬ ‫ﮐﻨﺘﺮل‬ ‫ﺑﺤﺚ‬ ‫ﺑﺎ‬
2-1-‫دﺳﺘﻮر‬acker
2-2-‫دﺳﺘﻮر‬canon
2-3-‫دﺳﺘﻮر‬care
2-4-‫دﺳﺘﻮر‬cdf2rdf
2-5-‫دﺳﺘﻮر‬ctrb
2-6-‫دﺳﺘﻮر‬Ctrbf
2-7-‫دﺳﺘﻮر‬diag
2-8-‫دﺳﺘﻮر‬eig
2-9-‫دﺳﺘﻮر‬estim
2-10-‫دﺳﺘﻮر‬exam
2-11-‫دﺳﺘﻮر‬Gram
2-12-‫دﺳﺘﻮر‬initial
2-13-‫دﺳﺘﻮر‬kalman
2-14-‫دﺳﺘﻮر‬Lyap
2-15-‫دﺳﺘﻮر‬null
2-16-‫دﺳﺘﻮر‬obsv
2-17-‫دﺳﺘﻮر‬obsvf
2-18-‫دﺳﺘﻮر‬place
2-19-‫دﺳﺘﻮر‬ss
2-20-‫دﺳﺘﻮر‬ssdata
2-21-‫دﺳﺘﻮر‬ss2ss
2-22-‫دﺳﺘﻮر‬ss2tf
2-23-‫دﺳﺘﻮر‬tf2ss
3-‫ﮐ‬ ‫ﻣﺘﻦ‬ ‫ﻣﺜﺎﻟﻬﺎی‬ ‫ﺑﻪ‬ ‫ﻣﺮﺑﻮط‬ ‫ﻫﺎی‬ ‫ﺑﺮﻧﺎﻣﻪ‬ ‫ﺑﺮرﺳﯽ‬‫ﺘﺎب‬
3-1-‫رﺳﻢ‬‫ﭘﺎﺳﺨﻬﺎی‬‫ﻏﯿﺮﺧﻄﯽ‬ ‫ﺳﯿﺴﺘﻢ‬)‫ﻣﺜﺎل‬5-3(
3-2-‫دﺳﺘﻮر‬ ‫ﺑﺎ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﯿﺪﺑﮏ‬ ‫ﻃﺮاﺣﯽ‬acker)‫ﻣﺜﺎل‬6-8(
3-3-‫اﻧﺘﮕﺮال‬ ‫ﮐﻨﺘﺮل‬ ‫ﺑﺎ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﯿﺪﺑﮏ‬)‫ﻣﺜﺎل‬6-9(
3-4-‫ﺳﯿﺴﺘﻢ‬ ‫دﯾﻨﺎﻣﯿﮑﯽ‬ ‫رﻓﺘﺎر‬ ‫ﺑﺮ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﯿﺪﺑﮏ‬ ‫ﺗﻐﯿﯿﺮ‬ ‫اﺛﺮ‬)‫ﻣﺜﺎل‬6-10(
3-5-‫رؤﯾﺘﮕﺮﺣﺎﻟﺖ‬ ‫ﻃﺮاﺣﯽ‬)‫ﻣﺜﺎل‬7-1(
3-6-‫رؤﯾﺘﮕﺮ‬‫ﯾﺎﻓﺘﻪ‬ ‫ﮐﺎﻫﺶ‬ ‫ﻣﺮﺗﺒﻪ‬)‫ﻣﺜﺎل‬7-2(
3-7-‫رؤﯾﺘﮕﺮ‬ ‫ﺑﺎ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﯿﺪﺑﮏ‬ ‫ﮐﻨﺘﺮل‬)‫ﻣﺜﺎل‬7-3(
4
3-8-‫ﯾﺎﻓﺘﻪ‬ ‫ﮐﺎﻫﺶ‬ ‫ﻣﺮﺗﺒﻪ‬ ‫رؤﯾﺘﮕﺮ‬ ‫ﺑﺎ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﯿﺪﺑﮏ‬ ‫ﮐﻨﺘﺮل‬)‫ﻣﺜﺎل‬7-4(
3-9-‫ﺣﺎﻟﺖ‬ ‫ﻓﯿﺪﺑﮏ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫ﺑﻬﯿﻨﻪ‬ ‫ﮐﻨﻨﺪۀ‬ ‫ﮐﻨﺘﺮل‬ ‫ﻃﺮاﺣﯽ‬)‫ﻣﺜﺎل‬8-1(
3-10-‫ﺗﻐﯿﯿﺮات‬ ‫ﺣﺴﺎب‬ ‫و‬ ‫ﺑﻬﯿﻨﻪ‬ ‫ﮐﻨﺘﺮل‬)‫ﻣﺜﺎل‬8-2(
3-11-‫ﮐﻨﺘﺮل‬‫ﭘﺎﯾﺪاری‬ ‫درﺟﮥ‬ ‫و‬ ‫ﺑﻬﯿﻨﻪ‬)‫ﻣﺜﺎل‬8-3(
3-12-‫ﮐﺎﻟﻤﻦ‬ ‫ﻓﯿﻠﺘﺮ‬)‫ﻣﺜﺎل‬8-4(
3-13-‫ﮐﺎﻟﻤﻦ‬ ‫ﻓﯿﻠﺘﺮ‬ ‫ﺑﺎ‬ ‫ﺧﺮوﺟﯽ‬ ‫ﻓﯿﺪﺑﮏ‬ ‫ﮐﻨﻨﺪۀ‬ ‫ﮐﻨﺘﺮل‬)‫ﻣﺜﺎل‬8-5(
5
‫ﻣﻘﺪﻣﻪ‬
1
6
‫اﻓﺰار‬ ‫ﻧﺮم‬ ‫دﺳﺘﻮرﻫﺎی‬ ‫ﺑﺮرﺳﯽ‬Matlab
‫ﻣﺪرن‬ ‫ﮐﻨﺘﺮل‬ ‫ﺑﺤﺚ‬ ‫ﺑﺎ‬ ‫ﻣﺮﺗﺒﻂ‬
2
7
8
2-1-‫دﺳﺘﻮر‬acker:
•‫ﻫﺪف‬:‫ورودی‬ ‫ﺗﮏ‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬ ‫ﺑﺮای‬ ‫ﻗﻄﺐ‬ ‫ﺟﺎﯾﺎب‬ ‫ﻃﺮاﺣﯽ‬
•‫دﺳﺘﻮراﻟﻌﻤﻞ‬ ‫ﻧﮕﺎرش‬:
K=acker(A,B,P)
•‫ﺗﻮﺿﯿﺤﺎت‬:
‫اﺳﺖ‬ ‫ﻣﻔﺮوض‬ ‫زﯾﺮ‬ ‫ورودی‬ ‫ﺗﮏ‬ ‫ﺳﯿﺴﺘﻢ‬:
BuAxx +=
•
‫ﺣﺎﻟﺖ‬ ‫ﻓﯿﺪﺑﮏ‬ ‫ﺑﺮدار‬ ‫ﺧﻮاﻫﯿﻢ‬ ‫ﻣﯽ‬K‫ﺷﺪه‬ ‫ﺗﻌﯿﯿﻦ‬ ‫ﻣﺤﻠﻬﺎی‬ ‫در‬ ‫ﺑﺴﺘﻪ‬ ‫ﺣﻠﻘﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻗﻄﺒﻬﺎی‬ ‫ﮐﻪ‬ ‫ﮐﻨﯿﻢ‬ ‫ﻃﺮاﺣﯽ‬ ‫ﭼﻨﺎن‬ ‫را‬‫ﺑﺮدار‬ ‫در‬P
‫ﮔﯿﺮﻧﺪ‬ ‫ﻗﺮار‬.‫دﺳﺘﻮر‬K=acker(A,B,P)‫ﻓﯿﺪﺑﮏ‬ ‫ﺑﻬﺮه‬ ‫ﺑﺮدار‬ ‫آﮐﺮﻣﻦ‬ ‫ﻓﺮﻣﻮل‬ ‫از‬ ‫اﺳﺘﻔﺎده‬ ‫ﺑﺎ‬(K)‫ﮐﻪ‬ ‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﻣﺸﺨﺺ‬ ‫ﭼﻨﺎن‬ ‫را‬
‫ﻓﯿﺪﺑﮏ‬ ‫ﻗﺎﻧﻮن‬u = -Kx،‫ﺑﺮدار‬ ‫در‬ ‫ﺷﺪه‬ ‫ﺗﻌﯿﯿﻦ‬ ‫ﻣﺤﻠﻬﺎی‬ ‫در‬ ‫را‬ ‫ﺑﺴﺘﻪ‬ ‫ﺣﻠﻘﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻗﻄﺒﻬﺎی‬P‫دﻫﺪ‬ ‫ﻗﺮار‬.‫ﻣﻘﺎدﯾﺮ‬ ‫دﯾﮕﺮ‬ ‫ﻋﺒﺎرت‬ ‫ﺑﻪ‬
‫ﻣﺎﺗﺮﯾﺲ‬ ‫وﯾﮋه‬A-BK‫اﻋﻀﺎ‬ ‫ﻣﺤﻞ‬ ‫در‬‫ﺑﺮدار‬ ‫ی‬P‫ﮔﯿﺮﻧﺪ‬ ‫ﻣﯽ‬ ‫ﻗﺮار‬.،‫ﻧﻤﻮﻧﻪ‬ ‫ﻋﻨﻮان‬ ‫ﺑﻪ‬‫ﺣﺎﻟﺖ‬ ‫ﻓﯿﺪﺑﮏ‬ ‫ﻃﺮاﺣﯽ‬ ‫ﺑﺎ‬ ‫زﯾﺮ‬ ‫ﺑﺮﻧﺎﻣﻪ‬ ‫ﺗﮑﻪ‬ ‫در‬K،
‫ﻧﺎﭘﺎﯾﺪار‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻗﻄﺒﻬﺎی‬‫ﺑﻪ‬P=[-2,-3]‫ﻣ‬‫ﻨﺘ‬‫ﺷﻮﻧﺪ‬ ‫ﻣﯽ‬ ‫ﻘﻞ‬.
A=[2,0,-1,-1]
B=[1;1]
P=[-2,-3 ]
K=acker(A,B,P)
‫ﻣﯿ‬ ‫ﺑﺎﺷﺪ‬ ‫ﺧﺮوﺟﯽ‬ ‫ﺗﮏ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﭼﻨﺎﻧﭽﻪ‬ ‫اﯾﻦ‬ ‫ﺑﺮ‬ ‫ﻋﻼوه‬‫دﺳﺘﻮر‬ ‫از‬ ‫ﺘﻮان‬acker‫روﯾﺘﮕﺮ‬ ‫ﺑﻬﺮه‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫ﺑﺮای‬‫ﻟﯿﻮﻧﺒﺮﮔﺮ‬‫اﺳﺘﻔﺎده‬ ‫ﻧﯿﺰ‬
‫ﮐﺮد‬.‫اﮔﺮ‬y=Cx‫ﺑﺎﺷﺪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺧﺮوﺟﯽ‬ ‫ﻣﻌﺎدﻟﻪ‬،‫ﺑﺮدار‬ ‫زﯾﺮ‬ ‫دﺳﺘﻮر‬L‫ﮐﺮد‬ ‫ﺧﻮاﻫﺪ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫روﯾﺘﮕﺮ‬ ‫ﺑﻬﺮه‬ ‫ﻋﻨﻮان‬ ‫ﺑﻪ‬ ‫را‬:
L = (acker(A’,C’,P))’
‫ﻣﺤﻠﻬﺎی‬ ‫در‬ ‫روﯾﺘﮕﺮ‬ ‫ﻗﻄﺒﻬﺎی‬ ‫و‬‫ﺑﺮدار‬ ‫ﺗﻮﺳﻂ‬ ‫ﺷﺪه‬ ‫ﻣﺸﺨﺺ‬P‫ﮔﯿﺮﻧﺪ‬ ‫ﻣﯽ‬ ‫ﻗﺮار‬.
•‫ﻣﺤﺪودﯾﺘﻬﺎ‬:
1.‫دﺳﺘﻮر‬acker‫اﺳﺖ‬ ‫اﺳﺘﻔﺎده‬ ‫ﻗﺎﺑﻞ‬ ‫ورودی‬ ‫ﺗﮏ‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬ ‫در‬ ‫ﻓﻘﻂ‬.
2.(A,B)‫ﺑﺎﺷﺪ‬ ‫ﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫ﺑﺎﯾﺪ‬.
3.‫اﯾﻦ‬‫از‬ ‫ﺑﯿﺶ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫درﺟﻪ‬ ‫ﭼﻨﺎﻧﭽﻪ‬ ‫و‬ ‫ﻧﯿﺴﺖ‬ ‫ﺑﺮﺧﻮردار‬ ‫ﺑﺎﻻﯾﯽ‬ ‫اﻃﻤﯿﻨﺎن‬ ‫ﻗﺎﺑﻠﯿﺖ‬ ‫از‬ ‫روش‬5‫ﺳﯿﺴﺘﻢ‬ ‫ﭘﺬﯾﺮی‬ ‫ﮐﻨﺘﺮل‬ ‫ﯾﺎ‬ ‫ﺑﻮده‬
‫ا‬ ‫دﭼﺎر‬ ‫ﺑﺎﺷﺪ‬ ‫ﺿﻌﯿﻒ‬‫ﺷﺪ‬ ‫ﺧﻮاﻫﺪ‬ ‫ﺷﮑﺎل‬.
•‫ﻣﺮﺗﺒﻂ‬ ‫دﺳﺘﻮرات‬:
‫دﺳﺘﻮر‬place‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫اﻧﺠﺎم‬ ‫ورودی‬ ‫ﭼﻨﺪ‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬ ‫در‬ ‫را‬ ‫ﻗﻄﺐ‬ ‫ﺟﺎﯾﺎﺑﯽ‬ ‫ﻋﻤﻞ‬.
2-2-‫دﺳﺘﻮر‬canon:
•‫ﻫﺪف‬:‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫در‬ ‫ﮐﺎﻧﻮﻧﯿﮑﺎل‬ ‫ﻫﺎی‬ ‫ﺗﺤﻘﻖ‬ ‫ﻣﺤﺎﺳﺒﻪ‬
•‫دﺳﺘﻮراﻟﻌﻤﻞ‬ ‫ﻧﮕﺎرش‬:
CSYS= canon(SYS,’TYPE’)
[CSYS,T]= canon(SYS,’TYPE’)
•‫ﺗﻮﺿﯿﺤﺎت‬:‫ﺳﯿﺴﺘﻢ‬ ‫ﺑﺮای‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫در‬ ‫ﮐﺎﻧﻮﻧﯿﮑﺎل‬ ‫ﺗﺤﻘﻖ‬ ‫ﯾﮏ‬ ،‫دﺳﺘﻮر‬ ‫اﯾﻦ‬LTI‫ﺑﺎ‬ ‫ﮐﻪ‬ ‫زﻣﺎن‬ ‫ﮔﺴﺴﺘﻪ‬ ‫ﯾﺎ‬ ‫ﭘﯿﻮﺳﺘﻪ‬SYS
‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫اراﺋﻪ‬ ‫اﺳﺖ‬ ‫ﺷﺪه‬ ‫ﻣﺸﺨﺺ‬.‫اﺳﺖ‬ ‫ﺷﺪه‬ ‫ﮔﺮﻓﺘﻪ‬ ‫ﻧﻈﺮ‬ ‫در‬ ‫دﺳﺘﻮراﻟﻌﻤﻞ‬ ‫اﯾﻦ‬ ‫در‬ ‫ﮐﺎﻧﻮﻧﯿﮑﺎل‬ ‫ﺗﺤﻘﻖ‬ ‫ﻧﻮع‬ ‫دو‬‫ﻣﺘﻐﯿﺮ‬ ‫ﺗﻮﺳﻂ‬ ‫ﮐﻪ‬
TYPE‫ﻣﯽ‬ ‫اﻧﺘﺨﺎب‬‫ﮔﺮدد‬.
9
‫اﻟﻒ‬-‫ﻓﺮم‬MODAL:
‫دﺳﺘﻮر‬CSYS= canon(SYS,’modal’)‫ﺗﺤﻘﻖ‬ ‫ﯾﮏ‬MODAL‫ﺳﯿﺴﺘﻢ‬ ‫از‬SYS‫در‬ ‫و‬ ‫آورده‬ ‫ﺑﺪﺳﺖ‬ ‫را‬CSYS
‫ﻣﯽ‬‫رﯾﺰد‬.،‫ﺗﺤﻘﻖ‬ ‫اﯾﻦ‬ ‫در‬‫ﺣﻘﯿﻘﯽ‬ ‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬SYS‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﻗﻄﺮﻫﺎی‬ ‫روی‬A‫ﻣﯽ‬ ‫ﻗﺮار‬‫ﻫﺮ‬ ‫ازاء‬ ‫ﺑﻪ‬ ‫و‬ ‫ﮔﯿﺮﻧﺪ‬‫زوج‬‫ﯾﮏ‬ ‫ﻣﻮﻫﻮﻣﯽ‬ ‫ﻗﻄﺐ‬
‫ﺑﻠﻮک‬2×2‫ﻣﺎﺗﺮﯾﺲ‬ ‫در‬A‫ﻣﯽ‬ ‫ﻇﺎﻫﺮ‬‫ﺷﻮد‬.‫ﺳﯿﺴ‬ ‫ﺑﺮای‬ ‫ﻣﺜﺎل‬ ‫ﻋﻨﻮان‬ ‫ﺑﻪ‬‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫ﺑﺎ‬ ‫ﺘﻤﯽ‬),,( 21 λωσλ j±،‫ﻣﺎﺗﺮﯾﺲ‬A‫در‬
‫ﻓﺮم‬ ‫ﺗﺤﻘﻖ‬MODAL‫ﺑﻮد‬ ‫ﺧﻮاﻫﺪ‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬:












−
2
1
000
00
00
000
λ
σω
ωσ
λ
‫ب‬-‫ﻓﺮم‬COMPANION:
‫دﺳﺘﻮر‬CSYS = canon(SYS,’companion’)‫ﺗﺤﻘﻖ‬ ‫ﯾﮏ‬COMPANION‫از‬SYS‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫اراﺋﻪ‬‫ﺿﺮاﯾﺐ‬ ‫آن‬ ‫در‬ ‫ﮐﻪ‬
‫رو‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻣﺸﺨﺼﻪ‬ ‫ﻣﻌﺎدﻟﻪ‬‫ﻣﺎﺗﺮﯾﺲ‬ ‫راﺳﺖ‬ ‫ﺳﻤﺖ‬ ‫اﻟﯿﻪ‬ ‫ﻣﻨﺘﻬﯽ‬ ‫ﺳﺘﻮن‬ ‫ی‬A‫ﻗﺮار‬‫ﮔﯿﺮد‬ ‫ﻣﯽ‬.‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻣﺸﺨﺼﻪ‬ ‫ﻣﻌﺎدﻟﻪ‬ ‫اﮔﺮ‬
‫ﺑﺎﺷﺪ‬ ‫زﯾﺮ‬:
nn
nn
asasassP ++++= −
−
1
1
1 ...)(
‫ﻣﺎﺗﺮﯾﺲ‬ ‫آﻧﮕﺎه‬A‫ﺗﺤﻘﻖ‬ ‫در‬COMPANION‫ﺑﻮد‬ ‫ﺧﻮاﻫﺪ‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬:
















−
−
−
−
=
−
1
2
1
10000
01000
0001
0000
a
a
a
a
A
n
n
MMMMMM
K
K
‫اﮔﺮ‬SYS‫دﺳﺘﻮ‬ ‫آﻧﮕﺎه‬ ‫ﺑﺎﺷﺪ‬ ‫داﺷﺘﻪ‬ ‫وﺟﻮد‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬‫ر‬[CSYS,T]=canon(SYS,’TYPE’)‫ﻣﺎﺗﺮﯾﺲ‬
‫ﺗﺒﺪﯾﻞ‬T‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫اراﺋﻪ‬ ‫ﻧﯿﺰ‬ ‫ﺷﻮﻧﺪ‬ ‫ﻣﯽ‬ ‫ﻣﺮﺗﺒﻂ‬ ‫ﮐﺎﻧﻮﻧﯿﮑﺎل‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺣﺎﻟﺘﻬﺎی‬ ‫ﺑﻪ‬ ‫اﺻﻠﯽ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺣﺎﻟﺘﻬﺎی‬ ‫آن‬ ‫ﺗﻮﺳﻂ‬ ‫ﮐﻪ‬ ‫را‬:xTxc .=
‫ﺳﯿﺴﺘﻢ‬ ‫ﭼﻨﺎﻧﭽﻪ‬SYS، ‫ﻧﺒﺎﺷﺪ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻓﺮم‬ ‫ﺑﻪ‬‫ﻣﺎﺗﺮﯾﺲ‬T‫ﺑﻮد‬ ‫ﺧﻮاﻫﺪ‬ ‫ﺗﻬﯽ‬.
‫در‬ ‫ﻋﻤﻠﯿﺎت‬ ‫اﻧﺠﺎم‬ ‫روﻧﺪ‬‫ﺳﯿﺴﺘﻢ‬ ‫ﭼﻨﺎﻧﭽﻪ‬ ‫اﺑﺘﺪا‬ ‫ﮐﻪ‬ ‫اﺳﺖ‬ ‫ﺻﻮرت‬ ‫اﯾﻦ‬ ‫ﺑﻪ‬ ‫دﺳﺘﻮر‬ ‫اﯾﻦ‬SYS‫داده‬ ‫ﺻﻔﺮ‬ ‫و‬ ‫ﻗﻄﺐ‬ ‫ﯾﺎ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﺮم‬ ‫ﺑﻪ‬
‫دﺳﺘﻮر‬ ‫از‬ ‫اﺳﺘﻔﺎده‬ ‫ﺑﺎ‬ ‫ﺑﺎﺷﺪ‬ ‫ﺷﺪه‬SS‫آﯾﺪ‬ ‫ﻣﯽ‬ ‫ﺑﺪﺳﺖ‬ ‫آن‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻓﺮم‬.‫ﺗﺤﻘﻖ‬ ‫در‬MODAL‫ﻣﺎﺗﺮﯾﺲ‬P‫ﺑﺮدارﻫﺎی‬ ‫ﻣﺠﻤﻮﻋﻪ‬ ‫ﮐﻪ‬
‫ﻣﺎﺗﺮﯾﺲ‬ ‫وﯾﮋه‬A‫ﺗﺸ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫زﯾﺮ‬ ‫ﻣﻌﺎدﻻت‬ ‫ﺑﺎ‬ ‫ﺳﭙﺲ‬ ‫و‬ ‫ﺷﻮد‬ ‫ﻣﯽ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫اﺳﺖ‬‫ﺎﺑﻬﯽ‬T=P-1
‫ﮐﺎﻧﻮﻧﯿﮑﺎل‬ ‫ﻓﺮم‬ ‫و‬ ‫ﺷﺪه‬ ‫اﻋﻤﺎل‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺑﻪ‬
‫آﯾﺪ‬ ‫ﻣﯽ‬ ‫ﺑﺪﺳﺖ‬:
DuCPxy
BuPAPxPx cc
+=
+= −−
•
11
‫ﺣﺎﻟﺖ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﺗﺮﺗﯿﺐ‬ ‫اﯾﻦ‬ ‫ﺑﻪ‬T‫ﻫﻤﺎن‬ ‫اﺳﺖ‬ ‫دﺳﺘﻮراﻟﻌﻤﻞ‬ ‫اﺟﺮای‬ ‫ﻧﺘﺎﯾﺞ‬ ‫از‬ ‫ﮐﻪ‬P-1
‫ﺑﻮد‬ ‫ﺧﻮاﻫﺪ‬.‫ﻓﺮم‬ ‫ﺗﺤﻘﻖ‬COMPANION
‫آ‬ ‫ﻣﯽ‬ ‫ﺑﺪﺳﺖ‬ ‫ﭘﺬﯾﺮی‬ ‫ﮐﻨﺘﺮل‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫روی‬ ‫از‬ ‫ﺗﺸﺎﺑﻬﯽ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫از‬ ‫اﺳﺘﻔﺎده‬ ‫ﺑﺎ‬ ‫ﻧﯿﺰ‬‫ﯾﺪ‬.
•‫ﻣﺜﺎل‬:‫زﯾﺮ‬ ‫ﺳﯿﺴﺘﻢ‬‫اﺳﺖ‬ ‫ﻣﻔﺮوض‬:
[ ]xy
uxx
001
1
1
1
25.03
651
021
=










+










−=
•
‫ﻣﺎﺗﺮﯾﺲ‬ ‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬A‫از‬ ‫ﻋﺒﺎرﺗﻨﺪ‬:
10
6571.6
571.26715.0
3
2,1
=
±=
λ
λ j
‫ﮐﺎﻧﻮﻧﯿﮑﺎل‬ ‫ﺗﺤﻘﻖ‬ ‫آوردن‬ ‫ﺑﺪﺳﺖ‬ ‫ﺑﺮای‬MODAL‫ﺑﺮﻧﺎﻣ‬ ‫ﺗﮑﻪ‬ ‫ﺳﯿﺴﺘﻢ‬‫ﮥ‬‫دارﯾﻢ‬ ‫را‬ ‫زﯾﺮ‬:
A=[1 2 0;-1 5 6;3 0.5 2];
B=[1;1;1];
C=[1 0 0];
D=0;
SYS=ss(A,B,C,D);
[CSYS,T]=canon(SYS,’modal’);
[Ac,Bc,Cc,Dc]=ssdata(SYS);
‫آن‬ ‫در‬ ‫ﮐﻪ‬Dc , Cc , Bc , Ac‫و‬ ‫ﮐﺎﻧﻮﻧﯿﮑﺎل‬ ‫ﺗﺘﺤﻘﻖ‬ ‫ﺑﻪ‬ ‫ﻣﺮﺑﻮط‬ ‫ﻣﺎﺗﺮﯾﺴﻬﺎی‬T‫اﺳﺖ‬ ‫ﻣﺮﺑﻮﻃﻪ‬ ‫ﺗﺸﺎﺑﻬﯽ‬ ‫ﺗﺒﺪﯾﻞ‬.‫ﺑﻪ‬ ‫ﮐﺎﻧﻮﻧﯿﮑﺎل‬ ‫ﺗﺤﻘﻖ‬
‫ﺑﻮد‬ ‫ﺧﻮاﻫﺪ‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬:
[ ] ccc
cccc
xuDxCy
uxuBxAx
3178.02081.0473.0
93.1
2267.1
2776.0
6571.600
06715.0571.2
0571.26715.0
−=+=










−+










−=+=
•
•‫ﻣﺤﺪودﯾﺘﻬﺎ‬:
1.‫ﻣﯽ‬ ‫ﺻﺤﯿﺢ‬ ‫ﭘﺎﺳﺦ‬ ‫زﻣﺎﻧﯽ‬ ‫دﺳﺘﻮر‬ ‫اﯾﻦ‬‫ﮐ‬ ‫دﻫﺪ‬‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﻪ‬A‫ﺑﺎﺷﺪ‬ ‫ﻧﺪاﺷﺘﻪ‬ ‫ﺗﮑﺮاری‬ ‫وﯾﮋه‬ ‫ﻣﻘﺪار‬.
2.‫ﺗﺤﻘﻖ‬ ‫در‬COMPANION‫ﺑﺎﺷﺪ‬ ‫ﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫ورودی‬ ‫اوﻟﯿﻦ‬ ‫از‬ ‫ﺑﺎﯾﺪ‬ ‫ﺳﯿﺴﺘﻢ‬.
3.The companion form is often poorly conditioned for most state-space
computation avoid using it when possible.
•‫ﻣﺮﺗﺒﻂ‬ ‫دﺳﺘﻮرات‬:
‫دﺳﺘﻮر‬ss2ss‫اﻧﺠﺎم‬ ‫ﺑﺮای‬‫ﻣﯽ‬ ‫ﮐﺎر‬ ‫ﺑﻪ‬ ‫ﺗﺸﺎﺑﻬﯽ‬ ‫ﺗﺒﺪﯾﻞ‬‫ر‬‫ود‬.
2-3-‫دﺳﺘﻮر‬care:
•‫ﻫﺪف‬:‫زﻣﺎن‬ ‫ﺟﺒﺮی‬ ‫رﯾﮑﺎﺗﯽ‬ ‫ﻣﻌﺎدﻟﮥ‬ ‫ﺣﻞ‬-‫ﭘﯿﻮﺳﺘﻪ‬
•‫ﻧﮕﺎرش‬:
[X,L,G,rr]=care(A,B,Q)
[X,L,G,rr]=care(A,B,Q,R,S,E)
[X,L,G,report]=care(A,B,Q,…,’report’)
[X1,X2,L,report]=care(A,B,Q,…,’implicit’)
•‫ﺗﻮﺿﯿﺤﺎت‬:
‫دﺳﺘﻮر‬[X,L,G,rr]=care(A,B,Q)‫ﻣﯽ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫را‬ ‫زﯾﺮ‬ ‫رﯾﮑﺎﺗﯽ‬ ‫ﻣﻌﺎدﻟﮥ‬ ‫ﻣﻨﺤﺼﺮﺑﻔﺮد‬ ‫ﭘﺎﺳﺦ‬‫ﮐﻨﺪ‬:
0)( =+−+= QXXBBXAXAXRic TT
‫ﻣﺎﺗﺮﯾﺲ‬ ‫وﯾﮋۀ‬ ‫ﻣﻘﺎذﯾﺮ‬ ‫ﻫﻤﮥ‬ ‫ﮐﻪ‬ ‫ﻧﺤﻮی‬ ‫ﺑﻪ‬A-BBT
X‫ﮔﯿﺮﻧﺪ‬ ‫ﻗﺮار‬ ‫ﻣﻮﻫﻮﻣﯽ‬ ‫ﻣﺤﻮر‬ ‫ﭼﭗ‬ ‫ﺳﻤﺖ‬.‫ﻣﺎﺗﺮﯾﺲ‬X‫ﻣﺘﻘﺎرن‬1
‫ﭘﺎﺳﺦ‬ ‫و‬ ‫اﺳﺖ‬
‫ﭘﺎﯾﺪارﺳﺎز‬2
‫ﻣﻌﺎدﻟﮥ‬Ric(X)=0‫ﻣﯽ‬ ‫ﻧﺎﻣﯿﺪه‬‫ﺷﻮد‬.‫را‬ ‫زﯾﺮ‬ ‫ﻣﻮارد‬ ‫دﺳﺘﻮر‬ ‫اﯾﻦ‬‫ﻣﯽ‬ ‫ﻧﺘﯿﺠﻪ‬ ‫ﻧﯿﺰ‬‫دﻫﺪ‬:
1-‫ﺑﺮدار‬L‫ﻣﺎﺗﺮﯾﺲ‬ ‫وﯾﮋۀ‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫ﺷﺎﻣﻞ‬ ‫ﮐﻪ‬A-BBT
X‫اﺳﺖ‬.
2-‫ﺑﻬﺮۀ‬ ‫ﻣﺎﺗﺮﯾﺲ‬G=BT
X
1
Symmetric
2
Stabilizing
11
3-‫ﻧﺴﺒﯽ‬ ‫ﻣﺎﻧﺪۀ‬3
‫ﻣﯽ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫ﮐﻪ‬‫ﺷﻮد‬:
F
F
X
XRic
rr
)(
=
‫دﺳﺘﻮر‬[X,L,G,rr]=care(A,B,Q,R,S,E)‫ﻋﻤﻮﻣﯽ‬ ‫رﯾﮑﺎﺗﯽ‬ ‫ﻣﻌﺎدﻟﮥ‬‫ﻣﯽ‬ ‫ﺣﻞ‬ ‫را‬ ‫ﺗﺮی‬‫ﮐﻨﺪ‬:
0)()()( 1
=+++−+= −
QSXEBRSXBEXAEXEAXRic TTTTT
‫ﺑ‬ ‫ﻣﺎﺗﺮﯾﺲ‬‫اﯾﻨﺤﺎﻟﺖ‬ ‫در‬ ‫ﻬﺮه‬)(1 TT
SXEBRG += −
‫ﺑﺮدار‬ ‫در‬ ‫ﺑﺴﺘﻪ‬ ‫ﺣﻠﻘﻪ‬ ‫وﯾﮋۀ‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫ﻧﯿﺰ‬ ‫و‬ ‫ﺑﻮده‬
),*( EGBAeigL −=‫ﻣﯽ‬ ‫ﻗﺮار‬‫ﮔﯿﺮﻧﺪ‬.
‫دﺳﺘﻮر‬ ‫دﯾﮕﺮ‬ ‫ﻧﮕﺎرش‬ ‫دو‬care‫ﮐﻨﻨﺪۀ‬ ‫ﮐﻨﺘﺮل‬ ‫ﻃﺮاﺣﯽ‬ ‫ﻧﻈﯿﺮ‬ ‫ﻣﺨﺘﻠﻒ‬ ‫ﮐﺎرﺑﺮدﻫﺎی‬ ‫در‬ ‫آن‬ ‫از‬ ‫اﺳﺘﻔﺎده‬ ‫ﺑﻪ‬ ‫ﮐﻤﮏ‬ ‫ﺑﺮای‬H∞‫ﮔﺮﻓﺘﻪ‬ ‫ﻧﻈﺮ‬ ‫در‬
‫ﺷﺪه‬‫اﻧﺪ‬4
.
‫ﻣﺜﺎل‬:‫ﻓﺮض‬ ‫ﺑﺎ‬
[ ] 3,11,
1
0
,
11
23
=−=





=




−
= rCBA
‫رﯾﮑﺎﺗﯽ‬ ‫ﻣﻌﺎدﻟﮥ‬
01
=+−+ −
CCXBXBRXAXA TTT
‫اﺳﺖ‬ ‫ﺣﻞ‬ ‫ﻗﺎﺑﻞ‬ ‫زﯾﺮ‬ ‫ﺑﺮﻧﺎﻣﮥ‬ ‫از‬ ‫اﺳﺘﻔﺎده‬ ‫ﺑﺎ‬:
A=[-3 2;1 1];
B=[0;1]
C=[1 –1];
R=3;
[X,L,g]=care(A,B,C’*C,r);
‫ﻣﯽ‬ ‫ﻧﺘﯿﺠﻪ‬ ‫زﯾﺮ‬ ‫ﻓﺮم‬ ‫ﺑﻪ‬ ‫را‬ ‫رﯾﮑﺎﺗﯽ‬ ‫ﻣﻌﺎدﻟﮥ‬ ‫ﭘﺎﺳﺦ‬ ‫ﺑﺮﻧﺎﻣﻪ‬ ‫اﯾﻦ‬‫دﻫﺪ‬:
X=
0.5895 1.8216
1.8216 8.8188
‫ﻣﺎﺗﺮﯾﺲ‬ ‫وﯾﮋۀ‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫ﻣﻘﺎﯾﺴﮥ‬A‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﺑﺎ‬A-B*g‫ﻣﯽ‬ ‫ﻧﺸﺎن‬‫اﺳﺖ‬ ‫ﭘﺎﯾﺪارﺳﺎز‬ ‫ﭘﺎﺳﺦ‬ ‫اﯾﻦ‬ ‫ﮐﻪ‬ ‫دﻫﺪ‬:
» [eig(A) eig(A-B*g)]
ans=
-3.4495 -3.5026
1.4495 -1.4370
•‫آﻟﮕﻮرﯾﺘﻢ‬:
‫دﺳﺘﻮر‬care‫ﺗﻮﺳﻌﻪ‬ ‫ﻫﺎﻣﯿﻠﺘﻮﻧﯿﻦ‬ ،‫ﻫﺎﻣﯿﻠﺘﻮﻧﯿﻦ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫از‬‫آﻟﮕﻮرﯾﺘﻢ‬ ‫ﯾﺎ‬ ‫ﯾﺎﻓﺘﻪ‬QZ‫ﺑﺮای‬‫اﺳﺘﻔﺎده‬ ‫رﯾﮑﺎﺗﯽ‬ ‫ﻣﻌﺎدﻟﮥ‬ ‫ﺣﻞ‬
‫ﻣﯽ‬‫ﮐﻨﺪ‬5
.
•‫ﻣﺤﺪودﯾﺘﻬﺎ‬:
‫زوج‬(A,B)‫ﭘﺎﯾﺪاری‬ ‫ﺑﺎﯾﺪ‬‫ﺑﺎﺷﺪ‬ ‫ﭘﺬﯾﺮ‬.‫وﯾﮋه‬ ‫ﻣﻘﺪار‬ ‫ﻫﯿﭻ‬ ‫ﻫﺎﻣﯿﻠﺘﻮﻧﯿﻦ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ،‫ﺑﻌﻼوه‬‫ﺑﺎﺷﺪ‬ ‫ﻧﺪاﺷﺘﻪ‬ ‫ﻣﻮﻫﻮﻣﯽ‬ ‫ﻣﺤﻮر‬ ‫روی‬ ‫ای‬.‫اﯾﻦ‬ ‫ﺑﺮای‬
‫ﮐﺎﻓﯿﺴﺖ‬ ‫زﯾﺮ‬ ‫ﺷﺮاﯾﻂ‬ ‫از‬ ‫ﯾﮑﯽ‬ ‫ﺗﺤﻘﻖ‬ ‫ﻣﻨﻈﻮر‬:
1-‫زوج‬(Q,A)‫آﺷﮑﺎری‬‫ﮐﻪ‬ ‫ﺣﺎﻟﺘﯽ‬ ‫در‬ ‫ﺑﺎﺷﺪ‬ ‫ﭘﺬﯾﺮ‬:S=0 , R>0
2-0>





RS
SQ
T
3
Relative residual
4
‫ﺑﻪ‬ ‫ﻣﻮرد‬ ‫اﯾﻦ‬ ‫در‬ ‫ﮐﺎﻣﻠﺘﺮ‬ ‫ﺗﻮﺿﯿﺤﺎت‬ ‫ﺑﺮای‬help‫ﻧﺮم‬‫اﻓﺰار‬Matlab‫ﺷﻮد‬ ‫ﻣﺮاﺟﻌﻪ‬.
٥‫ﺷﺪه‬ ‫ﻣﻌﺮﻓﯽ‬ ‫زﯾﺮ‬ ‫ﻣﺮﺟﻊ‬ ‫در‬ ‫آﻟﮕﻮرﯾﺘﻤﻬﺎ‬ ‫اﯾﻦ‬‫اﻧﺪ‬:
Arnold, W.F., Ш and A.J. Laub, “Generalized Eigenproblem Algorithms and Software for Algebraic Riccati Equation”, Proc.
IEEE, 72(1984), pp. 1746-1754
12
•‫ﻣﺮﺗﺒﻂ‬ ‫دﺳﺘﻮرﻫﺎی‬:
dare:‫زﻣﺎن‬ ‫رﯾﮑﺎﺗﯽ‬ ‫ﻣﻌﺎدﻻت‬ ‫ﺣﻞ‬-‫ﮔﺴﺴﺘﻪ‬
lyap:‫زﻣﺎن‬ ‫ﻟﯿﺎﭘﺎﻧﻮف‬ ‫ﻣﻌﺎدﻻت‬ ‫ﺣﻞ‬-‫ﭘﯿﻮﺳﺘﻪ‬
2-4-‫دﺳﺘﻮر‬cdf2rdf:
•‫ﻫﺪف‬:‫ﺑﺎ‬ ‫ﻗﻄﺮی‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﺑﻪ‬ ‫ﻣﺨﺘﻠﻂ‬ ‫ﻋﻨﺎﺻﺮ‬ ‫ﺑﺎ‬ ‫ﻗﻄﺮی‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﺗﺒﺪﯾﻞ‬‫ﺣﻘﯿﻘﯽ‬ ‫ﺑﻠﻮﮐﻬﺎی‬.
•‫دﺳﺘﻮراﻟﻌﻤﻞ‬ ‫ﻧﮕﺎرش‬:[V,D]=cdf2rdf(V,D)
•‫ﺗﻮﺿﯿﺤﺎت‬:
‫ﭼﻨﺎﻧﭽ‬‫ﻣﺎﺗﺮﯾﺲ‬ ‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫ﻪ‬X‫ﻣﺎﺗﺮﯾﺴﻬﺎی‬ ،‫ﺑﺎﺷﻨﺪ‬ ‫ﻣﻮﻫﻮﻣﯽ‬V‫و‬D‫دﺳﺘﻮر‬ ‫اﺟﺮای‬ ‫از‬ ‫ﮐﻪ‬[V,D]=eig(X)‫ﻣﯽ‬ ‫ﺑﺪﺳﺖ‬‫آﯾﻨﺪ‬
‫ﺑﻮد‬ ‫ﺧﻮاﻫﻨﺪ‬ ‫ﻣﻮﻫﻮﻣﯽ‬ ‫ﻋﻨﺎﺻﺮ‬ ‫دارای‬.‫دﺳﺘﻮر‬cdf2rdf‫ﻣﻮﻫﻮﻣﯽ‬ ‫ﻋﻨﺎﺻﺮ‬ ‫ﺑﺎ‬ ‫ﻗﻄﺮی‬ ‫ﻣﺎﺗﺮﯾﺲ‬D‫ﻗﻄﺮی‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﯾﮏ‬ ‫ﺑﻪ‬ ‫را‬–‫ﺑﻠﻮﮐﯽ‬
‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﺣﻘﯿﻘﯽ‬ ‫ﺑﻠﻮﮐﻬﺎی‬ ‫ﺑﺎ‬.‫وﯾﮋ‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫از‬ ‫زوج‬ ‫ﻫﺮ‬‫ﺑﺨﺶ‬ ‫در‬ ‫آﻧﭽﻪ‬ ‫ﻃﺒﻖ‬ ‫ﻣﻮﻫﻮﻣﯽ‬ ‫ه‬2-6-3‫ﺑﻠﻮک‬ ‫ﯾﮏ‬ ‫ﺑﺎ‬ ‫ﺷﺪ‬ ‫ﮔﻔﺘﻪ‬2×2
‫ﻣﺘﻨﺎﻇﺮ‬ ‫ﺣﻘﯿﻘﯽ‬‫ﺷﺪ‬ ‫ﺧﻮاﻫﺪ‬.‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫اﯾﻦ‬ ‫در‬ ‫اﻟﺒﺘﻪ‬V‫دﯾﮕﺮ‬ ‫و‬ ‫ﮐﺮد‬ ‫ﺧﻮاﻫﺪ‬ ‫ﺗﻐﯿﯿﺮ‬ ‫ﺗﯿﺰ‬V‫ﺳﯿﺴﺘﻢ‬ ‫وﯾﮋه‬ ‫ﺑﺮدارﻫﺎی‬ ‫ﺷﺎﻣﻞ‬
‫ﺑﻮد‬ ‫ﻧﺨﻮاﻫﺪ‬‫؛‬‫ﺗﻐﯿﯿﺮات‬ ‫اﻣﺎ‬V‫راﺑﻄﻪ‬ ‫ﮐﻤﺎﮐﺎن‬ ‫ﮐﻪ‬ ‫اﺳﺖ‬ ‫ﻧﺤﻮی‬ ‫ﺑﻪ‬X*V=V*D‫ﺑﺎﺷﺪ‬ ‫ﺑﺮﻗﺮار‬.
•‫ﻣﺜﺎل‬:‫ﻣﺎﺗﺮﯾﺲ‬X‫ﮔﯿﺮﯾﻢ‬ ‫ﻣﯽ‬ ‫ﻧﻈﺮ‬ ‫در‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫را‬:










−
=
450
540
321
X
‫دارد‬ ‫ﻣﻮﻫﻮﻣﯽ‬ ‫وﯾﮋه‬ ‫ﻣﻘﺪار‬ ‫ﺟﻔﺖ‬ ‫ﯾﮏ‬ ‫ﮐﻪ‬:
»[V,D]=eig(X)
V =
1.0000 0.4002-0.0191i 0.4002+0.191i
0 0.6479 0.6479
0 0+0.6479i 0-0.6479i
D =
1 0 0
0 4+5i 0
0 0 4-5i
، ‫ﺣﻘﯿﻘﯽ‬ ‫ﺑﻠﻮﮐﯽ‬ ‫ﻗﻄﺮی‬ ‫ﻓﺮم‬ ‫ﺑﻪ‬ ‫ﻧﻤﺎﯾﺶ‬ ‫اﯾﻦ‬ ‫ﺗﺒﺪﯾﻞ‬‫ﮐﺮد‬ ‫ﺧﻮاﻫﺪ‬ ‫ﺣﺎﺻﻞ‬ ‫را‬ ‫زﯾﺮ‬ ‫ﻧﺘﯿﺠﻪ‬:
»[V,D]=cdf2rdf(V,D)
V =
1 0.4002 -0.0191
0 0.6479 0
0 0 0.6479
D =
1 0 0
0 4 5
0 -5 4
2-5-‫دﺳﺘﻮر‬ctrb:
•‫ﻫﺪف‬:‫ﭘﺬﯾﺮی‬ ‫ﮐﻨﺘﺮل‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﻣﺤﺎﺳﺒﻪ‬
•‫دﺳﺘﻮراﻟﻌﻤﻞ‬ ‫ﻧﮕﺎرش‬:
Co=ctrb(A,B)
Co=ctrb(SYS)
Co=ctrb(SYS.a,SYS.b)
•‫ﺗﻮﺿﯿﺤﺎت‬:‫ﻓﺮم‬ ‫ﺑﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻣﻌﺎدﻟﻪ‬ ‫ﭼﻨﺎﻧﭽﻪ‬BuAxx +=
•
‫آن‬ ‫در‬ ‫ﮐﻪ‬ ‫ﺑﺎﺷﺪ‬Anxn‫و‬Bnxm،‫اﺳﺖ‬‫ﻣﺎ‬‫ﮐﻨﺘﺮل‬ ‫ﺗﺮﯾﺲ‬
‫ﺳﯿﺴﺘﻢ‬ ‫ﭘﺬﯾﺮی‬)‫دﺳﺘﻮر‬ ‫ﺑﺎ‬ ‫ﮐﻪ‬ctrb‫ﺷﻮد‬ ‫ﻣﯽ‬ ‫ﻣﺤﺎﺳﺒﻪ‬(‫ﺑﻮد‬ ‫ﺧﻮاﻫﺪ‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬:
13
[ ]BABAABBCo n 12 −
= L
‫ﻣﺎﺗﺮﯾﺲ‬ ‫رﺗﺒﻪ‬ ‫ﮐﻪ‬ ‫اﺳﺖ‬ ‫ﮐﺎﻣﻞ‬ ‫ﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫زﻣﺎﻧﯽ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﮐﻪ‬ ‫اﺳﺖ‬ ‫واﺿﺢ‬Co‫ﺑﺎﺷﺪ‬ ‫ﮐﺎﻣﻞ‬.
•‫ﻣﺜﺎل‬:‫ﻣﺎﺗﺮﯾﺴﻬﺎی‬A‫و‬B‫ﮔﯿﺮﯾﻢ‬ ‫ﻣﯽ‬ ‫ﻧﻈﺮ‬ ‫در‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫را‬:






−
−
=





−
=
11
11
,
24
11
BA
‫ﮐﻨﺘﺮل‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫رﺗﺒﮥ‬ ‫زﯾﺮ‬ ‫ﺑﺮﻧﺎﻣﮥ‬‫ﻣﯽ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫را‬ ‫ﭘﺬﯾﺮی‬‫ﮐﻨﺪ‬:
»A=[1 1;4 –2];
»B=[1 –1;1 –1];
»Co=ctrb(A,B)
Co=
1 -1 2 -2
1 -1 2 -2
»rank(Co)
ans=
1
‫رﺗﺒﻪ‬ ‫ﭼﻮن‬Co‫ﻧﯿﺴﺖ‬ ‫ﮐﺎﻣﻞ‬،‫ﮐﺎﻣﻞ‬ ‫ﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻟﺬا‬‫ﻧﻤﯽ‬‫ﺑﺎﺷﺪ‬.‫ﮐ‬ ‫ﺣﺎﻟﺘﻬﺎی‬ ‫ﺗﻌﺪاد‬‫ﻨﺘﺮل‬‫ﻧﺎ‬‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﭘﺬﯾﺮ‬
‫ﻣﯽ‬ ‫ﻣﺤﺎﺳﺒﻪ‬‫ﺷﻮد‬:
»unco=length(A)-rank(Co)
ans=
1
‫دارد‬ ‫ﻧﺎﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫ﺣﺎﻟﺖ‬ ‫ﯾﮏ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻟﺬا‬ ‫و‬.
•‫ﻣﺤﺪودﯾﺘﻬﺎ‬:
‫ﻣﺤﺎﺳﺒﻪ‬Co‫ﭘﺎره‬ ‫در‬‫ﺷﻮد‬ ‫ﻣﯽ‬ ‫ﺧﻄﺎ‬ ‫دﭼﺎر‬ ‫ﻣﻮارد‬ ‫ای‬.‫ﮐﻨﯿﻢ‬ ‫ﻣﯽ‬ ‫ﺑﺮرﺳﯽ‬ ‫ﺳﺎده‬ ‫ﻣﺜﺎل‬ ‫ﯾﮏ‬ ‫ﺑﺎ‬ ‫را‬ ‫ﻣﻮﺿﻮع‬ ‫اﯾﻦ‬:






=





=
δ
δ 1
,
10
1
BA
‫اﮔﺮ‬δ≠0‫ﺑﻮد‬ ‫ﺧﻮاﻫﺪ‬ ‫ﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫زوج‬ ‫اﯾﻦ‬ ‫ﺑﺎﺷﺪ‬:
[ ] 




 +
==
δδ
δ 2
11
ABBCo
‫اﮔﺮ‬ ‫اﻣﺎ‬eps<2
δ‫آن‬ ‫در‬ ‫ﮐﻪ‬ ‫ﺑﺎﺷﺪ‬eps‫راﯾﺎﻧﻪ‬ ‫آﻧﮕﺎه‬ ‫اﺳﺖ‬ ‫ﮐﺎﻣﭙﯿﻮﺗﺮ‬ ‫ﻣﺤﺎﺳﺒﺎت‬ ‫ﻧﺴﺒﯽ‬ ‫وﺿﻮح‬2
δ‫و‬ ‫ﮔﺮﻓﺖ‬ ‫ﺧﻮاﻫﺪ‬ ‫ﻧﻈﺮ‬ ‫در‬ ‫ﺻﻔﺮ‬ ‫را‬
‫ﻧﺸﺎن‬ ‫ﻧﺎﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫را‬ ‫ﺳﯿﺴﺘﻢ‬‫اﺳﺖ‬ ‫ﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﮐﻪ‬ ‫ﺣﺎﻟﯽ‬ ‫در‬ ‫داد‬ ‫ﺧﻮاﻫﺪ‬.‫دﺳﺘﻮر‬ ‫از‬ ‫اﺳﺖ‬ ‫ﺑﻬﺘﺮ‬ ‫ﺷﺮاﯾﻂ‬ ‫اﯾﻦ‬ ‫در‬ctrbf
‫ﺷﻮد‬ ‫اﺳﺘﻔﺎده‬.
•‫ﻣﺮﺗﺒﻂ‬ ‫دﺳﺘﻮرات‬:
obsv:‫ﭘﺬﯾﺮی‬ ‫روﯾﺖ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﻣﺤﺎﺳﺒﻪ‬‫ﺳﯿﺴﺘﻢ‬
ctrbf:‫ﺳﯿﺴﺘﻢ‬ ‫ﻧﺎﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫و‬ ‫ﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫ﺣﺎﻟﺘﻬﺎی‬ ‫ﺟﺪاﺳﺎزی‬
2-6-‫دﺳﺘﻮر‬Ctrbf:
•‫ﻫﺪف‬:‫ﮐﻨﺘﺮ‬ ‫ﭘﻠﮑﺎﻧﯽ‬ ‫ﻓﺮم‬ ‫ﺗﻬﯿﻪ‬‫ﭘﺬﯾﺮ‬ ‫ل‬)‫ﻧﺎﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫و‬ ‫ﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫ﺣﺎﻟﺘﻬﺎی‬ ‫ﺟﺪاﺳﺎزی‬(
•‫دﺳﺘﻮراﻟﻌﻤﻞ‬ ‫ﻧﮕﺎرش‬:[Abar,Bbar,Cbar,T,K]=ctrbf(A,B,C)
[Abar,Bbar,Cbar,r,k]=ctrbf(A,B,C,tol)
14
•‫ﺗﻮﺿﯿﺤﺎت‬:
‫ا‬‫زوج‬ ‫ﭘﺬﯾﺮی‬ ‫ﮐﻨﺘﺮل‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫رﺗﺒﻪ‬ ‫ﮔﺮ‬(A,B)‫از‬ ‫ﮐﻮﭼﮑﺘﺮ‬n)n‫ﻣﺮﺗﺒﻪ‬A‫اﺳﺖ‬(‫ﺑﺎﺷﺪ‬،‫آﻧﮕﺎ‬‫ﻣﺎﻧﻨﺪ‬ ‫ﺗﺸﺎﺑﻬﯽ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﯾﮏ‬ ‫ه‬T‫وﺟﻮد‬
‫ﻣﯽ‬ ‫ﮐﻪ‬ ‫دارد‬‫ﮐﻨﺪ‬ ‫ﺟﺪا‬ ‫ﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫ﺣﺎﻟﺘﻬﺎی‬ ‫از‬ ‫را‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻧﺎﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫ﺣﺎﻟﺘﻬﺎی‬ ‫ﺗﻮاﻧﺪ‬.‫ﺗﺒﺪﯾﻞ‬ ‫ﻣﺎﺗﺮﯾﺲ‬unitary T‫اﺳﺖ‬1
‫و‬‫دارﯾﻢ‬
:
TT
CTCTBBTATA === ,,
‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫اﯾﻦ‬A‫ﻣﯽ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﭼﻨﺎن‬ ‫ﭘﻠﮑﺎﻧﯽ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﯾﮏ‬ ‫ﺑﻪ‬ ‫را‬‫ﺣﺎﻟﺘﻬﺎ‬ ‫ﺑﻪ‬ ‫ﻣﺮﺑﻮط‬ ‫ﺑﺨﺶ‬ ‫ﮐﻪ‬ ‫ﮐﻨﺪ‬‫ﻧﺎﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫ی‬(Auc)‫در‬
‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﺑﺎﻻی‬ ‫ﭼﭗ‬ ‫ﺳﻤﺖ‬ ‫ﮔﻮﺷﻪ‬A‫ﮔﯿﺮد‬ ‫ﻗﺮار‬:
[ ]cuc
cc
uc
CCC
B
B
AA
A
A =





=





= ,
0
,
0
21
‫ا‬ ‫در‬‫ﯾﻨﺤﺎﻟﺖ‬‫زوج‬(Ac,Bc)‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫ﺗﻤﺎم‬ ، ‫ﺑﻮده‬ ‫ﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬Auc‫داﺷﺖ‬ ‫ﺧﻮاﻫﯿﻢ‬ ‫و‬ ‫ﻫﺴﺘﻨﺪ‬ ‫ﻧﺎﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬:
BAsICBAsIC cc
11
)()( −−
−=−
‫ﺳ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﺗﺎﺑﻊ‬ ‫ﺗﻌﯿﯿﻦ‬ ‫در‬ ‫ﻧﺎﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫ﺣﺎﻟﺘﻬﺎی‬ ‫ﯾﻌﻨﯽ‬‫ﻧﺪارد‬ ‫اﺛﺮی‬ ‫ﯿﺴﺘﻢ‬.
‫دﺳﺘﻮر‬[Abar,Bbar,Cbar,T,K]=ctrbf(A,B,C)‫ﺑ‬ ‫ﺷﺪه‬ ‫داده‬ ‫ﻧﻤﺎﯾﺶ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﺳﯿﺴﺘﻢ‬‫ﺎ‬A،B‫و‬C‫ر‬‫ﺑﻪ‬ ‫ا‬
‫ﺑﺎ‬ ‫ﺳﯿﺴﺘﻤﯽ‬CBA ,,‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫اﻟﺬﮐﺮ‬ ‫ﻓﻮق‬.T‫و‬ ‫ﺗﺸﺎﺑﻬﯽ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﻣﺎﺗﺮﯾﺲ‬K‫ﻃﻮل‬ ‫ﺑﻪ‬ ‫ﺑﺮدار‬ ‫ﯾﮏ‬n‫ﮐﻪ‬ ‫اﺳﺖ‬n‫ﻣﺎﺗﺮﯾﺲ‬ ‫اﺑﻌﺎد‬
A‫ﺑﺎﺷﺪ‬ ‫ﻣﯽ‬.‫ﻋﻀﻮ‬ ‫ﻫﺮ‬K‫ﻧﺸﺎن‬‫ﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫ﺣﺎﻟﺖ‬ ‫ﭼﻨﺪ‬ ‫ﺗﺸﺎﺑﻬﯽ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫ﺑﺮای‬ ‫ﺗﮑﺮار‬ ‫ﺑﺎر‬ ‫ﻫﺮ‬ ‫در‬ ‫ﮐﻪ‬ ‫دﻫﺪ‬ ‫ﻣﯽ‬
‫اﺳﺖ‬ ‫ﺷﺪه‬ ‫اﺳﺘﺨﺮاج‬.
‫ﺑﺮدار‬ ‫ﺻﻔﺮ‬ ‫ﻏﯿﺮ‬ ‫اﻋﻀﺎی‬ ‫ﺗﻌﺪاد‬ ‫ﺑﻨﺎﺑﺮاﯾﻦ‬K‫ﺗﺒﺪﯾﻞ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫ﺑﺮای‬ ‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻧﺸﺎن‬T‫اﺳﺖ‬ ‫ﻻزم‬ ‫ﺗﮑﺮار‬ ‫ﭼﻨﺪ‬.‫ﺑﻌﻼوه‬
2
SUM(K)‫ﺣﺎﻟﺘﻬﺎی‬ ‫ﺗﻌﺪاد‬Ac‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻧﺸﺎن‬ ‫را‬.
‫ﻋﻨﺼﺮ‬tol‫د‬‫ر‬‫دﺳﺘﻮر‬ctrbf(A,B,C,tol)‫ﻓﻀﺎﻫﺎی‬ ‫زﯾﺮ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫در‬ ‫ﻣﺠﺎز‬ ‫ﺗﻠﺮاﻧﺲ‬ ‫ﻣﻘﺪار‬
‫ﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬/‫ﻧﺎﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬‫را‬‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻧﺸﺎن‬.‫اﮔﺮ‬‫ﺑﺎﺷﺪ‬ ‫ﻧﺸﺪه‬ ‫ﺗﻌﯿﯿﻦ‬ ‫ﺗﻠﺮاﻧﺲ‬ ‫اﯾﻦ‬ ‫ﻣﻘﺪار‬،‫ﻣﻘﺪار‬10*n*norm(A,1)* eps‫ﻋﻨﻮان‬ ‫ﺑﻪ‬
‫ﺷﻮد‬ ‫ﻣﯽ‬ ‫ﮔﺮﻓﺘﻪ‬ ‫ﻧﻈﺮ‬ ‫در‬ ‫ﻓﺮض‬ ‫ﭘﯿﺶ‬.
•‫ﻣﺜﺎل‬:‫ﺑﮕﯿﺮﯾﺪ‬ ‫ﻧﻈﺮ‬ ‫در‬ ‫را‬ ‫زﯾﺮ‬ ‫ﺳﯿﺴﺘﻢ‬:






=





−
−
=





−
=
10
01
,
11
11
,
24
11
CBA
‫دﺳﺘﻮر‬ ‫اﻋﻤﺎل‬ ‫ﺑﺎ‬
[Abar,Bbar,Cbar,T,K]=ctrbf(A,B,C)
‫داﺷﺖ‬ ‫ﺧﻮاﻫﯿﻢ‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫را‬ ‫ﺟﺪﯾﺪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫و‬ ‫ﺷﺪه‬ ‫ﺟﺪا‬ ‫ﻫﻢ‬ ‫از‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻧﺎﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫و‬ ‫ﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫ﺣﺎﻟﺘﻬﺎی‬:
Abar=
-3 0
-3 2
Bbar=
0 0
1.4142 -1.4142
Cbar=
-0.7071 0.7071
0.7071 0.7071
‫ﺗﺒ‬ ‫ﻣﺎﺗﺮﯾﺲ‬‫ﺗﺸﺎﺑﻬﯽ‬ ‫ﺪﯾﻞ‬T‫ﺑﺮدار‬ ‫و‬K‫ﺑﻮد‬ ‫ﺧﻮاﻫﻨﺪ‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫ﻧﯿﺰ‬:
T=
-0.7071 0.7071
0.7071 0.7071
K=
1 0
١‫ﻣﺎﺗﺮﯾﺲ‬Unitay T‫اﮔﺮ‬ ‫ﺗﻨﻬﺎ‬ ‫و‬ ‫ﺗﻨﻬﺎ‬ ‫اﮔﺮ‬ ‫اﺳﺖ‬:
T.TT
=TT
.T=I
٢‫دﺳﺘﻮر‬SUM(K)‫ﺑﺮدار‬ ‫ﻋﻨﺎﺻﺮ‬ ‫ﻣﺠﻤﻮع‬K‫ﻣﯽ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫را‬‫ﮐﻨﺪ‬.
15
‫در‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫ﺣﺎﻟﺖ‬ ‫ﮐﻪ‬ ‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻧﺸﺎن‬ ‫ﺟﺪﯾﺪ‬ ‫ﺳﯿﺴﺘﻢ‬3-‫در‬ ‫آن‬ ‫ﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫ﺣﺎﻟﺖ‬ ‫و‬2+‫اﺳﺖ‬ ‫ﮔﺮﻓﺘﻪ‬ ‫ﻗﺮار‬.
•‫ﻣﺮﺗﺒﻂ‬ ‫دﺳﺘﻮراﻟﻌﻤﻠﻬﺎی‬:
ctrb:‫ﻣ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫را‬ ‫ﭘﺬﯾﺮی‬ ‫ﮐﻨﺘﺮل‬ ‫ﻣﺎﺗﺮﯾﺲ‬‫ﮐﻨﺪ‬ ‫ﯽ‬.
minreal:‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻧﺘﯿﺠﻪ‬ ‫را‬ ‫ﻧﯿﻤﺎل‬ ‫ﻣﯽ‬ ‫ﺗﺤﻘﻖ‬ ‫و‬ ‫داده‬ ‫اﻧﺠﺎم‬ ‫ﺻﻔﺮ‬ ‫و‬ ‫ﻗﻄﺐ‬ ‫ﺣﺬف‬.
2-7-‫دﺳﺘﻮر‬diag:
•‫ﻫﺪف‬:
1.‫اﺻﻠﯽ‬ ‫ﻗﻄﺮ‬ ‫ﻣﻮازی‬ ‫ﻗﻄﺮﻫﺎی‬ ‫روی‬ ‫ﯾﺎ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﯾﮏ‬ ‫اﺻﻠﯽ‬ ‫ﻗﻄﺮ‬ ‫روی‬ ‫ﺑﺮدار‬ ‫ﯾﮏ‬ ‫ﻋﻨﺎﺻﺮ‬ ‫ﻗﺮاردادن‬
2.‫ﺑﺮدار‬ ‫ﯾﮏ‬ ‫در‬ ‫آن‬ ‫ﺑﺎ‬ ‫ﻣﻮازی‬ ‫ﻗﻄﺮﻫﺎی‬ ‫ﯾﺎ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﯾﮏ‬ ‫اﺻﻠﯽ‬ ‫ﻗﻄﺮ‬ ‫روی‬ ‫ﻋﻨﺎﺻﺮ‬ ‫ﻗﺮاردادن‬.
•‫دﺳ‬ ‫ﻧﮕﺎرش‬‫ﺘﻮراﻟﻌﻤﻞ‬:
X=diag(v,k)
X=diag(v)
V=diag(x,k)
V=diag(x)
•‫ﺗﻮﺿﯿﺤﺎت‬:
‫دﺳﺘﻮر‬X=diag(v,k)‫آن‬ ‫در‬ ‫ﮐﻪ‬V‫و‬ ‫ﺑﺮدار‬ ‫ﯾﮏ‬n‫و‬ ‫ﻋﻀﻮی‬k، ‫اﺳﺖ‬ ‫ﺻﺤﯿﺢ‬ ‫ﻋﺪد‬ ‫ﯾﮏ‬‫ﻣﺎﺗﺮﯾﺲ‬X‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﺗﻮﻟﯿﺪ‬ ‫را‬
‫آن‬ ‫اﺑﻌﺎد‬ ‫ﮐﻪ‬n+abs(k)‫ﺑﺮدار‬ ‫ﻋﻨﺎﺻﺮ‬ ‫و‬ ‫اﺳﺖ‬V‫روی‬K‫ﻗﺮاردارﻧﺪ‬ ‫آن‬ ‫ﻗﻄﺮ‬ ‫اﻣﯿﻦ‬.K=0‫ا‬ ‫ﻗﻄﺮ‬ ‫ﺑﯿﺎﻧﮕﺮ‬،‫ﺻﻠﯽ‬K>0‫ﻗﻄﺮﻫﺎی‬ ‫ﺑﻪ‬ ‫ﻣﺮﺑﻮط‬
‫و‬ ‫اﺻﻠﯽ‬ ‫ﻗﻄﺮ‬ ‫ﺑﺎﻻی‬K<0‫اﺳﺖ‬ ‫آن‬ ‫زﯾﺮ‬ ‫ﻗﻄﺮﻫﺎی‬ ‫ﺑﻪ‬ ‫ﻣﺮﺑﻮط‬.
‫دﺳﺘﻮر‬X=diag(v)‫ازای‬ ‫ﺑﻪ‬ ‫ﻗﺒﻞ‬ ‫دﺳﺘﻮر‬ ‫ﻫﻤﺎن‬ ‫واﻗﻊ‬ ‫در‬K=0‫اﺳﺖ‬.‫دﺳﺘﻮر‬V=diag(x,k)‫آن‬ ‫در‬ ‫ﮐﻪ‬x‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﯾﮏ‬
، ‫اﺳﺖ‬‫ﻗﻄﺮ‬k‫ام‬x‫ﺑﺮدار‬ ‫در‬ ‫را‬V‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻗﺮار‬.‫ﻋﻼﻣﺖ‬ ‫وﺿﻌﯿﺖ‬K‫دﺳﺘﻮر‬ ‫ﻣﺎﻧﻨﺪ‬X=diag(v,k)‫ﺑﺎﺷﺪ‬ ‫ﻣﯽ‬.V=diag(x)‫ﻧﯿﺰ‬
‫ﻣﺎﺗﺮﯾﺲ‬ ‫اﺻﻠﯽ‬ ‫ﻗﻄﺮ‬ ‫روی‬ ‫ﻋﻨﺎﺻﺮ‬x‫ﺑﺮدار‬ ‫در‬ ‫را‬k‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻗﺮار‬.
•‫ﻣﺜﺎل‬:‫ﺑﺮدار‬V‫ﮔﯿﺮﯾﻢ‬ ‫ﻣﯽ‬ ‫ﻧﻈﺮ‬ ‫در‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫را‬:
» V=[-1 –2 –3];
» X=diag(V)
X=
-1 0 0
0 -2 0
0 0 -3
» X=diag(v,1)
X=
0 -1 0 0
0 0 -2 0
0 0 0 -3
0 0 0 0
» Y=[1 2 3;-3 –2 –1;-5 –6 –8];
» V1=diag(Y)
V1=
1
-2
-8
» V2=diag(Y,1)
V2=
2
-1
16
2-8-‫دﺳﺘﻮر‬eig:
•‫ﻫﺪف‬:‫وﯾﮋه‬ ‫ﺑﺮدارﻫﺎی‬ ‫و‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫ﯾﺎﻓﺘﻦ‬
•‫دﺳﺘﻮراﻟﻌﻤﻞ‬ ‫ﻧﮕﺎرش‬:
d=eig(A)
d=eig(A,B)
[V,D]=eig(A)
[V,D]=eig(A,’no balance’)
[V,D]=eig(A,B)
[V,D]=eig(A,B,flag)
•‫ﺗﻮﺿﯿﺤﺎت‬:‫ﭘﺮدازﯾﻢ‬ ‫ﻣﯽ‬ ‫ﻣﻘﺪﻣﺎﺗﯽ‬ ‫ﺗﻌﺎرﯾﻒ‬ ‫ای‬ ‫ﭘﺎره‬ ‫ﻣﺮور‬ ‫ﺑﻪ‬ ‫آﻏﺎز‬ ‫در‬.‫اﺳﺖ‬ ‫زﯾﺮ‬ ‫ﻣﻌﺎدﻟﻪ‬ ‫ﺣﻞ‬ ‫واﻗﻊ‬ ‫در‬ ‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫ﻣﺴﺎﻟﻪ‬:
XAX λ=
‫آن‬ ‫در‬ ‫ﮐﻪ‬A‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﯾﮏ‬n*n،X‫ﺑﺮدار‬ ‫ﯾﮏ‬n‫ﻋﻀﻮ‬‫و‬ ‫ی‬λ‫اﺳﺖ‬ ‫اﺳﮑﺎﻟﺮ‬ ‫ﯾﮏ‬.
‫از‬ ‫ﻣﻘﺎدﯾﺮی‬λ، ‫ﮐﻨﻨﺪ‬ ‫ﻣﯽ‬ ‫ﺑﺮآورده‬ ‫را‬ ‫ﻓﻮق‬ ‫ﻣﻌﺎدﻟﻪ‬ ‫ﮐﻪ‬‫ﻣﺎﺗﺮﯾﺲ‬ ‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬A‫ﻫﺴﺘﻨﺪ‬.‫ﻣﺎﺗﺮﯾﺲ‬ ‫اﺑﻌﺎد‬ ‫ﺗﻌﺪاد‬ ‫ﺑﺎ‬ ‫ﺑﺮاﺑﺮ‬ ‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫ﺗﻌﺪاد‬
A)‫ﯾﻌﻨﯽ‬n(‫اﺳﺖ‬.‫ﺑﺮدار‬X‫ﻣﺎﺗﺮﯾﺲ‬ ‫راﺳﺖ‬ ‫ﺳﻤﺖ‬ ‫وﯾﮋه‬ ‫ﺑﺮدار‬ ‫ﻧﺎم‬ ‫ﺑﻪ‬ ‫ﻧﯿﺰ‬A‫ﻣﯽ‬ ‫ﺷﻨﺎﺧﺘﻪ‬‫ﺷﻮد‬.‫اﻓﺰار‬ ‫ﻧﺮم‬ ‫در‬Matlab‫دﺳﺘﻮر‬
eig‫اﺳﺖ‬ ‫ﺷﺪه‬ ‫ﮔﺮﻓﺘﻪ‬ ‫ﻧﻈﺮ‬ ‫در‬ ‫وﯾﮋه‬ ‫ﺑﺮدارﻫﺎی‬ ‫و‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫ﺑﺮای‬.
، ‫ﯾﺎﻓﺘﻪ‬ ‫ﺗﻌﻤﯿﻢ‬ ‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫ﻣﺴﺎﻟﻪ‬ ‫در‬‫از‬ ‫ﻣﻘﺎدﯾﺮی‬ ‫ﯾﺎﻓﺘﻦ‬ ‫ﻫﺪف‬λ‫و‬x‫ﺳﺎزﻧﺪ‬ ‫ﺑﺮآورده‬ ‫را‬ ‫زﯾﺮ‬ ‫ﻣﻌﺎدﻟﻪ‬ ‫ﮐﻪ‬ ‫اﺳﺖ‬:
BXAX λ=
‫آن‬ ‫در‬ ‫ﮐﻪ‬A‫و‬B‫ﻣﺎﺗﺮﯾﺴﻬﺎی‬ ‫دو‬ ‫ﻫﺮ‬n*n‫ﻫﺴﺘﻨﺪ‬ ‫ﻣﻌﻠﻮم‬ ‫و‬.‫اﮔﺮ‬B‫ﻧﺒﺎﺷﺪ‬ ‫وﯾﮋه‬‫ﺗﺒﺪﯾﻞ‬ ‫زﯾﺮ‬ ‫ﻓﺮم‬ ‫ﺑﻪ‬ ‫ﺗﻮان‬ ‫ﻣﯽ‬ ‫را‬ ‫ﻓﻮق‬ ‫ﻣﻌﺎدﻟﻪ‬ ‫آﻧﮕﺎه‬
‫ﮐﺮد‬:
XAXB λ=−1
‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﺑﺮای‬ ‫ﻣﻌﻤﻮﻟﯽ‬ ‫وﯾﮋه‬ ‫ﺑﺮدارﻫﺎی‬ ‫و‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫ﯾﺎﻓﺘﻦ‬ ‫ﻫﻤﺎن‬ ‫واﻗﻊ‬ ‫در‬ ‫ﮐﻪ‬B-1
A‫ﺑﺎﺷﺪ‬ ‫ﻣﯽ‬.‫اﮔﺮ‬ ‫اﻣﺎ‬B‫اﻟﮕﻮرﯾﺘﻢ‬ ‫از‬ ‫اﺳﺘﻔﺎده‬ ‫ﺑﺎﺷﺪ‬ ‫وﯾﮋه‬
QZ‫اﺳﺖ‬ ‫ﺿﺮوری‬.
‫دﺳﺘﻮر‬d=eig(A)‫ﻣﺎﺗﺮﯾﺲ‬ ‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬A‫ﻣﯽ‬ ‫ﺑﺮ‬ ‫را‬‫ﮔﺮ‬‫داﻧﺪ‬.
‫دﺳﺘﻮر‬d=eig(A,B)‫آن‬ ‫در‬ ‫ﮐﻪ‬A‫و‬B،‫ﻫﺴﺘﻨﺪ‬ ‫ﻣﺮﺑﻌﯽ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫دو‬‫ﻣﺤﺎﺳﺒﻪ‬ ‫را‬ ‫ﯾﺎﻓﺘﻪ‬ ‫ﺗﻌﻤﯿﻢ‬ ‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬
‫ﮐﻨﺪ‬ ‫ﻣﯽ‬.
[V,D]=eig(A)‫ﻣﺎﺗﺮﯾﺲ‬ ‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬A‫ﻗﻄﺮی‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫روی‬ ‫در‬ ‫را‬D‫ﻣﺎﺗﺮﯾﺲ‬ ‫در‬ ‫را‬ ‫آن‬ ‫وﯾﮋه‬ ‫ﺑﺮدارﻫﺎی‬ ‫و‬V، ‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻗﺮار‬
‫داﺷﺖ‬ ‫ﺧﻮاﻫﯿﻢ‬ ‫ﺑﻨﺎﺑﺮاﯾﻦ‬:A*V=V*D‫ﮐﻪ‬V‫ﺑ‬ ‫ﻣﺎﺗﺮﯾﺲ‬‫راﺳﺖ‬ ‫وﯾﮋه‬ ‫ﺮدارﻫﺎی‬A‫اﺳﺖ‬.‫ﻣﺎﺗﺮﯾﺲ‬W‫ﭼﭗ‬ ‫ﺑﺮدارﻫﺎی‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ،A
‫ﺷﻮد‬ ‫ﻣﯽ‬ ‫ﻧﺎﻣﯿﺪه‬‫اﮔﺮ‬WT
*A=D*WT
.‫ﻣﺤﺎﺳﺒﻪ‬ ‫ﺑﺮای‬W‫اﺳﺖ‬ ‫ﻻزم‬ ‫زﯾﺮ‬ ‫دﺳﺘﻮرات‬:
» [W,D]=eig(A.’);
» W=conj(W);
‫دﺳﺘﻮر‬[V,D]=eig(a,'no balance')‫وﯾﮋه‬ ‫ﺑﺮدارﻫﺎی‬ ‫و‬ ‫ﻣﻘﺎدﯾﺮ‬A‫ﺳﺎزی‬ ‫ﻣﺘﻌﺎدل‬ ‫ﻓﺮآﯾﻨﺪ‬ ‫اﻧﺠﺎم‬ ‫ﺑﺪون‬ ‫را‬1
‫ﻣ‬ ‫اوﻟﯿﻪ‬‫ﺤﺎﺳﺒﻪ‬
‫ﮐﻨﺪ‬ ‫ﻣﯽ‬.،‫ﻣﻌﻤﻮل‬ ‫ﻃﻮر‬ ‫ﺑﻪ‬،‫ﺑﺨﺸﯿﺪه‬ ‫ﺑﻬﺒﻮد‬ ‫را‬ ‫ورودی‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﺷﺮاﯾﻂ‬ ‫ﺳﺎزی‬ ‫ﻣﺘﻌﺎدل‬ ‫ﻋﻤﻞ‬ ‫اﻧﺠﺎم‬‫ﻣﻘﺎدﯾﺮ‬ ‫ﺗﺮ‬ ‫ﺻﺤﯿﺢ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫ﺑﻪ‬ ‫ﻣﻨﺠﺮ‬
‫ﺷﻮد‬ ‫ﻣﯽ‬ ‫وﯾﮋه‬ ‫ﺑﺮدارﻫﺎی‬ ‫و‬.‫ﮐﺮدن‬ ‫ﮔﺮد‬ ‫ﺧﻄﺎی‬ ‫ﺑﺮوز‬ ‫اﻣﮑﺎن‬ ‫ﮐﻪ‬ ‫ﺑﺎﺷﻨﺪ‬ ‫ﮐﻮﭼﮏ‬ ‫ﺣﺪی‬ ‫ﺑﻪ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﻋﻨﺎﺻﺮ‬ ‫ﭼﻨﺎﻧﭽﻪ‬ ‫اﻣﺎ‬2
‫داﺗﺸﻪ‬ ‫وﺟﻮد‬
‫آﻧ‬ ‫اﺳﺖ‬ ‫ﻣﻤﮑﻦ‬ ‫ﺳﺎزی‬ ‫ﻣﺘﻌﺎدل‬ ‫ﻋﻤﻞ‬ ‫ﺑﺎﺷﺪ‬‫ﻗﺎﺑﻞ‬ ‫ﻣﻘﺎدﯾﺮ‬ ،‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﻋﻨﺎﺻﺮ‬ ‫ﺳﺎﯾﺮ‬ ‫ﺑﺎ‬ ‫ﻣﻘﺎﯾﺴﻪ‬ ‫در‬ ‫ﮐﻪ‬ ‫ﮐﻨﺪ‬ ‫دﻫﯽ‬ ‫ﻣﻘﯿﺎس‬ ‫ای‬ ‫ﮔﻮﻧﻪ‬ ‫ﺑﻪ‬ ‫را‬ ‫ﻬﺎ‬
‫آﻣﺪ‬ ‫ﺧﻮاﻫﺪ‬ ‫ﺑﻮﺟﻮد‬ ‫ﺧﻄﺎ‬ ‫وﯾﮋه‬ ‫ﺑﺮدارﻫﺎی‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫در‬ ‫ﻧﺘﯿﺠﻪ‬ ‫در‬ ‫و‬ ‫ﺑﮕﯿﺮﻧﺪ‬ ‫ای‬ ‫ﻣﻼﺣﻈﻪ‬.‫از‬ ‫ﻋﻨﺼﺮی‬ ‫ﮐﻪ‬ ‫ﻣﻮاردی‬ ‫در‬ ‫اﺳﺖ‬ ‫ﺑﻬﺘﺮ‬ ‫ﺑﻨﺎﺑﺮاﯾﻦ‬
‫ﻣﺎﺗﺮﯾﺲ‬A‫ﺣﺎﻟﺖ‬ ‫از‬ ‫اﺳﺖ‬ ‫ﮐﻮﭼﮏ‬ ‫ﺧﯿﻠﯽ‬
'no balance'‫ﻣﻘﺎدﯾﺮ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫ﺑﺮای‬‫ﺷﻮد‬ ‫اﺳﺘﻔﺎده‬ ‫وﯾﮋه‬ ‫ﺑﺮدارﻫﺎی‬ ‫و‬.
‫دﺳﺘﻮر‬[V,D]=eig(A,B)‫ﻗﻄﺮی‬ ‫ﻣﺎﺗﺮﯾﺲ‬D‫ﻣﺎﺗﺮﯾﺲ‬ ‫و‬ ‫ﯾﺎﻓﺘﻪ‬ ‫ﺗﻌﻤﯿﻢ‬ ‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫ﺷﺎﻣﻞ‬V‫ﺑﺮدارﻫﺎی‬ ‫آن‬ ‫ﺳﺘﻮﻧﻬﺎی‬ ‫ﮐﻪ‬
‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﺗﻮﻟﯿﺪ‬ ‫را‬ ‫ﻫﺴﺘﻨﺪ‬ ‫ﯾﺎﻓﺘﻪ‬ ‫ﺗﻌﻤﯿﻢ‬ ‫وﯾﮋه‬.‫داﺷﺖ‬ ‫ﺧﻮاﻫﯿﻢ‬ ‫ﺑﻨﺎﺑﺮاﯾﻦ‬:A*V=B*V*D
1
Balancing
2
Roundoff error
17
‫دﺳﺘﻮر‬[V,D]=eig(A,B,flag)‫ﻣ‬ ‫اﻟﮕﻮرﯾﺘﻢ‬‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﻣﺸﺨﺺ‬ ‫ﻧﯿﺰ‬ ‫را‬ ‫وﯾﮋه‬ ‫ﺑﺮدارﻫﺎی‬ ‫و‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫در‬ ‫اﺳﺘﻔﺎده‬ ‫ﻮرد‬.
flag‫ﮐﻨﺪ‬ ‫اﺧﺘﯿﺎر‬ ‫را‬ ‫زﯾﺮ‬ ‫ﻣﻮارد‬ ‫از‬ ‫ﯾﮑﯽ‬ ‫ﺗﻮاﻧﺪ‬ ‫ﻣﯽ‬:
‘chol’:‫ﻓﺎﮐﺘﻮرﮔﯿﺮی‬ ‫از‬ ‫اﺳﺘﻔﺎده‬ ‫ﺑﺎ‬ ‫را‬ ‫ﯾﺎﻓﺘﻪ‬ ‫ﺗﻌﻤﯿﻢ‬ ‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫ﻣﺤﺎﺳﺒﻪ‬cholesky‫از‬B‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫اﻧﺠﺎم‬.‫ﭼﻨﺎﻧﭽﻪ‬A‫ﻣﺘﻘﺎرن‬
(Hermation)‫و‬B‫ﻣﻌﯿﻦ‬ ‫ﻣﺘﻘﺎرن‬‫ﺷﺪ‬ ‫ﺧﻮاﻫﺪ‬ ‫اﻧﺘﺨﺎب‬ ‫ﻓﺮض‬ ‫ﭘﯿﺶ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫روش‬ ‫اﯾﻦ‬ ‫ﺑﺎﺷﺪ‬ ‫ﻣﺜﺒﺖ‬.
‘qz’:‫از‬‫اﻟﮕﻮرﯾﺘﻢ‬QZ‫ﺑﺮای‬ ‫و‬ ‫ﮔﯿﺮد‬ ‫ﻣﯽ‬ ‫ﺑﻬﺮه‬A‫و‬B‫اﺳﺖ‬ ‫اﻋﻤﺎل‬ ‫ﻗﺎﺑﻞ‬ ‫ﻧﯿﺰ‬ ‫ﻧﺎﻣﺘﻘﺎرن‬.
•‫ﻣﺜﺎل‬:
‫ﮔﯿﺮﯾﻢ‬ ‫ﻣﯽ‬ ‫ﻧﻈﺮ‬ ‫در‬ ‫را‬ ‫زﯾﺮ‬ ‫ﻣﺎﺗﺮﯾﺲ‬:












−−
−−
−−
−−
=
11.05.05.0
012/4/
142
*29.023
epseps
eps
eps
B
‫ﻣ‬ ‫ﮔﺮدﮐﺮدن‬ ‫ﺧﻄﺎی‬ ‫دﭼﺎر‬ ‫ﻣﺤﺎﺳﺒﺎت‬ ‫در‬ ‫ﮐﻪ‬ ‫اﺳﺖ‬ ‫ﻋﻨﺎﺻﺮی‬ ‫دارای‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫اﯾﻦ‬‫ﯽ‬‫ﺷﻮﻧﺪ‬.‫ﮐﻪ‬ ‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻧﺸﺎن‬ ‫ﺧﻮﺑﯽ‬ ‫ﺑﻪ‬ ‫ﻣﺜﺎل‬ ‫اﯾﻦ‬
‫ﺣﺎﻟﺖ‬ ‫از‬ ‫اﺳﺘﻔﺎده‬no balance‫اﺳﺖ‬ ‫ﺿﺮوری‬ ‫وﯾﮋه‬ ‫ﺑﺮدارﻫﺎی‬ ‫ﺻﺤﯿﺢ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫ﺑﺮای‬.‫دﺳﺘﻮرات‬ ‫اﺟﺮای‬ ‫ﺑﺎ‬:
» [VB,DB]=eig(B);
» B*VB-VB*DB
‫داﺷﺖ‬ ‫ﺧﻮاﻫﯿﻢ‬:
ans =
0 -0.0000 0.0000 0
0.0000 -0.0000 -0.0000 -0.0000
-0.0000 -0.0000 -0.0000 0.0000
0 0.0000 0 1.4420
‫دﺳﺘﻮرات‬ ‫اﺟﺮای‬ ‫ﺑﺎ‬ ‫ﮐﻪ‬ ‫ﺣﺎﻟﯽ‬ ‫در‬ ‫ﻧﯿﺴﺖ‬ ‫ﺻﻔﺮ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﺑﺎ‬ ‫ﺑﺮاﺑﺮ‬ ‫ﮐﻪ‬:
» [VN,DN]=eig(B,‘nobalance’);
» B*VN-VN*DN
‫اﺳﺖ‬ ‫ﻧﺰدﯾﮑﺘﺮ‬ ‫ﺑﺴﯿﺎر‬ ‫ﺻﻔﺮ‬ ‫ﺑﻪ‬ ‫ﮐﻪ‬ ‫آﯾﺪ‬ ‫ﻣﯽ‬ ‫ﺑﺪﺳﺖ‬ ‫زﯾﺮ‬ ‫ﻣﺎﺗﺮﯾﺲ‬:
ans =
1.0e-015 *
0.4441 -0.2220 0.1471 -0.4996
0 0.0555 -0.3695 0.0278
-0.0172 -0.0015 0.0066 0
0 -0.2220 -0.1110 0.0555
2-9-‫دﺳﺘﻮر‬estim:
•‫ﻫﺪف‬:‫ﺣﺎﻟﺖ‬ ‫ﻣﻌﺎدﻻت‬ ‫درﯾﺎﻓﺖ‬ ‫ﺑﺎ‬ ‫روﯾﺘﮕﺮ‬ ‫دﯾﻨﺎﻣﯿﮑﯽ‬ ‫ﻣﻌﺎدﻻت‬ ‫ﺗﻌﯿﯿﻦ‬‫روﯾﺘﮕﺮ‬ ‫ﺑﻬﺮه‬ ‫و‬ ‫ﺳﯿﺴﺘﻢ‬.
•‫ﻧﮕﺎرش‬:
est=estim(sys,L)
est=estim(sys,L,sensors,known)
•‫ﺗﻮﺿﯿﺤﺎت‬:
‫دﺳﺘﻮر‬est=estim(sys,L)‫ﺳﯿﺴﺘﻢ‬ ‫درﯾﺎﻓﺖ‬ ‫ﺑﺎ‬sys‫روﯾﺘﮕﺮ‬ ‫ﺑﻬﺮه‬ ‫و‬L‫روﯾﺘﮕﺮ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻣﻌﺎدﻻت‬ ،(est)‫را‬‫ﻣﯽ‬ ‫ﻧﺸﺎن‬
‫دﻫﺪ‬.‫ﺳﯿﺴﺘﻢ‬ ‫ورودﯾﻬﺎی‬ ‫ﻫﻤﻪ‬(W)‫ﺧﺮوﺟﯿﻬﺎی‬ ‫ﻫﻤﻪ‬ ‫و‬ ‫ﺗﺼﺎدﻓﯽ‬Y‫ﮔﯿﺮ‬ ‫اﻧﺪازه‬ ‫ﻗﺎﺑﻞ‬‫ﻣﯽ‬ ‫ﻓﺮض‬ ‫ی‬‫ﺷﻮﻧﺪ‬.‫روﯾﺘﮕﺮ‬est‫ﻓﺮم‬ ‫در‬
‫ﺷﻮد‬ ‫ﻣﯽ‬ ‫اراﺋﻪ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬.‫اﺻﻠﯽ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫اﮔﺮ‬(sys)‫ﺑﺎﺷﺪ‬ ‫زﯾﺮ‬ ‫ﻣﻌﺎدﻻت‬ ‫دارای‬:
X=Ax+Bw
Y=Cx+Dw
18
‫دﺳﺘﻮر‬ ‫آﻧﮕﺎه‬estim‫ﺳﯿﺴﺘﻢ‬ ‫ﺣﺎﻟﺖ‬ ‫و‬ ‫ﺧﺮوﺟﯽ‬ ‫ﺗﺨﻤﯿﻨﻬﺎی‬),(
^^
yx‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﺗﻮﻟﯿﺪ‬ ‫زﯾﺮ‬ ‫ﻣﻌﺎدﻻت‬ ‫ﺑﺎ‬ ‫را‬:
^
^
^
^^^
)(
x
I
C
x
y
xCyLxAx






=








−+=
•
‫دﺳﺘﻮر‬est=estim(sys,l,sensors,known)‫ﻋﻤﻮﻣﯽ‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬ ‫ﺑﺮای‬‫رود‬ ‫ﻣﯽ‬ ‫ﮐﺎر‬ ‫ﺑﻪ‬ ‫ﺗﺮ‬.‫ﻣﯽ‬ ‫ﻓﺮض‬ ‫اﯾﻨﺠﺎ‬ ‫در‬
‫ﺳﯿﺴﺘﻢ‬ ‫ﮐﻪ‬ ‫ﺷﻮد‬sys‫ﻣﻌﻠﻮم‬ ‫ﻫﺎی‬ ‫ورودی‬ ‫دارای‬u‫ﺗﺼﺎدﻓﯽ‬ ‫ورودﯾﻬﺎی‬ ‫و‬w‫ﺑﺎﺷﺪ‬.‫دو‬ ‫ﺑﻪ‬ ‫ﻧﯿﺰ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻫﺎی‬ ‫ﺧﺮوﺟﯽ‬ ‫ﻫﻤﭽﻨﯿﻦ‬
‫اﻧﺪا‬ ‫ﻗﺎﺑﻞ‬ ‫ﮔﺮوه‬‫ﮔﯿﺮی‬ ‫زه‬(y)‫ﮔﯿﺮی‬ ‫اﻧﺪازه‬ ‫ﻗﺎﺑﻞ‬ ‫ﻏﯿﺮ‬ ‫و‬(z)‫ﺷﻮﻧﺪ‬ ‫ﻣﯽ‬ ‫ﺗﻘﺴﯿﻢ‬.
‫ﺑﻮد‬ ‫ﺧﻮاﻫﺪ‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻣﻌﺎدﻻت‬:
u
D
D
w
D
D
x
C
C
y
z
uBwBAxx






+





+





=





++=
•
22
12
21
11
2
1
21
‫اﻧﺪﯾﺲ‬ ‫ﺑﺮدارﻫﺎی‬sensors‫و‬known‫اﻧﺪازه‬ ‫ﻗﺎﺑﻞ‬ ‫ﺧﺮوﺟﯿﻬﺎ‬ ‫از‬ ‫ﮐﺪاﻣﯿﮏ‬ ‫ﮐﻪ‬ ‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﻣﺸﺨﺺ‬ ‫ﺗﺮﺗﯿﺐ‬ ‫ﺑﻪ‬‫ﻫﺴﺘﺘﻨﺪ‬ ‫ﮔﯿﺮی‬(y)‫و‬
‫ﺗﺼﺎدﻓﯽ‬ ‫ﻏﯿﺮ‬ ‫ﻣﻘﺪار‬ ‫ورودﯾﻬﺎ‬ ‫از‬ ‫ﮐﺪاﻣﯿﮏ‬‫دارﻧﺪ‬(u).‫روﯾﺘﮕﺮ‬est‫ورودﯾﻬﺎی‬ ‫از‬u‫ﺧﺮوﺟﯿﻬﺎی‬ ‫و‬y‫ﺳﯿﺴﺘﻢ‬ ‫ﺣﺎﻟﺘﻬﺎی‬ ‫ﺗﺨﻤﯿﻦ‬ ‫و‬
‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫اﺳﺘﻔﺎده‬.
u
D
x
I
C
x
y
uDxCyLuBxAx






+





=








−−++=
•
0
)(
22
^
2
^
^
22
^
22
^^
‫روﯾﺘﮕﺮ‬ ‫ﺑﻬﺮه‬ ‫ﻃﺮاﺣﯽ‬ ‫ﮐﻪ‬ ‫اﺳﺖ‬ ‫ذﮐﺮ‬ ‫ﺷﺎﯾﺎن‬(L)‫دﺳﺘﻮرات‬ ‫ﺑﺎ‬place،kalman‫ﯾﺎ‬acker‫اﺳﺖ‬ ‫اﻣﮑﺎﻧﭙﺬﯾﺮ‬.‫دﯾﮕﺮ‬ ‫ﺳﻮی‬ ‫از‬
‫دﯾﻨﺎ‬ ‫ﮐﻪ‬ ‫اﺳﺖ‬ ‫ﻻزم‬ ‫ﺗﺨﻤﯿﻦ‬ ‫ﺻﺤﺖ‬ ‫ﺗﻀﻤﯿﻦ‬ ‫ﻣﻨﻈﻮر‬ ‫ﺑﻪ‬‫ﺑﺎﺷﻨﺪ‬ ‫ﺳﺮﯾﻌﺘﺮ‬ ‫اﺻﻠﯽ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫دﯾﻨﺎﻣﯿﮑﻬﺎی‬ ‫از‬ ‫روﯾﺘﮕﺮ‬ ‫ﻣﯿﮑﻬﺎی‬.
•‫دﺳﺘﻮر‬‫ﻫﺎی‬‫ﻣﺮﺗﺒﻂ‬:
‫دﺳﺘﻮر‬reg‫رﮔﻮﻻﺗﻮر‬ ‫ﯾﮏ‬ ‫ﻣﻌﺎدﻻت‬‫را‬‫اراﺋﻪ‬ ‫روﯾﺘﮕﺮ‬ ‫ﺑﻬﺮه‬ ‫و‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﯿﺪﺑﮏ‬ ‫درﯾﺎﻓﺖ‬ ‫ﺑﺎ‬‫دﻫﺪ‬ ‫ﻣﯽ‬.
2-10-‫دﺳﺘﻮر‬exam:
•‫ﻫﺪف‬:‫ﻣﺤﺎﺳﺒﻪ‬eX
‫ﺣﺎﻟ‬ ‫در‬‫ﺘ‬‫ﯽ‬‫ﮐﻪ‬X‫اﺳﺖ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﯾﮏ‬.
•‫ﻧﮕﺎرش‬:Y=exam(X)
•‫ﺗﻮﺿﯿﺤﺎت‬:‫ﻣﺤﺎﺳﺒﻪ‬ ‫در‬eX
‫ﮐﻪ‬ ‫ﻫﻨﮕﺎﻣﯽ‬X‫دارد‬ ‫وﺟﻮد‬ ‫ﻋﻤﺪه‬ ‫روش‬ ‫دو‬ ‫اﺳﺖ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﯾﮏ‬:
‫اﺳﺖ‬ ‫ﺗﯿﻠﻮر‬ ‫ﺳﺮی‬ ‫از‬ ‫اﺳﺘﻔﺎده‬ ‫اول‬ ‫روش‬:
LL ++++++=
!!3!2
32
K
XXX
XIe
K
X
‫روی‬ ‫ﺗﺸﺎﺑﻬﯽ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫اﻋﻤﺎل‬ ‫دوم‬ ‫روش‬X‫اﺳﺖ‬ ‫آن‬ ‫ﻗﻄﺮﺳﺎزی‬ ‫و‬.
111 −−−
=→=→= PPeePDPXXPPD DX
‫ﺗﻮان‬ ‫ﻣﯽ‬ ‫زﯾﺮ‬ ‫دﺳﺘﻮرات‬ ‫ﺑﺎ‬ ‫ﺗﺮﺗﯿﺐ‬ ‫اﯾﻦ‬ ‫ﺑﻪ‬eX
‫ﮐﺮد‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫را‬.
» [V,D]=eig(X);
» exp_x=V*diag(exp(diag(D)))/V;
‫ﭼﻨﺎﻧﭽﻪ‬X‫ﻣﺤﺎﺳﺒﻪ‬ ‫ﺑﺮای‬ ‫ﺳﻮم‬ ‫روش‬ ‫از‬ ‫ﺑﺎﺷﺪ‬ ‫ﻧﺪاﺷﺘﻪ‬ ‫ﺗﮑﺮاری‬ ‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬eX
‫ﺷﻮد‬ ‫ﻣﯽ‬ ‫اﺳﺘﻔﺎده‬.‫ﻣﺤﺎﺳﺒﻪ‬ ‫ﺳﻮم‬ ‫روش‬eX
‫راه‬ ‫از‬
‫ﺗﻘﺮﯾﺐ‬Pade‫اﺳﺖ‬.
19
•‫ﻣﺮﺗﺒﻂ‬ ‫دﺳﺘﻮرات‬:
expm1:‫ﻣﺤﺎﺳﺒﻪ‬eX
‫ﺗﻘﺮﯾﺐ‬ ‫روش‬ ‫از‬Pade
expm2:‫ﻣﺤﺎﺳﺒﻪ‬eX
‫روش‬ ‫از‬‫ﺗﯿﻠ‬ ‫ﺳﺮی‬‫ﻮر‬
expm3:‫ﻣﺤﺎﺳﺒﻪ‬eX
‫روش‬ ‫از‬‫وﯾﮋه‬ ‫ﺑﺮدارﻫﺎی‬ ‫و‬ ‫ﻣﻘﺎدﯾﺮ‬
logm:‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﻟﮕﺎرﯾﺘﻢ‬A‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫را‬.
sqrtm:‫دﺳﺘﻮر‬X=sqrtm(A)‫ﻣﺎﺗﺮﯾﺲ‬X‫ﮐﻪ‬ ‫آورد‬ ‫ﻣﯽ‬ ‫ﺑﺪﺳﺖ‬ ‫ﭼﻨﺎن‬ ‫را‬X*X=A
funm:‫ﻧﻤﺎﯾﺪ‬ ‫ﻣﯽ‬ ‫اﻋﻤﺎل‬ ‫را‬ ‫ﻣﺨﺘﻠﻒ‬ ‫ﺗﻮاﺑﻊ‬ ‫ﻣﺎﺗﺮﯾﺴﯽ‬ ‫ﻓﺮم‬.
2-11-‫دﺳﺘﻮر‬Gram:
•‫ﻫﺪف‬:‫ﮔﺮاﻣﯿﺎﻧﻬﺎی‬ ‫ﻣﺤﺎﺳﺒﻪ‬‫ﭘﺬﯾﺮی‬ ‫روﯾﺖ‬ ‫و‬ ‫ﭘﺬﯾﺮی‬ ‫ﮐﻨﺘﺮل‬.
•‫ﻧﮕﺎرش‬:
Wc=gram(sys,’c’)
Wo=gram(sys,’o’)
•‫ﺗﻮﺿﯿﺤﺎت‬:
‫دﺳﺘﻮر‬gram‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫را‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﭘﺬﯾﺮی‬ ‫روﯾﺖ‬ ‫و‬ ‫ﭘﺬﯾﺮی‬ ‫ﮐﻨﺘﺮل‬ ‫ﮔﺮاﻣﯿﺎﻧﻬﺎی‬.‫ﮐﻨﺘﺮل‬ ‫ﺑﺮرﺳﯽ‬ ‫در‬ ‫ﮔﺮاﻣﯿﺎﻧﻬﺎ‬ ‫اﯾﻦ‬ ‫از‬
‫اﺳﺘ‬ ‫ﻣﺪﻟﻬﺎ‬ ‫ﻣﺮﺗﺒﻪ‬ ‫ﮐﺎﻫﺶ‬ ‫در‬ ‫ﻧﯿﺰ‬ ‫و‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﭘﺬﯾﺮی‬ ‫روﯾﺖ‬ ‫و‬ ‫ﭘﺬﯾﺮی‬‫ﺷﻮد‬ ‫ﻣﯽ‬ ‫ﻔﺎده‬.
‫ﺑﺎﺷﺪ‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻓﻀﺎی‬ ‫ﻣﻌﺎدﻻت‬ ‫اﮔﺮ‬:
DuCxy
BuAxx
+=
+=
•
‫ﺷﻮﻧﺪ‬ ‫ﻣﯽ‬ ‫ﺗﻌﺮﯾﻒ‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫ﭘﺬﯾﺮی‬ ‫روﯾﺖ‬ ‫و‬ ‫ﭘﺬﯾﺮی‬ ‫ﮐﻨﺘﺮل‬ ‫ﮔﺮاﻣﯿﺎﻧﻬﺎی‬:
∫
∫
=
=
∞
τ
τ
ττ
ττ
dCeCeW
deBBeW
ATA
o
ATA
c
T
T
.
.
0
‫داﺷﺖ‬ ‫ﺧﻮاﻫﯿﻢ‬ ‫زﻣﺎن‬ ‫ﮔﺴﺴﺘﻪ‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬ ‫ﺑﺮای‬ ‫و‬:
∑
∑
=
=
∞
=
kTKT
o
k
KTTk
c
CACAW
ABBAW
)(
)(
0
‫ﻣﻌ‬ ‫ﻣﺜﺒﺖ‬ ‫ﭘﺬﯾﺮی‬ ‫ﮐﻨﺘﺮل‬ ‫ﮔﺮاﻣﯿﺎن‬‫اﮔﺮ‬ ‫ﺗﻨﻬﺎ‬ ‫و‬ ‫اﮔﺮ‬ ‫اﺳﺖ‬ ‫ﯿﻦ‬(A,B)‫ﻣﻌﯿﻦ‬ ‫ﻣﺜﺒﺖ‬ ‫ﻧﯿﺰ‬ ‫ﭘﺬﯾﺮی‬ ‫روﯾﺖ‬ ‫ﮔﺮاﻣﯿﺎن‬ ،‫ﺑﺎﺷﺪ‬ ‫ﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬
‫اﮔﺮ‬ ‫ﺗﻨﻬﺎ‬ ‫و‬ ‫اﮔﺮ‬ ‫اﺳﺖ‬(C,A)‫ﺑﺎﺷﺪ‬ ‫ﭘﺬﯾﺮ‬ ‫روﯾﺖ‬.‫دﺳﺘﻮر‬gram‫اﺳﺖ‬ ‫اﻋﻤﺎل‬ ‫ﻗﺎﺑﻞ‬ ‫ﻧﯿﺰ‬ ‫زﻣﺎن‬ ‫ﮔﺴﺴﺘﻪ‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬ ‫ﺑﻪ‬.
‫ﮐﺮد‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫ﺗﻮان‬ ‫ﻣﯽ‬ ‫زﯾﺮ‬ ‫ﻟﯿﺎﭘﺎﻧﻮف‬ ‫ﻣﻌﺎدﻟﻪ‬ ‫ﺣﻞ‬ ‫از‬ ‫را‬ ‫ﭘﺬﯾﺮی‬ ‫ﮐﻨﺘﺮل‬ ‫ﮔﺮاﻣﯿﺎن‬:
:‫ﺳﯿﺴﺘﻤﻬﺎی‬ ‫در‬‫ﭘﯿﻮﺳﺘﻪ‬ 0=++ TT
cc BBAWAW
:‫ﮔﺴﺴﺘﻪ‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬ ‫در‬ 0=+− T
c
T
c BBWAAW
‫اﺳﺖ‬ ‫ﺻﺎدق‬ ‫زﯾﺮ‬ ‫ﻟﯿﺎﭘﺎﻧﻮف‬ ‫ﻣﻌﺎدﻻت‬ ‫در‬ ‫ﻧﯿﺰ‬ ‫ﭘﺬﯾﺮی‬ ‫روﯾﺖ‬ ‫ﮔﺮاﻣﯿﺎن‬:
:‫ﭘﯿﻮﺳﺘﻪ‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬ ‫در‬ 0=++ CCAWWA T
oo
T
:‫ﮔﺴﺴﺘﻪ‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬ ‫در‬ 0=+− CCWAWA T
oo
T
‫دﺳﺘﻮرات‬ ‫از‬ ‫ﺑﻨﺎﺑﺮاﯾﻦ‬lyap‫و‬dlyap‫ﻧ‬‫ﻣﯽ‬ ‫ﯿﺰ‬‫ﮐﺮد‬ ‫اﺳﺘﻔﺎده‬ ‫ﮔﺮاﻣﯿﺎﻧﻬﺎ‬ ‫ﻣﺤﺎﺳﺒﮥ‬ ‫ﺑﺮای‬ ‫ﺗﻮان‬.
20
•‫ﻣﺤﺪودﯾﺘﻬﺎ‬:‫ﻣﺎﺗﺮﯾﺲ‬A‫ﺑﺎﺷﺪ‬ ‫ﭘﺎﯾﺪار‬ ‫ﺑﺎﯾﺪ‬.
•‫ﻣﺮﺗﺒﻂ‬ ‫دﺳﺘﻮرات‬:
ctrb:‫ﭘﺬﯾﺮی‬ ‫ﮐﻨﺘﺮل‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﻣﺤﺎﺳﺒﻪ‬
obsv:‫ﭘﺬﯾﺮی‬ ‫روﯾﺖ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﻣﺤﺎﺳﺒﻪ‬
balreal:‫ﻫﺎ‬ ‫ﮔﺮاﻣﯿﺎن‬ ‫از‬ ‫اﺳﺘﻔﺎده‬ ‫ﺑﺎ‬ ‫ﺷﺪه‬ ‫ﻣﺘﻌﺎدل‬ ‫ﺗﺤﻘﻖ‬ ‫ﻣﺤﺎﺳﺒﻪ‬
lyap,dlyap:‫ﻟﯿﺎﭘﺎﻧﻮف‬ ‫ﻣﻌﺎدﻟﻪ‬ ‫ﺣﻞ‬‫زﻣﺎن‬ ‫ﮔﺴﺴﺘﻪ‬ ‫و‬ ‫ﭘﯿﻮﺳﺘﻪ‬ ‫ﺣﺎﻟﺘﻬﺎی‬ ‫در‬.
2-12-‫دﺳﺘﻮر‬initial:
•‫ﻫﺪف‬:‫اوﻟﯿﻪ‬ ‫ﺷﺮاﯾﻂ‬ ‫ﺑﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﭘﺎﺳﺦ‬ ‫ﻣﺤﺎﺳﺒﻪ‬)‫ﺻﻔﺮ‬ ‫ورودی‬ ‫ﭘﺎﺳﺦ‬(
•‫ﻧﮕﺎرش‬:
initial(sys,x0)
initial(sys,x0,t)
initial(sys1,sys2,...,sysN,x0)
initial(sys1,sys2,...,sysN,x0,t)
initial(sys1,’PlotStyle1’,...,sysN,’PlotStyleN’,x0)
[y,x,t]=initial(sys,x0)
•‫ﺗﻮﺿﯿﺤﺎت‬:‫دﺳﺘﻮر‬initial‫اوﻟﯿﻪ‬ ‫ﺷﺮاﯾﻂ‬ ‫ازای‬ ‫ﺑﻪ‬ ‫ﺷﻮد‬ ‫ﻧﻤﯽ‬ ‫اﻋﻤﺎل‬ ‫آن‬ ‫ﺑﻪ‬ ‫ﺧﺎرﺟﯽ‬ ‫ورودی‬ ‫ﻫﯿﭻ‬ ‫ﮐﻪ‬ ‫را‬ ‫ﺳﯿﺴﺘﻤﯽ‬ ‫ﭘﺎﺳﺦ‬
‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺣﺎﻟﺘﻬﺎی‬ ‫در‬.‫اﺳﺖ‬ ‫اﻋﻤﺎل‬ ‫ﻗﺎﺑﻞ‬ ‫زﻣﺎن‬ ‫ﮔﺴﺴﺘﻪ‬ ‫و‬ ‫ﭘﯿﻮﺳﺘﻪ‬ ‫ﻣﺪﻟﻬﺎی‬ ‫ﺑﻪ‬ ‫ﺗﺎﺑﻊ‬ ‫اﯾﻦ‬.‫ﺣﺎﻟﺖ‬ ‫در‬ ‫ﺟﺰ‬ ‫ﺑﻪ‬
[y,t,x]=initial(sys,xo)‫دﺳﺘﻮر‬ ‫اﺟﺮای‬ ‫ﻣﻮارد‬ ‫ﺳﺎﯾﺮ‬ ‫در‬initial‫ﺳﯿﺴﺘﻢ‬ ‫اوﻟﯿﻪ‬ ‫ﺷﺮاﯾﻂ‬ ‫ﭘﺎﺳﺨﻬﺎی‬ ‫رﺳﻢ‬ ‫ﺑﺎ‬
‫اﺳﺖ‬ ‫ﻫﻤﺮاه‬.
‫دﺳﺘﻮر‬initial(sys,x0)‫ﺳﯿﺴﺘﻢ‬ ‫ﭘﺎﺳﺦ‬sys)‫اﺳﺖ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻓﺮم‬ ‫ﺑﻪ‬ ‫آن‬ ‫ﻣﻌﺎدﻻت‬ ‫ﮐﻪ‬(‫اوﻟﯿﻪ‬ ‫ﺷﺮاﯾﻂ‬ ‫ﺑﻪ‬ ‫را‬x0
‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫رﺳﻢ‬.‫ﺳﯿﺴﺘﻢ‬sys،‫ﮔﺴﺴﺘﻪ‬ ‫ﯾﺎ‬ ‫ﭘﯿﻮﺳﺘﻪ‬ ‫ﺗﻮاﻧﺪ‬ ‫ﻣﯽ‬SISO‫ﯾﺎ‬MIMO،‫ورودی‬ ‫ﺑﺎ‬‫ﺑﺎﺷﺪ‬ ‫ورودی‬ ‫ﺑﺪون‬ ‫ﯾﺎ‬.‫زﻣﺎﻧﯽ‬ ‫ﺑﺎزه‬
‫ﻋﻤﻠﮑﺮد‬ ‫ﮐﻪ‬ ‫ﺷﻮد‬ ‫ﻣﯽ‬ ‫ﺗﻌﯿﯿﻦ‬ ‫ﭼﻨﺎن‬ ‫ﺧﻮدﮐﺎر‬ ‫ﻃﻮر‬ ‫ﺑﻪ‬ ‫ﺳﺎزی‬ ‫ﺷﺒﯿﻪ‬ ‫ﻣﻨﺤﻨﯿﻬﺎی‬ ‫ﻧﻤﺎﯾﺶ‬‫ﭘﺎ‬ً‫ﻼ‬‫ﮐﺎﻣ‬ ‫ﮔﺬرا‬ ‫ﺣﺎﻟﺖ‬ ‫در‬ ‫را‬ ‫ﺳﺨﻬﺎ‬‫ﻧﺸﺎن‬
‫دﻫﺪ‬.
‫دﺳﺘﻮر‬ ‫ﻧﺘﯿﺠﻪ‬initial(sys,xo,t)‫ﺑﺮای‬ ‫ﻣﻄﻠﻮب‬ ‫زﻣﺎﻧﯽ‬ ‫ﺑﺎزه‬ ‫اﯾﻨﺤﺎﻟﺖ‬ ‫در‬ ‫ﮐﻪ‬ ‫ﺗﻔﺎوت‬ ‫اﯾﻦ‬ ‫ﺑﺎ‬ ‫اﺳﺖ‬ ‫ﻗﺒﻞ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻣﺎﻧﻨﺪ‬
‫ﺳﯿﺴ‬ ‫ﺷﺮاﯾﻂ‬ ‫ﻣﺤﺎﺳﺒﻪ‬‫اﺳﺖ‬ ‫ﺷﺪه‬ ‫ﻣﺸﺨﺺ‬ ‫ﻧﯿﺰ‬ ‫ﺘﻢ‬.‫ﻣﯽ‬‫اﻧﺘﺨﺎب‬ ‫ﺑﺎ‬ ‫ﺗﻮان‬t=Tfinal‫ﯾﺎ‬ ‫ﮐﺮد‬ ‫ﻣﺸﺨﺺ‬ ‫را‬ ‫ﺳﺎزی‬ ‫ﺷﺒﯿﻪ‬ ‫اﻧﺘﻬﺎی‬ ‫ﻟﺤﻈﻪ‬t
‫ﻧﻤﻮد‬ ‫ﺗﻌﺮﯾﻒ‬ ‫زﯾﺮ‬ ‫ﺑﺮدار‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫را‬:
t=0:dt:tfinal
:‫ﻣﺜﺎل‬ t=0:0.1:10;
‫ﺷﺒﯿﻪ‬ ‫زﻣﺎﻧﯽ‬ ‫ﺑﺎزه‬ ‫ﺑﺮ‬ ‫ﻋﻼوه‬ ‫اﯾﻨﺤﺎﻟﺖ‬ ‫در‬‫ﺳﺎزی‬)‫ﺻﻔﺮ‬‫ﺗﺎ‬Tfinal(‫اﺳﺖ‬ ‫ﺷﺪه‬ ‫ﻣﺸﺨﺺ‬ ‫ﻧﯿﺰ‬ ‫ﺳﺎزی‬ ‫ﺷﺒﯿﻪ‬ ‫ﮔﺎﻣﻬﺎی‬ ،.‫ﺳﯿﺴ‬ ‫در‬‫ﺘﻤﻬﺎی‬
، ‫ﮔﺴﺴﺘﻪ‬dt‫ﺑﺎﺷﺪ‬ ‫ﻫﻤﺎﻫﻨﮓ‬ ‫ﺑﺮداری‬ ‫ﻧﻤﻮﻧﻪ‬ ‫زﻣﺎن‬ ‫ﺑﺎ‬ ‫ﺑﺎﯾﺪ‬.‫ﭘﯿﻮﺳﺘﻪ‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬ ‫در‬dt‫رﻓﺘﺎر‬ ‫ﺗﺎ‬ ‫ﺷﻮد‬ ‫اﺧﺘﯿﺎر‬ ‫ﮐﻮﭼﮏ‬ ‫آﻧﻘﺪر‬ ‫ﺑﺎﯾﺪ‬
‫ﮔﺮدد‬ ‫ﻣﺸﺨﺺ‬ ‫ﺧﻮﺑﯽ‬ ‫ﺑﻪ‬ ‫ﮔﺬرا‬ ‫ﺣﺎﻟﺖ‬.
‫ﺳﯿﺴﺘﻢ‬ ‫ﭼﻨﺪ‬ ‫ﭘﺎﺳﺨﻬﺎی‬ ‫ﻫﻤﺰﻣﺎن‬ ‫رﺳﻢ‬ ‫ﺑﺮای‬LTI‫رود‬ ‫ﻣﯽ‬ ‫ﮐﺎر‬ ‫ﺑﻪ‬ ‫زﯾﺮ‬ ‫دﺳﺘﻮرات‬ ، ‫اوﻟﯿﻪ‬ ‫ﺷﺮاﯾﻂ‬ ‫ﯾﮏ‬ ‫ﺑﻪ‬:
initial(sys1,sys2,...,sysN,x0)
initial(sys1,sys2,...,sysN,x0,t)
‫دﺳﺘﻮرات‬ ‫اﺟﺮای‬:
[y,t,x]=initial(sys,x0)
[y,t,x]=initial(sys,x0,t)
‫ﺷﺒﯿﻪ‬ ‫ﺧﺮوﺟﯽ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﺗﻮﻟﯿﺪ‬ ‫ﺑﻪ‬ ‫ﻣﻨﺠﺮ‬(y)،‫ﺳﺎزی‬ ‫ﺷﺒﯿﻪ‬ ‫زﻣﺎﻧﻬﺎی‬ ‫ﺑﺮدار‬(t)‫ﺳﯿﺴﺘﻢ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻣﺴﯿﺮﻫﺎی‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫و‬(x)‫ﻣﯽ‬‫ﺷﻮد‬.
‫اﯾﻨﺤﺎﻟﺖ‬ ‫در‬‫ﺷﻮد‬ ‫ﻧﻤﯽ‬ ‫رﺳﻢ‬ ‫ﻣﻨﺤﻨﯽ‬ ‫ﻫﯿﭻ‬.‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﺳﻄﺮﻫﺎی‬ ‫ﺗﻌﺪاد‬y‫ﺳﺎزی‬ ‫ﺷﺒﯿﻪ‬ ‫زﻣﺎﻧﻬﺎی‬ ‫ﺗﻌﺪاد‬ ‫ﺑﻪ‬)‫اﺑﻌﺎد‬t(‫ﺗﻌﺪاد‬ ‫و‬
21
‫اﺳﺖ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺧﺮوﺟﯿﻬﺎی‬ ‫ﺗﻌﺪاد‬ ‫ﺑﻪ‬ ‫آن‬ ‫ﺳﺘﻮﻧﻬﺎی‬.‫ﻣﺎﺗﺮﯾﺲ‬x‫ﺗﻌﺪاد‬ ‫ﺑﻪ‬ ‫ﻧﯿﺰ‬length(t)‫ﺳﯿﺴﺘﻢ‬ ‫ﺣﺎﻟﺘﻬﺎی‬ ‫ﺗﻌﺪاد‬ ‫ﺑﻪ‬ ‫و‬ ‫ﺳﻄﺮ‬
‫دارد‬ ‫ﺳﺘﻮن‬.
•‫ﻣﺜﺎل‬:‫ﻧﻈ‬ ‫در‬ ‫زﯾﺮ‬ ‫ﻓﺮم‬ ‫ﺑﻪ‬ ‫را‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻣﻌﺎدﻻت‬‫ﮔﯿﺮﯾﻢ‬ ‫ﻣﯽ‬ ‫ﺮ‬:
[ ] 





=











 −−
=








•
•
2
1
2
1
2
1
4493.69691.1
07814.0
7814.05572.0
x
x
y
x
x
x
x
‫اوﻟﯿﻪ‬ ‫ﺷﺮاﯾﻂ‬ ‫ﺑﺎ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﭘﺎﺳﺦ‬





=
0
1
0x‫اﺳﺖ‬ ‫ﺣﺼﻮل‬ ‫ﻗﺎﺑﻞ‬ ‫زﯾﺮ‬ ‫ﺑﺮﻧﺎﻣﮥ‬ ‫ﺗﻮﺳﻂ‬:
A = [-0.5572 -0.7814;0.7814 0];
C = [1.9691 6.4493];
x0 = [1 ; 0.5];
t1=0:0.1:10;
t2=0:1:10;
sys = ss(A,[],C,[]);
subplot(2,2,1);initial(sys,x0);
subplot(2,2,2);initial(sys,x0,t1);
subplot(2,2,3);initial(sys,x0,6.5);
subplot(2,2,4);initial(sys,x0,t2);
•‫ﻣﺮﺗﺒﻂ‬ ‫دﺳﺘﻮرات‬:
impulse:‫ﺳﯿﺴﺘﻢ‬ ‫ﺿﺮﺑﻪ‬ ‫ﭘﺎﺳﺦ‬ ‫رﺳﻢ‬
lsim:‫دﻟﺨﻮاه‬ ‫ورودی‬ ‫ﻫﺮ‬ ‫ﺑﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﭘﺎﺳﺦ‬ ‫رﺳﻢ‬
step:‫ﺳﯿﺴﺘﻢ‬ ‫ﭘﻠﻪ‬ ‫ﭘﺎﺳﺦ‬ ‫رﺳﻢ‬
2-13-‫دﺳﺘﻮر‬kalman:
•‫ﻫﺪف‬:‫روﯾﺘﮕﺮ‬ ‫ﻃﺮاﺣﯽ‬)‫ﻓﯿﻠﺘﺮ‬(‫زﻣﺎن‬ ‫ﮔﺴﺴﺘﻪ‬ ‫و‬ ‫ﭘﯿﻮﺳﺘﻪ‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬ ‫ﺑﺮای‬ ‫ﮐﺎﻟﻤﻦ‬
•‫ﻧﮕﺎرش‬:
[kest,l,p]=kalman(sys,Qn,Rn,Nn)
[kest,l,p,m,z]=kalman(sys,Qn,Rn,Nn)
[kest,l,p]=kalman(sys,Qn,Rn,Nn,Sensors,Known)
)‫آﺧﺮ‬ ‫ﻣﻮرد‬‫زﻣﺎن‬ ‫ﮔﺴﺴﺘﻪ‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬ ‫ﺑﺮای‬ ‫ﻓﻘﻂ‬‫اﺳﺖ‬ ‫ﺻﺎدق‬(.
22
•‫ﺗﻮﺿﯿﺤﺎت‬:
‫دﺳﺘﻮر‬kalman‫را‬ ‫ﮐﺎﻟﻤﻦ‬ ‫روﯾﺘﮕﺮ‬ ،‫ﮔﯿﺮی‬ ‫اﻧﺪازه‬ ‫ﻧﻮﯾﺰ‬ ‫و‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻧﻮﯾﺰ‬ ‫ﮐﻮارﯾﺎﻧﺲ‬ ‫ﻧﯿﺰ‬ ‫و‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬ ‫درﯾﺎﻓﺖ‬ ‫ﺑﺎ‬
‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﻃﺮاﺣﯽ‬.
‫ﺳﯿﺴﺘﻢ‬‫ﺷﻮد‬ ‫ﻣﯽ‬ ‫ﮔﺮﻓﺘﻪ‬ ‫ﻧﻈﺮ‬ ‫در‬ ‫زﯾﺮ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻣﻌﺎدﻻت‬ ‫ﺑﺎ‬:
vHwDuCxy
GwBuAxx
v +++=
++=
•
‫آن‬ ‫در‬ ‫ﮐﻪ‬ u ‫و‬ ‫ﻣﻌﯿﻦ‬ ‫ورودی‬ w ‫و‬ v ‫ﻧﻮﯾﺰﻫﺎی‬ ‫ﺗﺮﺗﯿﺐ‬ ‫ﺑﻪ‬‫ﺳ‬‫اﻧﺪازه‬ ‫ﻔﯿﺪ‬‫دارﯾﻢ‬ ‫و‬ ‫ﻫﺴﺘﻨﺪ‬ ‫ﻓﺮاﯾﻨﺪ‬ ‫و‬ ‫ﮔﯿﺮی‬:
NwvERvvEQwwE
vEwE
TTT
===
==
)(,)(,)(
0)()(
‫ﺗﺨﻤﯿﻦ‬ ‫ﯾﺎﻓﺘﻦ‬ ‫ﻫﺪف‬
^
x‫ﮔﺮدد‬ ‫ﮐﻤﯿﻨﻪ‬ ‫ﻣﺎﻧﺪﮔﺎر‬ ‫ﺣﺎﻟﺖ‬ ‫ﺧﻄﺎی‬ ‫ﮐﻮارﯾﺎﻧﺲ‬ ‫ﭼﻨﺎﻧﮑﻪ‬ ‫اﺳﺖ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺣﺎﻟﺘﻬﺎی‬ ‫از‬:
)}}{({lim
^^
T
t
xxxxP −−=
∞→
‫ﺑﻬﯿﻨﻪ‬ ‫ﭘﺎﺳﺦ‬،‫ﺑﺎﺷﺪ‬ ‫ﻣﯽ‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫آن‬ ‫ﻣﻌﺎدﻻت‬ ‫ﮐﻪ‬ ‫اﺳﺖ‬ ‫ﮐﺎﻟﻤﻦ‬ ‫ﻓﯿﻠﺘﺮ‬:
u
D
x
I
C
x
y
DuxCyLBuxAx v






+





=








−−++=
•
0
)(
^
^
^
^^^
‫آن‬ ‫در‬ ‫ﮐﻪ‬L‫ﻣﯽ‬ ‫ﺣﺎﺻﻞ‬ ‫ﺟﺒﺮی‬ ‫رﯾﮑﺎﺗﯽ‬ ‫ﻣﻌﺎدﻟﻪ‬ ‫ﯾﮏ‬ ‫ﺣﻞ‬ ‫از‬ ‫و‬ ‫ﺑﻮده‬ ‫ﻓﯿﻠﺘﺮ‬ ‫ﺑﻬﺮه‬‫ﺷﻮد‬.
‫دﺳﺘﻮر‬[kest,l,p]=kalman(sys,Qn,Rn,Nn)‫ﻣ‬‫ﮐﺎﻟﻤﻦ‬ ‫ﻓﯿﻠﺘﺮ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﺪل‬(kest)‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻧﺘﯿﺠﻪ‬ ‫را‬.
Qn،Rn‫و‬Nn‫ﺑﺎ‬ ‫ﺑﺎﻻ‬ ‫رواﺑﻂ‬ ‫در‬ ‫ﮐﻪ‬ ‫ﻫﺴﺘﻨﺪ‬ ‫ﻧﻮﯾﺰ‬ ‫ﮐﻮارﯾﺎﻧﺲ‬Q،R‫و‬N‫اﻧﺪ‬ ‫ﺷﺪه‬ ‫ﻣﺸﺨﺺ‬.sys‫ﺑﺎﯾﺪ‬ ‫ﮐﻪ‬ ‫اﺳﺖ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻣﺪل‬ ‫ﻧﯿﺰ‬
‫ﺷﻮد‬ ‫وارد‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬:
A,[B G], C, [D H]
‫ﺣﺎﺻﻞ‬ ‫روﯾﺘﮕﺮ‬(kest)‫ورودی‬ ‫دارای‬‫ﻫ‬‫ﺎی‬[u;yv]‫ﺧﺮوﺟﯿﻬﺎی‬ ‫و‬


 ^^
; xy‫ﻣﯽ‬‫ﺑﺎﺷﺪ‬.‫روﯾﺘﮕﺮ‬ ‫ﻣﻌﺎدﻟﻪ‬ ‫ﺑﺮ‬ ‫ﻋﻼوه‬ ‫دﺳﺘﻮر‬ ‫اﯾﻦ‬(kest)
‫روﯾﺘﮕﺮ‬ ‫ﺑﻬﺮه‬ ‫ﻣﻘﺪار‬ ،L‫ﮐﻮارﯾﺎ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﻧﯿﺰ‬ ‫و‬‫ﻣﺎﻧﺪﮔﺎر‬ ‫ﺧﻄﺎی‬ ‫ﻧﺲ‬P‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫اراﺋﻪ‬ ‫ﻧﯿﺰ‬ ‫را‬.
•‫ﻫﺎ‬ ‫ﻣﺤﺪودﯾﺖ‬:
‫ﮐﻪ‬ ‫ﻓﺮض‬ ‫اﯾﻦ‬ ‫ﺑﺎ‬:
)( NQHGN
HQHHNHNRR
GQGQ
T
TTT
T
+=
+++=
=
‫ﮐﻨﻨﺪ‬ ‫ارﺿﺎ‬ ‫را‬ ‫زﯾﺮ‬ ‫ﺷﺮاﯾﻂ‬ ‫ﺑﺎﯾﺪ‬ ‫ﻧﻮﯾﺰ‬ ‫و‬ ‫ﺳﯿﺴﺘﻢ‬:
1.(C,A)‫آﺷﮑﺎری‬‫ﺑﺎﺷﺪ‬ ‫ﭘﺬﯾﺮ‬(detectable)
2.R>0‫و‬0
1
≥−
− T
NRNQ
3.),(
11 T
NRNQCRNA
−−
−−‫ﻧﺎﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫ﺣﺎﻟﺖ‬ ‫ﻫﯿﭻ‬‫ﺑﺎﺷﻨﺪ‬ ‫ﻧﺪاﺷﺘﻪ‬ ‫ﻣﻮﻫﻮﻣﯽ‬ ‫ﻣﺤﻮر‬ ‫روی‬ ‫ی‬.
23
•‫ﻣﺮﺗﺒﻂ‬ ‫دﺳﺘﻮرات‬:
care:‫ﭘﯿﻮﺳﺘﻪ‬ ‫ﺟﺒﺮی‬ ‫رﯾﮑﺎﺗﯽ‬ ‫ﻣﻌﺎدﻟﻪ‬ ‫ﺣﻞ‬
estim:‫روﯾﺘﮕﺮ‬ ‫ﺑﻬﺮه‬ ‫و‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻣﻌﺎدﻻت‬ ‫روی‬ ‫از‬ ‫روﯾﺘﮕﺮ‬ ‫ﻣﻌﺎدﻻت‬ ‫ﺗﻬﯿﻪ‬
lqr:‫ﺣﺎﻟﺖ‬ ‫ﺑﯿﺪﺑﮏ‬ ‫رﮔﻮﻻﺗﻮر‬ ‫ﯾﮏ‬ ‫ﻃﺮاﺣﯽ‬LQ
2-14-‫دﺳﺘﻮر‬Lyap:
•‫ﻫﺪف‬:‫ﭘﯿﻮﺳﺘﻪ‬ ‫ﻟﯿﺎﭘﺎﻧﻮف‬ ‫ﻣﻌﺎدﻟﻪ‬ ‫ﺣﻞ‬–‫زﻣﺎن‬
•‫ﻧﮕﺎرش‬:
X=lyap(A,Q)
X=lyap(A,B,C)
•‫ﺗﻮﺿﯿﺤﺎت‬:‫دﺳﺘﻮر‬X=Lyap(A,Q)‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﺣﻞ‬ ‫را‬ ‫زﯾﺮ‬ ‫ﻟﯿﺎﭘﺎﻧﻮف‬ ‫ﻣﻌﺎدﻟﻪ‬:
AX+XAT
+Q=0
‫آن‬ ‫در‬ ‫ﮐﻪ‬A‫و‬Q‫ﻫﺴﺘﻨﺪ‬ ‫ﻣﺮﺑﻌﯽ‬ ‫ﻣﺎﺗﺮﯾﺴﻬﺎی‬.‫ﻣﺎﺗﺮﯾﺲ‬X‫اﮔﺮ‬ ‫اﺳﺖ‬ ‫ﻣﺘﻘﺎرن‬Q‫ﺑﺎﺷﺪ‬ ‫ﻣﺘﻘﺎرن‬.
‫دﺳﺘﻮر‬X=lyap(A,B,C)‫ﯾ‬ ‫ﺗﻌﻤﯿﻢ‬ ‫ﻟﯿﺎﭘﺎﻧﻮف‬ ‫ﻣﻌﺎدﻟﻪ‬‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﺣﻞ‬ ‫را‬ ‫ﺎﻓﺘﻪ‬.
AX+XB+C=0
‫آن‬ ‫در‬ ‫ﮐﻪ‬A‫و‬B‫و‬C‫ﻟﺰوﻣﺎ‬"‫ﻧﯿﺴﺘﻨﺪ‬ ‫ﻣﺮﺑﻌﯽ‬‫اﺳﺖ‬ ‫ﺳﺎزﮔﺎر‬ ‫آﻧﻬﺎ‬ ‫اﺑﻌﺎد‬ ‫وﻟﯽ‬.
•‫ﻫﺎ‬ ‫ﻣﺤﺪودﯾﺖ‬:
‫اﮔﺮ‬α1،α2،...‫و‬αn‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬A‫و‬β1،β2،...‫و‬βn‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬B‫ﭘﯿﻮﺳﺘﻪ‬ ‫ﻟﯿﺎﭘﺎﻧﻮف‬ ‫ﻣﻌﺎدﻟﻪ‬ ‫آﻧﮕﺎه‬ ،‫ﺑﺎﺷﻨﺪ‬‫ﺑﻔﺮد‬ ‫ﻣﻨﺤﺼﺮ‬ ‫ﭘﺎﺳﺦ‬
‫دﻟﺨﻮاه‬ ‫زوج‬ ‫ﻫﺮ‬ ‫ﺑﺮای‬ ‫اﮔﺮ‬ ‫دارد‬(i,j)‫ﺑﺎﺷﯿﻢ‬ ‫داﺷﺘﻪ‬:
0≠+ ji βα
‫دﺳﺘﻮر‬ ‫ﻧﺒﺎﺷﺪ‬ ‫ﺑﺮﻗﺮار‬ ‫ﺷﺮاﯾﻂ‬ ‫اﯾﻦ‬ ‫ﭼﻨﺎﻧﭽﻪ‬lyap‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﺧﻄﺎ‬ ‫ﭘﯿﻐﺎم‬ ‫ﺗﻮﻟﯿﺪ‬:
Solution does not exits or is not uniqe
•‫ﻣﺮﺗﺒﻂ‬ ‫دﺳﺘﻮرات‬:
‫دﺳﺘﻮر‬dlyap‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﺣﻞ‬ ‫را‬ ‫ﮔﺴﺴﺘﻪ‬ ‫ﻟﯿﺎﭘﺎﻧﻮف‬ ‫ﻣﻌﺎدﻟﻪ‬.
2-15-‫دﺳﺘﻮر‬null:
•‫ﻫﺪف‬:‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﯾﮏ‬ ‫ﺗﻬﯽ‬ ‫ﻓﻀﺎی‬ ‫ﺗﻌﯿﯿﻦ‬
•‫ﻧﮕﺎرش‬:B=null(A)
•‫ﺗﻮﺿﯿﺤﺎت‬:‫دﺳﺘﻮر‬B=null(A)‫ﻣﺘﻌﺎﻣﺪ‬ ‫ﭘﺎﯾﻪ‬ ‫ﯾﮏ‬‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﺗﻬﯽ‬ ‫ﻓﻀﺎی‬ ‫ﺑﺮای‬ ‫ﯾﮑﻪ‬A‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫اراﺋﻪ‬.
‫ﮐﻪ‬ ‫اﺳﺖ‬ ‫واﺿﺢ‬:IBBT
=‫ﺳﺘﻮﻧﻬﺎی‬ ‫ﺗﻌﺪاد‬ ‫و‬B،‫ﺗﻬﯽ‬ ‫ﻓﻀﺎی‬ ‫اﺑﻌﺎد‬1
A‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫را‬.
» A=[1 2 3;1 2 3;1 2 3]
A =
1 2 3
1 2 3
1 2 3
» null(A)
ans =
1
Nullity
24
-0.1690 -0.9487
0.8452 0
-0.5071 0.3162
» null(A,'r')
ans =
-2 -3
1 0
0 1
2-16-‫دﺳﺘﻮر‬obsv:
•‫ﻫﺪف‬:‫ﭘﺬﯾﺮی‬ ‫روﯾﺖ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﻣﺤﺎﺳﺒﻪ‬
•‫ﻧﮕﺎرش‬:
Ob=obsv(A,C)
Ob=obsv(sys)
•‫ﺗﻮﺿﯿﺤﺎت‬:‫دﺳﺘﻮر‬obsv‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫را‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻧﻤﺎﯾﺶ‬ ‫ﺑﺎ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﯾﮏ‬ ‫ﭘﺬﯾﺮی‬ ‫روﯾﺖ‬ ‫ﻣﺎﺗﺮﯾﺲ‬.‫اﮔﺮ‬A‫ﯾﮏ‬
‫ﻣﺎﺗﺮﯾﺲ‬n*n‫و‬C‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﯾﮏ‬p*n‫دﺳﺘﻮر‬ ،‫ﺑﺎﺷﺪ‬obsv(A,C)‫داد‬ ‫ﺧﻮاﻫﺪ‬ ‫ﻧﺘﯿﺠﻪ‬ ‫را‬ ‫زﯾﺮ‬ ‫ﭘﺬﯾﺮی‬ ‫روﯾﺖ‬ ‫ﻣﺎﺗﺮﯾﺲ‬:
[ ]Tn
CACACACOb 12 −
= L
‫دﺳﺘﻮر‬ ‫ﺑﺎ‬ ‫ﮐﻪ‬ ‫اﺳﺖ‬ ‫واﺿﺢ‬rank[obsv(A,C)]‫روﯾﺖ‬ ‫ﺗﻮان‬ ‫ﻣﯽ‬‫ﮐﺮد‬ ‫ﺑﺮرﺳﯽ‬ ‫را‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﮐﺎﻣﻞ‬ ‫ﭘﺬﯾﺮی‬.
‫اﮔﺮ‬sys‫دﺳﺘﻮر‬ ، ‫ﺑﺎﺷﺪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﯾﮏ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬obsv(sys)‫ﺧﻮاﻫﺪ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫را‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﭘﺬﯾﺮی‬ ‫روﯾﺖ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﻧﯿﺰ‬
‫ﮐﺮد‬.
‫اﺳﺖ‬ ‫ﻣﻌﺎدل‬ ‫زﯾﺮ‬ ‫دﺳﺘﻮر‬ ‫ﺑﺎ‬ ‫دﺳﺘﻮر‬ ‫اﯾﻦ‬:
Ob=obsv(sys.a,sys.b)
•‫ﻣﺜﺎل‬:‫اﺳﺖ‬ ‫ﻣﻔﺮوض‬ ‫زﯾﺮ‬ ‫ﺳﯿﺴﺘﻢ‬:
DuCxy
BuAxx
+=
+=
•
‫آن‬ ‫در‬ ‫ﮐﻪ‬:






=





−
=
10
01
,
24
11
BA
‫اﺳﺖ‬ ‫ﮐﺎﻣﻞ‬ ‫ﭘﺬﯾﺮ‬ ‫روﯾﺖ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫اﯾﻦ‬ ‫ﮐﻪ‬ ‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻧﺸﺎن‬ ‫زﯾﺮ‬ ‫ﺑﺮﻧﺎﻣﻪ‬ ‫ﺗﮑﻪ‬.
» A=[1 1;4 -2];
» B=eye(2);
» C=[1 0];
» D=0;
» rank(obsv(A,C))
ans =
2
25
•‫ﻣﺮﺗﺒﻂ‬ ‫دﺳﺘﻮرﻫﺎی‬:
obsvf:‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﺟﺪا‬ ‫ﻫﻢ‬ ‫از‬ ‫را‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻧﺎﭘﺬﯾﺮ‬ ‫روﯾﺖ‬ ‫و‬ ‫ﭘﺬﯾﺮ‬ ‫روﯾﺖ‬ ‫ﺣﺎﻟﺘﻬﺎی‬.
2-17-‫دﺳﺘﻮر‬obsvf:
•‫ﻫﺪف‬:‫ﺳﯿﺴﺘﻢ‬ ‫ﭘﺬﯾﺮ‬ ‫روﯾﺖ‬ ‫و‬ ‫ﻧﺎﭘﺬﯾﺮ‬ ‫روﯾﺖ‬ ‫ﺣﺎﻟﺘﻬﺎی‬ ‫ﮐﺮدن‬ ‫ﺟﺪا‬
•‫ﻧﮕﺎرش‬:
[Abar,Bbar,Cbar,T,k]=obsvf(A,B,C)
[Abar,Bbar,Cbar,T,k]=obsvf(A,B,C,tol)
•‫ﺗﻮﺿﯿﺤﺎت‬:‫ﮔﯿﺮﯾﻢ‬ ‫ﻣﯽ‬ ‫ﻧﻈﺮ‬ ‫در‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫را‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻣﻌﺎدﻻت‬:
DuxCy
BuxAx
np
nn
+=
+=
×
×
•
‫روﯾﺖ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫رﺗﺒﻪ‬ ‫اﮔﺮ‬‫ﺳﯿﺴﺘﻢ‬ ‫ﭘﺬﯾﺮی‬r‫ﺑﺎﺷﺪ‬)‫و‬r<n(‫ﻧﯿﺴﺖ‬ ‫ﮐﺎﻣﻞ‬ ‫ﭘﺬﯾﺮ‬ ‫روﯾﺖ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫آﻧﮕﺎه‬.‫ﺗﺸﺎﺑﻬﯽ‬ ‫ﺗﺒﺪﯾﻞ‬ ،‫اﯾﻨﺤﺎﻟﺖ‬ ‫در‬T
‫ﮐﻪ‬ ‫دارد‬ ‫وﺟﻮد‬unitary‫روﯾﺖ‬ ‫ﺣﺎﻟﺘﻬﺎی‬ ‫و‬ ‫اﺳﺖ‬‫روﯾﺖ‬ ‫و‬ ‫ﭘﺬﯾﺮ‬‫ﻧﺎﭘﺬﯾﺮ‬‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﺟﺪا‬ ‫ﻫﻢ‬ ‫از‬ ‫را‬ ‫ﺳﯿﺴﺘﻢ‬.
TT
CTCTBBTATA === ,,
‫ﺗﺒﺪﯾﻞ‬ ‫اﯾﻦ‬ ‫اﻋﻤﺎل‬ ‫ﺑﺎ‬،‫روﯾﺖ‬ ‫ﺣﺎﻟﺘﻬﺎی‬‫ﺑﺎﻻ‬ ‫ﮔﻮﺷﻪ‬ ‫در‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻧﺎﭘﺬﯾﺮ‬-‫ﭼ‬‫ﭗ‬‫ﻣﺎﺗﺮﯾﺲ‬A‫ﮔﯿﺮﻧﺪ‬ ‫ﻣﯽ‬ ‫ﻗﺮار‬:
[ ]o
o
nono
CC
B
B
B
A
AA
A 0,,
0 0
12
=





=





=
‫زوج‬ ‫ﺗﺮﺗﯿﺐ‬ ‫اﯾﻦ‬ ‫ﺑﻪ‬[Abar,Bbar,Cbar,k]=obsvf(A,B,C)‫ر‬‫وﯾﺖ‬‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫و‬ ‫اﺳﺖ‬ ‫ﮐﺎﻣﻞ‬ ‫ﭘﺬﯾﺮ‬Ano‫ﺣﺎﻟﺘﻬﺎی‬
‫ﻫﺴﺘﻨﺪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻧﺎﭘﺬﯾﺮ‬ ‫روﯾﺖ‬.
‫دﺳﺘﻮر‬[Abar,Bbar,Cbar,T,k]=obsvf(A,B,C)‫ﻫﺎی‬ ‫ﻣﺎﺗﺮﯾﺲ‬A‫و‬B‫و‬C‫ﻗﺒﻼ‬ ‫ﮐﻪ‬ ‫ﻧﺤﻮی‬ ‫ﺑﻪ‬ ‫را‬"‫ﺷﺪ‬ ‫ﮔﻔﺘﻪ‬
‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﺗﻮﻟﯿﺪ‬.T‫ﮐﻨﺘﺮل‬ ‫ﺣﺎﻟﺘﻬﺎی‬ ‫ﮐﺮدن‬ ‫ﺟﺪا‬ ‫ﺑﺮای‬ ‫ﺗﺸﺎﺑﻬﯽ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﻧﯿﺰ‬‫ﮐﻨﺘﺮل‬ ‫و‬ ‫ﭘﺬﯾﺮ‬‫اﺳﺖ‬ ‫ﻧﺎﭘﺬﯾﺮ‬.k‫ﺑﺮدار‬ ‫ﯾﮏ‬n‫اﺳﺖ‬ ‫ﻋﻀﻮی‬)n
‫اﺑﻌﺎد‬A‫اﺳﺖ‬(‫ﻫ‬ ‫و‬‫ﻧﮕﺎﺷﺖ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫ﺑﺮای‬ ‫ﺗﮑﺮار‬ ‫ﻣﺮﺗﺒﻪ‬ ‫ﻫﺮ‬ ‫در‬ ‫ﮐﻪ‬ ‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻧﺸﺎن‬ ‫آن‬ ‫ﻋﻀﻮ‬ ‫ﺮ‬T‫روﯾﺖ‬ ‫ﺣﺎﻟﺖ‬ ‫ﭼﻨﺪ‬ ،‫ﭘﺬﯾﺮ‬
‫اﺳﺖ‬ ‫ﺷﺪه‬ ‫ﺟﺪا‬.
‫ﻧﺘﯿﺠﻪ‬ ‫در‬sum(k)‫ﺣﺎﻟﺘﻬﺎی‬ ‫ﺗﻌﺪاد‬Ao‫را‬‫داد‬ ‫ﺧﻮاﻫﺪ‬ ‫ﻧﺸﺎن‬.‫دﺳﺘﻮر‬ ‫ﺑﺎ‬obsvf(A,B,C,tol)‫اﻧﺠﺎم‬ ‫ﺗﻠﺮاﻧﺲ‬ ‫ﺗﻮان‬ ‫ﻣﯽ‬
‫ﻧﯿﺰ‬ ‫را‬ ‫ﻧﺎﭘﺬﯾﺮ‬ ‫روﯾﺖ‬ ‫و‬ ‫ﭘﺬﯾﺮ‬ ‫روﯾﺖ‬ ‫ﻓﻀﺎﻫﺎی‬ ‫ﺗﻌﯿﯿﻦ‬ ‫و‬ ‫ﻣﺤﺎﺳﺒﺎت‬‫ﺗﻌﯿﯿ‬‫ﻦ‬‫ﮐﺮد‬.
•‫ﻣﺮﺗﺒﻂ‬ ‫دﺳﺘﻮرات‬:
obsv:‫ﭘﺬﯾﺮی‬ ‫روﯾﺖ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﻣﺤﺎﺳﺒﻪ‬
2-18-‫دﺳﺘﻮر‬place:
•‫ﻫﺪف‬:‫ورودی‬ ‫ﭼﻨﺪ‬ ‫ﻫﺎی‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺑﺮای‬ ‫ﻗﻄﺐ‬ ‫ﺟﺎﯾﺎب‬ ‫ﻃﺮاﺣﯽ‬
•‫ﻧﮕﺎرش‬:
K=place(A,B,P)
[K,prec,message]=place(A,B,P)
•‫ﺗﻮﺿﯿﺤﺎت‬:
‫ورودی‬ ‫ﭼﻨﺪ‬ ‫ﺳﯿﺴﺘﻢ‬)‫ورودی‬ ‫ﺗﮏ‬ ‫ﯾﺎ‬(‫اﺳﺖ‬ ‫ﻣﻔﺮوض‬ ‫زﯾﺮ‬:
BuAxx +=
•
26
‫ﻣﯽ‬ ‫ﻓﺮض‬‫ﺷﻮ‬‫ﺑﺮدار‬ ‫ﮐﻪ‬ ‫د‬P‫ﺣ‬‫ﺑﺎﺷﺪ‬ ‫ﺑﺴﺘﻪ‬ ‫ﺣﻠﻘﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺑﺮای‬ ‫ﻣﻄﻠﻮب‬ ‫ﻗﻄﺒﻬﺎی‬ ‫ﻣﺤﻞ‬ ‫ﺎوی‬1
.‫دﺳﺘﻮر‬K=place(A,B,P)
‫ﺣﺎﻟﺖ‬ ‫ﻓﯿﺪﺑﮏ‬ ‫ﻣﺎﺗﺮﯾﺲ‬K‫ﻗﺎﻧﻮن‬ ‫ﮐﻪ‬ ‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﻃﺮاﺣﯽ‬ ‫ﭼﻨﺎن‬ ‫را‬u=-Kx‫ﻣﺸﺨﺺ‬ ‫ﻣﺤﻠﻬﺎی‬ ‫در‬ ‫را‬ ‫ﺑﺴﺘﻪ‬ ‫ﺣﻠﻘﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻗﻄﺒﻬﺎی‬
‫ﺑﺮدار‬ ‫در‬ ‫ﺷﺪه‬P‫دﻫﺪ‬ ‫ﻗﺮار‬.‫ﻣﺎ‬ ‫ورودی‬ ‫ﭼﻨﺪ‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬ ‫در‬ ‫ﮐﻪ‬ ‫اﺳﺖ‬ ‫واﺿﺢ‬‫ﺗﺮﯾﺲ‬K‫ﻧﯿﺴﺖ‬ ‫ﺑﻔﺮد‬ ‫ﻣﻨﺤﺼﺮ‬.‫دﺳﺘﻮر‬place‫از‬
‫در‬ ‫اﻏﺘﺸﺎﺷﺎت‬ ‫ﺑﺮاﺑﺮ‬ ‫در‬ ‫را‬ ‫ﺑﺴﺘﻪ‬ ‫ﺣﻠﻘﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺣﺴﺎﺳﯿﺖ‬ ‫ﮐﻪ‬ ‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫اﺳﺘﻔﺎده‬ ‫اﻟﮕﻮرﯾﺘﻤﻬﺎﯾﯽ‬A‫و‬B‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﮐﺎﻫﺶ‬2
.
‫دﺳﺘﻮر‬[K,prec,message]=place(A,B,P)‫ﺗﻌﯿﯿﻦ‬ ‫ﺑﺮ‬ ‫ﻋﻼوه‬K،Prec‫ﮐﻪ‬ ‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻧﺸﺎن‬ ‫ﮐﻪ‬ ‫ﮔﺮداﻧﺪ‬ ‫ﻣﯽ‬ ‫ﺑﺮ‬ ‫را‬
‫ﺑﺴﺘﻪ‬ ‫ﺣﻠﻘﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻗﻄﺒﻬﺎی‬‫در‬ ‫ﺷﺪه‬ ‫ﺗﻌﯿﯿﻦ‬ ‫ﻣﺤﻠﻬﺎی‬ ‫ﺑﻪ‬ ‫اﻧﺪازه‬ ‫ﭼﻪ‬ ‫ﺗﺎ‬P‫ﻫﺴﺘﻨﺪ‬ ‫ﻧﺰدﯾﮏ‬.Precً‫ﺎ‬‫دﻗﯿﻘ‬ ‫ﮐﻪ‬ ‫را‬ ‫ﻗﻄﺒﻬﺎﯾﯽ‬ ‫ﺗﻌﺪاد‬‫در‬
‫در‬ ‫ﺷﺪه‬ ‫ﺗﻌﯿﯿﻦ‬ ‫ﻣﺤﻠﻬﺎی‬P‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻧﺸﺎن‬ ‫اﻧﺪ‬ ‫ﮔﺮﻓﺘﻪ‬ ‫ﻗﺮار‬.‫از‬ ‫ﺑﯿﺶ‬ ‫ﺑﺴﺘﻪ‬ ‫ﺣﻠﻘﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻗﻄﺒﻬﺎی‬ ‫از‬ ‫ﯾﮑﯽ‬ ‫اﮔﺮ‬ ‫ﺑﻌﻼوه‬10%‫از‬
‫در‬ ‫ﻫﺸﺪار‬ ‫ﭘﯿﻐﺎم‬ ‫ﯾﮏ‬ ،‫ﺑﺎﺷﺪ‬ ‫دور‬ ‫ﻣﻄﻠﻮب‬ ‫ﻣﺤﻠﻬﺎی‬message‫ﻣﯿﺸﻮد‬ ‫ﺻﺎدر‬.
‫ﺑﺎ‬‫دﺳﺘﻮر‬ ‫از‬ ‫اﺳﺘﻔﺎده‬place‫ﮐﺮد‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫را‬ ‫روﯾﺘﮕﺮ‬ ‫ﺑﻬﺮه‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﺗﻮان‬ ‫ﻣﯽ‬:
L=place(A’,C’,P)’
•‫ﻣﺮﺗﺒﻂ‬ ‫دﺳﺘﻮرات‬:
acker:‫ورودی‬ ‫ﺗﮏ‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬ ‫ﺑﺮای‬ ‫آﮐﺮﻣﻦ‬ ‫ﻓﺮﻣﻮل‬ ‫از‬ ‫اﺳﺘﻔﺎده‬ ‫ﺑﺎ‬ ‫ﻗﻄﺐ‬ ‫ﺟﺎﯾﺎﺑﯽ‬
2-19-‫دﺳﺘﻮر‬ss:
•‫ﻫﺪف‬:‫ﻣﺪل‬ ‫ﯾﮏ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﯾﺎ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬ ‫ﺗﻌﺮﯾﻒ‬LTI‫ﺣﺎﻟ‬ ‫ﻓﻀﺎی‬ ‫ﺑﻪ‬‫ﺖ‬
•‫ﻧﮕﺎرش‬:
sys=ss(A,B,C,D);
sys=ss(d);
sys=ss(A,B,C,D,ltisys);
sys=ss(A,B,C,D,’property1’,value1,…,’propertyN’,valueN);
sys_ss=ss(sys)
sys_ss=ss(sys,’minimal’)
•‫ﺗﻮﺿﯿﺤﺎت‬:‫دﺳﺘﻮر‬ss‫ﺻﻔﺮ‬ ‫ﻣﺪل‬ ‫ﯾﺎ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﺗﺎﺑﻊ‬ ‫ﻣﺪل‬ ‫ﯾﮏ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﯾﺎ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻓﺮم‬ ‫ﺑﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻧﻤﺎﯾﺶ‬ ‫ﺑﺮای‬-‫ﻗﻄﺐ‬-
‫رود‬ ‫ﻣﯽ‬ ‫ﮐﺎر‬ ‫ﺑﻪ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬ ‫ﺑﻪ‬ ‫ﺑﻬﺮه‬.
‫دﺳﺘﻮر‬SYS=ss(A,B,C,D)‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﺗﻮﻟﯿﺪ‬ ‫زﯾﺮ‬ ‫ﭘﯿﻮﺳﺘﻪ‬ ‫زﻣﺎن‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺑﺮای‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬:
DuCxy
BuAxx
+=
+=
•
‫اﮔﺮ‬D=0‫ﺻﻔﺮ‬ ‫اﺳﮑﺎﻟﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫آن‬ ‫ﻣﻘﺪار‬ ‫ﮐﺎﻓﯿﺴﺖ‬ ‫ﺑﺎﺷﺪ‬)‫آن‬ ‫اﺑﻌﺎد‬ ‫ﺑﻪ‬ ‫ﺗﻮﺟﻪ‬ ‫ﺑﺪون‬(‫ﺷﻮد‬ ‫وارد‬.
‫دﺳﺘﻮر‬sys=ss(d)‫ﺑ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﺑﺎ‬ ‫ﺳﯿﺴﺘﻢ‬‫ﺛﺎﺑﺖ‬ ‫ﻬﺮه‬d‫ﺑﺎ‬ ‫اﺳﺖ‬ ‫ﻣﻌﺎدل‬ ‫و‬ ‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻧﻤﺎﯾﺶ‬ ‫را‬:
sys=ss([],[],[],d);
‫دﺳﺘﻮر‬sys=ss(A,B,C,D,ltisys)‫در‬ ‫ﺷﺪه‬ ‫ﻣﺸﺨﺺ‬ ‫وﯾﮋﮔﯽ‬ ‫ﺑﻪ‬ ‫ﺗﻮﺟﻪ‬ ‫ﺑﺎ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬ ‫ﯾﮏ‬ltisys‫ﺗﻮﻟﯿﺪ‬
‫ﮐﻨﺪ‬ ‫ﻣﯽ‬.‫ﻣﻮ‬ ‫از‬ ‫ﯾﮑﯽ‬ ‫ﺗﻮاﻧﺪ‬ ‫ﻣﯽ‬ ‫وﯾﮋﮔﯽ‬ ‫اﯾﻦ‬.‫ﺑﺎﺷﺪ‬ ‫زﯾﺮ‬ ‫ﺟﺪول‬ ‫در‬ ‫ﺷﺪه‬ ‫ذﮐﺮ‬ ‫ارد‬:
‫وﯾﮋﮔﯽ‬ ‫ﻧﻮع‬‫وﯾﮋﮔﯽ‬ ‫ﻣﻌﺮﻓﯽ‬‫وﯾﮋﮔﯽ‬ ‫ﻧﺎم‬
1
‫ﺳﯿﺴ‬ ‫ﻗﻄﺒﻬﺎی‬‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫ﻫﻤﺎن‬ ‫ﺑﺴﺘﻪ‬ ‫ﺣﻠﻘﻪ‬ ‫ﺘﻢ‬A-BK‫ﻫﺴﺘﻨﺪ‬.
2
‫اﻧﺪ‬ ‫ﺷﺪه‬ ‫اﻗﺘﺒﺎس‬ ‫زﯾﺮ‬ ‫ﻣﺮﺟﻊ‬ ‫از‬ ‫اﻟﮕﻮرﯾﺘﻤﻬﺎ‬ ‫اﯾﻦ‬:
Kautsky,J. and N.K.Nichols, "Robust Pole Assignment in Linear State Feedback", Int.J.Control, 41 (1985) , pp.1129-1155
27
‫ﻣﺎ‬‫ﺗﺮﯾﺲ‬‫ورودی‬ ‫ﺗﺄﺧﯿﺮﻫﺎی‬/‫ﺧﺮوﺟﯽ‬IoDelayMatrix
‫ﺑﺮدار‬‫ورودی‬ ‫در‬ ‫ﺗﺄﺧﯿﺮ‬InputDelay
Cell array‫ورودی‬ ‫ﮐﺎﻧﺎﻟﻬﺎی‬ ‫ﮔﺮوه‬InputGroup
Cell vector of string‫ورودی‬ ‫ﮐﺎﻧﺎﻟﻬﺎی‬ ‫اﺳﺎﻣﯽ‬InputName
Text‫ﻣﺪل‬ ‫ﻣﻌﺮﻓﯽ‬ ‫ﺑﺮای‬ ‫ﯾﺎدداﺷﺘﻬﺎ‬Notes
‫ﺑﺮدار‬‫ﺧﺮوﺟﯽ‬ ‫ﺗﺄﺧﯿﺮﻫﺎی‬OutputDelay
Cell array‫ﮔﺮو‬‫ﺧﺮوﺟﯽ‬ ‫ﮐﺎﻧﺎﻟﻬﺎی‬ ‫ه‬OutputGroup
Cell vector of strings‫ﺧﺮوﺟﯽ‬ ‫ﮐﺎﻧﺎﻟﻬﺎی‬ ‫اﺳﺎﻣﯽ‬OutputName
‫اﺳﮑﺎﻟﺮ‬‫ﻧﻤﻮﻧﻪ‬ ‫زﻣﺎن‬‫ﺑﺮداری‬Ts
‫دﻟﺨﻮاه‬‫اﺿﺎﻓﯽ‬ ‫اﻃﻼﻋﺎت‬UserData
‫ﺷﻮد‬ ‫ﻣﯽ‬ ‫داده‬ ‫ﺗﻮﺿﯿﺢ‬ ‫اﺧﺘﺼﺎر‬ ‫ﺑﻪ‬ ‫وﯾﮋﮔﯿﻬﺎ‬ ‫اﯾﻦ‬ ‫از‬ ‫ﯾﮏ‬ ‫ﻫﺮ‬:
1.‫ﺑﺮداری‬ ‫ﻧﻤﻮﻧﻪ‬ ‫زﻣﺎن‬Ts)‫ﺛﺎﻧﯿﻪ‬ ‫ﺑﺮﺣﺴﺐ‬(‫ﺣﺎﻟ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬ ‫ﺗﻌﺮﯾﻒ‬ ‫ﺑﺮای‬‫زﻣﺎن‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬ ‫ﺖ‬-‫ﻣﯽ‬ ‫ﮐﺎر‬ ‫ﺑﻪ‬ ‫ﮔﺴﺴﺘﻪ‬
‫رود‬.Ts=0‫زﻣﺎن‬ ‫ﺳﯿﺴﺘﻢ‬-‫و‬ ‫ﭘﯿﻮﺳﺘﻪ‬Ts=-1‫اﺳﺖ‬ ‫ﻧﺎﻣﻌﻠﻮم‬ ‫ﺑﺮداری‬ ‫ﻧﻤﻮﻧﻪ‬ ‫زﻣﺎن‬ ‫ﺑﺎ‬ ‫ﮔﺴﺴﺘﻪ‬ ‫زﻣﺎن‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻣﻌﺮف‬.
2.‫وﯾﮋﮔﯽ‬InputDelay،OutputDelay‫و‬IoDelayMatrix‫را‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪﻟﻬﺎی‬ ‫در‬ ‫ﺗﺎﺧﯿﺮ‬ ‫ﮐﺮدن‬ ‫وارد‬ ‫اﻣﮑﺎن‬
‫اﯾﻦ‬ ‫ﻓﺮض‬ ‫ﭘﯿﺶ‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫و‬ ‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫اﯾﺠﺎد‬‫اﺳﺖ‬ ‫ﺻﻔﺮ‬ ‫وﯾﮋﮔﯿﻬﺎ‬)‫ﺗﺎﺧﯿﺮ‬ ‫ﺑﺪون‬(
3.‫ﻫﺎی‬ ‫وﯾﮋﮔﯽ‬InputName‫و‬OutputName‫ﻧ‬ ‫اﻣﮑﺎن‬‫ﺎ‬‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﮐﺎرﺑﺮ‬ ‫ﺑﻪ‬ ‫را‬ ‫ﺧﺮوﺟﯿﻬﺎ‬ ‫و‬ ‫ورودﯾﻬﺎ‬ ‫ﺗﮏ‬ ‫ﺗﮏ‬ ‫ﻣﮕﺬاری‬.
4.InputGroup‫و‬OutputGroup‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻧﻮﯾﺲ‬ ‫ﺑﺮﻧﺎﻣﻪ‬ ‫ﺑﻪ‬ ‫را‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺧﺮوﺟﯿﻬﺎی‬ ‫و‬ ‫ورودﯾﻬﺎ‬ ‫ﺑﻨﺪی‬ ‫ﮔﺮوه‬ ‫اﻣﮑﺎن‬.‫ﺑﻪ‬
‫ﺳﯿﺴﺘﻢ‬ ‫ﯾﮏ‬ ‫در‬ ‫ﻣﺜﺎل‬ ‫ﻋﻨﻮان‬5‫ﺑﺮﻧﺎﻣﻪ‬ ،‫ورودی‬‫ﻣﯽ‬ ‫ﻧﻮﯾﺲ‬‫ﺗﻮاﻧﺪ‬3‫ﮔﺮوه‬ ‫در‬ ‫را‬ ‫ورودی‬control‫و‬2‫در‬ ‫را‬ ‫ورودی‬
‫ﮔﺮوه‬noise‫دﻫﺪ‬ ‫ﻗﺮار‬.
5.‫وﯾﮋﮔﯿﻬﺎی‬Notes‫و‬User data‫اﻧﺪ‬ ‫ﺷﺪه‬ ‫ﮔﺮﻓﺘﻪ‬ ‫ﻧﻈﺮ‬ ‫در‬ ‫ﻧﻮﯾﺲ‬ ‫ﺑﺮﻧﺎﻣﻪ‬ ‫ﺗﻮﺳﻂ‬ ‫اﺿﺎﻓﯽ‬ ‫ﻣﻮارد‬ ‫ﺗﻌﺮﯾﻒ‬ ‫ﺑﺮای‬ ‫ﻧﯿﺰ‬.Notes
‫ﯾﮏ‬ ‫ﺗﻨﻬﺎ‬textً‫ﻻ‬‫ﻣﻌﻤﻮ‬ ‫و‬ ‫ﺑﻮده‬‫اﺳﺖ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫درﺑﺎره‬ ‫ﺗﻮﺿﯿﺤﺎﺗﯽ‬ ‫ﺣﺎوی‬.‫وﯾﮋﮔﯽ‬ ‫در‬User data‫ﺗﻮاﻧﺪ‬ ‫ﻣﯽ‬ ‫ﻧﻮﯾﺲ‬ ‫ﺑﺮﻧﺎﻣﻪ‬
‫ﮐﻨﺪ‬ ‫ﺗﻌﺮﯾﻒ‬ ‫را‬ ‫ﺧﻮد‬ ‫ﻧﻈﺮ‬ ‫ﻣﻮرد‬ ‫ﻫﺎی‬ ‫داده‬.
‫ﺷﺪ‬ ‫ﺧﻮاﻫﺪ‬ ‫ﻣﺸﺨﺺ‬ ‫وﯾﮋﮔﯿﻬﺎ‬ ‫اﯾﻦ‬ ‫ﺑﻪ‬ ‫دﻫﯽ‬ ‫ﻣﻘﺪار‬ ‫ﻣﻘﺪار‬ ‫ﻧﺤﻮه‬ ،‫ﺷﺪه‬ ‫ذﮐﺮ‬ ‫دﺳﺘﻮراﻟﻌﻤﻠﻬﺎی‬ ‫اﯾﻦ‬ ‫اﻧﺘﻬﺎی‬ ‫در‬ ‫ﮐﻪ‬ ‫ﻣﺜﺎﻟﻬﺎﯾﯽ‬ ‫در‬.
‫دﺳﺘﻮر‬sys_ss=ss(sys)‫ﻣﺪل‬sys،‫دﺳﺘﻮرات‬ ‫ﺗﻮﺳﻂ‬ ‫ﺷﺪه‬ ‫ﺗﻮﻟﯿﺪ‬tf‫و‬zpk‫ﻣﺪل‬ ‫ﺑﻪ‬ ‫را‬sys_ss‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫در‬
‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﺗﺒﺪﯾﻞ‬.‫ﺷﻮد‬ ‫ﻣﯽ‬ ‫ﮔﻔﺘﻪ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﺗﺤﻘﻖ‬ ‫ﻋﻤﻠﯿﺎت‬ ‫اﯾﻦ‬ ‫ﺑﻪ‬.
‫دﺳﺘﻮر‬sys_ss=ss(sys,’minimal’)‫ﺳﯿﺴﺘﻢ‬ ‫از‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﺗﺤﻘﻖ‬ ‫ﯾﮏ‬sys‫آن‬ ‫در‬ ‫ﮐﻪ‬ ‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫اراﺋﻪ‬ ‫ﭼﻨﺎن‬ ‫را‬
‫ﻧﺒﺎﺷﺪ‬ ‫ﻣﻮﺟﻮد‬ ‫ﻧﺎﭘﺬﯾﺮی‬ ‫ﮐﻨﺘﺮل‬ ‫ﯾﺎ‬ ‫ﻧﺎﭘﺬﯾﺮ‬ ‫روﯾﺖ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻫﯿﭻ‬.
‫اﺳﺖ‬ ‫ﻣﻌﺎدل‬ ‫زﯾﺮ‬ ‫دﺳﺘﻮر‬ ‫ﺑﺎ‬ ‫دﺳﺘﻮر‬ ‫اﯾﻦ‬:
sys_ss=mineral(ss(sys))
‫ﻣﺜﺎل‬1:‫ورودی‬ ‫ﺗﮏ‬ ‫ﺳﯿﺴﺘﻢ‬/‫ﮔﯿﺮﯾﻢ‬ ‫ﻣﯽ‬ ‫ﻧﻈﺮ‬ ‫در‬ ‫ا‬ ‫ر‬ ‫زﯾﺮ‬ ‫دار‬ ‫ﺗﺎﺧﯿﺮ‬ ‫ﺧﺮوﺟﯽ‬ ‫ﺗﮏ‬:
‫زﯾﺮ‬ ‫دﺳﺘﻮرات‬plant‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﻣﻌﺮﻓﯽ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫در‬ ‫را‬:
» sys=tf(1,[1 1]);
» sys_ss=ss(sys);
‫ﺑﻪ‬ ‫ﺗﺎﺧﯿﺮ‬ ‫اﻓﺰودن‬ ‫ﺑﺮای‬plant،‫وﯾﮋﮔﯽ‬Input Delay‫ﮐﻨﯿﻢ‬ ‫ﻣﯽ‬ ‫دﻫﯽ‬ ‫ﻣﻘﺪار‬ ‫را‬.‫اﯾﻨﮑﺎر‬‫دﺳﺘﻮر‬ ‫ﺑﺎ‬set‫ﺷﻮد‬ ‫ﻣﯽ‬ ‫اﻧﺠﺎم‬:
28
» set(sys_ss,’InputDelay’,0.3);
‫ﻣ‬ ‫ﮐﺎر‬ ‫ﺑﻪ‬ ‫را‬ ‫زﯾﺮ‬ ‫دﺳﺘﻮر‬ ‫آن‬ ‫ﺑﻪ‬ ‫ﯾﺎدداﺷﺖ‬ ‫ﯾﮏ‬ ‫اﻓﺰودن‬ ‫ﻧﯿﺰ‬ ‫و‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺧﺮوﺟﯽ‬ ‫و‬ ‫ورودی‬ ‫ﻧﺎﻣﮕﺬاری‬ ‫ﺑﺮای‬‫ﯽ‬‫ﺑﺮﯾﻢ‬:
»set(sys_ss,’InputName’,’energy’,Outputname’,’temprature’,’Notes’,’A
Sample Heater Mode’)
‫اﯾﻦ‬ ‫ﺑﻪ‬‫ﺗﺮﺗ‬‫ﯿﺐ‬sys_ss‫ﺧﻮﺑﯽ‬ ‫ﺑﻪ‬ ‫آن‬ ‫ﭘﻠﻪ‬ ‫ﭘﺎﺳﺦ‬ ‫رﺳﻢ‬ ‫و‬ ‫اﺳﺖ‬ ‫دار‬ ‫ﺗﺎﺧﯿﺮ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺑﺮای‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬ ‫واﻗﻊ‬ ‫در‬3/0‫ﺛﺎﻧﯿﻪ‬
‫ﮐﺮد‬ ‫ﺧﻮاﻫﺪ‬ ‫ﻣﺸﺨﺺ‬ ‫ﭘﺎﺳﺦ‬ ‫اﺑﺘﺪای‬ ‫در‬ ‫را‬ ‫ﻣﺮده‬ ‫زﻣﺎن‬.
‫دﺳﺘﻮر‬ ‫ﺷﻮد‬ ‫آﮔﺎه‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺷﺪه‬ ‫ﺗﻨﻈﯿﻢ‬ ‫وﯾﮋﮔﯿﻬﺎی‬ ‫از‬ ‫ﯾﮑﯽ‬ ‫ﻓﻌﻠﯽ‬ ‫ﻣﻘﺪار‬ ‫از‬ ‫ﺑﺨﻮاﻫﺪ‬ ‫ﻧﻮﯾﺲ‬ ‫ﺑﺮﻧﺎﻣﻪ‬ ‫ﻟﺤﻈﻪ‬ ‫ﻫﺮ‬ ‫در‬ ‫ﭼﻨﺎﻧﭽﻪ‬get‫ﻣﻮرد‬
‫ﻗﺮا‬ ‫اﺳﺘﻔﺎده‬‫ﮔﯿﺮد‬ ‫ﻣﯽ‬ ‫ر‬.‫ﻗﺒﻞ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫در‬ ‫ﻣﺜﺎل‬ ‫ﻋﻨﻮان‬ ‫ﺑﻪ‬:
» get(sys_ss,’InputDelay’)
ans=
0.3000
‫اﺳﺖ‬ ‫اﻣﮑﺎﻧﭙﺬﯾﺮ‬ ‫ﻧﯿﺰ‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫دﺳﺘﺮﺳﯽ‬ ‫اﯾﻦ‬:
» sys_ss.InputDelay
ans=
0.3000
‫ﻣﺜﺎل‬2:
‫ﻣﺘﻐﯿﺮ‬ ‫در‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬ ‫ﻗﺮاردادن‬ ‫ﺑﺮ‬ ‫ﻋﻼوه‬ ‫زﯾﺮ‬ ‫ﺑﺮﻧﺎﻣﻪ‬system‫و‬ ‫ﺣﺎﻟﺘﻬﺎ‬ ،‫ﻧﺎﻣﮕﺬاری‬ ‫ﻧﯿﺰ‬ ‫را‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺧﺮوﺟﯿﻬﺎی‬
‫ﮐﻨﺪ‬ ‫ﻣﯽ‬.
A=[0 1;-1 -2];
B=[1;1];
C=[1 0;0 2];
D=0;
system=ss(A,B,C,D,'statename',{'position' 'velocity'},…
'Outputname',{'out1';'out2'});
2-20-‫دﺳﺘﻮر‬ssdata:
•‫ﻫﺪف‬:‫ﻣﺎﺗﺮﯾﺴﻬﺎی‬ ‫ﺑﻪ‬ ‫دﺳﺘﺮﺳﯽ‬A،B،C‫و‬D‫ﻣﺪل‬ ‫روی‬ ‫از‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬‫ﺳﯿﺴﺘﻢ‬
•‫ﻧﮕﺎرش‬:[A,B,C,D]= ssdata (SYS)‫ﭘﯿﻮﺳﺘﻪ‬ ‫زﻣﺎن‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬
[A,B,C,D,Ts]=ssdata(SYS)‫ﮔﺴﺴﺘﻪ‬ ‫زﻣﺎن‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬
•‫ﺗﻮﺿﯿﺤﺎت‬:
‫ﻗﻄﺐ‬ ‫ﯾﺎ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﺗﺎﺑﻊ‬ ‫ﻓﺮم‬ ‫ﺑﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻣﺪل‬ ‫ﭼﻨﺎﻧﭽﻪ‬/‫ﺻﻔﺮ‬/‫ﺗﺒﺪﯾﻞ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬ ‫ﺑﻪ‬ ‫را‬ ‫آن‬ ‫اﺑﺘﺪا‬ ‫دﺳﺘﻮر‬ ‫اﯾﻦ‬ ، ‫ﺑﺎﺷﺪ‬ ‫ﺑﻬﺮه‬‫ﻣﺮده‬
‫ﺳﭙﺲ‬ ،A‫و‬B‫و‬C‫و‬D‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫اﺳﺘﺨﺮاج‬ ‫را‬.
•‫ﻣﺮﺗﺒﻂ‬ ‫دﺳﺘﻮرﻫﺎی‬:
ss:‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬ ‫ﺗﻌﺮﯾﻒ‬
2-21-‫دﺳﺘﻮر‬ss2ss:
•‫ﻫﺪف‬:‫ﺣﺎﻟﺖ‬ ‫ﻣﺤﻮرﻫﺎی‬ ‫ﺗﺒﺪﯾﻞ‬1
‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻧﻤﺎﯾﺶ‬ ‫در‬)‫ﺗﺸﺎﺑﻬﯽ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫اﻋﻤﺎل‬(
1
State Coordinates
29
•‫ﻧﮕﺎرش‬:SYST=ss2ss(SYS,T)
•‫ﺗﻮﺿﯿﺤﺎت‬:‫ﺳﯿﺴﺘﻢ‬SYS‫ﻓﻀﺎی‬ ‫ﻧﻤﺎﯾﺶ‬ ‫ﺑﺎ‬‫اﺳﺖ‬ ‫ﻣﻔﺮوض‬ ‫زﯾﺮ‬ ‫ﺣﺎﻟﺖ‬:
DuCxy
BuAxx
+=
+=
•
‫دﺳﺘﻮر‬ss2ss‫ﺗﺸﺎﺑﻬﯽ‬ ‫ﺗﺒﺪﯾﻞ‬Txx =‫ﺑﺮدار‬ ‫روی‬ ‫را‬x‫ﺳﯿﺴﺘﻢ‬ ‫و‬ ‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫اﻋﻤﺎل‬SYST‫را‬ ‫زﯾﺮ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬ ‫ﺑﺎ‬
‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻧﺘﯿﺠﻪ‬.
DuxCTy
TBuxTATx
+=
+=
−
−
•
1
1
‫دﺳﺘﻮر‬SYST= ss2ss (SYS,T)‫ﺳﯿﺴﺘﻢ‬ ‫درﯾﺎﻓﺖ‬ ‫ﺑﺎ‬SYS‫ﺗﺒﺪﯾﻞ‬ ‫و‬‫ﺗﺸﺎﺑﻬﯽ‬T‫ﻣﻌﺎدل‬ ‫ﺳﯿﺴﺘﻢ‬SYST‫ﻣﯽ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫را‬
‫ﮐﻨﺪ‬.‫ﻣﺎﺗﺮﯾﺲ‬T‫ﺑﺎﺷﺪ‬ ‫ﭘﺬﯾﺮ‬ ‫وارون‬ ‫ﺑﺎﯾﺪ‬.
•‫دﺳﺘﻮ‬‫رﻫﺎی‬‫ﻣﺮﺗﺒﻂ‬:
canon:‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫در‬ ‫ﮐﺎﻧﻮﻧﯿﮑﺎل‬ ‫ﺗﺤﻘﻖ‬
2-22-‫دﺳﺘﻮر‬ss2tf:
•‫ﻫﺪف‬:‫ﺗﺒﺪﯾﻞ‬ ‫ﺗﺎﺑﻊ‬ ‫ﺑﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬ ‫ﺗﺒﺪﯾﻞ‬
•‫ﻧﮕﺎرش‬:[Num,Den]=ss2tf(A,B,C,D,iu)
•‫ﺗﻮﺿﯿﺤﺎت‬:‫ﺗ‬ ‫ﺗﺎﺑﻊ‬‫ﺳﯿﺴﺘﻢ‬ ‫ﺒﺪﯾﻞ‬
DuCxy
BuAxx
+=
+=
•
‫ﺑﻪ‬ ‫ﻧﺴﺒﺖ‬ ‫را‬iu‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫ورودی‬ ‫اﻣﯿﻦ‬.‫اﺳﺖ‬ ‫زﯾﺮ‬ ‫راﺑﻄﻪ‬ ‫ﻃﺒﻖ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﺗﺎﺑﻊ‬ ‫ﻣﺤﺎﺳﺒﻪ‬:
DBAsIC
sDen
sNum
sH +−== −1
)(
)(
)(
)(
‫ﺑﺮدار‬Den‫ﻧﺰوﻟﯽ‬ ‫ﺗﻮاﻧﻬﺎی‬ ‫ﺣﺴﺐ‬ ‫ﺑﺮ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﺗﺎﺑﻊ‬ ‫ﻣﺨﺮج‬ ‫ﺿﺮاﯾﺐ‬ ‫ﺣﺎوی‬s‫اﺳﺖ‬.‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﺳﻄﺮﻫﺎی‬ ‫ﺗﻌﺪاد‬Num‫ﺗﻌﺪاد‬ ‫ﺑﺎ‬ ‫ﺑﺮاﺑﺮ‬
‫ﺳﯿﺴﺘﻢ‬ ‫ﺧﺮوﺟﯿﻬﺎی‬‫اﺳﺖ‬ ‫ﻣﺘﻨﺎﻇﺮ‬ ‫ﺧﺮوﺟﯽ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﺗﺎﺑﻊ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫ﺳﻄﺮ‬ ‫ﻫﺮ‬ ‫و‬ ‫اﺳﺖ‬.
•‫ﻣﺮﺗﺒﻂ‬ ‫دﺳﺘﻮرﻫﺎی‬:
tf2ss:‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬ ‫ﺑﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﺗﺎﺑﻊ‬ ‫ﺗﺒﺪﯾﻞ‬
ss2ss:‫ﺳﯿﺴﺘﻢ‬ ‫روی‬ ‫ﺗﺸﺎﺑﻬﯽ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫اﻧﺠﺎم‬
2-23-‫دﺳﺘﻮر‬tf2ss:
•‫ﻫﺪف‬:‫ﺳﯿﺴﺘﻢ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﺗﺎﺑﻊ‬ ‫روی‬ ‫از‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬ ‫آوردن‬ ‫ﺑﺪﺳﺖ‬
•‫ﻧﮕﺎرش‬:[A,B,C,D]=tf2ss(Num,Den)
•‫ﺗﻮﺿﯿﺤﺎت‬:
‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫زﯾﺮ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫را‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﺗﺎﺑﻊ‬.
DuCxy
BuAxx
+=
+=
•
‫ﺑﺎﺷﺪ‬ ‫ﻣﯽ‬ ‫ﮐﻨﺘﺮﻟﺮ‬ ‫ﮐﺎﻧﻮﻧﯿﮑﺎل‬ ‫ﻓﺮم‬ ‫ﺑﻪ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬.
30
•‫ﻣﺮﺗﺒﻂ‬ ‫دﺳﺘﻮرﻫﺎی‬:
ss2tf:‫ﺗﺒﺪﯾﻞ‬ ‫ﺗﺎﺑﻊ‬ ‫ﺑﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬ ‫ﺗﺒﺪﯾﻞ‬
31
‫ﺑﺮﻧﺎ‬ ‫ﺑﺮرﺳﯽ‬‫ﻣﺜﺎﻟﻬﺎی‬ ‫ﺑﻪ‬ ‫ﻣﺮﺑﻮط‬ ‫ﻫﺎی‬ ‫ﻣﻪ‬
‫ﮐﺘﺎب‬ ‫ﻣﺘﻦ‬
3
32
3-1-‫ﻏﯿﺮﺧﻄﯽ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﭘﺎﺳﺨﻬﺎی‬ ‫رﺳﻢ‬)‫ﻣﺜﺎل‬5-3(
‫ﻣﺜﺎل‬ ‫در‬5-3‫ﺣﺎﻟﺖ‬ ‫ﻓﯿﺪﺑﮏ‬ ،‫ﻣﻌﮑﻮس‬ ‫آوﻧﮓ‬ ‫ﺷﺪۀ‬ ‫ﺧﻄﯽ‬ ‫ﻣﺪل‬ ‫ﺑﺮای‬
ke=[-1.91 -4.262 -45.49 -15.64]‫در‬ ‫ﺑﺴﺘﻪ‬ ‫ﺣﻠﻘﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻗﻄﺒﻬﺎی‬ ‫ﺗﺎ‬ ‫ﮔﺮدﯾﺪ‬ ‫ﻃﺮاﺣﯽ‬
[-1,-2,-2.5,-3]‫ﮔﯿﺮﻧﺪ‬ ‫ﻗﺮار‬.‫ﻋﻤﻠﮑﺮد‬ ‫ﺑﺮرﺳﯽ‬ ‫ﺑﺮای‬ ‫اﻣﺎ‬‫ﻏﯿﺮﺧﻄﯽ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺑﺮروی‬ ‫را‬ ‫آن‬ ‫ﺑﺎﯾﺪ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﯿﺪﺑﮏ‬ ‫اﯾﻦ‬
‫آزﻣﻮد‬.‫ﻫﺴﺘﯿﻢ‬ ‫ﻏﯿﺮﺧﻄﯽ‬ ‫دﯾﻔﺮاﻧﺴﯿﻞ‬ ‫ﻣﻌﺎدﻻت‬ ‫ﺣﻞ‬ ‫ﻧﯿﺎزﻣﻨﺪ‬ ‫ﻣﻨﻈﻮر‬ ‫اﯾﻦ‬ ‫ﺑﻪ‬.‫اﻓﺰار‬ ‫ﻧﺮم‬ ‫در‬ ‫اﯾﻨﮑﺎر‬Matlab‫ﺑﺎ‬ ً‫ﻻ‬‫ﻣﻌﻤﻮ‬
‫دﺳﺘﻮرﻫﺎی‬1
ODE‫ﻣﯽ‬ ‫اﻧﺠﺎم‬‫ﮔﯿﺮد‬.‫اﺳﺖ‬ ‫ﺷﺪه‬ ‫ﺑﺮرﺳﯽ‬ ‫ﻣﻌﺎدﻻت‬ ‫ﻧﻮع‬ ‫اﯾﻦ‬ ‫ﺣﻞ‬ ‫ﺷﯿﻮۀ‬ ،‫ﺗﻔﺼﯿﻞ‬ ‫ﺑﻪ‬ ‫ﻣﺜﺎل‬ ‫اﯾﻦ‬ ‫در‬ ‫اﻣﺎ‬.‫ﻓﺎﯾﻞ‬ ‫دو‬
‫ﻧﺎﻣﻬﺎ‬ ‫ﺑﻪ‬‫ی‬EXP5_3‫و‬ode‫ﺷﺪه‬ ‫ﮔﺮﻓﺘﻪ‬ ‫درﻧﻈﺮ‬ ‫ﻣﺜﺎل‬ ‫اﯾﻦ‬ ‫ﺣﻞ‬ ‫ﺑﺮای‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬‫اﻧﺪ‬.
‫ض‬ ‫ﺷﮑﻞ‬1-1-‫ﻓﺎﯾﻞ‬EXP5_3
1
ode23, ode45, ode113, ode15s, ode23s, ode23t, ode23tb
%~~ Chapter 5, Example 3
clc
clear all;
%~~~~~ PARAMETERS DEFINITION ~~~~~
m=.1; % Kg - mass of pendulum
M=1; % Kg - mass of cart
I=.06; % Kg.m^2 - moment of inertia
g=9.81; % m/sec^2
L=.35; % meter (length of pendulum is 2*L)
m1_bar=m*L/(m+M);
m2_bar=m*L/(I+m*L^2);
%~~~~~~~ Simulation Time=5 sec
t=0.01:.01:5;
[rt,ct]=size(t);
par=[m,M,I,g,L,m1_bar,m2_bar];
%~~~~~ 1. teta(0)=5 deg ~~~~~~~~~~~~~
teta_0=5*(pi/180); % teta(0) in radian
x(:,1)=[0;0;teta_0;0]; % initial state
teta_5=ode(par,ct,x(:,1)); % calling user-defined
function: ode
plot(t,teta_5,'b-');
%~~~~~ 2. teta(0)=20 deg ~~~~~~~~~~~~~
teta_0=20*(pi/180); % teta(0) in radian
x(:,1)=[0;0;teta_0;0]; % initial state
teta_5=ode(par,ct,x(:,1)); % calling user-defined
function: ode
hold on;plot(t,teta_5,'b--');
33
‫ض‬ ‫ﺷﮑﻞ‬1-1-)‫اداﻣﻪ‬(‫ﻓﺎﯾﻞ‬EXP5_3.m
‫ض‬ ‫ﺷﮑﻞ‬1-2-‫ﻓﺎﯾﻞ‬ode.m
%~~~~~ 4. teta(0)=33.4 deg ~~~~~~~~~~~~~
teta_0=33.4*(pi/180); % teta(0) in radian
x(:,1)=[0;0;teta_0;0]; % initial state
teta_5=ode(par,ct,x(:,1)); % calling user-defined
function: ode
hold on;plot(t,teta_5,'b:');
legend('initial angle= 5 deg','initial angle= 20
deg','initial angle= 33.4 deg',3);
function [teta]=ode(par_in,ct,x);
x(:,1)=x; % initial state
%~~~~~ DEFINITION OF PARAMETERS ~~~~~
m=par_in(1);
M=par_in(2);
I=par_in(3);
g=par_in(4);
L=par_in(5);
m1_bar=par_in(6);
m2_bar=par_in(7);
mb=m1_bar*m2_bar; %parameter definition only
for convenience!
for k=2:ct
%~~~~~ STATE FEEDBACK ~~~~~~~~~~~~~~~
ke=[-1.91 -4.262 -45.49 -15.64];
u=-ke*x(:,k-1);
%~~~~~ NONLINEAR DYNAMIC EQUATION ~~~~~
x1_dot=x(2,k-1);
x2_dot1=-mb*g*cos(x(3,k-1))*sin(x(3,k-1))/(1-
mb*cos(x(3,k-1))^2);
x2_dot2=(m1_bar*sin(x(3,k-1))*x(4,k-1)^2)/(1-
mb*cos(x(3,k-1))^2);
x2_dot3=u/((m+M)*(1-mb*cos(x(3,k-1))^2));
x2_dot=x2_dot1+x2_dot2+x2_dot3;
x3_dot=x(4,k-1);
x4_dot1=g*m2_bar*sin(x(3,k-1))/(1-mb*cos(x(3,k-1))^2);
x4_dot2=-(mb*sin(x(3,k-1))*x(4,k-1)^2)/(1-mb*cos(x(3,k-
1))^2);
x4_dot3=-m2_bar*cos(x(3,k-1))*u/((m+M)*(1-mb*cos(x(3,k-
1))^2));
Modern Control Matlab_Dr. Khaki Seddigh
Modern Control Matlab_Dr. Khaki Seddigh
Modern Control Matlab_Dr. Khaki Seddigh
Modern Control Matlab_Dr. Khaki Seddigh
Modern Control Matlab_Dr. Khaki Seddigh
Modern Control Matlab_Dr. Khaki Seddigh
Modern Control Matlab_Dr. Khaki Seddigh
Modern Control Matlab_Dr. Khaki Seddigh
Modern Control Matlab_Dr. Khaki Seddigh
Modern Control Matlab_Dr. Khaki Seddigh
Modern Control Matlab_Dr. Khaki Seddigh
Modern Control Matlab_Dr. Khaki Seddigh
Modern Control Matlab_Dr. Khaki Seddigh
Modern Control Matlab_Dr. Khaki Seddigh
Modern Control Matlab_Dr. Khaki Seddigh
Modern Control Matlab_Dr. Khaki Seddigh
Modern Control Matlab_Dr. Khaki Seddigh
Modern Control Matlab_Dr. Khaki Seddigh
Modern Control Matlab_Dr. Khaki Seddigh
Modern Control Matlab_Dr. Khaki Seddigh
Modern Control Matlab_Dr. Khaki Seddigh
Modern Control Matlab_Dr. Khaki Seddigh
Modern Control Matlab_Dr. Khaki Seddigh

More Related Content

Featured

2024 State of Marketing Report – by Hubspot
2024 State of Marketing Report – by Hubspot2024 State of Marketing Report – by Hubspot
2024 State of Marketing Report – by HubspotMarius Sescu
 
Everything You Need To Know About ChatGPT
Everything You Need To Know About ChatGPTEverything You Need To Know About ChatGPT
Everything You Need To Know About ChatGPTExpeed Software
 
Product Design Trends in 2024 | Teenage Engineerings
Product Design Trends in 2024 | Teenage EngineeringsProduct Design Trends in 2024 | Teenage Engineerings
Product Design Trends in 2024 | Teenage EngineeringsPixeldarts
 
How Race, Age and Gender Shape Attitudes Towards Mental Health
How Race, Age and Gender Shape Attitudes Towards Mental HealthHow Race, Age and Gender Shape Attitudes Towards Mental Health
How Race, Age and Gender Shape Attitudes Towards Mental HealthThinkNow
 
AI Trends in Creative Operations 2024 by Artwork Flow.pdf
AI Trends in Creative Operations 2024 by Artwork Flow.pdfAI Trends in Creative Operations 2024 by Artwork Flow.pdf
AI Trends in Creative Operations 2024 by Artwork Flow.pdfmarketingartwork
 
PEPSICO Presentation to CAGNY Conference Feb 2024
PEPSICO Presentation to CAGNY Conference Feb 2024PEPSICO Presentation to CAGNY Conference Feb 2024
PEPSICO Presentation to CAGNY Conference Feb 2024Neil Kimberley
 
Content Methodology: A Best Practices Report (Webinar)
Content Methodology: A Best Practices Report (Webinar)Content Methodology: A Best Practices Report (Webinar)
Content Methodology: A Best Practices Report (Webinar)contently
 
How to Prepare For a Successful Job Search for 2024
How to Prepare For a Successful Job Search for 2024How to Prepare For a Successful Job Search for 2024
How to Prepare For a Successful Job Search for 2024Albert Qian
 
Social Media Marketing Trends 2024 // The Global Indie Insights
Social Media Marketing Trends 2024 // The Global Indie InsightsSocial Media Marketing Trends 2024 // The Global Indie Insights
Social Media Marketing Trends 2024 // The Global Indie InsightsKurio // The Social Media Age(ncy)
 
Trends In Paid Search: Navigating The Digital Landscape In 2024
Trends In Paid Search: Navigating The Digital Landscape In 2024Trends In Paid Search: Navigating The Digital Landscape In 2024
Trends In Paid Search: Navigating The Digital Landscape In 2024Search Engine Journal
 
5 Public speaking tips from TED - Visualized summary
5 Public speaking tips from TED - Visualized summary5 Public speaking tips from TED - Visualized summary
5 Public speaking tips from TED - Visualized summarySpeakerHub
 
ChatGPT and the Future of Work - Clark Boyd
ChatGPT and the Future of Work - Clark Boyd ChatGPT and the Future of Work - Clark Boyd
ChatGPT and the Future of Work - Clark Boyd Clark Boyd
 
Getting into the tech field. what next
Getting into the tech field. what next Getting into the tech field. what next
Getting into the tech field. what next Tessa Mero
 
Google's Just Not That Into You: Understanding Core Updates & Search Intent
Google's Just Not That Into You: Understanding Core Updates & Search IntentGoogle's Just Not That Into You: Understanding Core Updates & Search Intent
Google's Just Not That Into You: Understanding Core Updates & Search IntentLily Ray
 
Time Management & Productivity - Best Practices
Time Management & Productivity -  Best PracticesTime Management & Productivity -  Best Practices
Time Management & Productivity - Best PracticesVit Horky
 
The six step guide to practical project management
The six step guide to practical project managementThe six step guide to practical project management
The six step guide to practical project managementMindGenius
 
Beginners Guide to TikTok for Search - Rachel Pearson - We are Tilt __ Bright...
Beginners Guide to TikTok for Search - Rachel Pearson - We are Tilt __ Bright...Beginners Guide to TikTok for Search - Rachel Pearson - We are Tilt __ Bright...
Beginners Guide to TikTok for Search - Rachel Pearson - We are Tilt __ Bright...RachelPearson36
 

Featured (20)

2024 State of Marketing Report – by Hubspot
2024 State of Marketing Report – by Hubspot2024 State of Marketing Report – by Hubspot
2024 State of Marketing Report – by Hubspot
 
Everything You Need To Know About ChatGPT
Everything You Need To Know About ChatGPTEverything You Need To Know About ChatGPT
Everything You Need To Know About ChatGPT
 
Product Design Trends in 2024 | Teenage Engineerings
Product Design Trends in 2024 | Teenage EngineeringsProduct Design Trends in 2024 | Teenage Engineerings
Product Design Trends in 2024 | Teenage Engineerings
 
How Race, Age and Gender Shape Attitudes Towards Mental Health
How Race, Age and Gender Shape Attitudes Towards Mental HealthHow Race, Age and Gender Shape Attitudes Towards Mental Health
How Race, Age and Gender Shape Attitudes Towards Mental Health
 
AI Trends in Creative Operations 2024 by Artwork Flow.pdf
AI Trends in Creative Operations 2024 by Artwork Flow.pdfAI Trends in Creative Operations 2024 by Artwork Flow.pdf
AI Trends in Creative Operations 2024 by Artwork Flow.pdf
 
Skeleton Culture Code
Skeleton Culture CodeSkeleton Culture Code
Skeleton Culture Code
 
PEPSICO Presentation to CAGNY Conference Feb 2024
PEPSICO Presentation to CAGNY Conference Feb 2024PEPSICO Presentation to CAGNY Conference Feb 2024
PEPSICO Presentation to CAGNY Conference Feb 2024
 
Content Methodology: A Best Practices Report (Webinar)
Content Methodology: A Best Practices Report (Webinar)Content Methodology: A Best Practices Report (Webinar)
Content Methodology: A Best Practices Report (Webinar)
 
How to Prepare For a Successful Job Search for 2024
How to Prepare For a Successful Job Search for 2024How to Prepare For a Successful Job Search for 2024
How to Prepare For a Successful Job Search for 2024
 
Social Media Marketing Trends 2024 // The Global Indie Insights
Social Media Marketing Trends 2024 // The Global Indie InsightsSocial Media Marketing Trends 2024 // The Global Indie Insights
Social Media Marketing Trends 2024 // The Global Indie Insights
 
Trends In Paid Search: Navigating The Digital Landscape In 2024
Trends In Paid Search: Navigating The Digital Landscape In 2024Trends In Paid Search: Navigating The Digital Landscape In 2024
Trends In Paid Search: Navigating The Digital Landscape In 2024
 
5 Public speaking tips from TED - Visualized summary
5 Public speaking tips from TED - Visualized summary5 Public speaking tips from TED - Visualized summary
5 Public speaking tips from TED - Visualized summary
 
ChatGPT and the Future of Work - Clark Boyd
ChatGPT and the Future of Work - Clark Boyd ChatGPT and the Future of Work - Clark Boyd
ChatGPT and the Future of Work - Clark Boyd
 
Getting into the tech field. what next
Getting into the tech field. what next Getting into the tech field. what next
Getting into the tech field. what next
 
Google's Just Not That Into You: Understanding Core Updates & Search Intent
Google's Just Not That Into You: Understanding Core Updates & Search IntentGoogle's Just Not That Into You: Understanding Core Updates & Search Intent
Google's Just Not That Into You: Understanding Core Updates & Search Intent
 
How to have difficult conversations
How to have difficult conversations How to have difficult conversations
How to have difficult conversations
 
Introduction to Data Science
Introduction to Data ScienceIntroduction to Data Science
Introduction to Data Science
 
Time Management & Productivity - Best Practices
Time Management & Productivity -  Best PracticesTime Management & Productivity -  Best Practices
Time Management & Productivity - Best Practices
 
The six step guide to practical project management
The six step guide to practical project managementThe six step guide to practical project management
The six step guide to practical project management
 
Beginners Guide to TikTok for Search - Rachel Pearson - We are Tilt __ Bright...
Beginners Guide to TikTok for Search - Rachel Pearson - We are Tilt __ Bright...Beginners Guide to TikTok for Search - Rachel Pearson - We are Tilt __ Bright...
Beginners Guide to TikTok for Search - Rachel Pearson - We are Tilt __ Bright...
 

Modern Control Matlab_Dr. Khaki Seddigh

  • 1. 1 ‫ﺗﻌﺎﻟﯽ‬ ‫ﺑﺎﺳﻤﻪ‬ ‫اﻓﺰار‬ ‫ﻧﺮم‬ ‫ﮐﺎرﺑﺮد‬ ‫ﺑﻪ‬ ‫ﻧﮕﺎﻫﯽ‬Matlab ‫در‬ ‫ﻣﺪرن‬ ‫ﮐﻨﺘﺮل‬ )‫ﮐﺘﺎب‬ ‫ﺿﻤﯿﻤﮥ‬”‫ﻣﺪرن‬ ‫ﮐﻨﺘﺮل‬ ‫اﺻﻮل‬“‫ﺻﺪﯾﻖ‬ ‫ﺧﺎﮐﯽ‬ ‫ﻋﻠﯽ‬ ‫دﮐﺘﺮ‬ ‫ﺗﺄﻟﯿﻒ‬( ‫ﮐﻨﻨﺪه‬ ‫ﺗﻬﯿﻪ‬:‫اﻣﺎﻧﯽ‬ ‫ﻣﺮادی‬ ‫ﻋﻠﯽ‬
  • 3. 3 ‫ﻓﻬﺮﺳﺖ‬ 1-‫ﻣﻘﺪﻣﻪ‬ 2-‫ﺑﺮرﺳﯽ‬‫اﻓﺰار‬ ‫ﻧﺮم‬ ‫دﺳﺘﻮرﻫﺎی‬Matlab‫ﻣﺮﺗﺒﻂ‬‫ﻣﺪرن‬ ‫ﮐﻨﺘﺮل‬ ‫ﺑﺤﺚ‬ ‫ﺑﺎ‬ 2-1-‫دﺳﺘﻮر‬acker 2-2-‫دﺳﺘﻮر‬canon 2-3-‫دﺳﺘﻮر‬care 2-4-‫دﺳﺘﻮر‬cdf2rdf 2-5-‫دﺳﺘﻮر‬ctrb 2-6-‫دﺳﺘﻮر‬Ctrbf 2-7-‫دﺳﺘﻮر‬diag 2-8-‫دﺳﺘﻮر‬eig 2-9-‫دﺳﺘﻮر‬estim 2-10-‫دﺳﺘﻮر‬exam 2-11-‫دﺳﺘﻮر‬Gram 2-12-‫دﺳﺘﻮر‬initial 2-13-‫دﺳﺘﻮر‬kalman 2-14-‫دﺳﺘﻮر‬Lyap 2-15-‫دﺳﺘﻮر‬null 2-16-‫دﺳﺘﻮر‬obsv 2-17-‫دﺳﺘﻮر‬obsvf 2-18-‫دﺳﺘﻮر‬place 2-19-‫دﺳﺘﻮر‬ss 2-20-‫دﺳﺘﻮر‬ssdata 2-21-‫دﺳﺘﻮر‬ss2ss 2-22-‫دﺳﺘﻮر‬ss2tf 2-23-‫دﺳﺘﻮر‬tf2ss 3-‫ﮐ‬ ‫ﻣﺘﻦ‬ ‫ﻣﺜﺎﻟﻬﺎی‬ ‫ﺑﻪ‬ ‫ﻣﺮﺑﻮط‬ ‫ﻫﺎی‬ ‫ﺑﺮﻧﺎﻣﻪ‬ ‫ﺑﺮرﺳﯽ‬‫ﺘﺎب‬ 3-1-‫رﺳﻢ‬‫ﭘﺎﺳﺨﻬﺎی‬‫ﻏﯿﺮﺧﻄﯽ‬ ‫ﺳﯿﺴﺘﻢ‬)‫ﻣﺜﺎل‬5-3( 3-2-‫دﺳﺘﻮر‬ ‫ﺑﺎ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﯿﺪﺑﮏ‬ ‫ﻃﺮاﺣﯽ‬acker)‫ﻣﺜﺎل‬6-8( 3-3-‫اﻧﺘﮕﺮال‬ ‫ﮐﻨﺘﺮل‬ ‫ﺑﺎ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﯿﺪﺑﮏ‬)‫ﻣﺜﺎل‬6-9( 3-4-‫ﺳﯿﺴﺘﻢ‬ ‫دﯾﻨﺎﻣﯿﮑﯽ‬ ‫رﻓﺘﺎر‬ ‫ﺑﺮ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﯿﺪﺑﮏ‬ ‫ﺗﻐﯿﯿﺮ‬ ‫اﺛﺮ‬)‫ﻣﺜﺎل‬6-10( 3-5-‫رؤﯾﺘﮕﺮﺣﺎﻟﺖ‬ ‫ﻃﺮاﺣﯽ‬)‫ﻣﺜﺎل‬7-1( 3-6-‫رؤﯾﺘﮕﺮ‬‫ﯾﺎﻓﺘﻪ‬ ‫ﮐﺎﻫﺶ‬ ‫ﻣﺮﺗﺒﻪ‬)‫ﻣﺜﺎل‬7-2( 3-7-‫رؤﯾﺘﮕﺮ‬ ‫ﺑﺎ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﯿﺪﺑﮏ‬ ‫ﮐﻨﺘﺮل‬)‫ﻣﺜﺎل‬7-3(
  • 4. 4 3-8-‫ﯾﺎﻓﺘﻪ‬ ‫ﮐﺎﻫﺶ‬ ‫ﻣﺮﺗﺒﻪ‬ ‫رؤﯾﺘﮕﺮ‬ ‫ﺑﺎ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﯿﺪﺑﮏ‬ ‫ﮐﻨﺘﺮل‬)‫ﻣﺜﺎل‬7-4( 3-9-‫ﺣﺎﻟﺖ‬ ‫ﻓﯿﺪﺑﮏ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫ﺑﻬﯿﻨﻪ‬ ‫ﮐﻨﻨﺪۀ‬ ‫ﮐﻨﺘﺮل‬ ‫ﻃﺮاﺣﯽ‬)‫ﻣﺜﺎل‬8-1( 3-10-‫ﺗﻐﯿﯿﺮات‬ ‫ﺣﺴﺎب‬ ‫و‬ ‫ﺑﻬﯿﻨﻪ‬ ‫ﮐﻨﺘﺮل‬)‫ﻣﺜﺎل‬8-2( 3-11-‫ﮐﻨﺘﺮل‬‫ﭘﺎﯾﺪاری‬ ‫درﺟﮥ‬ ‫و‬ ‫ﺑﻬﯿﻨﻪ‬)‫ﻣﺜﺎل‬8-3( 3-12-‫ﮐﺎﻟﻤﻦ‬ ‫ﻓﯿﻠﺘﺮ‬)‫ﻣﺜﺎل‬8-4( 3-13-‫ﮐﺎﻟﻤﻦ‬ ‫ﻓﯿﻠﺘﺮ‬ ‫ﺑﺎ‬ ‫ﺧﺮوﺟﯽ‬ ‫ﻓﯿﺪﺑﮏ‬ ‫ﮐﻨﻨﺪۀ‬ ‫ﮐﻨﺘﺮل‬)‫ﻣﺜﺎل‬8-5(
  • 6. 6 ‫اﻓﺰار‬ ‫ﻧﺮم‬ ‫دﺳﺘﻮرﻫﺎی‬ ‫ﺑﺮرﺳﯽ‬Matlab ‫ﻣﺪرن‬ ‫ﮐﻨﺘﺮل‬ ‫ﺑﺤﺚ‬ ‫ﺑﺎ‬ ‫ﻣﺮﺗﺒﻂ‬ 2
  • 7. 7
  • 8. 8 2-1-‫دﺳﺘﻮر‬acker: •‫ﻫﺪف‬:‫ورودی‬ ‫ﺗﮏ‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬ ‫ﺑﺮای‬ ‫ﻗﻄﺐ‬ ‫ﺟﺎﯾﺎب‬ ‫ﻃﺮاﺣﯽ‬ •‫دﺳﺘﻮراﻟﻌﻤﻞ‬ ‫ﻧﮕﺎرش‬: K=acker(A,B,P) •‫ﺗﻮﺿﯿﺤﺎت‬: ‫اﺳﺖ‬ ‫ﻣﻔﺮوض‬ ‫زﯾﺮ‬ ‫ورودی‬ ‫ﺗﮏ‬ ‫ﺳﯿﺴﺘﻢ‬: BuAxx += • ‫ﺣﺎﻟﺖ‬ ‫ﻓﯿﺪﺑﮏ‬ ‫ﺑﺮدار‬ ‫ﺧﻮاﻫﯿﻢ‬ ‫ﻣﯽ‬K‫ﺷﺪه‬ ‫ﺗﻌﯿﯿﻦ‬ ‫ﻣﺤﻠﻬﺎی‬ ‫در‬ ‫ﺑﺴﺘﻪ‬ ‫ﺣﻠﻘﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻗﻄﺒﻬﺎی‬ ‫ﮐﻪ‬ ‫ﮐﻨﯿﻢ‬ ‫ﻃﺮاﺣﯽ‬ ‫ﭼﻨﺎن‬ ‫را‬‫ﺑﺮدار‬ ‫در‬P ‫ﮔﯿﺮﻧﺪ‬ ‫ﻗﺮار‬.‫دﺳﺘﻮر‬K=acker(A,B,P)‫ﻓﯿﺪﺑﮏ‬ ‫ﺑﻬﺮه‬ ‫ﺑﺮدار‬ ‫آﮐﺮﻣﻦ‬ ‫ﻓﺮﻣﻮل‬ ‫از‬ ‫اﺳﺘﻔﺎده‬ ‫ﺑﺎ‬(K)‫ﮐﻪ‬ ‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﻣﺸﺨﺺ‬ ‫ﭼﻨﺎن‬ ‫را‬ ‫ﻓﯿﺪﺑﮏ‬ ‫ﻗﺎﻧﻮن‬u = -Kx،‫ﺑﺮدار‬ ‫در‬ ‫ﺷﺪه‬ ‫ﺗﻌﯿﯿﻦ‬ ‫ﻣﺤﻠﻬﺎی‬ ‫در‬ ‫را‬ ‫ﺑﺴﺘﻪ‬ ‫ﺣﻠﻘﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻗﻄﺒﻬﺎی‬P‫دﻫﺪ‬ ‫ﻗﺮار‬.‫ﻣﻘﺎدﯾﺮ‬ ‫دﯾﮕﺮ‬ ‫ﻋﺒﺎرت‬ ‫ﺑﻪ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫وﯾﮋه‬A-BK‫اﻋﻀﺎ‬ ‫ﻣﺤﻞ‬ ‫در‬‫ﺑﺮدار‬ ‫ی‬P‫ﮔﯿﺮﻧﺪ‬ ‫ﻣﯽ‬ ‫ﻗﺮار‬.،‫ﻧﻤﻮﻧﻪ‬ ‫ﻋﻨﻮان‬ ‫ﺑﻪ‬‫ﺣﺎﻟﺖ‬ ‫ﻓﯿﺪﺑﮏ‬ ‫ﻃﺮاﺣﯽ‬ ‫ﺑﺎ‬ ‫زﯾﺮ‬ ‫ﺑﺮﻧﺎﻣﻪ‬ ‫ﺗﮑﻪ‬ ‫در‬K، ‫ﻧﺎﭘﺎﯾﺪار‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻗﻄﺒﻬﺎی‬‫ﺑﻪ‬P=[-2,-3]‫ﻣ‬‫ﻨﺘ‬‫ﺷﻮﻧﺪ‬ ‫ﻣﯽ‬ ‫ﻘﻞ‬. A=[2,0,-1,-1] B=[1;1] P=[-2,-3 ] K=acker(A,B,P) ‫ﻣﯿ‬ ‫ﺑﺎﺷﺪ‬ ‫ﺧﺮوﺟﯽ‬ ‫ﺗﮏ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﭼﻨﺎﻧﭽﻪ‬ ‫اﯾﻦ‬ ‫ﺑﺮ‬ ‫ﻋﻼوه‬‫دﺳﺘﻮر‬ ‫از‬ ‫ﺘﻮان‬acker‫روﯾﺘﮕﺮ‬ ‫ﺑﻬﺮه‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫ﺑﺮای‬‫ﻟﯿﻮﻧﺒﺮﮔﺮ‬‫اﺳﺘﻔﺎده‬ ‫ﻧﯿﺰ‬ ‫ﮐﺮد‬.‫اﮔﺮ‬y=Cx‫ﺑﺎﺷﺪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺧﺮوﺟﯽ‬ ‫ﻣﻌﺎدﻟﻪ‬،‫ﺑﺮدار‬ ‫زﯾﺮ‬ ‫دﺳﺘﻮر‬L‫ﮐﺮد‬ ‫ﺧﻮاﻫﺪ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫روﯾﺘﮕﺮ‬ ‫ﺑﻬﺮه‬ ‫ﻋﻨﻮان‬ ‫ﺑﻪ‬ ‫را‬: L = (acker(A’,C’,P))’ ‫ﻣﺤﻠﻬﺎی‬ ‫در‬ ‫روﯾﺘﮕﺮ‬ ‫ﻗﻄﺒﻬﺎی‬ ‫و‬‫ﺑﺮدار‬ ‫ﺗﻮﺳﻂ‬ ‫ﺷﺪه‬ ‫ﻣﺸﺨﺺ‬P‫ﮔﯿﺮﻧﺪ‬ ‫ﻣﯽ‬ ‫ﻗﺮار‬. •‫ﻣﺤﺪودﯾﺘﻬﺎ‬: 1.‫دﺳﺘﻮر‬acker‫اﺳﺖ‬ ‫اﺳﺘﻔﺎده‬ ‫ﻗﺎﺑﻞ‬ ‫ورودی‬ ‫ﺗﮏ‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬ ‫در‬ ‫ﻓﻘﻂ‬. 2.(A,B)‫ﺑﺎﺷﺪ‬ ‫ﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫ﺑﺎﯾﺪ‬. 3.‫اﯾﻦ‬‫از‬ ‫ﺑﯿﺶ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫درﺟﻪ‬ ‫ﭼﻨﺎﻧﭽﻪ‬ ‫و‬ ‫ﻧﯿﺴﺖ‬ ‫ﺑﺮﺧﻮردار‬ ‫ﺑﺎﻻﯾﯽ‬ ‫اﻃﻤﯿﻨﺎن‬ ‫ﻗﺎﺑﻠﯿﺖ‬ ‫از‬ ‫روش‬5‫ﺳﯿﺴﺘﻢ‬ ‫ﭘﺬﯾﺮی‬ ‫ﮐﻨﺘﺮل‬ ‫ﯾﺎ‬ ‫ﺑﻮده‬ ‫ا‬ ‫دﭼﺎر‬ ‫ﺑﺎﺷﺪ‬ ‫ﺿﻌﯿﻒ‬‫ﺷﺪ‬ ‫ﺧﻮاﻫﺪ‬ ‫ﺷﮑﺎل‬. •‫ﻣﺮﺗﺒﻂ‬ ‫دﺳﺘﻮرات‬: ‫دﺳﺘﻮر‬place‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫اﻧﺠﺎم‬ ‫ورودی‬ ‫ﭼﻨﺪ‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬ ‫در‬ ‫را‬ ‫ﻗﻄﺐ‬ ‫ﺟﺎﯾﺎﺑﯽ‬ ‫ﻋﻤﻞ‬. 2-2-‫دﺳﺘﻮر‬canon: •‫ﻫﺪف‬:‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫در‬ ‫ﮐﺎﻧﻮﻧﯿﮑﺎل‬ ‫ﻫﺎی‬ ‫ﺗﺤﻘﻖ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ •‫دﺳﺘﻮراﻟﻌﻤﻞ‬ ‫ﻧﮕﺎرش‬: CSYS= canon(SYS,’TYPE’) [CSYS,T]= canon(SYS,’TYPE’) •‫ﺗﻮﺿﯿﺤﺎت‬:‫ﺳﯿﺴﺘﻢ‬ ‫ﺑﺮای‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫در‬ ‫ﮐﺎﻧﻮﻧﯿﮑﺎل‬ ‫ﺗﺤﻘﻖ‬ ‫ﯾﮏ‬ ،‫دﺳﺘﻮر‬ ‫اﯾﻦ‬LTI‫ﺑﺎ‬ ‫ﮐﻪ‬ ‫زﻣﺎن‬ ‫ﮔﺴﺴﺘﻪ‬ ‫ﯾﺎ‬ ‫ﭘﯿﻮﺳﺘﻪ‬SYS ‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫اراﺋﻪ‬ ‫اﺳﺖ‬ ‫ﺷﺪه‬ ‫ﻣﺸﺨﺺ‬.‫اﺳﺖ‬ ‫ﺷﺪه‬ ‫ﮔﺮﻓﺘﻪ‬ ‫ﻧﻈﺮ‬ ‫در‬ ‫دﺳﺘﻮراﻟﻌﻤﻞ‬ ‫اﯾﻦ‬ ‫در‬ ‫ﮐﺎﻧﻮﻧﯿﮑﺎل‬ ‫ﺗﺤﻘﻖ‬ ‫ﻧﻮع‬ ‫دو‬‫ﻣﺘﻐﯿﺮ‬ ‫ﺗﻮﺳﻂ‬ ‫ﮐﻪ‬ TYPE‫ﻣﯽ‬ ‫اﻧﺘﺨﺎب‬‫ﮔﺮدد‬.
  • 9. 9 ‫اﻟﻒ‬-‫ﻓﺮم‬MODAL: ‫دﺳﺘﻮر‬CSYS= canon(SYS,’modal’)‫ﺗﺤﻘﻖ‬ ‫ﯾﮏ‬MODAL‫ﺳﯿﺴﺘﻢ‬ ‫از‬SYS‫در‬ ‫و‬ ‫آورده‬ ‫ﺑﺪﺳﺖ‬ ‫را‬CSYS ‫ﻣﯽ‬‫رﯾﺰد‬.،‫ﺗﺤﻘﻖ‬ ‫اﯾﻦ‬ ‫در‬‫ﺣﻘﯿﻘﯽ‬ ‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬SYS‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﻗﻄﺮﻫﺎی‬ ‫روی‬A‫ﻣﯽ‬ ‫ﻗﺮار‬‫ﻫﺮ‬ ‫ازاء‬ ‫ﺑﻪ‬ ‫و‬ ‫ﮔﯿﺮﻧﺪ‬‫زوج‬‫ﯾﮏ‬ ‫ﻣﻮﻫﻮﻣﯽ‬ ‫ﻗﻄﺐ‬ ‫ﺑﻠﻮک‬2×2‫ﻣﺎﺗﺮﯾﺲ‬ ‫در‬A‫ﻣﯽ‬ ‫ﻇﺎﻫﺮ‬‫ﺷﻮد‬.‫ﺳﯿﺴ‬ ‫ﺑﺮای‬ ‫ﻣﺜﺎل‬ ‫ﻋﻨﻮان‬ ‫ﺑﻪ‬‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫ﺑﺎ‬ ‫ﺘﻤﯽ‬),,( 21 λωσλ j±،‫ﻣﺎﺗﺮﯾﺲ‬A‫در‬ ‫ﻓﺮم‬ ‫ﺗﺤﻘﻖ‬MODAL‫ﺑﻮد‬ ‫ﺧﻮاﻫﺪ‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬:             − 2 1 000 00 00 000 λ σω ωσ λ ‫ب‬-‫ﻓﺮم‬COMPANION: ‫دﺳﺘﻮر‬CSYS = canon(SYS,’companion’)‫ﺗﺤﻘﻖ‬ ‫ﯾﮏ‬COMPANION‫از‬SYS‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫اراﺋﻪ‬‫ﺿﺮاﯾﺐ‬ ‫آن‬ ‫در‬ ‫ﮐﻪ‬ ‫رو‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻣﺸﺨﺼﻪ‬ ‫ﻣﻌﺎدﻟﻪ‬‫ﻣﺎﺗﺮﯾﺲ‬ ‫راﺳﺖ‬ ‫ﺳﻤﺖ‬ ‫اﻟﯿﻪ‬ ‫ﻣﻨﺘﻬﯽ‬ ‫ﺳﺘﻮن‬ ‫ی‬A‫ﻗﺮار‬‫ﮔﯿﺮد‬ ‫ﻣﯽ‬.‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻣﺸﺨﺼﻪ‬ ‫ﻣﻌﺎدﻟﻪ‬ ‫اﮔﺮ‬ ‫ﺑﺎﺷﺪ‬ ‫زﯾﺮ‬: nn nn asasassP ++++= − − 1 1 1 ...)( ‫ﻣﺎﺗﺮﯾﺲ‬ ‫آﻧﮕﺎه‬A‫ﺗﺤﻘﻖ‬ ‫در‬COMPANION‫ﺑﻮد‬ ‫ﺧﻮاﻫﺪ‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬:                 − − − − = − 1 2 1 10000 01000 0001 0000 a a a a A n n MMMMMM K K ‫اﮔﺮ‬SYS‫دﺳﺘﻮ‬ ‫آﻧﮕﺎه‬ ‫ﺑﺎﺷﺪ‬ ‫داﺷﺘﻪ‬ ‫وﺟﻮد‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬‫ر‬[CSYS,T]=canon(SYS,’TYPE’)‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﺗﺒﺪﯾﻞ‬T‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫اراﺋﻪ‬ ‫ﻧﯿﺰ‬ ‫ﺷﻮﻧﺪ‬ ‫ﻣﯽ‬ ‫ﻣﺮﺗﺒﻂ‬ ‫ﮐﺎﻧﻮﻧﯿﮑﺎل‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺣﺎﻟﺘﻬﺎی‬ ‫ﺑﻪ‬ ‫اﺻﻠﯽ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺣﺎﻟﺘﻬﺎی‬ ‫آن‬ ‫ﺗﻮﺳﻂ‬ ‫ﮐﻪ‬ ‫را‬:xTxc .= ‫ﺳﯿﺴﺘﻢ‬ ‫ﭼﻨﺎﻧﭽﻪ‬SYS، ‫ﻧﺒﺎﺷﺪ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻓﺮم‬ ‫ﺑﻪ‬‫ﻣﺎﺗﺮﯾﺲ‬T‫ﺑﻮد‬ ‫ﺧﻮاﻫﺪ‬ ‫ﺗﻬﯽ‬. ‫در‬ ‫ﻋﻤﻠﯿﺎت‬ ‫اﻧﺠﺎم‬ ‫روﻧﺪ‬‫ﺳﯿﺴﺘﻢ‬ ‫ﭼﻨﺎﻧﭽﻪ‬ ‫اﺑﺘﺪا‬ ‫ﮐﻪ‬ ‫اﺳﺖ‬ ‫ﺻﻮرت‬ ‫اﯾﻦ‬ ‫ﺑﻪ‬ ‫دﺳﺘﻮر‬ ‫اﯾﻦ‬SYS‫داده‬ ‫ﺻﻔﺮ‬ ‫و‬ ‫ﻗﻄﺐ‬ ‫ﯾﺎ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﺮم‬ ‫ﺑﻪ‬ ‫دﺳﺘﻮر‬ ‫از‬ ‫اﺳﺘﻔﺎده‬ ‫ﺑﺎ‬ ‫ﺑﺎﺷﺪ‬ ‫ﺷﺪه‬SS‫آﯾﺪ‬ ‫ﻣﯽ‬ ‫ﺑﺪﺳﺖ‬ ‫آن‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻓﺮم‬.‫ﺗﺤﻘﻖ‬ ‫در‬MODAL‫ﻣﺎﺗﺮﯾﺲ‬P‫ﺑﺮدارﻫﺎی‬ ‫ﻣﺠﻤﻮﻋﻪ‬ ‫ﮐﻪ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫وﯾﮋه‬A‫ﺗﺸ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫زﯾﺮ‬ ‫ﻣﻌﺎدﻻت‬ ‫ﺑﺎ‬ ‫ﺳﭙﺲ‬ ‫و‬ ‫ﺷﻮد‬ ‫ﻣﯽ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫اﺳﺖ‬‫ﺎﺑﻬﯽ‬T=P-1 ‫ﮐﺎﻧﻮﻧﯿﮑﺎل‬ ‫ﻓﺮم‬ ‫و‬ ‫ﺷﺪه‬ ‫اﻋﻤﺎل‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺑﻪ‬ ‫آﯾﺪ‬ ‫ﻣﯽ‬ ‫ﺑﺪﺳﺖ‬: DuCPxy BuPAPxPx cc += += −− • 11 ‫ﺣﺎﻟﺖ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﺗﺮﺗﯿﺐ‬ ‫اﯾﻦ‬ ‫ﺑﻪ‬T‫ﻫﻤﺎن‬ ‫اﺳﺖ‬ ‫دﺳﺘﻮراﻟﻌﻤﻞ‬ ‫اﺟﺮای‬ ‫ﻧﺘﺎﯾﺞ‬ ‫از‬ ‫ﮐﻪ‬P-1 ‫ﺑﻮد‬ ‫ﺧﻮاﻫﺪ‬.‫ﻓﺮم‬ ‫ﺗﺤﻘﻖ‬COMPANION ‫آ‬ ‫ﻣﯽ‬ ‫ﺑﺪﺳﺖ‬ ‫ﭘﺬﯾﺮی‬ ‫ﮐﻨﺘﺮل‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫روی‬ ‫از‬ ‫ﺗﺸﺎﺑﻬﯽ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫از‬ ‫اﺳﺘﻔﺎده‬ ‫ﺑﺎ‬ ‫ﻧﯿﺰ‬‫ﯾﺪ‬. •‫ﻣﺜﺎل‬:‫زﯾﺮ‬ ‫ﺳﯿﺴﺘﻢ‬‫اﺳﺖ‬ ‫ﻣﻔﺮوض‬: [ ]xy uxx 001 1 1 1 25.03 651 021 =           +           −= • ‫ﻣﺎﺗﺮﯾﺲ‬ ‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬A‫از‬ ‫ﻋﺒﺎرﺗﻨﺪ‬:
  • 10. 10 6571.6 571.26715.0 3 2,1 = ±= λ λ j ‫ﮐﺎﻧﻮﻧﯿﮑﺎل‬ ‫ﺗﺤﻘﻖ‬ ‫آوردن‬ ‫ﺑﺪﺳﺖ‬ ‫ﺑﺮای‬MODAL‫ﺑﺮﻧﺎﻣ‬ ‫ﺗﮑﻪ‬ ‫ﺳﯿﺴﺘﻢ‬‫ﮥ‬‫دارﯾﻢ‬ ‫را‬ ‫زﯾﺮ‬: A=[1 2 0;-1 5 6;3 0.5 2]; B=[1;1;1]; C=[1 0 0]; D=0; SYS=ss(A,B,C,D); [CSYS,T]=canon(SYS,’modal’); [Ac,Bc,Cc,Dc]=ssdata(SYS); ‫آن‬ ‫در‬ ‫ﮐﻪ‬Dc , Cc , Bc , Ac‫و‬ ‫ﮐﺎﻧﻮﻧﯿﮑﺎل‬ ‫ﺗﺘﺤﻘﻖ‬ ‫ﺑﻪ‬ ‫ﻣﺮﺑﻮط‬ ‫ﻣﺎﺗﺮﯾﺴﻬﺎی‬T‫اﺳﺖ‬ ‫ﻣﺮﺑﻮﻃﻪ‬ ‫ﺗﺸﺎﺑﻬﯽ‬ ‫ﺗﺒﺪﯾﻞ‬.‫ﺑﻪ‬ ‫ﮐﺎﻧﻮﻧﯿﮑﺎل‬ ‫ﺗﺤﻘﻖ‬ ‫ﺑﻮد‬ ‫ﺧﻮاﻫﺪ‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬: [ ] ccc cccc xuDxCy uxuBxAx 3178.02081.0473.0 93.1 2267.1 2776.0 6571.600 06715.0571.2 0571.26715.0 −=+=           −+           −=+= • •‫ﻣﺤﺪودﯾﺘﻬﺎ‬: 1.‫ﻣﯽ‬ ‫ﺻﺤﯿﺢ‬ ‫ﭘﺎﺳﺦ‬ ‫زﻣﺎﻧﯽ‬ ‫دﺳﺘﻮر‬ ‫اﯾﻦ‬‫ﮐ‬ ‫دﻫﺪ‬‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﻪ‬A‫ﺑﺎﺷﺪ‬ ‫ﻧﺪاﺷﺘﻪ‬ ‫ﺗﮑﺮاری‬ ‫وﯾﮋه‬ ‫ﻣﻘﺪار‬. 2.‫ﺗﺤﻘﻖ‬ ‫در‬COMPANION‫ﺑﺎﺷﺪ‬ ‫ﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫ورودی‬ ‫اوﻟﯿﻦ‬ ‫از‬ ‫ﺑﺎﯾﺪ‬ ‫ﺳﯿﺴﺘﻢ‬. 3.The companion form is often poorly conditioned for most state-space computation avoid using it when possible. •‫ﻣﺮﺗﺒﻂ‬ ‫دﺳﺘﻮرات‬: ‫دﺳﺘﻮر‬ss2ss‫اﻧﺠﺎم‬ ‫ﺑﺮای‬‫ﻣﯽ‬ ‫ﮐﺎر‬ ‫ﺑﻪ‬ ‫ﺗﺸﺎﺑﻬﯽ‬ ‫ﺗﺒﺪﯾﻞ‬‫ر‬‫ود‬. 2-3-‫دﺳﺘﻮر‬care: •‫ﻫﺪف‬:‫زﻣﺎن‬ ‫ﺟﺒﺮی‬ ‫رﯾﮑﺎﺗﯽ‬ ‫ﻣﻌﺎدﻟﮥ‬ ‫ﺣﻞ‬-‫ﭘﯿﻮﺳﺘﻪ‬ •‫ﻧﮕﺎرش‬: [X,L,G,rr]=care(A,B,Q) [X,L,G,rr]=care(A,B,Q,R,S,E) [X,L,G,report]=care(A,B,Q,…,’report’) [X1,X2,L,report]=care(A,B,Q,…,’implicit’) •‫ﺗﻮﺿﯿﺤﺎت‬: ‫دﺳﺘﻮر‬[X,L,G,rr]=care(A,B,Q)‫ﻣﯽ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫را‬ ‫زﯾﺮ‬ ‫رﯾﮑﺎﺗﯽ‬ ‫ﻣﻌﺎدﻟﮥ‬ ‫ﻣﻨﺤﺼﺮﺑﻔﺮد‬ ‫ﭘﺎﺳﺦ‬‫ﮐﻨﺪ‬: 0)( =+−+= QXXBBXAXAXRic TT ‫ﻣﺎﺗﺮﯾﺲ‬ ‫وﯾﮋۀ‬ ‫ﻣﻘﺎذﯾﺮ‬ ‫ﻫﻤﮥ‬ ‫ﮐﻪ‬ ‫ﻧﺤﻮی‬ ‫ﺑﻪ‬A-BBT X‫ﮔﯿﺮﻧﺪ‬ ‫ﻗﺮار‬ ‫ﻣﻮﻫﻮﻣﯽ‬ ‫ﻣﺤﻮر‬ ‫ﭼﭗ‬ ‫ﺳﻤﺖ‬.‫ﻣﺎﺗﺮﯾﺲ‬X‫ﻣﺘﻘﺎرن‬1 ‫ﭘﺎﺳﺦ‬ ‫و‬ ‫اﺳﺖ‬ ‫ﭘﺎﯾﺪارﺳﺎز‬2 ‫ﻣﻌﺎدﻟﮥ‬Ric(X)=0‫ﻣﯽ‬ ‫ﻧﺎﻣﯿﺪه‬‫ﺷﻮد‬.‫را‬ ‫زﯾﺮ‬ ‫ﻣﻮارد‬ ‫دﺳﺘﻮر‬ ‫اﯾﻦ‬‫ﻣﯽ‬ ‫ﻧﺘﯿﺠﻪ‬ ‫ﻧﯿﺰ‬‫دﻫﺪ‬: 1-‫ﺑﺮدار‬L‫ﻣﺎﺗﺮﯾﺲ‬ ‫وﯾﮋۀ‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫ﺷﺎﻣﻞ‬ ‫ﮐﻪ‬A-BBT X‫اﺳﺖ‬. 2-‫ﺑﻬﺮۀ‬ ‫ﻣﺎﺗﺮﯾﺲ‬G=BT X 1 Symmetric 2 Stabilizing
  • 11. 11 3-‫ﻧﺴﺒﯽ‬ ‫ﻣﺎﻧﺪۀ‬3 ‫ﻣﯽ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫ﮐﻪ‬‫ﺷﻮد‬: F F X XRic rr )( = ‫دﺳﺘﻮر‬[X,L,G,rr]=care(A,B,Q,R,S,E)‫ﻋﻤﻮﻣﯽ‬ ‫رﯾﮑﺎﺗﯽ‬ ‫ﻣﻌﺎدﻟﮥ‬‫ﻣﯽ‬ ‫ﺣﻞ‬ ‫را‬ ‫ﺗﺮی‬‫ﮐﻨﺪ‬: 0)()()( 1 =+++−+= − QSXEBRSXBEXAEXEAXRic TTTTT ‫ﺑ‬ ‫ﻣﺎﺗﺮﯾﺲ‬‫اﯾﻨﺤﺎﻟﺖ‬ ‫در‬ ‫ﻬﺮه‬)(1 TT SXEBRG += − ‫ﺑﺮدار‬ ‫در‬ ‫ﺑﺴﺘﻪ‬ ‫ﺣﻠﻘﻪ‬ ‫وﯾﮋۀ‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫ﻧﯿﺰ‬ ‫و‬ ‫ﺑﻮده‬ ),*( EGBAeigL −=‫ﻣﯽ‬ ‫ﻗﺮار‬‫ﮔﯿﺮﻧﺪ‬. ‫دﺳﺘﻮر‬ ‫دﯾﮕﺮ‬ ‫ﻧﮕﺎرش‬ ‫دو‬care‫ﮐﻨﻨﺪۀ‬ ‫ﮐﻨﺘﺮل‬ ‫ﻃﺮاﺣﯽ‬ ‫ﻧﻈﯿﺮ‬ ‫ﻣﺨﺘﻠﻒ‬ ‫ﮐﺎرﺑﺮدﻫﺎی‬ ‫در‬ ‫آن‬ ‫از‬ ‫اﺳﺘﻔﺎده‬ ‫ﺑﻪ‬ ‫ﮐﻤﮏ‬ ‫ﺑﺮای‬H∞‫ﮔﺮﻓﺘﻪ‬ ‫ﻧﻈﺮ‬ ‫در‬ ‫ﺷﺪه‬‫اﻧﺪ‬4 . ‫ﻣﺜﺎل‬:‫ﻓﺮض‬ ‫ﺑﺎ‬ [ ] 3,11, 1 0 , 11 23 =−=      =     − = rCBA ‫رﯾﮑﺎﺗﯽ‬ ‫ﻣﻌﺎدﻟﮥ‬ 01 =+−+ − CCXBXBRXAXA TTT ‫اﺳﺖ‬ ‫ﺣﻞ‬ ‫ﻗﺎﺑﻞ‬ ‫زﯾﺮ‬ ‫ﺑﺮﻧﺎﻣﮥ‬ ‫از‬ ‫اﺳﺘﻔﺎده‬ ‫ﺑﺎ‬: A=[-3 2;1 1]; B=[0;1] C=[1 –1]; R=3; [X,L,g]=care(A,B,C’*C,r); ‫ﻣﯽ‬ ‫ﻧﺘﯿﺠﻪ‬ ‫زﯾﺮ‬ ‫ﻓﺮم‬ ‫ﺑﻪ‬ ‫را‬ ‫رﯾﮑﺎﺗﯽ‬ ‫ﻣﻌﺎدﻟﮥ‬ ‫ﭘﺎﺳﺦ‬ ‫ﺑﺮﻧﺎﻣﻪ‬ ‫اﯾﻦ‬‫دﻫﺪ‬: X= 0.5895 1.8216 1.8216 8.8188 ‫ﻣﺎﺗﺮﯾﺲ‬ ‫وﯾﮋۀ‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫ﻣﻘﺎﯾﺴﮥ‬A‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﺑﺎ‬A-B*g‫ﻣﯽ‬ ‫ﻧﺸﺎن‬‫اﺳﺖ‬ ‫ﭘﺎﯾﺪارﺳﺎز‬ ‫ﭘﺎﺳﺦ‬ ‫اﯾﻦ‬ ‫ﮐﻪ‬ ‫دﻫﺪ‬: » [eig(A) eig(A-B*g)] ans= -3.4495 -3.5026 1.4495 -1.4370 •‫آﻟﮕﻮرﯾﺘﻢ‬: ‫دﺳﺘﻮر‬care‫ﺗﻮﺳﻌﻪ‬ ‫ﻫﺎﻣﯿﻠﺘﻮﻧﯿﻦ‬ ،‫ﻫﺎﻣﯿﻠﺘﻮﻧﯿﻦ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫از‬‫آﻟﮕﻮرﯾﺘﻢ‬ ‫ﯾﺎ‬ ‫ﯾﺎﻓﺘﻪ‬QZ‫ﺑﺮای‬‫اﺳﺘﻔﺎده‬ ‫رﯾﮑﺎﺗﯽ‬ ‫ﻣﻌﺎدﻟﮥ‬ ‫ﺣﻞ‬ ‫ﻣﯽ‬‫ﮐﻨﺪ‬5 . •‫ﻣﺤﺪودﯾﺘﻬﺎ‬: ‫زوج‬(A,B)‫ﭘﺎﯾﺪاری‬ ‫ﺑﺎﯾﺪ‬‫ﺑﺎﺷﺪ‬ ‫ﭘﺬﯾﺮ‬.‫وﯾﮋه‬ ‫ﻣﻘﺪار‬ ‫ﻫﯿﭻ‬ ‫ﻫﺎﻣﯿﻠﺘﻮﻧﯿﻦ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ،‫ﺑﻌﻼوه‬‫ﺑﺎﺷﺪ‬ ‫ﻧﺪاﺷﺘﻪ‬ ‫ﻣﻮﻫﻮﻣﯽ‬ ‫ﻣﺤﻮر‬ ‫روی‬ ‫ای‬.‫اﯾﻦ‬ ‫ﺑﺮای‬ ‫ﮐﺎﻓﯿﺴﺖ‬ ‫زﯾﺮ‬ ‫ﺷﺮاﯾﻂ‬ ‫از‬ ‫ﯾﮑﯽ‬ ‫ﺗﺤﻘﻖ‬ ‫ﻣﻨﻈﻮر‬: 1-‫زوج‬(Q,A)‫آﺷﮑﺎری‬‫ﮐﻪ‬ ‫ﺣﺎﻟﺘﯽ‬ ‫در‬ ‫ﺑﺎﺷﺪ‬ ‫ﭘﺬﯾﺮ‬:S=0 , R>0 2-0>      RS SQ T 3 Relative residual 4 ‫ﺑﻪ‬ ‫ﻣﻮرد‬ ‫اﯾﻦ‬ ‫در‬ ‫ﮐﺎﻣﻠﺘﺮ‬ ‫ﺗﻮﺿﯿﺤﺎت‬ ‫ﺑﺮای‬help‫ﻧﺮم‬‫اﻓﺰار‬Matlab‫ﺷﻮد‬ ‫ﻣﺮاﺟﻌﻪ‬. ٥‫ﺷﺪه‬ ‫ﻣﻌﺮﻓﯽ‬ ‫زﯾﺮ‬ ‫ﻣﺮﺟﻊ‬ ‫در‬ ‫آﻟﮕﻮرﯾﺘﻤﻬﺎ‬ ‫اﯾﻦ‬‫اﻧﺪ‬: Arnold, W.F., Ш and A.J. Laub, “Generalized Eigenproblem Algorithms and Software for Algebraic Riccati Equation”, Proc. IEEE, 72(1984), pp. 1746-1754
  • 12. 12 •‫ﻣﺮﺗﺒﻂ‬ ‫دﺳﺘﻮرﻫﺎی‬: dare:‫زﻣﺎن‬ ‫رﯾﮑﺎﺗﯽ‬ ‫ﻣﻌﺎدﻻت‬ ‫ﺣﻞ‬-‫ﮔﺴﺴﺘﻪ‬ lyap:‫زﻣﺎن‬ ‫ﻟﯿﺎﭘﺎﻧﻮف‬ ‫ﻣﻌﺎدﻻت‬ ‫ﺣﻞ‬-‫ﭘﯿﻮﺳﺘﻪ‬ 2-4-‫دﺳﺘﻮر‬cdf2rdf: •‫ﻫﺪف‬:‫ﺑﺎ‬ ‫ﻗﻄﺮی‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﺑﻪ‬ ‫ﻣﺨﺘﻠﻂ‬ ‫ﻋﻨﺎﺻﺮ‬ ‫ﺑﺎ‬ ‫ﻗﻄﺮی‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﺗﺒﺪﯾﻞ‬‫ﺣﻘﯿﻘﯽ‬ ‫ﺑﻠﻮﮐﻬﺎی‬. •‫دﺳﺘﻮراﻟﻌﻤﻞ‬ ‫ﻧﮕﺎرش‬:[V,D]=cdf2rdf(V,D) •‫ﺗﻮﺿﯿﺤﺎت‬: ‫ﭼﻨﺎﻧﭽ‬‫ﻣﺎﺗﺮﯾﺲ‬ ‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫ﻪ‬X‫ﻣﺎﺗﺮﯾﺴﻬﺎی‬ ،‫ﺑﺎﺷﻨﺪ‬ ‫ﻣﻮﻫﻮﻣﯽ‬V‫و‬D‫دﺳﺘﻮر‬ ‫اﺟﺮای‬ ‫از‬ ‫ﮐﻪ‬[V,D]=eig(X)‫ﻣﯽ‬ ‫ﺑﺪﺳﺖ‬‫آﯾﻨﺪ‬ ‫ﺑﻮد‬ ‫ﺧﻮاﻫﻨﺪ‬ ‫ﻣﻮﻫﻮﻣﯽ‬ ‫ﻋﻨﺎﺻﺮ‬ ‫دارای‬.‫دﺳﺘﻮر‬cdf2rdf‫ﻣﻮﻫﻮﻣﯽ‬ ‫ﻋﻨﺎﺻﺮ‬ ‫ﺑﺎ‬ ‫ﻗﻄﺮی‬ ‫ﻣﺎﺗﺮﯾﺲ‬D‫ﻗﻄﺮی‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﯾﮏ‬ ‫ﺑﻪ‬ ‫را‬–‫ﺑﻠﻮﮐﯽ‬ ‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﺣﻘﯿﻘﯽ‬ ‫ﺑﻠﻮﮐﻬﺎی‬ ‫ﺑﺎ‬.‫وﯾﮋ‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫از‬ ‫زوج‬ ‫ﻫﺮ‬‫ﺑﺨﺶ‬ ‫در‬ ‫آﻧﭽﻪ‬ ‫ﻃﺒﻖ‬ ‫ﻣﻮﻫﻮﻣﯽ‬ ‫ه‬2-6-3‫ﺑﻠﻮک‬ ‫ﯾﮏ‬ ‫ﺑﺎ‬ ‫ﺷﺪ‬ ‫ﮔﻔﺘﻪ‬2×2 ‫ﻣﺘﻨﺎﻇﺮ‬ ‫ﺣﻘﯿﻘﯽ‬‫ﺷﺪ‬ ‫ﺧﻮاﻫﺪ‬.‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫اﯾﻦ‬ ‫در‬ ‫اﻟﺒﺘﻪ‬V‫دﯾﮕﺮ‬ ‫و‬ ‫ﮐﺮد‬ ‫ﺧﻮاﻫﺪ‬ ‫ﺗﻐﯿﯿﺮ‬ ‫ﺗﯿﺰ‬V‫ﺳﯿﺴﺘﻢ‬ ‫وﯾﮋه‬ ‫ﺑﺮدارﻫﺎی‬ ‫ﺷﺎﻣﻞ‬ ‫ﺑﻮد‬ ‫ﻧﺨﻮاﻫﺪ‬‫؛‬‫ﺗﻐﯿﯿﺮات‬ ‫اﻣﺎ‬V‫راﺑﻄﻪ‬ ‫ﮐﻤﺎﮐﺎن‬ ‫ﮐﻪ‬ ‫اﺳﺖ‬ ‫ﻧﺤﻮی‬ ‫ﺑﻪ‬X*V=V*D‫ﺑﺎﺷﺪ‬ ‫ﺑﺮﻗﺮار‬. •‫ﻣﺜﺎل‬:‫ﻣﺎﺗﺮﯾﺲ‬X‫ﮔﯿﺮﯾﻢ‬ ‫ﻣﯽ‬ ‫ﻧﻈﺮ‬ ‫در‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫را‬:           − = 450 540 321 X ‫دارد‬ ‫ﻣﻮﻫﻮﻣﯽ‬ ‫وﯾﮋه‬ ‫ﻣﻘﺪار‬ ‫ﺟﻔﺖ‬ ‫ﯾﮏ‬ ‫ﮐﻪ‬: »[V,D]=eig(X) V = 1.0000 0.4002-0.0191i 0.4002+0.191i 0 0.6479 0.6479 0 0+0.6479i 0-0.6479i D = 1 0 0 0 4+5i 0 0 0 4-5i ، ‫ﺣﻘﯿﻘﯽ‬ ‫ﺑﻠﻮﮐﯽ‬ ‫ﻗﻄﺮی‬ ‫ﻓﺮم‬ ‫ﺑﻪ‬ ‫ﻧﻤﺎﯾﺶ‬ ‫اﯾﻦ‬ ‫ﺗﺒﺪﯾﻞ‬‫ﮐﺮد‬ ‫ﺧﻮاﻫﺪ‬ ‫ﺣﺎﺻﻞ‬ ‫را‬ ‫زﯾﺮ‬ ‫ﻧﺘﯿﺠﻪ‬: »[V,D]=cdf2rdf(V,D) V = 1 0.4002 -0.0191 0 0.6479 0 0 0 0.6479 D = 1 0 0 0 4 5 0 -5 4 2-5-‫دﺳﺘﻮر‬ctrb: •‫ﻫﺪف‬:‫ﭘﺬﯾﺮی‬ ‫ﮐﻨﺘﺮل‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ •‫دﺳﺘﻮراﻟﻌﻤﻞ‬ ‫ﻧﮕﺎرش‬: Co=ctrb(A,B) Co=ctrb(SYS) Co=ctrb(SYS.a,SYS.b) •‫ﺗﻮﺿﯿﺤﺎت‬:‫ﻓﺮم‬ ‫ﺑﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻣﻌﺎدﻟﻪ‬ ‫ﭼﻨﺎﻧﭽﻪ‬BuAxx += • ‫آن‬ ‫در‬ ‫ﮐﻪ‬ ‫ﺑﺎﺷﺪ‬Anxn‫و‬Bnxm،‫اﺳﺖ‬‫ﻣﺎ‬‫ﮐﻨﺘﺮل‬ ‫ﺗﺮﯾﺲ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﭘﺬﯾﺮی‬)‫دﺳﺘﻮر‬ ‫ﺑﺎ‬ ‫ﮐﻪ‬ctrb‫ﺷﻮد‬ ‫ﻣﯽ‬ ‫ﻣﺤﺎﺳﺒﻪ‬(‫ﺑﻮد‬ ‫ﺧﻮاﻫﺪ‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬:
  • 13. 13 [ ]BABAABBCo n 12 − = L ‫ﻣﺎﺗﺮﯾﺲ‬ ‫رﺗﺒﻪ‬ ‫ﮐﻪ‬ ‫اﺳﺖ‬ ‫ﮐﺎﻣﻞ‬ ‫ﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫زﻣﺎﻧﯽ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﮐﻪ‬ ‫اﺳﺖ‬ ‫واﺿﺢ‬Co‫ﺑﺎﺷﺪ‬ ‫ﮐﺎﻣﻞ‬. •‫ﻣﺜﺎل‬:‫ﻣﺎﺗﺮﯾﺴﻬﺎی‬A‫و‬B‫ﮔﯿﺮﯾﻢ‬ ‫ﻣﯽ‬ ‫ﻧﻈﺮ‬ ‫در‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫را‬:       − − =      − = 11 11 , 24 11 BA ‫ﮐﻨﺘﺮل‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫رﺗﺒﮥ‬ ‫زﯾﺮ‬ ‫ﺑﺮﻧﺎﻣﮥ‬‫ﻣﯽ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫را‬ ‫ﭘﺬﯾﺮی‬‫ﮐﻨﺪ‬: »A=[1 1;4 –2]; »B=[1 –1;1 –1]; »Co=ctrb(A,B) Co= 1 -1 2 -2 1 -1 2 -2 »rank(Co) ans= 1 ‫رﺗﺒﻪ‬ ‫ﭼﻮن‬Co‫ﻧﯿﺴﺖ‬ ‫ﮐﺎﻣﻞ‬،‫ﮐﺎﻣﻞ‬ ‫ﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻟﺬا‬‫ﻧﻤﯽ‬‫ﺑﺎﺷﺪ‬.‫ﮐ‬ ‫ﺣﺎﻟﺘﻬﺎی‬ ‫ﺗﻌﺪاد‬‫ﻨﺘﺮل‬‫ﻧﺎ‬‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﭘﺬﯾﺮ‬ ‫ﻣﯽ‬ ‫ﻣﺤﺎﺳﺒﻪ‬‫ﺷﻮد‬: »unco=length(A)-rank(Co) ans= 1 ‫دارد‬ ‫ﻧﺎﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫ﺣﺎﻟﺖ‬ ‫ﯾﮏ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻟﺬا‬ ‫و‬. •‫ﻣﺤﺪودﯾﺘﻬﺎ‬: ‫ﻣﺤﺎﺳﺒﻪ‬Co‫ﭘﺎره‬ ‫در‬‫ﺷﻮد‬ ‫ﻣﯽ‬ ‫ﺧﻄﺎ‬ ‫دﭼﺎر‬ ‫ﻣﻮارد‬ ‫ای‬.‫ﮐﻨﯿﻢ‬ ‫ﻣﯽ‬ ‫ﺑﺮرﺳﯽ‬ ‫ﺳﺎده‬ ‫ﻣﺜﺎل‬ ‫ﯾﮏ‬ ‫ﺑﺎ‬ ‫را‬ ‫ﻣﻮﺿﻮع‬ ‫اﯾﻦ‬:       =      = δ δ 1 , 10 1 BA ‫اﮔﺮ‬δ≠0‫ﺑﻮد‬ ‫ﺧﻮاﻫﺪ‬ ‫ﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫زوج‬ ‫اﯾﻦ‬ ‫ﺑﺎﺷﺪ‬: [ ]       + == δδ δ 2 11 ABBCo ‫اﮔﺮ‬ ‫اﻣﺎ‬eps<2 δ‫آن‬ ‫در‬ ‫ﮐﻪ‬ ‫ﺑﺎﺷﺪ‬eps‫راﯾﺎﻧﻪ‬ ‫آﻧﮕﺎه‬ ‫اﺳﺖ‬ ‫ﮐﺎﻣﭙﯿﻮﺗﺮ‬ ‫ﻣﺤﺎﺳﺒﺎت‬ ‫ﻧﺴﺒﯽ‬ ‫وﺿﻮح‬2 δ‫و‬ ‫ﮔﺮﻓﺖ‬ ‫ﺧﻮاﻫﺪ‬ ‫ﻧﻈﺮ‬ ‫در‬ ‫ﺻﻔﺮ‬ ‫را‬ ‫ﻧﺸﺎن‬ ‫ﻧﺎﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫را‬ ‫ﺳﯿﺴﺘﻢ‬‫اﺳﺖ‬ ‫ﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﮐﻪ‬ ‫ﺣﺎﻟﯽ‬ ‫در‬ ‫داد‬ ‫ﺧﻮاﻫﺪ‬.‫دﺳﺘﻮر‬ ‫از‬ ‫اﺳﺖ‬ ‫ﺑﻬﺘﺮ‬ ‫ﺷﺮاﯾﻂ‬ ‫اﯾﻦ‬ ‫در‬ctrbf ‫ﺷﻮد‬ ‫اﺳﺘﻔﺎده‬. •‫ﻣﺮﺗﺒﻂ‬ ‫دﺳﺘﻮرات‬: obsv:‫ﭘﺬﯾﺮی‬ ‫روﯾﺖ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﻣﺤﺎﺳﺒﻪ‬‫ﺳﯿﺴﺘﻢ‬ ctrbf:‫ﺳﯿﺴﺘﻢ‬ ‫ﻧﺎﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫و‬ ‫ﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫ﺣﺎﻟﺘﻬﺎی‬ ‫ﺟﺪاﺳﺎزی‬ 2-6-‫دﺳﺘﻮر‬Ctrbf: •‫ﻫﺪف‬:‫ﮐﻨﺘﺮ‬ ‫ﭘﻠﮑﺎﻧﯽ‬ ‫ﻓﺮم‬ ‫ﺗﻬﯿﻪ‬‫ﭘﺬﯾﺮ‬ ‫ل‬)‫ﻧﺎﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫و‬ ‫ﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫ﺣﺎﻟﺘﻬﺎی‬ ‫ﺟﺪاﺳﺎزی‬( •‫دﺳﺘﻮراﻟﻌﻤﻞ‬ ‫ﻧﮕﺎرش‬:[Abar,Bbar,Cbar,T,K]=ctrbf(A,B,C) [Abar,Bbar,Cbar,r,k]=ctrbf(A,B,C,tol)
  • 14. 14 •‫ﺗﻮﺿﯿﺤﺎت‬: ‫ا‬‫زوج‬ ‫ﭘﺬﯾﺮی‬ ‫ﮐﻨﺘﺮل‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫رﺗﺒﻪ‬ ‫ﮔﺮ‬(A,B)‫از‬ ‫ﮐﻮﭼﮑﺘﺮ‬n)n‫ﻣﺮﺗﺒﻪ‬A‫اﺳﺖ‬(‫ﺑﺎﺷﺪ‬،‫آﻧﮕﺎ‬‫ﻣﺎﻧﻨﺪ‬ ‫ﺗﺸﺎﺑﻬﯽ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﯾﮏ‬ ‫ه‬T‫وﺟﻮد‬ ‫ﻣﯽ‬ ‫ﮐﻪ‬ ‫دارد‬‫ﮐﻨﺪ‬ ‫ﺟﺪا‬ ‫ﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫ﺣﺎﻟﺘﻬﺎی‬ ‫از‬ ‫را‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻧﺎﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫ﺣﺎﻟﺘﻬﺎی‬ ‫ﺗﻮاﻧﺪ‬.‫ﺗﺒﺪﯾﻞ‬ ‫ﻣﺎﺗﺮﯾﺲ‬unitary T‫اﺳﺖ‬1 ‫و‬‫دارﯾﻢ‬ : TT CTCTBBTATA === ,, ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫اﯾﻦ‬A‫ﻣﯽ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﭼﻨﺎن‬ ‫ﭘﻠﮑﺎﻧﯽ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﯾﮏ‬ ‫ﺑﻪ‬ ‫را‬‫ﺣﺎﻟﺘﻬﺎ‬ ‫ﺑﻪ‬ ‫ﻣﺮﺑﻮط‬ ‫ﺑﺨﺶ‬ ‫ﮐﻪ‬ ‫ﮐﻨﺪ‬‫ﻧﺎﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫ی‬(Auc)‫در‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﺑﺎﻻی‬ ‫ﭼﭗ‬ ‫ﺳﻤﺖ‬ ‫ﮔﻮﺷﻪ‬A‫ﮔﯿﺮد‬ ‫ﻗﺮار‬: [ ]cuc cc uc CCC B B AA A A =      =      = , 0 , 0 21 ‫ا‬ ‫در‬‫ﯾﻨﺤﺎﻟﺖ‬‫زوج‬(Ac,Bc)‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫ﺗﻤﺎم‬ ، ‫ﺑﻮده‬ ‫ﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬Auc‫داﺷﺖ‬ ‫ﺧﻮاﻫﯿﻢ‬ ‫و‬ ‫ﻫﺴﺘﻨﺪ‬ ‫ﻧﺎﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬: BAsICBAsIC cc 11 )()( −− −=− ‫ﺳ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﺗﺎﺑﻊ‬ ‫ﺗﻌﯿﯿﻦ‬ ‫در‬ ‫ﻧﺎﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫ﺣﺎﻟﺘﻬﺎی‬ ‫ﯾﻌﻨﯽ‬‫ﻧﺪارد‬ ‫اﺛﺮی‬ ‫ﯿﺴﺘﻢ‬. ‫دﺳﺘﻮر‬[Abar,Bbar,Cbar,T,K]=ctrbf(A,B,C)‫ﺑ‬ ‫ﺷﺪه‬ ‫داده‬ ‫ﻧﻤﺎﯾﺶ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﺳﯿﺴﺘﻢ‬‫ﺎ‬A،B‫و‬C‫ر‬‫ﺑﻪ‬ ‫ا‬ ‫ﺑﺎ‬ ‫ﺳﯿﺴﺘﻤﯽ‬CBA ,,‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫اﻟﺬﮐﺮ‬ ‫ﻓﻮق‬.T‫و‬ ‫ﺗﺸﺎﺑﻬﯽ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﻣﺎﺗﺮﯾﺲ‬K‫ﻃﻮل‬ ‫ﺑﻪ‬ ‫ﺑﺮدار‬ ‫ﯾﮏ‬n‫ﮐﻪ‬ ‫اﺳﺖ‬n‫ﻣﺎﺗﺮﯾﺲ‬ ‫اﺑﻌﺎد‬ A‫ﺑﺎﺷﺪ‬ ‫ﻣﯽ‬.‫ﻋﻀﻮ‬ ‫ﻫﺮ‬K‫ﻧﺸﺎن‬‫ﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫ﺣﺎﻟﺖ‬ ‫ﭼﻨﺪ‬ ‫ﺗﺸﺎﺑﻬﯽ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫ﺑﺮای‬ ‫ﺗﮑﺮار‬ ‫ﺑﺎر‬ ‫ﻫﺮ‬ ‫در‬ ‫ﮐﻪ‬ ‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫اﺳﺖ‬ ‫ﺷﺪه‬ ‫اﺳﺘﺨﺮاج‬. ‫ﺑﺮدار‬ ‫ﺻﻔﺮ‬ ‫ﻏﯿﺮ‬ ‫اﻋﻀﺎی‬ ‫ﺗﻌﺪاد‬ ‫ﺑﻨﺎﺑﺮاﯾﻦ‬K‫ﺗﺒﺪﯾﻞ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫ﺑﺮای‬ ‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻧﺸﺎن‬T‫اﺳﺖ‬ ‫ﻻزم‬ ‫ﺗﮑﺮار‬ ‫ﭼﻨﺪ‬.‫ﺑﻌﻼوه‬ 2 SUM(K)‫ﺣﺎﻟﺘﻬﺎی‬ ‫ﺗﻌﺪاد‬Ac‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻧﺸﺎن‬ ‫را‬. ‫ﻋﻨﺼﺮ‬tol‫د‬‫ر‬‫دﺳﺘﻮر‬ctrbf(A,B,C,tol)‫ﻓﻀﺎﻫﺎی‬ ‫زﯾﺮ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫در‬ ‫ﻣﺠﺎز‬ ‫ﺗﻠﺮاﻧﺲ‬ ‫ﻣﻘﺪار‬ ‫ﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬/‫ﻧﺎﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬‫را‬‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻧﺸﺎن‬.‫اﮔﺮ‬‫ﺑﺎﺷﺪ‬ ‫ﻧﺸﺪه‬ ‫ﺗﻌﯿﯿﻦ‬ ‫ﺗﻠﺮاﻧﺲ‬ ‫اﯾﻦ‬ ‫ﻣﻘﺪار‬،‫ﻣﻘﺪار‬10*n*norm(A,1)* eps‫ﻋﻨﻮان‬ ‫ﺑﻪ‬ ‫ﺷﻮد‬ ‫ﻣﯽ‬ ‫ﮔﺮﻓﺘﻪ‬ ‫ﻧﻈﺮ‬ ‫در‬ ‫ﻓﺮض‬ ‫ﭘﯿﺶ‬. •‫ﻣﺜﺎل‬:‫ﺑﮕﯿﺮﯾﺪ‬ ‫ﻧﻈﺮ‬ ‫در‬ ‫را‬ ‫زﯾﺮ‬ ‫ﺳﯿﺴﺘﻢ‬:       =      − − =      − = 10 01 , 11 11 , 24 11 CBA ‫دﺳﺘﻮر‬ ‫اﻋﻤﺎل‬ ‫ﺑﺎ‬ [Abar,Bbar,Cbar,T,K]=ctrbf(A,B,C) ‫داﺷﺖ‬ ‫ﺧﻮاﻫﯿﻢ‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫را‬ ‫ﺟﺪﯾﺪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫و‬ ‫ﺷﺪه‬ ‫ﺟﺪا‬ ‫ﻫﻢ‬ ‫از‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻧﺎﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫و‬ ‫ﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫ﺣﺎﻟﺘﻬﺎی‬: Abar= -3 0 -3 2 Bbar= 0 0 1.4142 -1.4142 Cbar= -0.7071 0.7071 0.7071 0.7071 ‫ﺗﺒ‬ ‫ﻣﺎﺗﺮﯾﺲ‬‫ﺗﺸﺎﺑﻬﯽ‬ ‫ﺪﯾﻞ‬T‫ﺑﺮدار‬ ‫و‬K‫ﺑﻮد‬ ‫ﺧﻮاﻫﻨﺪ‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫ﻧﯿﺰ‬: T= -0.7071 0.7071 0.7071 0.7071 K= 1 0 ١‫ﻣﺎﺗﺮﯾﺲ‬Unitay T‫اﮔﺮ‬ ‫ﺗﻨﻬﺎ‬ ‫و‬ ‫ﺗﻨﻬﺎ‬ ‫اﮔﺮ‬ ‫اﺳﺖ‬: T.TT =TT .T=I ٢‫دﺳﺘﻮر‬SUM(K)‫ﺑﺮدار‬ ‫ﻋﻨﺎﺻﺮ‬ ‫ﻣﺠﻤﻮع‬K‫ﻣﯽ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫را‬‫ﮐﻨﺪ‬.
  • 15. 15 ‫در‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫ﺣﺎﻟﺖ‬ ‫ﮐﻪ‬ ‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻧﺸﺎن‬ ‫ﺟﺪﯾﺪ‬ ‫ﺳﯿﺴﺘﻢ‬3-‫در‬ ‫آن‬ ‫ﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫ﺣﺎﻟﺖ‬ ‫و‬2+‫اﺳﺖ‬ ‫ﮔﺮﻓﺘﻪ‬ ‫ﻗﺮار‬. •‫ﻣﺮﺗﺒﻂ‬ ‫دﺳﺘﻮراﻟﻌﻤﻠﻬﺎی‬: ctrb:‫ﻣ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫را‬ ‫ﭘﺬﯾﺮی‬ ‫ﮐﻨﺘﺮل‬ ‫ﻣﺎﺗﺮﯾﺲ‬‫ﮐﻨﺪ‬ ‫ﯽ‬. minreal:‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻧﺘﯿﺠﻪ‬ ‫را‬ ‫ﻧﯿﻤﺎل‬ ‫ﻣﯽ‬ ‫ﺗﺤﻘﻖ‬ ‫و‬ ‫داده‬ ‫اﻧﺠﺎم‬ ‫ﺻﻔﺮ‬ ‫و‬ ‫ﻗﻄﺐ‬ ‫ﺣﺬف‬. 2-7-‫دﺳﺘﻮر‬diag: •‫ﻫﺪف‬: 1.‫اﺻﻠﯽ‬ ‫ﻗﻄﺮ‬ ‫ﻣﻮازی‬ ‫ﻗﻄﺮﻫﺎی‬ ‫روی‬ ‫ﯾﺎ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﯾﮏ‬ ‫اﺻﻠﯽ‬ ‫ﻗﻄﺮ‬ ‫روی‬ ‫ﺑﺮدار‬ ‫ﯾﮏ‬ ‫ﻋﻨﺎﺻﺮ‬ ‫ﻗﺮاردادن‬ 2.‫ﺑﺮدار‬ ‫ﯾﮏ‬ ‫در‬ ‫آن‬ ‫ﺑﺎ‬ ‫ﻣﻮازی‬ ‫ﻗﻄﺮﻫﺎی‬ ‫ﯾﺎ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﯾﮏ‬ ‫اﺻﻠﯽ‬ ‫ﻗﻄﺮ‬ ‫روی‬ ‫ﻋﻨﺎﺻﺮ‬ ‫ﻗﺮاردادن‬. •‫دﺳ‬ ‫ﻧﮕﺎرش‬‫ﺘﻮراﻟﻌﻤﻞ‬: X=diag(v,k) X=diag(v) V=diag(x,k) V=diag(x) •‫ﺗﻮﺿﯿﺤﺎت‬: ‫دﺳﺘﻮر‬X=diag(v,k)‫آن‬ ‫در‬ ‫ﮐﻪ‬V‫و‬ ‫ﺑﺮدار‬ ‫ﯾﮏ‬n‫و‬ ‫ﻋﻀﻮی‬k، ‫اﺳﺖ‬ ‫ﺻﺤﯿﺢ‬ ‫ﻋﺪد‬ ‫ﯾﮏ‬‫ﻣﺎﺗﺮﯾﺲ‬X‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﺗﻮﻟﯿﺪ‬ ‫را‬ ‫آن‬ ‫اﺑﻌﺎد‬ ‫ﮐﻪ‬n+abs(k)‫ﺑﺮدار‬ ‫ﻋﻨﺎﺻﺮ‬ ‫و‬ ‫اﺳﺖ‬V‫روی‬K‫ﻗﺮاردارﻧﺪ‬ ‫آن‬ ‫ﻗﻄﺮ‬ ‫اﻣﯿﻦ‬.K=0‫ا‬ ‫ﻗﻄﺮ‬ ‫ﺑﯿﺎﻧﮕﺮ‬،‫ﺻﻠﯽ‬K>0‫ﻗﻄﺮﻫﺎی‬ ‫ﺑﻪ‬ ‫ﻣﺮﺑﻮط‬ ‫و‬ ‫اﺻﻠﯽ‬ ‫ﻗﻄﺮ‬ ‫ﺑﺎﻻی‬K<0‫اﺳﺖ‬ ‫آن‬ ‫زﯾﺮ‬ ‫ﻗﻄﺮﻫﺎی‬ ‫ﺑﻪ‬ ‫ﻣﺮﺑﻮط‬. ‫دﺳﺘﻮر‬X=diag(v)‫ازای‬ ‫ﺑﻪ‬ ‫ﻗﺒﻞ‬ ‫دﺳﺘﻮر‬ ‫ﻫﻤﺎن‬ ‫واﻗﻊ‬ ‫در‬K=0‫اﺳﺖ‬.‫دﺳﺘﻮر‬V=diag(x,k)‫آن‬ ‫در‬ ‫ﮐﻪ‬x‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﯾﮏ‬ ، ‫اﺳﺖ‬‫ﻗﻄﺮ‬k‫ام‬x‫ﺑﺮدار‬ ‫در‬ ‫را‬V‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻗﺮار‬.‫ﻋﻼﻣﺖ‬ ‫وﺿﻌﯿﺖ‬K‫دﺳﺘﻮر‬ ‫ﻣﺎﻧﻨﺪ‬X=diag(v,k)‫ﺑﺎﺷﺪ‬ ‫ﻣﯽ‬.V=diag(x)‫ﻧﯿﺰ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫اﺻﻠﯽ‬ ‫ﻗﻄﺮ‬ ‫روی‬ ‫ﻋﻨﺎﺻﺮ‬x‫ﺑﺮدار‬ ‫در‬ ‫را‬k‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻗﺮار‬. •‫ﻣﺜﺎل‬:‫ﺑﺮدار‬V‫ﮔﯿﺮﯾﻢ‬ ‫ﻣﯽ‬ ‫ﻧﻈﺮ‬ ‫در‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫را‬: » V=[-1 –2 –3]; » X=diag(V) X= -1 0 0 0 -2 0 0 0 -3 » X=diag(v,1) X= 0 -1 0 0 0 0 -2 0 0 0 0 -3 0 0 0 0 » Y=[1 2 3;-3 –2 –1;-5 –6 –8]; » V1=diag(Y) V1= 1 -2 -8 » V2=diag(Y,1) V2= 2 -1
  • 16. 16 2-8-‫دﺳﺘﻮر‬eig: •‫ﻫﺪف‬:‫وﯾﮋه‬ ‫ﺑﺮدارﻫﺎی‬ ‫و‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫ﯾﺎﻓﺘﻦ‬ •‫دﺳﺘﻮراﻟﻌﻤﻞ‬ ‫ﻧﮕﺎرش‬: d=eig(A) d=eig(A,B) [V,D]=eig(A) [V,D]=eig(A,’no balance’) [V,D]=eig(A,B) [V,D]=eig(A,B,flag) •‫ﺗﻮﺿﯿﺤﺎت‬:‫ﭘﺮدازﯾﻢ‬ ‫ﻣﯽ‬ ‫ﻣﻘﺪﻣﺎﺗﯽ‬ ‫ﺗﻌﺎرﯾﻒ‬ ‫ای‬ ‫ﭘﺎره‬ ‫ﻣﺮور‬ ‫ﺑﻪ‬ ‫آﻏﺎز‬ ‫در‬.‫اﺳﺖ‬ ‫زﯾﺮ‬ ‫ﻣﻌﺎدﻟﻪ‬ ‫ﺣﻞ‬ ‫واﻗﻊ‬ ‫در‬ ‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫ﻣﺴﺎﻟﻪ‬: XAX λ= ‫آن‬ ‫در‬ ‫ﮐﻪ‬A‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﯾﮏ‬n*n،X‫ﺑﺮدار‬ ‫ﯾﮏ‬n‫ﻋﻀﻮ‬‫و‬ ‫ی‬λ‫اﺳﺖ‬ ‫اﺳﮑﺎﻟﺮ‬ ‫ﯾﮏ‬. ‫از‬ ‫ﻣﻘﺎدﯾﺮی‬λ، ‫ﮐﻨﻨﺪ‬ ‫ﻣﯽ‬ ‫ﺑﺮآورده‬ ‫را‬ ‫ﻓﻮق‬ ‫ﻣﻌﺎدﻟﻪ‬ ‫ﮐﻪ‬‫ﻣﺎﺗﺮﯾﺲ‬ ‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬A‫ﻫﺴﺘﻨﺪ‬.‫ﻣﺎﺗﺮﯾﺲ‬ ‫اﺑﻌﺎد‬ ‫ﺗﻌﺪاد‬ ‫ﺑﺎ‬ ‫ﺑﺮاﺑﺮ‬ ‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫ﺗﻌﺪاد‬ A)‫ﯾﻌﻨﯽ‬n(‫اﺳﺖ‬.‫ﺑﺮدار‬X‫ﻣﺎﺗﺮﯾﺲ‬ ‫راﺳﺖ‬ ‫ﺳﻤﺖ‬ ‫وﯾﮋه‬ ‫ﺑﺮدار‬ ‫ﻧﺎم‬ ‫ﺑﻪ‬ ‫ﻧﯿﺰ‬A‫ﻣﯽ‬ ‫ﺷﻨﺎﺧﺘﻪ‬‫ﺷﻮد‬.‫اﻓﺰار‬ ‫ﻧﺮم‬ ‫در‬Matlab‫دﺳﺘﻮر‬ eig‫اﺳﺖ‬ ‫ﺷﺪه‬ ‫ﮔﺮﻓﺘﻪ‬ ‫ﻧﻈﺮ‬ ‫در‬ ‫وﯾﮋه‬ ‫ﺑﺮدارﻫﺎی‬ ‫و‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫ﺑﺮای‬. ، ‫ﯾﺎﻓﺘﻪ‬ ‫ﺗﻌﻤﯿﻢ‬ ‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫ﻣﺴﺎﻟﻪ‬ ‫در‬‫از‬ ‫ﻣﻘﺎدﯾﺮی‬ ‫ﯾﺎﻓﺘﻦ‬ ‫ﻫﺪف‬λ‫و‬x‫ﺳﺎزﻧﺪ‬ ‫ﺑﺮآورده‬ ‫را‬ ‫زﯾﺮ‬ ‫ﻣﻌﺎدﻟﻪ‬ ‫ﮐﻪ‬ ‫اﺳﺖ‬: BXAX λ= ‫آن‬ ‫در‬ ‫ﮐﻪ‬A‫و‬B‫ﻣﺎﺗﺮﯾﺴﻬﺎی‬ ‫دو‬ ‫ﻫﺮ‬n*n‫ﻫﺴﺘﻨﺪ‬ ‫ﻣﻌﻠﻮم‬ ‫و‬.‫اﮔﺮ‬B‫ﻧﺒﺎﺷﺪ‬ ‫وﯾﮋه‬‫ﺗﺒﺪﯾﻞ‬ ‫زﯾﺮ‬ ‫ﻓﺮم‬ ‫ﺑﻪ‬ ‫ﺗﻮان‬ ‫ﻣﯽ‬ ‫را‬ ‫ﻓﻮق‬ ‫ﻣﻌﺎدﻟﻪ‬ ‫آﻧﮕﺎه‬ ‫ﮐﺮد‬: XAXB λ=−1 ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﺑﺮای‬ ‫ﻣﻌﻤﻮﻟﯽ‬ ‫وﯾﮋه‬ ‫ﺑﺮدارﻫﺎی‬ ‫و‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫ﯾﺎﻓﺘﻦ‬ ‫ﻫﻤﺎن‬ ‫واﻗﻊ‬ ‫در‬ ‫ﮐﻪ‬B-1 A‫ﺑﺎﺷﺪ‬ ‫ﻣﯽ‬.‫اﮔﺮ‬ ‫اﻣﺎ‬B‫اﻟﮕﻮرﯾﺘﻢ‬ ‫از‬ ‫اﺳﺘﻔﺎده‬ ‫ﺑﺎﺷﺪ‬ ‫وﯾﮋه‬ QZ‫اﺳﺖ‬ ‫ﺿﺮوری‬. ‫دﺳﺘﻮر‬d=eig(A)‫ﻣﺎﺗﺮﯾﺲ‬ ‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬A‫ﻣﯽ‬ ‫ﺑﺮ‬ ‫را‬‫ﮔﺮ‬‫داﻧﺪ‬. ‫دﺳﺘﻮر‬d=eig(A,B)‫آن‬ ‫در‬ ‫ﮐﻪ‬A‫و‬B،‫ﻫﺴﺘﻨﺪ‬ ‫ﻣﺮﺑﻌﯽ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫دو‬‫ﻣﺤﺎﺳﺒﻪ‬ ‫را‬ ‫ﯾﺎﻓﺘﻪ‬ ‫ﺗﻌﻤﯿﻢ‬ ‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫ﮐﻨﺪ‬ ‫ﻣﯽ‬. [V,D]=eig(A)‫ﻣﺎﺗﺮﯾﺲ‬ ‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬A‫ﻗﻄﺮی‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫روی‬ ‫در‬ ‫را‬D‫ﻣﺎﺗﺮﯾﺲ‬ ‫در‬ ‫را‬ ‫آن‬ ‫وﯾﮋه‬ ‫ﺑﺮدارﻫﺎی‬ ‫و‬V، ‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻗﺮار‬ ‫داﺷﺖ‬ ‫ﺧﻮاﻫﯿﻢ‬ ‫ﺑﻨﺎﺑﺮاﯾﻦ‬:A*V=V*D‫ﮐﻪ‬V‫ﺑ‬ ‫ﻣﺎﺗﺮﯾﺲ‬‫راﺳﺖ‬ ‫وﯾﮋه‬ ‫ﺮدارﻫﺎی‬A‫اﺳﺖ‬.‫ﻣﺎﺗﺮﯾﺲ‬W‫ﭼﭗ‬ ‫ﺑﺮدارﻫﺎی‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ،A ‫ﺷﻮد‬ ‫ﻣﯽ‬ ‫ﻧﺎﻣﯿﺪه‬‫اﮔﺮ‬WT *A=D*WT .‫ﻣﺤﺎﺳﺒﻪ‬ ‫ﺑﺮای‬W‫اﺳﺖ‬ ‫ﻻزم‬ ‫زﯾﺮ‬ ‫دﺳﺘﻮرات‬: » [W,D]=eig(A.’); » W=conj(W); ‫دﺳﺘﻮر‬[V,D]=eig(a,'no balance')‫وﯾﮋه‬ ‫ﺑﺮدارﻫﺎی‬ ‫و‬ ‫ﻣﻘﺎدﯾﺮ‬A‫ﺳﺎزی‬ ‫ﻣﺘﻌﺎدل‬ ‫ﻓﺮآﯾﻨﺪ‬ ‫اﻧﺠﺎم‬ ‫ﺑﺪون‬ ‫را‬1 ‫ﻣ‬ ‫اوﻟﯿﻪ‬‫ﺤﺎﺳﺒﻪ‬ ‫ﮐﻨﺪ‬ ‫ﻣﯽ‬.،‫ﻣﻌﻤﻮل‬ ‫ﻃﻮر‬ ‫ﺑﻪ‬،‫ﺑﺨﺸﯿﺪه‬ ‫ﺑﻬﺒﻮد‬ ‫را‬ ‫ورودی‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﺷﺮاﯾﻂ‬ ‫ﺳﺎزی‬ ‫ﻣﺘﻌﺎدل‬ ‫ﻋﻤﻞ‬ ‫اﻧﺠﺎم‬‫ﻣﻘﺎدﯾﺮ‬ ‫ﺗﺮ‬ ‫ﺻﺤﯿﺢ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫ﺑﻪ‬ ‫ﻣﻨﺠﺮ‬ ‫ﺷﻮد‬ ‫ﻣﯽ‬ ‫وﯾﮋه‬ ‫ﺑﺮدارﻫﺎی‬ ‫و‬.‫ﮐﺮدن‬ ‫ﮔﺮد‬ ‫ﺧﻄﺎی‬ ‫ﺑﺮوز‬ ‫اﻣﮑﺎن‬ ‫ﮐﻪ‬ ‫ﺑﺎﺷﻨﺪ‬ ‫ﮐﻮﭼﮏ‬ ‫ﺣﺪی‬ ‫ﺑﻪ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﻋﻨﺎﺻﺮ‬ ‫ﭼﻨﺎﻧﭽﻪ‬ ‫اﻣﺎ‬2 ‫داﺗﺸﻪ‬ ‫وﺟﻮد‬ ‫آﻧ‬ ‫اﺳﺖ‬ ‫ﻣﻤﮑﻦ‬ ‫ﺳﺎزی‬ ‫ﻣﺘﻌﺎدل‬ ‫ﻋﻤﻞ‬ ‫ﺑﺎﺷﺪ‬‫ﻗﺎﺑﻞ‬ ‫ﻣﻘﺎدﯾﺮ‬ ،‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﻋﻨﺎﺻﺮ‬ ‫ﺳﺎﯾﺮ‬ ‫ﺑﺎ‬ ‫ﻣﻘﺎﯾﺴﻪ‬ ‫در‬ ‫ﮐﻪ‬ ‫ﮐﻨﺪ‬ ‫دﻫﯽ‬ ‫ﻣﻘﯿﺎس‬ ‫ای‬ ‫ﮔﻮﻧﻪ‬ ‫ﺑﻪ‬ ‫را‬ ‫ﻬﺎ‬ ‫آﻣﺪ‬ ‫ﺧﻮاﻫﺪ‬ ‫ﺑﻮﺟﻮد‬ ‫ﺧﻄﺎ‬ ‫وﯾﮋه‬ ‫ﺑﺮدارﻫﺎی‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫در‬ ‫ﻧﺘﯿﺠﻪ‬ ‫در‬ ‫و‬ ‫ﺑﮕﯿﺮﻧﺪ‬ ‫ای‬ ‫ﻣﻼﺣﻈﻪ‬.‫از‬ ‫ﻋﻨﺼﺮی‬ ‫ﮐﻪ‬ ‫ﻣﻮاردی‬ ‫در‬ ‫اﺳﺖ‬ ‫ﺑﻬﺘﺮ‬ ‫ﺑﻨﺎﺑﺮاﯾﻦ‬ ‫ﻣﺎﺗﺮﯾﺲ‬A‫ﺣﺎﻟﺖ‬ ‫از‬ ‫اﺳﺖ‬ ‫ﮐﻮﭼﮏ‬ ‫ﺧﯿﻠﯽ‬ 'no balance'‫ﻣﻘﺎدﯾﺮ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫ﺑﺮای‬‫ﺷﻮد‬ ‫اﺳﺘﻔﺎده‬ ‫وﯾﮋه‬ ‫ﺑﺮدارﻫﺎی‬ ‫و‬. ‫دﺳﺘﻮر‬[V,D]=eig(A,B)‫ﻗﻄﺮی‬ ‫ﻣﺎﺗﺮﯾﺲ‬D‫ﻣﺎﺗﺮﯾﺲ‬ ‫و‬ ‫ﯾﺎﻓﺘﻪ‬ ‫ﺗﻌﻤﯿﻢ‬ ‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫ﺷﺎﻣﻞ‬V‫ﺑﺮدارﻫﺎی‬ ‫آن‬ ‫ﺳﺘﻮﻧﻬﺎی‬ ‫ﮐﻪ‬ ‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﺗﻮﻟﯿﺪ‬ ‫را‬ ‫ﻫﺴﺘﻨﺪ‬ ‫ﯾﺎﻓﺘﻪ‬ ‫ﺗﻌﻤﯿﻢ‬ ‫وﯾﮋه‬.‫داﺷﺖ‬ ‫ﺧﻮاﻫﯿﻢ‬ ‫ﺑﻨﺎﺑﺮاﯾﻦ‬:A*V=B*V*D 1 Balancing 2 Roundoff error
  • 17. 17 ‫دﺳﺘﻮر‬[V,D]=eig(A,B,flag)‫ﻣ‬ ‫اﻟﮕﻮرﯾﺘﻢ‬‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﻣﺸﺨﺺ‬ ‫ﻧﯿﺰ‬ ‫را‬ ‫وﯾﮋه‬ ‫ﺑﺮدارﻫﺎی‬ ‫و‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫در‬ ‫اﺳﺘﻔﺎده‬ ‫ﻮرد‬. flag‫ﮐﻨﺪ‬ ‫اﺧﺘﯿﺎر‬ ‫را‬ ‫زﯾﺮ‬ ‫ﻣﻮارد‬ ‫از‬ ‫ﯾﮑﯽ‬ ‫ﺗﻮاﻧﺪ‬ ‫ﻣﯽ‬: ‘chol’:‫ﻓﺎﮐﺘﻮرﮔﯿﺮی‬ ‫از‬ ‫اﺳﺘﻔﺎده‬ ‫ﺑﺎ‬ ‫را‬ ‫ﯾﺎﻓﺘﻪ‬ ‫ﺗﻌﻤﯿﻢ‬ ‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫ﻣﺤﺎﺳﺒﻪ‬cholesky‫از‬B‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫اﻧﺠﺎم‬.‫ﭼﻨﺎﻧﭽﻪ‬A‫ﻣﺘﻘﺎرن‬ (Hermation)‫و‬B‫ﻣﻌﯿﻦ‬ ‫ﻣﺘﻘﺎرن‬‫ﺷﺪ‬ ‫ﺧﻮاﻫﺪ‬ ‫اﻧﺘﺨﺎب‬ ‫ﻓﺮض‬ ‫ﭘﯿﺶ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫روش‬ ‫اﯾﻦ‬ ‫ﺑﺎﺷﺪ‬ ‫ﻣﺜﺒﺖ‬. ‘qz’:‫از‬‫اﻟﮕﻮرﯾﺘﻢ‬QZ‫ﺑﺮای‬ ‫و‬ ‫ﮔﯿﺮد‬ ‫ﻣﯽ‬ ‫ﺑﻬﺮه‬A‫و‬B‫اﺳﺖ‬ ‫اﻋﻤﺎل‬ ‫ﻗﺎﺑﻞ‬ ‫ﻧﯿﺰ‬ ‫ﻧﺎﻣﺘﻘﺎرن‬. •‫ﻣﺜﺎل‬: ‫ﮔﯿﺮﯾﻢ‬ ‫ﻣﯽ‬ ‫ﻧﻈﺮ‬ ‫در‬ ‫را‬ ‫زﯾﺮ‬ ‫ﻣﺎﺗﺮﯾﺲ‬:             −− −− −− −− = 11.05.05.0 012/4/ 142 *29.023 epseps eps eps B ‫ﻣ‬ ‫ﮔﺮدﮐﺮدن‬ ‫ﺧﻄﺎی‬ ‫دﭼﺎر‬ ‫ﻣﺤﺎﺳﺒﺎت‬ ‫در‬ ‫ﮐﻪ‬ ‫اﺳﺖ‬ ‫ﻋﻨﺎﺻﺮی‬ ‫دارای‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫اﯾﻦ‬‫ﯽ‬‫ﺷﻮﻧﺪ‬.‫ﮐﻪ‬ ‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻧﺸﺎن‬ ‫ﺧﻮﺑﯽ‬ ‫ﺑﻪ‬ ‫ﻣﺜﺎل‬ ‫اﯾﻦ‬ ‫ﺣﺎﻟﺖ‬ ‫از‬ ‫اﺳﺘﻔﺎده‬no balance‫اﺳﺖ‬ ‫ﺿﺮوری‬ ‫وﯾﮋه‬ ‫ﺑﺮدارﻫﺎی‬ ‫ﺻﺤﯿﺢ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫ﺑﺮای‬.‫دﺳﺘﻮرات‬ ‫اﺟﺮای‬ ‫ﺑﺎ‬: » [VB,DB]=eig(B); » B*VB-VB*DB ‫داﺷﺖ‬ ‫ﺧﻮاﻫﯿﻢ‬: ans = 0 -0.0000 0.0000 0 0.0000 -0.0000 -0.0000 -0.0000 -0.0000 -0.0000 -0.0000 0.0000 0 0.0000 0 1.4420 ‫دﺳﺘﻮرات‬ ‫اﺟﺮای‬ ‫ﺑﺎ‬ ‫ﮐﻪ‬ ‫ﺣﺎﻟﯽ‬ ‫در‬ ‫ﻧﯿﺴﺖ‬ ‫ﺻﻔﺮ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﺑﺎ‬ ‫ﺑﺮاﺑﺮ‬ ‫ﮐﻪ‬: » [VN,DN]=eig(B,‘nobalance’); » B*VN-VN*DN ‫اﺳﺖ‬ ‫ﻧﺰدﯾﮑﺘﺮ‬ ‫ﺑﺴﯿﺎر‬ ‫ﺻﻔﺮ‬ ‫ﺑﻪ‬ ‫ﮐﻪ‬ ‫آﯾﺪ‬ ‫ﻣﯽ‬ ‫ﺑﺪﺳﺖ‬ ‫زﯾﺮ‬ ‫ﻣﺎﺗﺮﯾﺲ‬: ans = 1.0e-015 * 0.4441 -0.2220 0.1471 -0.4996 0 0.0555 -0.3695 0.0278 -0.0172 -0.0015 0.0066 0 0 -0.2220 -0.1110 0.0555 2-9-‫دﺳﺘﻮر‬estim: •‫ﻫﺪف‬:‫ﺣﺎﻟﺖ‬ ‫ﻣﻌﺎدﻻت‬ ‫درﯾﺎﻓﺖ‬ ‫ﺑﺎ‬ ‫روﯾﺘﮕﺮ‬ ‫دﯾﻨﺎﻣﯿﮑﯽ‬ ‫ﻣﻌﺎدﻻت‬ ‫ﺗﻌﯿﯿﻦ‬‫روﯾﺘﮕﺮ‬ ‫ﺑﻬﺮه‬ ‫و‬ ‫ﺳﯿﺴﺘﻢ‬. •‫ﻧﮕﺎرش‬: est=estim(sys,L) est=estim(sys,L,sensors,known) •‫ﺗﻮﺿﯿﺤﺎت‬: ‫دﺳﺘﻮر‬est=estim(sys,L)‫ﺳﯿﺴﺘﻢ‬ ‫درﯾﺎﻓﺖ‬ ‫ﺑﺎ‬sys‫روﯾﺘﮕﺮ‬ ‫ﺑﻬﺮه‬ ‫و‬L‫روﯾﺘﮕﺮ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻣﻌﺎدﻻت‬ ،(est)‫را‬‫ﻣﯽ‬ ‫ﻧﺸﺎن‬ ‫دﻫﺪ‬.‫ﺳﯿﺴﺘﻢ‬ ‫ورودﯾﻬﺎی‬ ‫ﻫﻤﻪ‬(W)‫ﺧﺮوﺟﯿﻬﺎی‬ ‫ﻫﻤﻪ‬ ‫و‬ ‫ﺗﺼﺎدﻓﯽ‬Y‫ﮔﯿﺮ‬ ‫اﻧﺪازه‬ ‫ﻗﺎﺑﻞ‬‫ﻣﯽ‬ ‫ﻓﺮض‬ ‫ی‬‫ﺷﻮﻧﺪ‬.‫روﯾﺘﮕﺮ‬est‫ﻓﺮم‬ ‫در‬ ‫ﺷﻮد‬ ‫ﻣﯽ‬ ‫اراﺋﻪ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬.‫اﺻﻠﯽ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫اﮔﺮ‬(sys)‫ﺑﺎﺷﺪ‬ ‫زﯾﺮ‬ ‫ﻣﻌﺎدﻻت‬ ‫دارای‬: X=Ax+Bw Y=Cx+Dw
  • 18. 18 ‫دﺳﺘﻮر‬ ‫آﻧﮕﺎه‬estim‫ﺳﯿﺴﺘﻢ‬ ‫ﺣﺎﻟﺖ‬ ‫و‬ ‫ﺧﺮوﺟﯽ‬ ‫ﺗﺨﻤﯿﻨﻬﺎی‬),( ^^ yx‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﺗﻮﻟﯿﺪ‬ ‫زﯾﺮ‬ ‫ﻣﻌﺎدﻻت‬ ‫ﺑﺎ‬ ‫را‬: ^ ^ ^ ^^^ )( x I C x y xCyLxAx       =         −+= • ‫دﺳﺘﻮر‬est=estim(sys,l,sensors,known)‫ﻋﻤﻮﻣﯽ‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬ ‫ﺑﺮای‬‫رود‬ ‫ﻣﯽ‬ ‫ﮐﺎر‬ ‫ﺑﻪ‬ ‫ﺗﺮ‬.‫ﻣﯽ‬ ‫ﻓﺮض‬ ‫اﯾﻨﺠﺎ‬ ‫در‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﮐﻪ‬ ‫ﺷﻮد‬sys‫ﻣﻌﻠﻮم‬ ‫ﻫﺎی‬ ‫ورودی‬ ‫دارای‬u‫ﺗﺼﺎدﻓﯽ‬ ‫ورودﯾﻬﺎی‬ ‫و‬w‫ﺑﺎﺷﺪ‬.‫دو‬ ‫ﺑﻪ‬ ‫ﻧﯿﺰ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻫﺎی‬ ‫ﺧﺮوﺟﯽ‬ ‫ﻫﻤﭽﻨﯿﻦ‬ ‫اﻧﺪا‬ ‫ﻗﺎﺑﻞ‬ ‫ﮔﺮوه‬‫ﮔﯿﺮی‬ ‫زه‬(y)‫ﮔﯿﺮی‬ ‫اﻧﺪازه‬ ‫ﻗﺎﺑﻞ‬ ‫ﻏﯿﺮ‬ ‫و‬(z)‫ﺷﻮﻧﺪ‬ ‫ﻣﯽ‬ ‫ﺗﻘﺴﯿﻢ‬. ‫ﺑﻮد‬ ‫ﺧﻮاﻫﺪ‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻣﻌﺎدﻻت‬: u D D w D D x C C y z uBwBAxx       +      +      =      ++= • 22 12 21 11 2 1 21 ‫اﻧﺪﯾﺲ‬ ‫ﺑﺮدارﻫﺎی‬sensors‫و‬known‫اﻧﺪازه‬ ‫ﻗﺎﺑﻞ‬ ‫ﺧﺮوﺟﯿﻬﺎ‬ ‫از‬ ‫ﮐﺪاﻣﯿﮏ‬ ‫ﮐﻪ‬ ‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﻣﺸﺨﺺ‬ ‫ﺗﺮﺗﯿﺐ‬ ‫ﺑﻪ‬‫ﻫﺴﺘﺘﻨﺪ‬ ‫ﮔﯿﺮی‬(y)‫و‬ ‫ﺗﺼﺎدﻓﯽ‬ ‫ﻏﯿﺮ‬ ‫ﻣﻘﺪار‬ ‫ورودﯾﻬﺎ‬ ‫از‬ ‫ﮐﺪاﻣﯿﮏ‬‫دارﻧﺪ‬(u).‫روﯾﺘﮕﺮ‬est‫ورودﯾﻬﺎی‬ ‫از‬u‫ﺧﺮوﺟﯿﻬﺎی‬ ‫و‬y‫ﺳﯿﺴﺘﻢ‬ ‫ﺣﺎﻟﺘﻬﺎی‬ ‫ﺗﺨﻤﯿﻦ‬ ‫و‬ ‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫اﺳﺘﻔﺎده‬. u D x I C x y uDxCyLuBxAx       +      =         −−++= • 0 )( 22 ^ 2 ^ ^ 22 ^ 22 ^^ ‫روﯾﺘﮕﺮ‬ ‫ﺑﻬﺮه‬ ‫ﻃﺮاﺣﯽ‬ ‫ﮐﻪ‬ ‫اﺳﺖ‬ ‫ذﮐﺮ‬ ‫ﺷﺎﯾﺎن‬(L)‫دﺳﺘﻮرات‬ ‫ﺑﺎ‬place،kalman‫ﯾﺎ‬acker‫اﺳﺖ‬ ‫اﻣﮑﺎﻧﭙﺬﯾﺮ‬.‫دﯾﮕﺮ‬ ‫ﺳﻮی‬ ‫از‬ ‫دﯾﻨﺎ‬ ‫ﮐﻪ‬ ‫اﺳﺖ‬ ‫ﻻزم‬ ‫ﺗﺨﻤﯿﻦ‬ ‫ﺻﺤﺖ‬ ‫ﺗﻀﻤﯿﻦ‬ ‫ﻣﻨﻈﻮر‬ ‫ﺑﻪ‬‫ﺑﺎﺷﻨﺪ‬ ‫ﺳﺮﯾﻌﺘﺮ‬ ‫اﺻﻠﯽ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫دﯾﻨﺎﻣﯿﮑﻬﺎی‬ ‫از‬ ‫روﯾﺘﮕﺮ‬ ‫ﻣﯿﮑﻬﺎی‬. •‫دﺳﺘﻮر‬‫ﻫﺎی‬‫ﻣﺮﺗﺒﻂ‬: ‫دﺳﺘﻮر‬reg‫رﮔﻮﻻﺗﻮر‬ ‫ﯾﮏ‬ ‫ﻣﻌﺎدﻻت‬‫را‬‫اراﺋﻪ‬ ‫روﯾﺘﮕﺮ‬ ‫ﺑﻬﺮه‬ ‫و‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﯿﺪﺑﮏ‬ ‫درﯾﺎﻓﺖ‬ ‫ﺑﺎ‬‫دﻫﺪ‬ ‫ﻣﯽ‬. 2-10-‫دﺳﺘﻮر‬exam: •‫ﻫﺪف‬:‫ﻣﺤﺎﺳﺒﻪ‬eX ‫ﺣﺎﻟ‬ ‫در‬‫ﺘ‬‫ﯽ‬‫ﮐﻪ‬X‫اﺳﺖ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﯾﮏ‬. •‫ﻧﮕﺎرش‬:Y=exam(X) •‫ﺗﻮﺿﯿﺤﺎت‬:‫ﻣﺤﺎﺳﺒﻪ‬ ‫در‬eX ‫ﮐﻪ‬ ‫ﻫﻨﮕﺎﻣﯽ‬X‫دارد‬ ‫وﺟﻮد‬ ‫ﻋﻤﺪه‬ ‫روش‬ ‫دو‬ ‫اﺳﺖ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﯾﮏ‬: ‫اﺳﺖ‬ ‫ﺗﯿﻠﻮر‬ ‫ﺳﺮی‬ ‫از‬ ‫اﺳﺘﻔﺎده‬ ‫اول‬ ‫روش‬: LL ++++++= !!3!2 32 K XXX XIe K X ‫روی‬ ‫ﺗﺸﺎﺑﻬﯽ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫اﻋﻤﺎل‬ ‫دوم‬ ‫روش‬X‫اﺳﺖ‬ ‫آن‬ ‫ﻗﻄﺮﺳﺎزی‬ ‫و‬. 111 −−− =→=→= PPeePDPXXPPD DX ‫ﺗﻮان‬ ‫ﻣﯽ‬ ‫زﯾﺮ‬ ‫دﺳﺘﻮرات‬ ‫ﺑﺎ‬ ‫ﺗﺮﺗﯿﺐ‬ ‫اﯾﻦ‬ ‫ﺑﻪ‬eX ‫ﮐﺮد‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫را‬. » [V,D]=eig(X); » exp_x=V*diag(exp(diag(D)))/V; ‫ﭼﻨﺎﻧﭽﻪ‬X‫ﻣﺤﺎﺳﺒﻪ‬ ‫ﺑﺮای‬ ‫ﺳﻮم‬ ‫روش‬ ‫از‬ ‫ﺑﺎﺷﺪ‬ ‫ﻧﺪاﺷﺘﻪ‬ ‫ﺗﮑﺮاری‬ ‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬eX ‫ﺷﻮد‬ ‫ﻣﯽ‬ ‫اﺳﺘﻔﺎده‬.‫ﻣﺤﺎﺳﺒﻪ‬ ‫ﺳﻮم‬ ‫روش‬eX ‫راه‬ ‫از‬ ‫ﺗﻘﺮﯾﺐ‬Pade‫اﺳﺖ‬.
  • 19. 19 •‫ﻣﺮﺗﺒﻂ‬ ‫دﺳﺘﻮرات‬: expm1:‫ﻣﺤﺎﺳﺒﻪ‬eX ‫ﺗﻘﺮﯾﺐ‬ ‫روش‬ ‫از‬Pade expm2:‫ﻣﺤﺎﺳﺒﻪ‬eX ‫روش‬ ‫از‬‫ﺗﯿﻠ‬ ‫ﺳﺮی‬‫ﻮر‬ expm3:‫ﻣﺤﺎﺳﺒﻪ‬eX ‫روش‬ ‫از‬‫وﯾﮋه‬ ‫ﺑﺮدارﻫﺎی‬ ‫و‬ ‫ﻣﻘﺎدﯾﺮ‬ logm:‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﻟﮕﺎرﯾﺘﻢ‬A‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫را‬. sqrtm:‫دﺳﺘﻮر‬X=sqrtm(A)‫ﻣﺎﺗﺮﯾﺲ‬X‫ﮐﻪ‬ ‫آورد‬ ‫ﻣﯽ‬ ‫ﺑﺪﺳﺖ‬ ‫ﭼﻨﺎن‬ ‫را‬X*X=A funm:‫ﻧﻤﺎﯾﺪ‬ ‫ﻣﯽ‬ ‫اﻋﻤﺎل‬ ‫را‬ ‫ﻣﺨﺘﻠﻒ‬ ‫ﺗﻮاﺑﻊ‬ ‫ﻣﺎﺗﺮﯾﺴﯽ‬ ‫ﻓﺮم‬. 2-11-‫دﺳﺘﻮر‬Gram: •‫ﻫﺪف‬:‫ﮔﺮاﻣﯿﺎﻧﻬﺎی‬ ‫ﻣﺤﺎﺳﺒﻪ‬‫ﭘﺬﯾﺮی‬ ‫روﯾﺖ‬ ‫و‬ ‫ﭘﺬﯾﺮی‬ ‫ﮐﻨﺘﺮل‬. •‫ﻧﮕﺎرش‬: Wc=gram(sys,’c’) Wo=gram(sys,’o’) •‫ﺗﻮﺿﯿﺤﺎت‬: ‫دﺳﺘﻮر‬gram‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫را‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﭘﺬﯾﺮی‬ ‫روﯾﺖ‬ ‫و‬ ‫ﭘﺬﯾﺮی‬ ‫ﮐﻨﺘﺮل‬ ‫ﮔﺮاﻣﯿﺎﻧﻬﺎی‬.‫ﮐﻨﺘﺮل‬ ‫ﺑﺮرﺳﯽ‬ ‫در‬ ‫ﮔﺮاﻣﯿﺎﻧﻬﺎ‬ ‫اﯾﻦ‬ ‫از‬ ‫اﺳﺘ‬ ‫ﻣﺪﻟﻬﺎ‬ ‫ﻣﺮﺗﺒﻪ‬ ‫ﮐﺎﻫﺶ‬ ‫در‬ ‫ﻧﯿﺰ‬ ‫و‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﭘﺬﯾﺮی‬ ‫روﯾﺖ‬ ‫و‬ ‫ﭘﺬﯾﺮی‬‫ﺷﻮد‬ ‫ﻣﯽ‬ ‫ﻔﺎده‬. ‫ﺑﺎﺷﺪ‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻓﻀﺎی‬ ‫ﻣﻌﺎدﻻت‬ ‫اﮔﺮ‬: DuCxy BuAxx += += • ‫ﺷﻮﻧﺪ‬ ‫ﻣﯽ‬ ‫ﺗﻌﺮﯾﻒ‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫ﭘﺬﯾﺮی‬ ‫روﯾﺖ‬ ‫و‬ ‫ﭘﺬﯾﺮی‬ ‫ﮐﻨﺘﺮل‬ ‫ﮔﺮاﻣﯿﺎﻧﻬﺎی‬: ∫ ∫ = = ∞ τ τ ττ ττ dCeCeW deBBeW ATA o ATA c T T . . 0 ‫داﺷﺖ‬ ‫ﺧﻮاﻫﯿﻢ‬ ‫زﻣﺎن‬ ‫ﮔﺴﺴﺘﻪ‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬ ‫ﺑﺮای‬ ‫و‬: ∑ ∑ = = ∞ = kTKT o k KTTk c CACAW ABBAW )( )( 0 ‫ﻣﻌ‬ ‫ﻣﺜﺒﺖ‬ ‫ﭘﺬﯾﺮی‬ ‫ﮐﻨﺘﺮل‬ ‫ﮔﺮاﻣﯿﺎن‬‫اﮔﺮ‬ ‫ﺗﻨﻬﺎ‬ ‫و‬ ‫اﮔﺮ‬ ‫اﺳﺖ‬ ‫ﯿﻦ‬(A,B)‫ﻣﻌﯿﻦ‬ ‫ﻣﺜﺒﺖ‬ ‫ﻧﯿﺰ‬ ‫ﭘﺬﯾﺮی‬ ‫روﯾﺖ‬ ‫ﮔﺮاﻣﯿﺎن‬ ،‫ﺑﺎﺷﺪ‬ ‫ﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫اﮔﺮ‬ ‫ﺗﻨﻬﺎ‬ ‫و‬ ‫اﮔﺮ‬ ‫اﺳﺖ‬(C,A)‫ﺑﺎﺷﺪ‬ ‫ﭘﺬﯾﺮ‬ ‫روﯾﺖ‬.‫دﺳﺘﻮر‬gram‫اﺳﺖ‬ ‫اﻋﻤﺎل‬ ‫ﻗﺎﺑﻞ‬ ‫ﻧﯿﺰ‬ ‫زﻣﺎن‬ ‫ﮔﺴﺴﺘﻪ‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬ ‫ﺑﻪ‬. ‫ﮐﺮد‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫ﺗﻮان‬ ‫ﻣﯽ‬ ‫زﯾﺮ‬ ‫ﻟﯿﺎﭘﺎﻧﻮف‬ ‫ﻣﻌﺎدﻟﻪ‬ ‫ﺣﻞ‬ ‫از‬ ‫را‬ ‫ﭘﺬﯾﺮی‬ ‫ﮐﻨﺘﺮل‬ ‫ﮔﺮاﻣﯿﺎن‬: :‫ﺳﯿﺴﺘﻤﻬﺎی‬ ‫در‬‫ﭘﯿﻮﺳﺘﻪ‬ 0=++ TT cc BBAWAW :‫ﮔﺴﺴﺘﻪ‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬ ‫در‬ 0=+− T c T c BBWAAW ‫اﺳﺖ‬ ‫ﺻﺎدق‬ ‫زﯾﺮ‬ ‫ﻟﯿﺎﭘﺎﻧﻮف‬ ‫ﻣﻌﺎدﻻت‬ ‫در‬ ‫ﻧﯿﺰ‬ ‫ﭘﺬﯾﺮی‬ ‫روﯾﺖ‬ ‫ﮔﺮاﻣﯿﺎن‬: :‫ﭘﯿﻮﺳﺘﻪ‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬ ‫در‬ 0=++ CCAWWA T oo T :‫ﮔﺴﺴﺘﻪ‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬ ‫در‬ 0=+− CCWAWA T oo T ‫دﺳﺘﻮرات‬ ‫از‬ ‫ﺑﻨﺎﺑﺮاﯾﻦ‬lyap‫و‬dlyap‫ﻧ‬‫ﻣﯽ‬ ‫ﯿﺰ‬‫ﮐﺮد‬ ‫اﺳﺘﻔﺎده‬ ‫ﮔﺮاﻣﯿﺎﻧﻬﺎ‬ ‫ﻣﺤﺎﺳﺒﮥ‬ ‫ﺑﺮای‬ ‫ﺗﻮان‬.
  • 20. 20 •‫ﻣﺤﺪودﯾﺘﻬﺎ‬:‫ﻣﺎﺗﺮﯾﺲ‬A‫ﺑﺎﺷﺪ‬ ‫ﭘﺎﯾﺪار‬ ‫ﺑﺎﯾﺪ‬. •‫ﻣﺮﺗﺒﻂ‬ ‫دﺳﺘﻮرات‬: ctrb:‫ﭘﺬﯾﺮی‬ ‫ﮐﻨﺘﺮل‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ obsv:‫ﭘﺬﯾﺮی‬ ‫روﯾﺖ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ balreal:‫ﻫﺎ‬ ‫ﮔﺮاﻣﯿﺎن‬ ‫از‬ ‫اﺳﺘﻔﺎده‬ ‫ﺑﺎ‬ ‫ﺷﺪه‬ ‫ﻣﺘﻌﺎدل‬ ‫ﺗﺤﻘﻖ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ lyap,dlyap:‫ﻟﯿﺎﭘﺎﻧﻮف‬ ‫ﻣﻌﺎدﻟﻪ‬ ‫ﺣﻞ‬‫زﻣﺎن‬ ‫ﮔﺴﺴﺘﻪ‬ ‫و‬ ‫ﭘﯿﻮﺳﺘﻪ‬ ‫ﺣﺎﻟﺘﻬﺎی‬ ‫در‬. 2-12-‫دﺳﺘﻮر‬initial: •‫ﻫﺪف‬:‫اوﻟﯿﻪ‬ ‫ﺷﺮاﯾﻂ‬ ‫ﺑﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﭘﺎﺳﺦ‬ ‫ﻣﺤﺎﺳﺒﻪ‬)‫ﺻﻔﺮ‬ ‫ورودی‬ ‫ﭘﺎﺳﺦ‬( •‫ﻧﮕﺎرش‬: initial(sys,x0) initial(sys,x0,t) initial(sys1,sys2,...,sysN,x0) initial(sys1,sys2,...,sysN,x0,t) initial(sys1,’PlotStyle1’,...,sysN,’PlotStyleN’,x0) [y,x,t]=initial(sys,x0) •‫ﺗﻮﺿﯿﺤﺎت‬:‫دﺳﺘﻮر‬initial‫اوﻟﯿﻪ‬ ‫ﺷﺮاﯾﻂ‬ ‫ازای‬ ‫ﺑﻪ‬ ‫ﺷﻮد‬ ‫ﻧﻤﯽ‬ ‫اﻋﻤﺎل‬ ‫آن‬ ‫ﺑﻪ‬ ‫ﺧﺎرﺟﯽ‬ ‫ورودی‬ ‫ﻫﯿﭻ‬ ‫ﮐﻪ‬ ‫را‬ ‫ﺳﯿﺴﺘﻤﯽ‬ ‫ﭘﺎﺳﺦ‬ ‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺣﺎﻟﺘﻬﺎی‬ ‫در‬.‫اﺳﺖ‬ ‫اﻋﻤﺎل‬ ‫ﻗﺎﺑﻞ‬ ‫زﻣﺎن‬ ‫ﮔﺴﺴﺘﻪ‬ ‫و‬ ‫ﭘﯿﻮﺳﺘﻪ‬ ‫ﻣﺪﻟﻬﺎی‬ ‫ﺑﻪ‬ ‫ﺗﺎﺑﻊ‬ ‫اﯾﻦ‬.‫ﺣﺎﻟﺖ‬ ‫در‬ ‫ﺟﺰ‬ ‫ﺑﻪ‬ [y,t,x]=initial(sys,xo)‫دﺳﺘﻮر‬ ‫اﺟﺮای‬ ‫ﻣﻮارد‬ ‫ﺳﺎﯾﺮ‬ ‫در‬initial‫ﺳﯿﺴﺘﻢ‬ ‫اوﻟﯿﻪ‬ ‫ﺷﺮاﯾﻂ‬ ‫ﭘﺎﺳﺨﻬﺎی‬ ‫رﺳﻢ‬ ‫ﺑﺎ‬ ‫اﺳﺖ‬ ‫ﻫﻤﺮاه‬. ‫دﺳﺘﻮر‬initial(sys,x0)‫ﺳﯿﺴﺘﻢ‬ ‫ﭘﺎﺳﺦ‬sys)‫اﺳﺖ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻓﺮم‬ ‫ﺑﻪ‬ ‫آن‬ ‫ﻣﻌﺎدﻻت‬ ‫ﮐﻪ‬(‫اوﻟﯿﻪ‬ ‫ﺷﺮاﯾﻂ‬ ‫ﺑﻪ‬ ‫را‬x0 ‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫رﺳﻢ‬.‫ﺳﯿﺴﺘﻢ‬sys،‫ﮔﺴﺴﺘﻪ‬ ‫ﯾﺎ‬ ‫ﭘﯿﻮﺳﺘﻪ‬ ‫ﺗﻮاﻧﺪ‬ ‫ﻣﯽ‬SISO‫ﯾﺎ‬MIMO،‫ورودی‬ ‫ﺑﺎ‬‫ﺑﺎﺷﺪ‬ ‫ورودی‬ ‫ﺑﺪون‬ ‫ﯾﺎ‬.‫زﻣﺎﻧﯽ‬ ‫ﺑﺎزه‬ ‫ﻋﻤﻠﮑﺮد‬ ‫ﮐﻪ‬ ‫ﺷﻮد‬ ‫ﻣﯽ‬ ‫ﺗﻌﯿﯿﻦ‬ ‫ﭼﻨﺎن‬ ‫ﺧﻮدﮐﺎر‬ ‫ﻃﻮر‬ ‫ﺑﻪ‬ ‫ﺳﺎزی‬ ‫ﺷﺒﯿﻪ‬ ‫ﻣﻨﺤﻨﯿﻬﺎی‬ ‫ﻧﻤﺎﯾﺶ‬‫ﭘﺎ‬ً‫ﻼ‬‫ﮐﺎﻣ‬ ‫ﮔﺬرا‬ ‫ﺣﺎﻟﺖ‬ ‫در‬ ‫را‬ ‫ﺳﺨﻬﺎ‬‫ﻧﺸﺎن‬ ‫دﻫﺪ‬. ‫دﺳﺘﻮر‬ ‫ﻧﺘﯿﺠﻪ‬initial(sys,xo,t)‫ﺑﺮای‬ ‫ﻣﻄﻠﻮب‬ ‫زﻣﺎﻧﯽ‬ ‫ﺑﺎزه‬ ‫اﯾﻨﺤﺎﻟﺖ‬ ‫در‬ ‫ﮐﻪ‬ ‫ﺗﻔﺎوت‬ ‫اﯾﻦ‬ ‫ﺑﺎ‬ ‫اﺳﺖ‬ ‫ﻗﺒﻞ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻣﺎﻧﻨﺪ‬ ‫ﺳﯿﺴ‬ ‫ﺷﺮاﯾﻂ‬ ‫ﻣﺤﺎﺳﺒﻪ‬‫اﺳﺖ‬ ‫ﺷﺪه‬ ‫ﻣﺸﺨﺺ‬ ‫ﻧﯿﺰ‬ ‫ﺘﻢ‬.‫ﻣﯽ‬‫اﻧﺘﺨﺎب‬ ‫ﺑﺎ‬ ‫ﺗﻮان‬t=Tfinal‫ﯾﺎ‬ ‫ﮐﺮد‬ ‫ﻣﺸﺨﺺ‬ ‫را‬ ‫ﺳﺎزی‬ ‫ﺷﺒﯿﻪ‬ ‫اﻧﺘﻬﺎی‬ ‫ﻟﺤﻈﻪ‬t ‫ﻧﻤﻮد‬ ‫ﺗﻌﺮﯾﻒ‬ ‫زﯾﺮ‬ ‫ﺑﺮدار‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫را‬: t=0:dt:tfinal :‫ﻣﺜﺎل‬ t=0:0.1:10; ‫ﺷﺒﯿﻪ‬ ‫زﻣﺎﻧﯽ‬ ‫ﺑﺎزه‬ ‫ﺑﺮ‬ ‫ﻋﻼوه‬ ‫اﯾﻨﺤﺎﻟﺖ‬ ‫در‬‫ﺳﺎزی‬)‫ﺻﻔﺮ‬‫ﺗﺎ‬Tfinal(‫اﺳﺖ‬ ‫ﺷﺪه‬ ‫ﻣﺸﺨﺺ‬ ‫ﻧﯿﺰ‬ ‫ﺳﺎزی‬ ‫ﺷﺒﯿﻪ‬ ‫ﮔﺎﻣﻬﺎی‬ ،.‫ﺳﯿﺴ‬ ‫در‬‫ﺘﻤﻬﺎی‬ ، ‫ﮔﺴﺴﺘﻪ‬dt‫ﺑﺎﺷﺪ‬ ‫ﻫﻤﺎﻫﻨﮓ‬ ‫ﺑﺮداری‬ ‫ﻧﻤﻮﻧﻪ‬ ‫زﻣﺎن‬ ‫ﺑﺎ‬ ‫ﺑﺎﯾﺪ‬.‫ﭘﯿﻮﺳﺘﻪ‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬ ‫در‬dt‫رﻓﺘﺎر‬ ‫ﺗﺎ‬ ‫ﺷﻮد‬ ‫اﺧﺘﯿﺎر‬ ‫ﮐﻮﭼﮏ‬ ‫آﻧﻘﺪر‬ ‫ﺑﺎﯾﺪ‬ ‫ﮔﺮدد‬ ‫ﻣﺸﺨﺺ‬ ‫ﺧﻮﺑﯽ‬ ‫ﺑﻪ‬ ‫ﮔﺬرا‬ ‫ﺣﺎﻟﺖ‬. ‫ﺳﯿﺴﺘﻢ‬ ‫ﭼﻨﺪ‬ ‫ﭘﺎﺳﺨﻬﺎی‬ ‫ﻫﻤﺰﻣﺎن‬ ‫رﺳﻢ‬ ‫ﺑﺮای‬LTI‫رود‬ ‫ﻣﯽ‬ ‫ﮐﺎر‬ ‫ﺑﻪ‬ ‫زﯾﺮ‬ ‫دﺳﺘﻮرات‬ ، ‫اوﻟﯿﻪ‬ ‫ﺷﺮاﯾﻂ‬ ‫ﯾﮏ‬ ‫ﺑﻪ‬: initial(sys1,sys2,...,sysN,x0) initial(sys1,sys2,...,sysN,x0,t) ‫دﺳﺘﻮرات‬ ‫اﺟﺮای‬: [y,t,x]=initial(sys,x0) [y,t,x]=initial(sys,x0,t) ‫ﺷﺒﯿﻪ‬ ‫ﺧﺮوﺟﯽ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﺗﻮﻟﯿﺪ‬ ‫ﺑﻪ‬ ‫ﻣﻨﺠﺮ‬(y)،‫ﺳﺎزی‬ ‫ﺷﺒﯿﻪ‬ ‫زﻣﺎﻧﻬﺎی‬ ‫ﺑﺮدار‬(t)‫ﺳﯿﺴﺘﻢ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻣﺴﯿﺮﻫﺎی‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫و‬(x)‫ﻣﯽ‬‫ﺷﻮد‬. ‫اﯾﻨﺤﺎﻟﺖ‬ ‫در‬‫ﺷﻮد‬ ‫ﻧﻤﯽ‬ ‫رﺳﻢ‬ ‫ﻣﻨﺤﻨﯽ‬ ‫ﻫﯿﭻ‬.‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﺳﻄﺮﻫﺎی‬ ‫ﺗﻌﺪاد‬y‫ﺳﺎزی‬ ‫ﺷﺒﯿﻪ‬ ‫زﻣﺎﻧﻬﺎی‬ ‫ﺗﻌﺪاد‬ ‫ﺑﻪ‬)‫اﺑﻌﺎد‬t(‫ﺗﻌﺪاد‬ ‫و‬
  • 21. 21 ‫اﺳﺖ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺧﺮوﺟﯿﻬﺎی‬ ‫ﺗﻌﺪاد‬ ‫ﺑﻪ‬ ‫آن‬ ‫ﺳﺘﻮﻧﻬﺎی‬.‫ﻣﺎﺗﺮﯾﺲ‬x‫ﺗﻌﺪاد‬ ‫ﺑﻪ‬ ‫ﻧﯿﺰ‬length(t)‫ﺳﯿﺴﺘﻢ‬ ‫ﺣﺎﻟﺘﻬﺎی‬ ‫ﺗﻌﺪاد‬ ‫ﺑﻪ‬ ‫و‬ ‫ﺳﻄﺮ‬ ‫دارد‬ ‫ﺳﺘﻮن‬. •‫ﻣﺜﺎل‬:‫ﻧﻈ‬ ‫در‬ ‫زﯾﺮ‬ ‫ﻓﺮم‬ ‫ﺑﻪ‬ ‫را‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻣﻌﺎدﻻت‬‫ﮔﯿﺮﯾﻢ‬ ‫ﻣﯽ‬ ‫ﺮ‬: [ ]       =             −− =         • • 2 1 2 1 2 1 4493.69691.1 07814.0 7814.05572.0 x x y x x x x ‫اوﻟﯿﻪ‬ ‫ﺷﺮاﯾﻂ‬ ‫ﺑﺎ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﭘﺎﺳﺦ‬      = 0 1 0x‫اﺳﺖ‬ ‫ﺣﺼﻮل‬ ‫ﻗﺎﺑﻞ‬ ‫زﯾﺮ‬ ‫ﺑﺮﻧﺎﻣﮥ‬ ‫ﺗﻮﺳﻂ‬: A = [-0.5572 -0.7814;0.7814 0]; C = [1.9691 6.4493]; x0 = [1 ; 0.5]; t1=0:0.1:10; t2=0:1:10; sys = ss(A,[],C,[]); subplot(2,2,1);initial(sys,x0); subplot(2,2,2);initial(sys,x0,t1); subplot(2,2,3);initial(sys,x0,6.5); subplot(2,2,4);initial(sys,x0,t2); •‫ﻣﺮﺗﺒﻂ‬ ‫دﺳﺘﻮرات‬: impulse:‫ﺳﯿﺴﺘﻢ‬ ‫ﺿﺮﺑﻪ‬ ‫ﭘﺎﺳﺦ‬ ‫رﺳﻢ‬ lsim:‫دﻟﺨﻮاه‬ ‫ورودی‬ ‫ﻫﺮ‬ ‫ﺑﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﭘﺎﺳﺦ‬ ‫رﺳﻢ‬ step:‫ﺳﯿﺴﺘﻢ‬ ‫ﭘﻠﻪ‬ ‫ﭘﺎﺳﺦ‬ ‫رﺳﻢ‬ 2-13-‫دﺳﺘﻮر‬kalman: •‫ﻫﺪف‬:‫روﯾﺘﮕﺮ‬ ‫ﻃﺮاﺣﯽ‬)‫ﻓﯿﻠﺘﺮ‬(‫زﻣﺎن‬ ‫ﮔﺴﺴﺘﻪ‬ ‫و‬ ‫ﭘﯿﻮﺳﺘﻪ‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬ ‫ﺑﺮای‬ ‫ﮐﺎﻟﻤﻦ‬ •‫ﻧﮕﺎرش‬: [kest,l,p]=kalman(sys,Qn,Rn,Nn) [kest,l,p,m,z]=kalman(sys,Qn,Rn,Nn) [kest,l,p]=kalman(sys,Qn,Rn,Nn,Sensors,Known) )‫آﺧﺮ‬ ‫ﻣﻮرد‬‫زﻣﺎن‬ ‫ﮔﺴﺴﺘﻪ‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬ ‫ﺑﺮای‬ ‫ﻓﻘﻂ‬‫اﺳﺖ‬ ‫ﺻﺎدق‬(.
  • 22. 22 •‫ﺗﻮﺿﯿﺤﺎت‬: ‫دﺳﺘﻮر‬kalman‫را‬ ‫ﮐﺎﻟﻤﻦ‬ ‫روﯾﺘﮕﺮ‬ ،‫ﮔﯿﺮی‬ ‫اﻧﺪازه‬ ‫ﻧﻮﯾﺰ‬ ‫و‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻧﻮﯾﺰ‬ ‫ﮐﻮارﯾﺎﻧﺲ‬ ‫ﻧﯿﺰ‬ ‫و‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬ ‫درﯾﺎﻓﺖ‬ ‫ﺑﺎ‬ ‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﻃﺮاﺣﯽ‬. ‫ﺳﯿﺴﺘﻢ‬‫ﺷﻮد‬ ‫ﻣﯽ‬ ‫ﮔﺮﻓﺘﻪ‬ ‫ﻧﻈﺮ‬ ‫در‬ ‫زﯾﺮ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻣﻌﺎدﻻت‬ ‫ﺑﺎ‬: vHwDuCxy GwBuAxx v +++= ++= • ‫آن‬ ‫در‬ ‫ﮐﻪ‬ u ‫و‬ ‫ﻣﻌﯿﻦ‬ ‫ورودی‬ w ‫و‬ v ‫ﻧﻮﯾﺰﻫﺎی‬ ‫ﺗﺮﺗﯿﺐ‬ ‫ﺑﻪ‬‫ﺳ‬‫اﻧﺪازه‬ ‫ﻔﯿﺪ‬‫دارﯾﻢ‬ ‫و‬ ‫ﻫﺴﺘﻨﺪ‬ ‫ﻓﺮاﯾﻨﺪ‬ ‫و‬ ‫ﮔﯿﺮی‬: NwvERvvEQwwE vEwE TTT === == )(,)(,)( 0)()( ‫ﺗﺨﻤﯿﻦ‬ ‫ﯾﺎﻓﺘﻦ‬ ‫ﻫﺪف‬ ^ x‫ﮔﺮدد‬ ‫ﮐﻤﯿﻨﻪ‬ ‫ﻣﺎﻧﺪﮔﺎر‬ ‫ﺣﺎﻟﺖ‬ ‫ﺧﻄﺎی‬ ‫ﮐﻮارﯾﺎﻧﺲ‬ ‫ﭼﻨﺎﻧﮑﻪ‬ ‫اﺳﺖ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺣﺎﻟﺘﻬﺎی‬ ‫از‬: )}}{({lim ^^ T t xxxxP −−= ∞→ ‫ﺑﻬﯿﻨﻪ‬ ‫ﭘﺎﺳﺦ‬،‫ﺑﺎﺷﺪ‬ ‫ﻣﯽ‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫آن‬ ‫ﻣﻌﺎدﻻت‬ ‫ﮐﻪ‬ ‫اﺳﺖ‬ ‫ﮐﺎﻟﻤﻦ‬ ‫ﻓﯿﻠﺘﺮ‬: u D x I C x y DuxCyLBuxAx v       +      =         −−++= • 0 )( ^ ^ ^ ^^^ ‫آن‬ ‫در‬ ‫ﮐﻪ‬L‫ﻣﯽ‬ ‫ﺣﺎﺻﻞ‬ ‫ﺟﺒﺮی‬ ‫رﯾﮑﺎﺗﯽ‬ ‫ﻣﻌﺎدﻟﻪ‬ ‫ﯾﮏ‬ ‫ﺣﻞ‬ ‫از‬ ‫و‬ ‫ﺑﻮده‬ ‫ﻓﯿﻠﺘﺮ‬ ‫ﺑﻬﺮه‬‫ﺷﻮد‬. ‫دﺳﺘﻮر‬[kest,l,p]=kalman(sys,Qn,Rn,Nn)‫ﻣ‬‫ﮐﺎﻟﻤﻦ‬ ‫ﻓﯿﻠﺘﺮ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﺪل‬(kest)‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻧﺘﯿﺠﻪ‬ ‫را‬. Qn،Rn‫و‬Nn‫ﺑﺎ‬ ‫ﺑﺎﻻ‬ ‫رواﺑﻂ‬ ‫در‬ ‫ﮐﻪ‬ ‫ﻫﺴﺘﻨﺪ‬ ‫ﻧﻮﯾﺰ‬ ‫ﮐﻮارﯾﺎﻧﺲ‬Q،R‫و‬N‫اﻧﺪ‬ ‫ﺷﺪه‬ ‫ﻣﺸﺨﺺ‬.sys‫ﺑﺎﯾﺪ‬ ‫ﮐﻪ‬ ‫اﺳﺖ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻣﺪل‬ ‫ﻧﯿﺰ‬ ‫ﺷﻮد‬ ‫وارد‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬: A,[B G], C, [D H] ‫ﺣﺎﺻﻞ‬ ‫روﯾﺘﮕﺮ‬(kest)‫ورودی‬ ‫دارای‬‫ﻫ‬‫ﺎی‬[u;yv]‫ﺧﺮوﺟﯿﻬﺎی‬ ‫و‬    ^^ ; xy‫ﻣﯽ‬‫ﺑﺎﺷﺪ‬.‫روﯾﺘﮕﺮ‬ ‫ﻣﻌﺎدﻟﻪ‬ ‫ﺑﺮ‬ ‫ﻋﻼوه‬ ‫دﺳﺘﻮر‬ ‫اﯾﻦ‬(kest) ‫روﯾﺘﮕﺮ‬ ‫ﺑﻬﺮه‬ ‫ﻣﻘﺪار‬ ،L‫ﮐﻮارﯾﺎ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﻧﯿﺰ‬ ‫و‬‫ﻣﺎﻧﺪﮔﺎر‬ ‫ﺧﻄﺎی‬ ‫ﻧﺲ‬P‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫اراﺋﻪ‬ ‫ﻧﯿﺰ‬ ‫را‬. •‫ﻫﺎ‬ ‫ﻣﺤﺪودﯾﺖ‬: ‫ﮐﻪ‬ ‫ﻓﺮض‬ ‫اﯾﻦ‬ ‫ﺑﺎ‬: )( NQHGN HQHHNHNRR GQGQ T TTT T += +++= = ‫ﮐﻨﻨﺪ‬ ‫ارﺿﺎ‬ ‫را‬ ‫زﯾﺮ‬ ‫ﺷﺮاﯾﻂ‬ ‫ﺑﺎﯾﺪ‬ ‫ﻧﻮﯾﺰ‬ ‫و‬ ‫ﺳﯿﺴﺘﻢ‬: 1.(C,A)‫آﺷﮑﺎری‬‫ﺑﺎﺷﺪ‬ ‫ﭘﺬﯾﺮ‬(detectable) 2.R>0‫و‬0 1 ≥− − T NRNQ 3.),( 11 T NRNQCRNA −− −−‫ﻧﺎﭘﺬﯾﺮ‬ ‫ﮐﻨﺘﺮل‬ ‫ﺣﺎﻟﺖ‬ ‫ﻫﯿﭻ‬‫ﺑﺎﺷﻨﺪ‬ ‫ﻧﺪاﺷﺘﻪ‬ ‫ﻣﻮﻫﻮﻣﯽ‬ ‫ﻣﺤﻮر‬ ‫روی‬ ‫ی‬.
  • 23. 23 •‫ﻣﺮﺗﺒﻂ‬ ‫دﺳﺘﻮرات‬: care:‫ﭘﯿﻮﺳﺘﻪ‬ ‫ﺟﺒﺮی‬ ‫رﯾﮑﺎﺗﯽ‬ ‫ﻣﻌﺎدﻟﻪ‬ ‫ﺣﻞ‬ estim:‫روﯾﺘﮕﺮ‬ ‫ﺑﻬﺮه‬ ‫و‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻣﻌﺎدﻻت‬ ‫روی‬ ‫از‬ ‫روﯾﺘﮕﺮ‬ ‫ﻣﻌﺎدﻻت‬ ‫ﺗﻬﯿﻪ‬ lqr:‫ﺣﺎﻟﺖ‬ ‫ﺑﯿﺪﺑﮏ‬ ‫رﮔﻮﻻﺗﻮر‬ ‫ﯾﮏ‬ ‫ﻃﺮاﺣﯽ‬LQ 2-14-‫دﺳﺘﻮر‬Lyap: •‫ﻫﺪف‬:‫ﭘﯿﻮﺳﺘﻪ‬ ‫ﻟﯿﺎﭘﺎﻧﻮف‬ ‫ﻣﻌﺎدﻟﻪ‬ ‫ﺣﻞ‬–‫زﻣﺎن‬ •‫ﻧﮕﺎرش‬: X=lyap(A,Q) X=lyap(A,B,C) •‫ﺗﻮﺿﯿﺤﺎت‬:‫دﺳﺘﻮر‬X=Lyap(A,Q)‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﺣﻞ‬ ‫را‬ ‫زﯾﺮ‬ ‫ﻟﯿﺎﭘﺎﻧﻮف‬ ‫ﻣﻌﺎدﻟﻪ‬: AX+XAT +Q=0 ‫آن‬ ‫در‬ ‫ﮐﻪ‬A‫و‬Q‫ﻫﺴﺘﻨﺪ‬ ‫ﻣﺮﺑﻌﯽ‬ ‫ﻣﺎﺗﺮﯾﺴﻬﺎی‬.‫ﻣﺎﺗﺮﯾﺲ‬X‫اﮔﺮ‬ ‫اﺳﺖ‬ ‫ﻣﺘﻘﺎرن‬Q‫ﺑﺎﺷﺪ‬ ‫ﻣﺘﻘﺎرن‬. ‫دﺳﺘﻮر‬X=lyap(A,B,C)‫ﯾ‬ ‫ﺗﻌﻤﯿﻢ‬ ‫ﻟﯿﺎﭘﺎﻧﻮف‬ ‫ﻣﻌﺎدﻟﻪ‬‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﺣﻞ‬ ‫را‬ ‫ﺎﻓﺘﻪ‬. AX+XB+C=0 ‫آن‬ ‫در‬ ‫ﮐﻪ‬A‫و‬B‫و‬C‫ﻟﺰوﻣﺎ‬"‫ﻧﯿﺴﺘﻨﺪ‬ ‫ﻣﺮﺑﻌﯽ‬‫اﺳﺖ‬ ‫ﺳﺎزﮔﺎر‬ ‫آﻧﻬﺎ‬ ‫اﺑﻌﺎد‬ ‫وﻟﯽ‬. •‫ﻫﺎ‬ ‫ﻣﺤﺪودﯾﺖ‬: ‫اﮔﺮ‬α1،α2،...‫و‬αn‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬A‫و‬β1،β2،...‫و‬βn‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬B‫ﭘﯿﻮﺳﺘﻪ‬ ‫ﻟﯿﺎﭘﺎﻧﻮف‬ ‫ﻣﻌﺎدﻟﻪ‬ ‫آﻧﮕﺎه‬ ،‫ﺑﺎﺷﻨﺪ‬‫ﺑﻔﺮد‬ ‫ﻣﻨﺤﺼﺮ‬ ‫ﭘﺎﺳﺦ‬ ‫دﻟﺨﻮاه‬ ‫زوج‬ ‫ﻫﺮ‬ ‫ﺑﺮای‬ ‫اﮔﺮ‬ ‫دارد‬(i,j)‫ﺑﺎﺷﯿﻢ‬ ‫داﺷﺘﻪ‬: 0≠+ ji βα ‫دﺳﺘﻮر‬ ‫ﻧﺒﺎﺷﺪ‬ ‫ﺑﺮﻗﺮار‬ ‫ﺷﺮاﯾﻂ‬ ‫اﯾﻦ‬ ‫ﭼﻨﺎﻧﭽﻪ‬lyap‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﺧﻄﺎ‬ ‫ﭘﯿﻐﺎم‬ ‫ﺗﻮﻟﯿﺪ‬: Solution does not exits or is not uniqe •‫ﻣﺮﺗﺒﻂ‬ ‫دﺳﺘﻮرات‬: ‫دﺳﺘﻮر‬dlyap‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﺣﻞ‬ ‫را‬ ‫ﮔﺴﺴﺘﻪ‬ ‫ﻟﯿﺎﭘﺎﻧﻮف‬ ‫ﻣﻌﺎدﻟﻪ‬. 2-15-‫دﺳﺘﻮر‬null: •‫ﻫﺪف‬:‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﯾﮏ‬ ‫ﺗﻬﯽ‬ ‫ﻓﻀﺎی‬ ‫ﺗﻌﯿﯿﻦ‬ •‫ﻧﮕﺎرش‬:B=null(A) •‫ﺗﻮﺿﯿﺤﺎت‬:‫دﺳﺘﻮر‬B=null(A)‫ﻣﺘﻌﺎﻣﺪ‬ ‫ﭘﺎﯾﻪ‬ ‫ﯾﮏ‬‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﺗﻬﯽ‬ ‫ﻓﻀﺎی‬ ‫ﺑﺮای‬ ‫ﯾﮑﻪ‬A‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫اراﺋﻪ‬. ‫ﮐﻪ‬ ‫اﺳﺖ‬ ‫واﺿﺢ‬:IBBT =‫ﺳﺘﻮﻧﻬﺎی‬ ‫ﺗﻌﺪاد‬ ‫و‬B،‫ﺗﻬﯽ‬ ‫ﻓﻀﺎی‬ ‫اﺑﻌﺎد‬1 A‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫را‬. » A=[1 2 3;1 2 3;1 2 3] A = 1 2 3 1 2 3 1 2 3 » null(A) ans = 1 Nullity
  • 24. 24 -0.1690 -0.9487 0.8452 0 -0.5071 0.3162 » null(A,'r') ans = -2 -3 1 0 0 1 2-16-‫دﺳﺘﻮر‬obsv: •‫ﻫﺪف‬:‫ﭘﺬﯾﺮی‬ ‫روﯾﺖ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ •‫ﻧﮕﺎرش‬: Ob=obsv(A,C) Ob=obsv(sys) •‫ﺗﻮﺿﯿﺤﺎت‬:‫دﺳﺘﻮر‬obsv‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫را‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻧﻤﺎﯾﺶ‬ ‫ﺑﺎ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﯾﮏ‬ ‫ﭘﺬﯾﺮی‬ ‫روﯾﺖ‬ ‫ﻣﺎﺗﺮﯾﺲ‬.‫اﮔﺮ‬A‫ﯾﮏ‬ ‫ﻣﺎﺗﺮﯾﺲ‬n*n‫و‬C‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﯾﮏ‬p*n‫دﺳﺘﻮر‬ ،‫ﺑﺎﺷﺪ‬obsv(A,C)‫داد‬ ‫ﺧﻮاﻫﺪ‬ ‫ﻧﺘﯿﺠﻪ‬ ‫را‬ ‫زﯾﺮ‬ ‫ﭘﺬﯾﺮی‬ ‫روﯾﺖ‬ ‫ﻣﺎﺗﺮﯾﺲ‬: [ ]Tn CACACACOb 12 − = L ‫دﺳﺘﻮر‬ ‫ﺑﺎ‬ ‫ﮐﻪ‬ ‫اﺳﺖ‬ ‫واﺿﺢ‬rank[obsv(A,C)]‫روﯾﺖ‬ ‫ﺗﻮان‬ ‫ﻣﯽ‬‫ﮐﺮد‬ ‫ﺑﺮرﺳﯽ‬ ‫را‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﮐﺎﻣﻞ‬ ‫ﭘﺬﯾﺮی‬. ‫اﮔﺮ‬sys‫دﺳﺘﻮر‬ ، ‫ﺑﺎﺷﺪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﯾﮏ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬obsv(sys)‫ﺧﻮاﻫﺪ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫را‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﭘﺬﯾﺮی‬ ‫روﯾﺖ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﻧﯿﺰ‬ ‫ﮐﺮد‬. ‫اﺳﺖ‬ ‫ﻣﻌﺎدل‬ ‫زﯾﺮ‬ ‫دﺳﺘﻮر‬ ‫ﺑﺎ‬ ‫دﺳﺘﻮر‬ ‫اﯾﻦ‬: Ob=obsv(sys.a,sys.b) •‫ﻣﺜﺎل‬:‫اﺳﺖ‬ ‫ﻣﻔﺮوض‬ ‫زﯾﺮ‬ ‫ﺳﯿﺴﺘﻢ‬: DuCxy BuAxx += += • ‫آن‬ ‫در‬ ‫ﮐﻪ‬:       =      − = 10 01 , 24 11 BA ‫اﺳﺖ‬ ‫ﮐﺎﻣﻞ‬ ‫ﭘﺬﯾﺮ‬ ‫روﯾﺖ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫اﯾﻦ‬ ‫ﮐﻪ‬ ‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻧﺸﺎن‬ ‫زﯾﺮ‬ ‫ﺑﺮﻧﺎﻣﻪ‬ ‫ﺗﮑﻪ‬. » A=[1 1;4 -2]; » B=eye(2); » C=[1 0]; » D=0; » rank(obsv(A,C)) ans = 2
  • 25. 25 •‫ﻣﺮﺗﺒﻂ‬ ‫دﺳﺘﻮرﻫﺎی‬: obsvf:‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﺟﺪا‬ ‫ﻫﻢ‬ ‫از‬ ‫را‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻧﺎﭘﺬﯾﺮ‬ ‫روﯾﺖ‬ ‫و‬ ‫ﭘﺬﯾﺮ‬ ‫روﯾﺖ‬ ‫ﺣﺎﻟﺘﻬﺎی‬. 2-17-‫دﺳﺘﻮر‬obsvf: •‫ﻫﺪف‬:‫ﺳﯿﺴﺘﻢ‬ ‫ﭘﺬﯾﺮ‬ ‫روﯾﺖ‬ ‫و‬ ‫ﻧﺎﭘﺬﯾﺮ‬ ‫روﯾﺖ‬ ‫ﺣﺎﻟﺘﻬﺎی‬ ‫ﮐﺮدن‬ ‫ﺟﺪا‬ •‫ﻧﮕﺎرش‬: [Abar,Bbar,Cbar,T,k]=obsvf(A,B,C) [Abar,Bbar,Cbar,T,k]=obsvf(A,B,C,tol) •‫ﺗﻮﺿﯿﺤﺎت‬:‫ﮔﯿﺮﯾﻢ‬ ‫ﻣﯽ‬ ‫ﻧﻈﺮ‬ ‫در‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫را‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻣﻌﺎدﻻت‬: DuxCy BuxAx np nn += += × × • ‫روﯾﺖ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫رﺗﺒﻪ‬ ‫اﮔﺮ‬‫ﺳﯿﺴﺘﻢ‬ ‫ﭘﺬﯾﺮی‬r‫ﺑﺎﺷﺪ‬)‫و‬r<n(‫ﻧﯿﺴﺖ‬ ‫ﮐﺎﻣﻞ‬ ‫ﭘﺬﯾﺮ‬ ‫روﯾﺖ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫آﻧﮕﺎه‬.‫ﺗﺸﺎﺑﻬﯽ‬ ‫ﺗﺒﺪﯾﻞ‬ ،‫اﯾﻨﺤﺎﻟﺖ‬ ‫در‬T ‫ﮐﻪ‬ ‫دارد‬ ‫وﺟﻮد‬unitary‫روﯾﺖ‬ ‫ﺣﺎﻟﺘﻬﺎی‬ ‫و‬ ‫اﺳﺖ‬‫روﯾﺖ‬ ‫و‬ ‫ﭘﺬﯾﺮ‬‫ﻧﺎﭘﺬﯾﺮ‬‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﺟﺪا‬ ‫ﻫﻢ‬ ‫از‬ ‫را‬ ‫ﺳﯿﺴﺘﻢ‬. TT CTCTBBTATA === ,, ‫ﺗﺒﺪﯾﻞ‬ ‫اﯾﻦ‬ ‫اﻋﻤﺎل‬ ‫ﺑﺎ‬،‫روﯾﺖ‬ ‫ﺣﺎﻟﺘﻬﺎی‬‫ﺑﺎﻻ‬ ‫ﮔﻮﺷﻪ‬ ‫در‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻧﺎﭘﺬﯾﺮ‬-‫ﭼ‬‫ﭗ‬‫ﻣﺎﺗﺮﯾﺲ‬A‫ﮔﯿﺮﻧﺪ‬ ‫ﻣﯽ‬ ‫ﻗﺮار‬: [ ]o o nono CC B B B A AA A 0,, 0 0 12 =      =      = ‫زوج‬ ‫ﺗﺮﺗﯿﺐ‬ ‫اﯾﻦ‬ ‫ﺑﻪ‬[Abar,Bbar,Cbar,k]=obsvf(A,B,C)‫ر‬‫وﯾﺖ‬‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫و‬ ‫اﺳﺖ‬ ‫ﮐﺎﻣﻞ‬ ‫ﭘﺬﯾﺮ‬Ano‫ﺣﺎﻟﺘﻬﺎی‬ ‫ﻫﺴﺘﻨﺪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻧﺎﭘﺬﯾﺮ‬ ‫روﯾﺖ‬. ‫دﺳﺘﻮر‬[Abar,Bbar,Cbar,T,k]=obsvf(A,B,C)‫ﻫﺎی‬ ‫ﻣﺎﺗﺮﯾﺲ‬A‫و‬B‫و‬C‫ﻗﺒﻼ‬ ‫ﮐﻪ‬ ‫ﻧﺤﻮی‬ ‫ﺑﻪ‬ ‫را‬"‫ﺷﺪ‬ ‫ﮔﻔﺘﻪ‬ ‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﺗﻮﻟﯿﺪ‬.T‫ﮐﻨﺘﺮل‬ ‫ﺣﺎﻟﺘﻬﺎی‬ ‫ﮐﺮدن‬ ‫ﺟﺪا‬ ‫ﺑﺮای‬ ‫ﺗﺸﺎﺑﻬﯽ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﻧﯿﺰ‬‫ﮐﻨﺘﺮل‬ ‫و‬ ‫ﭘﺬﯾﺮ‬‫اﺳﺖ‬ ‫ﻧﺎﭘﺬﯾﺮ‬.k‫ﺑﺮدار‬ ‫ﯾﮏ‬n‫اﺳﺖ‬ ‫ﻋﻀﻮی‬)n ‫اﺑﻌﺎد‬A‫اﺳﺖ‬(‫ﻫ‬ ‫و‬‫ﻧﮕﺎﺷﺖ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫ﺑﺮای‬ ‫ﺗﮑﺮار‬ ‫ﻣﺮﺗﺒﻪ‬ ‫ﻫﺮ‬ ‫در‬ ‫ﮐﻪ‬ ‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻧﺸﺎن‬ ‫آن‬ ‫ﻋﻀﻮ‬ ‫ﺮ‬T‫روﯾﺖ‬ ‫ﺣﺎﻟﺖ‬ ‫ﭼﻨﺪ‬ ،‫ﭘﺬﯾﺮ‬ ‫اﺳﺖ‬ ‫ﺷﺪه‬ ‫ﺟﺪا‬. ‫ﻧﺘﯿﺠﻪ‬ ‫در‬sum(k)‫ﺣﺎﻟﺘﻬﺎی‬ ‫ﺗﻌﺪاد‬Ao‫را‬‫داد‬ ‫ﺧﻮاﻫﺪ‬ ‫ﻧﺸﺎن‬.‫دﺳﺘﻮر‬ ‫ﺑﺎ‬obsvf(A,B,C,tol)‫اﻧﺠﺎم‬ ‫ﺗﻠﺮاﻧﺲ‬ ‫ﺗﻮان‬ ‫ﻣﯽ‬ ‫ﻧﯿﺰ‬ ‫را‬ ‫ﻧﺎﭘﺬﯾﺮ‬ ‫روﯾﺖ‬ ‫و‬ ‫ﭘﺬﯾﺮ‬ ‫روﯾﺖ‬ ‫ﻓﻀﺎﻫﺎی‬ ‫ﺗﻌﯿﯿﻦ‬ ‫و‬ ‫ﻣﺤﺎﺳﺒﺎت‬‫ﺗﻌﯿﯿ‬‫ﻦ‬‫ﮐﺮد‬. •‫ﻣﺮﺗﺒﻂ‬ ‫دﺳﺘﻮرات‬: obsv:‫ﭘﺬﯾﺮی‬ ‫روﯾﺖ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ 2-18-‫دﺳﺘﻮر‬place: •‫ﻫﺪف‬:‫ورودی‬ ‫ﭼﻨﺪ‬ ‫ﻫﺎی‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺑﺮای‬ ‫ﻗﻄﺐ‬ ‫ﺟﺎﯾﺎب‬ ‫ﻃﺮاﺣﯽ‬ •‫ﻧﮕﺎرش‬: K=place(A,B,P) [K,prec,message]=place(A,B,P) •‫ﺗﻮﺿﯿﺤﺎت‬: ‫ورودی‬ ‫ﭼﻨﺪ‬ ‫ﺳﯿﺴﺘﻢ‬)‫ورودی‬ ‫ﺗﮏ‬ ‫ﯾﺎ‬(‫اﺳﺖ‬ ‫ﻣﻔﺮوض‬ ‫زﯾﺮ‬: BuAxx += •
  • 26. 26 ‫ﻣﯽ‬ ‫ﻓﺮض‬‫ﺷﻮ‬‫ﺑﺮدار‬ ‫ﮐﻪ‬ ‫د‬P‫ﺣ‬‫ﺑﺎﺷﺪ‬ ‫ﺑﺴﺘﻪ‬ ‫ﺣﻠﻘﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺑﺮای‬ ‫ﻣﻄﻠﻮب‬ ‫ﻗﻄﺒﻬﺎی‬ ‫ﻣﺤﻞ‬ ‫ﺎوی‬1 .‫دﺳﺘﻮر‬K=place(A,B,P) ‫ﺣﺎﻟﺖ‬ ‫ﻓﯿﺪﺑﮏ‬ ‫ﻣﺎﺗﺮﯾﺲ‬K‫ﻗﺎﻧﻮن‬ ‫ﮐﻪ‬ ‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﻃﺮاﺣﯽ‬ ‫ﭼﻨﺎن‬ ‫را‬u=-Kx‫ﻣﺸﺨﺺ‬ ‫ﻣﺤﻠﻬﺎی‬ ‫در‬ ‫را‬ ‫ﺑﺴﺘﻪ‬ ‫ﺣﻠﻘﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻗﻄﺒﻬﺎی‬ ‫ﺑﺮدار‬ ‫در‬ ‫ﺷﺪه‬P‫دﻫﺪ‬ ‫ﻗﺮار‬.‫ﻣﺎ‬ ‫ورودی‬ ‫ﭼﻨﺪ‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬ ‫در‬ ‫ﮐﻪ‬ ‫اﺳﺖ‬ ‫واﺿﺢ‬‫ﺗﺮﯾﺲ‬K‫ﻧﯿﺴﺖ‬ ‫ﺑﻔﺮد‬ ‫ﻣﻨﺤﺼﺮ‬.‫دﺳﺘﻮر‬place‫از‬ ‫در‬ ‫اﻏﺘﺸﺎﺷﺎت‬ ‫ﺑﺮاﺑﺮ‬ ‫در‬ ‫را‬ ‫ﺑﺴﺘﻪ‬ ‫ﺣﻠﻘﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺣﺴﺎﺳﯿﺖ‬ ‫ﮐﻪ‬ ‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫اﺳﺘﻔﺎده‬ ‫اﻟﮕﻮرﯾﺘﻤﻬﺎﯾﯽ‬A‫و‬B‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﮐﺎﻫﺶ‬2 . ‫دﺳﺘﻮر‬[K,prec,message]=place(A,B,P)‫ﺗﻌﯿﯿﻦ‬ ‫ﺑﺮ‬ ‫ﻋﻼوه‬K،Prec‫ﮐﻪ‬ ‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻧﺸﺎن‬ ‫ﮐﻪ‬ ‫ﮔﺮداﻧﺪ‬ ‫ﻣﯽ‬ ‫ﺑﺮ‬ ‫را‬ ‫ﺑﺴﺘﻪ‬ ‫ﺣﻠﻘﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻗﻄﺒﻬﺎی‬‫در‬ ‫ﺷﺪه‬ ‫ﺗﻌﯿﯿﻦ‬ ‫ﻣﺤﻠﻬﺎی‬ ‫ﺑﻪ‬ ‫اﻧﺪازه‬ ‫ﭼﻪ‬ ‫ﺗﺎ‬P‫ﻫﺴﺘﻨﺪ‬ ‫ﻧﺰدﯾﮏ‬.Precً‫ﺎ‬‫دﻗﯿﻘ‬ ‫ﮐﻪ‬ ‫را‬ ‫ﻗﻄﺒﻬﺎﯾﯽ‬ ‫ﺗﻌﺪاد‬‫در‬ ‫در‬ ‫ﺷﺪه‬ ‫ﺗﻌﯿﯿﻦ‬ ‫ﻣﺤﻠﻬﺎی‬P‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻧﺸﺎن‬ ‫اﻧﺪ‬ ‫ﮔﺮﻓﺘﻪ‬ ‫ﻗﺮار‬.‫از‬ ‫ﺑﯿﺶ‬ ‫ﺑﺴﺘﻪ‬ ‫ﺣﻠﻘﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻗﻄﺒﻬﺎی‬ ‫از‬ ‫ﯾﮑﯽ‬ ‫اﮔﺮ‬ ‫ﺑﻌﻼوه‬10%‫از‬ ‫در‬ ‫ﻫﺸﺪار‬ ‫ﭘﯿﻐﺎم‬ ‫ﯾﮏ‬ ،‫ﺑﺎﺷﺪ‬ ‫دور‬ ‫ﻣﻄﻠﻮب‬ ‫ﻣﺤﻠﻬﺎی‬message‫ﻣﯿﺸﻮد‬ ‫ﺻﺎدر‬. ‫ﺑﺎ‬‫دﺳﺘﻮر‬ ‫از‬ ‫اﺳﺘﻔﺎده‬place‫ﮐﺮد‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫را‬ ‫روﯾﺘﮕﺮ‬ ‫ﺑﻬﺮه‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﺗﻮان‬ ‫ﻣﯽ‬: L=place(A’,C’,P)’ •‫ﻣﺮﺗﺒﻂ‬ ‫دﺳﺘﻮرات‬: acker:‫ورودی‬ ‫ﺗﮏ‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬ ‫ﺑﺮای‬ ‫آﮐﺮﻣﻦ‬ ‫ﻓﺮﻣﻮل‬ ‫از‬ ‫اﺳﺘﻔﺎده‬ ‫ﺑﺎ‬ ‫ﻗﻄﺐ‬ ‫ﺟﺎﯾﺎﺑﯽ‬ 2-19-‫دﺳﺘﻮر‬ss: •‫ﻫﺪف‬:‫ﻣﺪل‬ ‫ﯾﮏ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﯾﺎ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬ ‫ﺗﻌﺮﯾﻒ‬LTI‫ﺣﺎﻟ‬ ‫ﻓﻀﺎی‬ ‫ﺑﻪ‬‫ﺖ‬ •‫ﻧﮕﺎرش‬: sys=ss(A,B,C,D); sys=ss(d); sys=ss(A,B,C,D,ltisys); sys=ss(A,B,C,D,’property1’,value1,…,’propertyN’,valueN); sys_ss=ss(sys) sys_ss=ss(sys,’minimal’) •‫ﺗﻮﺿﯿﺤﺎت‬:‫دﺳﺘﻮر‬ss‫ﺻﻔﺮ‬ ‫ﻣﺪل‬ ‫ﯾﺎ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﺗﺎﺑﻊ‬ ‫ﻣﺪل‬ ‫ﯾﮏ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﯾﺎ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻓﺮم‬ ‫ﺑﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻧﻤﺎﯾﺶ‬ ‫ﺑﺮای‬-‫ﻗﻄﺐ‬- ‫رود‬ ‫ﻣﯽ‬ ‫ﮐﺎر‬ ‫ﺑﻪ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬ ‫ﺑﻪ‬ ‫ﺑﻬﺮه‬. ‫دﺳﺘﻮر‬SYS=ss(A,B,C,D)‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﺗﻮﻟﯿﺪ‬ ‫زﯾﺮ‬ ‫ﭘﯿﻮﺳﺘﻪ‬ ‫زﻣﺎن‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺑﺮای‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬: DuCxy BuAxx += += • ‫اﮔﺮ‬D=0‫ﺻﻔﺮ‬ ‫اﺳﮑﺎﻟﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫آن‬ ‫ﻣﻘﺪار‬ ‫ﮐﺎﻓﯿﺴﺖ‬ ‫ﺑﺎﺷﺪ‬)‫آن‬ ‫اﺑﻌﺎد‬ ‫ﺑﻪ‬ ‫ﺗﻮﺟﻪ‬ ‫ﺑﺪون‬(‫ﺷﻮد‬ ‫وارد‬. ‫دﺳﺘﻮر‬sys=ss(d)‫ﺑ‬ ‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﺑﺎ‬ ‫ﺳﯿﺴﺘﻢ‬‫ﺛﺎﺑﺖ‬ ‫ﻬﺮه‬d‫ﺑﺎ‬ ‫اﺳﺖ‬ ‫ﻣﻌﺎدل‬ ‫و‬ ‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻧﻤﺎﯾﺶ‬ ‫را‬: sys=ss([],[],[],d); ‫دﺳﺘﻮر‬sys=ss(A,B,C,D,ltisys)‫در‬ ‫ﺷﺪه‬ ‫ﻣﺸﺨﺺ‬ ‫وﯾﮋﮔﯽ‬ ‫ﺑﻪ‬ ‫ﺗﻮﺟﻪ‬ ‫ﺑﺎ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬ ‫ﯾﮏ‬ltisys‫ﺗﻮﻟﯿﺪ‬ ‫ﮐﻨﺪ‬ ‫ﻣﯽ‬.‫ﻣﻮ‬ ‫از‬ ‫ﯾﮑﯽ‬ ‫ﺗﻮاﻧﺪ‬ ‫ﻣﯽ‬ ‫وﯾﮋﮔﯽ‬ ‫اﯾﻦ‬.‫ﺑﺎﺷﺪ‬ ‫زﯾﺮ‬ ‫ﺟﺪول‬ ‫در‬ ‫ﺷﺪه‬ ‫ذﮐﺮ‬ ‫ارد‬: ‫وﯾﮋﮔﯽ‬ ‫ﻧﻮع‬‫وﯾﮋﮔﯽ‬ ‫ﻣﻌﺮﻓﯽ‬‫وﯾﮋﮔﯽ‬ ‫ﻧﺎم‬ 1 ‫ﺳﯿﺴ‬ ‫ﻗﻄﺒﻬﺎی‬‫وﯾﮋه‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫ﻫﻤﺎن‬ ‫ﺑﺴﺘﻪ‬ ‫ﺣﻠﻘﻪ‬ ‫ﺘﻢ‬A-BK‫ﻫﺴﺘﻨﺪ‬. 2 ‫اﻧﺪ‬ ‫ﺷﺪه‬ ‫اﻗﺘﺒﺎس‬ ‫زﯾﺮ‬ ‫ﻣﺮﺟﻊ‬ ‫از‬ ‫اﻟﮕﻮرﯾﺘﻤﻬﺎ‬ ‫اﯾﻦ‬: Kautsky,J. and N.K.Nichols, "Robust Pole Assignment in Linear State Feedback", Int.J.Control, 41 (1985) , pp.1129-1155
  • 27. 27 ‫ﻣﺎ‬‫ﺗﺮﯾﺲ‬‫ورودی‬ ‫ﺗﺄﺧﯿﺮﻫﺎی‬/‫ﺧﺮوﺟﯽ‬IoDelayMatrix ‫ﺑﺮدار‬‫ورودی‬ ‫در‬ ‫ﺗﺄﺧﯿﺮ‬InputDelay Cell array‫ورودی‬ ‫ﮐﺎﻧﺎﻟﻬﺎی‬ ‫ﮔﺮوه‬InputGroup Cell vector of string‫ورودی‬ ‫ﮐﺎﻧﺎﻟﻬﺎی‬ ‫اﺳﺎﻣﯽ‬InputName Text‫ﻣﺪل‬ ‫ﻣﻌﺮﻓﯽ‬ ‫ﺑﺮای‬ ‫ﯾﺎدداﺷﺘﻬﺎ‬Notes ‫ﺑﺮدار‬‫ﺧﺮوﺟﯽ‬ ‫ﺗﺄﺧﯿﺮﻫﺎی‬OutputDelay Cell array‫ﮔﺮو‬‫ﺧﺮوﺟﯽ‬ ‫ﮐﺎﻧﺎﻟﻬﺎی‬ ‫ه‬OutputGroup Cell vector of strings‫ﺧﺮوﺟﯽ‬ ‫ﮐﺎﻧﺎﻟﻬﺎی‬ ‫اﺳﺎﻣﯽ‬OutputName ‫اﺳﮑﺎﻟﺮ‬‫ﻧﻤﻮﻧﻪ‬ ‫زﻣﺎن‬‫ﺑﺮداری‬Ts ‫دﻟﺨﻮاه‬‫اﺿﺎﻓﯽ‬ ‫اﻃﻼﻋﺎت‬UserData ‫ﺷﻮد‬ ‫ﻣﯽ‬ ‫داده‬ ‫ﺗﻮﺿﯿﺢ‬ ‫اﺧﺘﺼﺎر‬ ‫ﺑﻪ‬ ‫وﯾﮋﮔﯿﻬﺎ‬ ‫اﯾﻦ‬ ‫از‬ ‫ﯾﮏ‬ ‫ﻫﺮ‬: 1.‫ﺑﺮداری‬ ‫ﻧﻤﻮﻧﻪ‬ ‫زﻣﺎن‬Ts)‫ﺛﺎﻧﯿﻪ‬ ‫ﺑﺮﺣﺴﺐ‬(‫ﺣﺎﻟ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬ ‫ﺗﻌﺮﯾﻒ‬ ‫ﺑﺮای‬‫زﻣﺎن‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬ ‫ﺖ‬-‫ﻣﯽ‬ ‫ﮐﺎر‬ ‫ﺑﻪ‬ ‫ﮔﺴﺴﺘﻪ‬ ‫رود‬.Ts=0‫زﻣﺎن‬ ‫ﺳﯿﺴﺘﻢ‬-‫و‬ ‫ﭘﯿﻮﺳﺘﻪ‬Ts=-1‫اﺳﺖ‬ ‫ﻧﺎﻣﻌﻠﻮم‬ ‫ﺑﺮداری‬ ‫ﻧﻤﻮﻧﻪ‬ ‫زﻣﺎن‬ ‫ﺑﺎ‬ ‫ﮔﺴﺴﺘﻪ‬ ‫زﻣﺎن‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻣﻌﺮف‬. 2.‫وﯾﮋﮔﯽ‬InputDelay،OutputDelay‫و‬IoDelayMatrix‫را‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪﻟﻬﺎی‬ ‫در‬ ‫ﺗﺎﺧﯿﺮ‬ ‫ﮐﺮدن‬ ‫وارد‬ ‫اﻣﮑﺎن‬ ‫اﯾﻦ‬ ‫ﻓﺮض‬ ‫ﭘﯿﺶ‬ ‫ﻣﻘﺎدﯾﺮ‬ ‫و‬ ‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫اﯾﺠﺎد‬‫اﺳﺖ‬ ‫ﺻﻔﺮ‬ ‫وﯾﮋﮔﯿﻬﺎ‬)‫ﺗﺎﺧﯿﺮ‬ ‫ﺑﺪون‬( 3.‫ﻫﺎی‬ ‫وﯾﮋﮔﯽ‬InputName‫و‬OutputName‫ﻧ‬ ‫اﻣﮑﺎن‬‫ﺎ‬‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﮐﺎرﺑﺮ‬ ‫ﺑﻪ‬ ‫را‬ ‫ﺧﺮوﺟﯿﻬﺎ‬ ‫و‬ ‫ورودﯾﻬﺎ‬ ‫ﺗﮏ‬ ‫ﺗﮏ‬ ‫ﻣﮕﺬاری‬. 4.InputGroup‫و‬OutputGroup‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻧﻮﯾﺲ‬ ‫ﺑﺮﻧﺎﻣﻪ‬ ‫ﺑﻪ‬ ‫را‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺧﺮوﺟﯿﻬﺎی‬ ‫و‬ ‫ورودﯾﻬﺎ‬ ‫ﺑﻨﺪی‬ ‫ﮔﺮوه‬ ‫اﻣﮑﺎن‬.‫ﺑﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﯾﮏ‬ ‫در‬ ‫ﻣﺜﺎل‬ ‫ﻋﻨﻮان‬5‫ﺑﺮﻧﺎﻣﻪ‬ ،‫ورودی‬‫ﻣﯽ‬ ‫ﻧﻮﯾﺲ‬‫ﺗﻮاﻧﺪ‬3‫ﮔﺮوه‬ ‫در‬ ‫را‬ ‫ورودی‬control‫و‬2‫در‬ ‫را‬ ‫ورودی‬ ‫ﮔﺮوه‬noise‫دﻫﺪ‬ ‫ﻗﺮار‬. 5.‫وﯾﮋﮔﯿﻬﺎی‬Notes‫و‬User data‫اﻧﺪ‬ ‫ﺷﺪه‬ ‫ﮔﺮﻓﺘﻪ‬ ‫ﻧﻈﺮ‬ ‫در‬ ‫ﻧﻮﯾﺲ‬ ‫ﺑﺮﻧﺎﻣﻪ‬ ‫ﺗﻮﺳﻂ‬ ‫اﺿﺎﻓﯽ‬ ‫ﻣﻮارد‬ ‫ﺗﻌﺮﯾﻒ‬ ‫ﺑﺮای‬ ‫ﻧﯿﺰ‬.Notes ‫ﯾﮏ‬ ‫ﺗﻨﻬﺎ‬textً‫ﻻ‬‫ﻣﻌﻤﻮ‬ ‫و‬ ‫ﺑﻮده‬‫اﺳﺖ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫درﺑﺎره‬ ‫ﺗﻮﺿﯿﺤﺎﺗﯽ‬ ‫ﺣﺎوی‬.‫وﯾﮋﮔﯽ‬ ‫در‬User data‫ﺗﻮاﻧﺪ‬ ‫ﻣﯽ‬ ‫ﻧﻮﯾﺲ‬ ‫ﺑﺮﻧﺎﻣﻪ‬ ‫ﮐﻨﺪ‬ ‫ﺗﻌﺮﯾﻒ‬ ‫را‬ ‫ﺧﻮد‬ ‫ﻧﻈﺮ‬ ‫ﻣﻮرد‬ ‫ﻫﺎی‬ ‫داده‬. ‫ﺷﺪ‬ ‫ﺧﻮاﻫﺪ‬ ‫ﻣﺸﺨﺺ‬ ‫وﯾﮋﮔﯿﻬﺎ‬ ‫اﯾﻦ‬ ‫ﺑﻪ‬ ‫دﻫﯽ‬ ‫ﻣﻘﺪار‬ ‫ﻣﻘﺪار‬ ‫ﻧﺤﻮه‬ ،‫ﺷﺪه‬ ‫ذﮐﺮ‬ ‫دﺳﺘﻮراﻟﻌﻤﻠﻬﺎی‬ ‫اﯾﻦ‬ ‫اﻧﺘﻬﺎی‬ ‫در‬ ‫ﮐﻪ‬ ‫ﻣﺜﺎﻟﻬﺎﯾﯽ‬ ‫در‬. ‫دﺳﺘﻮر‬sys_ss=ss(sys)‫ﻣﺪل‬sys،‫دﺳﺘﻮرات‬ ‫ﺗﻮﺳﻂ‬ ‫ﺷﺪه‬ ‫ﺗﻮﻟﯿﺪ‬tf‫و‬zpk‫ﻣﺪل‬ ‫ﺑﻪ‬ ‫را‬sys_ss‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫در‬ ‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﺗﺒﺪﯾﻞ‬.‫ﺷﻮد‬ ‫ﻣﯽ‬ ‫ﮔﻔﺘﻪ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﺗﺤﻘﻖ‬ ‫ﻋﻤﻠﯿﺎت‬ ‫اﯾﻦ‬ ‫ﺑﻪ‬. ‫دﺳﺘﻮر‬sys_ss=ss(sys,’minimal’)‫ﺳﯿﺴﺘﻢ‬ ‫از‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﺗﺤﻘﻖ‬ ‫ﯾﮏ‬sys‫آن‬ ‫در‬ ‫ﮐﻪ‬ ‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫اراﺋﻪ‬ ‫ﭼﻨﺎن‬ ‫را‬ ‫ﻧﺒﺎﺷﺪ‬ ‫ﻣﻮﺟﻮد‬ ‫ﻧﺎﭘﺬﯾﺮی‬ ‫ﮐﻨﺘﺮل‬ ‫ﯾﺎ‬ ‫ﻧﺎﭘﺬﯾﺮ‬ ‫روﯾﺖ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻫﯿﭻ‬. ‫اﺳﺖ‬ ‫ﻣﻌﺎدل‬ ‫زﯾﺮ‬ ‫دﺳﺘﻮر‬ ‫ﺑﺎ‬ ‫دﺳﺘﻮر‬ ‫اﯾﻦ‬: sys_ss=mineral(ss(sys)) ‫ﻣﺜﺎل‬1:‫ورودی‬ ‫ﺗﮏ‬ ‫ﺳﯿﺴﺘﻢ‬/‫ﮔﯿﺮﯾﻢ‬ ‫ﻣﯽ‬ ‫ﻧﻈﺮ‬ ‫در‬ ‫ا‬ ‫ر‬ ‫زﯾﺮ‬ ‫دار‬ ‫ﺗﺎﺧﯿﺮ‬ ‫ﺧﺮوﺟﯽ‬ ‫ﺗﮏ‬: ‫زﯾﺮ‬ ‫دﺳﺘﻮرات‬plant‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﻣﻌﺮﻓﯽ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫در‬ ‫را‬: » sys=tf(1,[1 1]); » sys_ss=ss(sys); ‫ﺑﻪ‬ ‫ﺗﺎﺧﯿﺮ‬ ‫اﻓﺰودن‬ ‫ﺑﺮای‬plant،‫وﯾﮋﮔﯽ‬Input Delay‫ﮐﻨﯿﻢ‬ ‫ﻣﯽ‬ ‫دﻫﯽ‬ ‫ﻣﻘﺪار‬ ‫را‬.‫اﯾﻨﮑﺎر‬‫دﺳﺘﻮر‬ ‫ﺑﺎ‬set‫ﺷﻮد‬ ‫ﻣﯽ‬ ‫اﻧﺠﺎم‬:
  • 28. 28 » set(sys_ss,’InputDelay’,0.3); ‫ﻣ‬ ‫ﮐﺎر‬ ‫ﺑﻪ‬ ‫را‬ ‫زﯾﺮ‬ ‫دﺳﺘﻮر‬ ‫آن‬ ‫ﺑﻪ‬ ‫ﯾﺎدداﺷﺖ‬ ‫ﯾﮏ‬ ‫اﻓﺰودن‬ ‫ﻧﯿﺰ‬ ‫و‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺧﺮوﺟﯽ‬ ‫و‬ ‫ورودی‬ ‫ﻧﺎﻣﮕﺬاری‬ ‫ﺑﺮای‬‫ﯽ‬‫ﺑﺮﯾﻢ‬: »set(sys_ss,’InputName’,’energy’,Outputname’,’temprature’,’Notes’,’A Sample Heater Mode’) ‫اﯾﻦ‬ ‫ﺑﻪ‬‫ﺗﺮﺗ‬‫ﯿﺐ‬sys_ss‫ﺧﻮﺑﯽ‬ ‫ﺑﻪ‬ ‫آن‬ ‫ﭘﻠﻪ‬ ‫ﭘﺎﺳﺦ‬ ‫رﺳﻢ‬ ‫و‬ ‫اﺳﺖ‬ ‫دار‬ ‫ﺗﺎﺧﯿﺮ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺑﺮای‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬ ‫واﻗﻊ‬ ‫در‬3/0‫ﺛﺎﻧﯿﻪ‬ ‫ﮐﺮد‬ ‫ﺧﻮاﻫﺪ‬ ‫ﻣﺸﺨﺺ‬ ‫ﭘﺎﺳﺦ‬ ‫اﺑﺘﺪای‬ ‫در‬ ‫را‬ ‫ﻣﺮده‬ ‫زﻣﺎن‬. ‫دﺳﺘﻮر‬ ‫ﺷﻮد‬ ‫آﮔﺎه‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺷﺪه‬ ‫ﺗﻨﻈﯿﻢ‬ ‫وﯾﮋﮔﯿﻬﺎی‬ ‫از‬ ‫ﯾﮑﯽ‬ ‫ﻓﻌﻠﯽ‬ ‫ﻣﻘﺪار‬ ‫از‬ ‫ﺑﺨﻮاﻫﺪ‬ ‫ﻧﻮﯾﺲ‬ ‫ﺑﺮﻧﺎﻣﻪ‬ ‫ﻟﺤﻈﻪ‬ ‫ﻫﺮ‬ ‫در‬ ‫ﭼﻨﺎﻧﭽﻪ‬get‫ﻣﻮرد‬ ‫ﻗﺮا‬ ‫اﺳﺘﻔﺎده‬‫ﮔﯿﺮد‬ ‫ﻣﯽ‬ ‫ر‬.‫ﻗﺒﻞ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫در‬ ‫ﻣﺜﺎل‬ ‫ﻋﻨﻮان‬ ‫ﺑﻪ‬: » get(sys_ss,’InputDelay’) ans= 0.3000 ‫اﺳﺖ‬ ‫اﻣﮑﺎﻧﭙﺬﯾﺮ‬ ‫ﻧﯿﺰ‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫دﺳﺘﺮﺳﯽ‬ ‫اﯾﻦ‬: » sys_ss.InputDelay ans= 0.3000 ‫ﻣﺜﺎل‬2: ‫ﻣﺘﻐﯿﺮ‬ ‫در‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬ ‫ﻗﺮاردادن‬ ‫ﺑﺮ‬ ‫ﻋﻼوه‬ ‫زﯾﺮ‬ ‫ﺑﺮﻧﺎﻣﻪ‬system‫و‬ ‫ﺣﺎﻟﺘﻬﺎ‬ ،‫ﻧﺎﻣﮕﺬاری‬ ‫ﻧﯿﺰ‬ ‫را‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺧﺮوﺟﯿﻬﺎی‬ ‫ﮐﻨﺪ‬ ‫ﻣﯽ‬. A=[0 1;-1 -2]; B=[1;1]; C=[1 0;0 2]; D=0; system=ss(A,B,C,D,'statename',{'position' 'velocity'},… 'Outputname',{'out1';'out2'}); 2-20-‫دﺳﺘﻮر‬ssdata: •‫ﻫﺪف‬:‫ﻣﺎﺗﺮﯾﺴﻬﺎی‬ ‫ﺑﻪ‬ ‫دﺳﺘﺮﺳﯽ‬A،B،C‫و‬D‫ﻣﺪل‬ ‫روی‬ ‫از‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬‫ﺳﯿﺴﺘﻢ‬ •‫ﻧﮕﺎرش‬:[A,B,C,D]= ssdata (SYS)‫ﭘﯿﻮﺳﺘﻪ‬ ‫زﻣﺎن‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬ [A,B,C,D,Ts]=ssdata(SYS)‫ﮔﺴﺴﺘﻪ‬ ‫زﻣﺎن‬ ‫ﺳﯿﺴﺘﻤﻬﺎی‬ •‫ﺗﻮﺿﯿﺤﺎت‬: ‫ﻗﻄﺐ‬ ‫ﯾﺎ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﺗﺎﺑﻊ‬ ‫ﻓﺮم‬ ‫ﺑﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻣﺪل‬ ‫ﭼﻨﺎﻧﭽﻪ‬/‫ﺻﻔﺮ‬/‫ﺗﺒﺪﯾﻞ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬ ‫ﺑﻪ‬ ‫را‬ ‫آن‬ ‫اﺑﺘﺪا‬ ‫دﺳﺘﻮر‬ ‫اﯾﻦ‬ ، ‫ﺑﺎﺷﺪ‬ ‫ﺑﻬﺮه‬‫ﻣﺮده‬ ‫ﺳﭙﺲ‬ ،A‫و‬B‫و‬C‫و‬D‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫اﺳﺘﺨﺮاج‬ ‫را‬. •‫ﻣﺮﺗﺒﻂ‬ ‫دﺳﺘﻮرﻫﺎی‬: ss:‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬ ‫ﺗﻌﺮﯾﻒ‬ 2-21-‫دﺳﺘﻮر‬ss2ss: •‫ﻫﺪف‬:‫ﺣﺎﻟﺖ‬ ‫ﻣﺤﻮرﻫﺎی‬ ‫ﺗﺒﺪﯾﻞ‬1 ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻧﻤﺎﯾﺶ‬ ‫در‬)‫ﺗﺸﺎﺑﻬﯽ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫اﻋﻤﺎل‬( 1 State Coordinates
  • 29. 29 •‫ﻧﮕﺎرش‬:SYST=ss2ss(SYS,T) •‫ﺗﻮﺿﯿﺤﺎت‬:‫ﺳﯿﺴﺘﻢ‬SYS‫ﻓﻀﺎی‬ ‫ﻧﻤﺎﯾﺶ‬ ‫ﺑﺎ‬‫اﺳﺖ‬ ‫ﻣﻔﺮوض‬ ‫زﯾﺮ‬ ‫ﺣﺎﻟﺖ‬: DuCxy BuAxx += += • ‫دﺳﺘﻮر‬ss2ss‫ﺗﺸﺎﺑﻬﯽ‬ ‫ﺗﺒﺪﯾﻞ‬Txx =‫ﺑﺮدار‬ ‫روی‬ ‫را‬x‫ﺳﯿﺴﺘﻢ‬ ‫و‬ ‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫اﻋﻤﺎل‬SYST‫را‬ ‫زﯾﺮ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬ ‫ﺑﺎ‬ ‫دﻫﺪ‬ ‫ﻣﯽ‬ ‫ﻧﺘﯿﺠﻪ‬. DuxCTy TBuxTATx += += − − • 1 1 ‫دﺳﺘﻮر‬SYST= ss2ss (SYS,T)‫ﺳﯿﺴﺘﻢ‬ ‫درﯾﺎﻓﺖ‬ ‫ﺑﺎ‬SYS‫ﺗﺒﺪﯾﻞ‬ ‫و‬‫ﺗﺸﺎﺑﻬﯽ‬T‫ﻣﻌﺎدل‬ ‫ﺳﯿﺴﺘﻢ‬SYST‫ﻣﯽ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫را‬ ‫ﮐﻨﺪ‬.‫ﻣﺎﺗﺮﯾﺲ‬T‫ﺑﺎﺷﺪ‬ ‫ﭘﺬﯾﺮ‬ ‫وارون‬ ‫ﺑﺎﯾﺪ‬. •‫دﺳﺘﻮ‬‫رﻫﺎی‬‫ﻣﺮﺗﺒﻂ‬: canon:‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫در‬ ‫ﮐﺎﻧﻮﻧﯿﮑﺎل‬ ‫ﺗﺤﻘﻖ‬ 2-22-‫دﺳﺘﻮر‬ss2tf: •‫ﻫﺪف‬:‫ﺗﺒﺪﯾﻞ‬ ‫ﺗﺎﺑﻊ‬ ‫ﺑﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬ ‫ﺗﺒﺪﯾﻞ‬ •‫ﻧﮕﺎرش‬:[Num,Den]=ss2tf(A,B,C,D,iu) •‫ﺗﻮﺿﯿﺤﺎت‬:‫ﺗ‬ ‫ﺗﺎﺑﻊ‬‫ﺳﯿﺴﺘﻢ‬ ‫ﺒﺪﯾﻞ‬ DuCxy BuAxx += += • ‫ﺑﻪ‬ ‫ﻧﺴﺒﺖ‬ ‫را‬iu‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﻣﺤﺎﺳﺒﻪ‬ ‫ورودی‬ ‫اﻣﯿﻦ‬.‫اﺳﺖ‬ ‫زﯾﺮ‬ ‫راﺑﻄﻪ‬ ‫ﻃﺒﻖ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﺗﺎﺑﻊ‬ ‫ﻣﺤﺎﺳﺒﻪ‬: DBAsIC sDen sNum sH +−== −1 )( )( )( )( ‫ﺑﺮدار‬Den‫ﻧﺰوﻟﯽ‬ ‫ﺗﻮاﻧﻬﺎی‬ ‫ﺣﺴﺐ‬ ‫ﺑﺮ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﺗﺎﺑﻊ‬ ‫ﻣﺨﺮج‬ ‫ﺿﺮاﯾﺐ‬ ‫ﺣﺎوی‬s‫اﺳﺖ‬.‫ﻣﺎﺗﺮﯾﺲ‬ ‫ﺳﻄﺮﻫﺎی‬ ‫ﺗﻌﺪاد‬Num‫ﺗﻌﺪاد‬ ‫ﺑﺎ‬ ‫ﺑﺮاﺑﺮ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺧﺮوﺟﯿﻬﺎی‬‫اﺳﺖ‬ ‫ﻣﺘﻨﺎﻇﺮ‬ ‫ﺧﺮوﺟﯽ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﺗﺎﺑﻊ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫ﺳﻄﺮ‬ ‫ﻫﺮ‬ ‫و‬ ‫اﺳﺖ‬. •‫ﻣﺮﺗﺒﻂ‬ ‫دﺳﺘﻮرﻫﺎی‬: tf2ss:‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬ ‫ﺑﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﺗﺎﺑﻊ‬ ‫ﺗﺒﺪﯾﻞ‬ ss2ss:‫ﺳﯿﺴﺘﻢ‬ ‫روی‬ ‫ﺗﺸﺎﺑﻬﯽ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫اﻧﺠﺎم‬ 2-23-‫دﺳﺘﻮر‬tf2ss: •‫ﻫﺪف‬:‫ﺳﯿﺴﺘﻢ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﺗﺎﺑﻊ‬ ‫روی‬ ‫از‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬ ‫آوردن‬ ‫ﺑﺪﺳﺖ‬ •‫ﻧﮕﺎرش‬:[A,B,C,D]=tf2ss(Num,Den) •‫ﺗﻮﺿﯿﺤﺎت‬: ‫ﮐﻨﺪ‬ ‫ﻣﯽ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫زﯾﺮ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬ ‫را‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺗﺒﺪﯾﻞ‬ ‫ﺗﺎﺑﻊ‬. DuCxy BuAxx += += • ‫ﺑﺎﺷﺪ‬ ‫ﻣﯽ‬ ‫ﮐﻨﺘﺮﻟﺮ‬ ‫ﮐﺎﻧﻮﻧﯿﮑﺎل‬ ‫ﻓﺮم‬ ‫ﺑﻪ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬.
  • 30. 30 •‫ﻣﺮﺗﺒﻂ‬ ‫دﺳﺘﻮرﻫﺎی‬: ss2tf:‫ﺗﺒﺪﯾﻞ‬ ‫ﺗﺎﺑﻊ‬ ‫ﺑﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﻀﺎی‬ ‫ﻣﺪل‬ ‫ﺗﺒﺪﯾﻞ‬
  • 31. 31 ‫ﺑﺮﻧﺎ‬ ‫ﺑﺮرﺳﯽ‬‫ﻣﺜﺎﻟﻬﺎی‬ ‫ﺑﻪ‬ ‫ﻣﺮﺑﻮط‬ ‫ﻫﺎی‬ ‫ﻣﻪ‬ ‫ﮐﺘﺎب‬ ‫ﻣﺘﻦ‬ 3
  • 32. 32 3-1-‫ﻏﯿﺮﺧﻄﯽ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﭘﺎﺳﺨﻬﺎی‬ ‫رﺳﻢ‬)‫ﻣﺜﺎل‬5-3( ‫ﻣﺜﺎل‬ ‫در‬5-3‫ﺣﺎﻟﺖ‬ ‫ﻓﯿﺪﺑﮏ‬ ،‫ﻣﻌﮑﻮس‬ ‫آوﻧﮓ‬ ‫ﺷﺪۀ‬ ‫ﺧﻄﯽ‬ ‫ﻣﺪل‬ ‫ﺑﺮای‬ ke=[-1.91 -4.262 -45.49 -15.64]‫در‬ ‫ﺑﺴﺘﻪ‬ ‫ﺣﻠﻘﻪ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﻗﻄﺒﻬﺎی‬ ‫ﺗﺎ‬ ‫ﮔﺮدﯾﺪ‬ ‫ﻃﺮاﺣﯽ‬ [-1,-2,-2.5,-3]‫ﮔﯿﺮﻧﺪ‬ ‫ﻗﺮار‬.‫ﻋﻤﻠﮑﺮد‬ ‫ﺑﺮرﺳﯽ‬ ‫ﺑﺮای‬ ‫اﻣﺎ‬‫ﻏﯿﺮﺧﻄﯽ‬ ‫ﺳﯿﺴﺘﻢ‬ ‫ﺑﺮروی‬ ‫را‬ ‫آن‬ ‫ﺑﺎﯾﺪ‬ ‫ﺣﺎﻟﺖ‬ ‫ﻓﯿﺪﺑﮏ‬ ‫اﯾﻦ‬ ‫آزﻣﻮد‬.‫ﻫﺴﺘﯿﻢ‬ ‫ﻏﯿﺮﺧﻄﯽ‬ ‫دﯾﻔﺮاﻧﺴﯿﻞ‬ ‫ﻣﻌﺎدﻻت‬ ‫ﺣﻞ‬ ‫ﻧﯿﺎزﻣﻨﺪ‬ ‫ﻣﻨﻈﻮر‬ ‫اﯾﻦ‬ ‫ﺑﻪ‬.‫اﻓﺰار‬ ‫ﻧﺮم‬ ‫در‬ ‫اﯾﻨﮑﺎر‬Matlab‫ﺑﺎ‬ ً‫ﻻ‬‫ﻣﻌﻤﻮ‬ ‫دﺳﺘﻮرﻫﺎی‬1 ODE‫ﻣﯽ‬ ‫اﻧﺠﺎم‬‫ﮔﯿﺮد‬.‫اﺳﺖ‬ ‫ﺷﺪه‬ ‫ﺑﺮرﺳﯽ‬ ‫ﻣﻌﺎدﻻت‬ ‫ﻧﻮع‬ ‫اﯾﻦ‬ ‫ﺣﻞ‬ ‫ﺷﯿﻮۀ‬ ،‫ﺗﻔﺼﯿﻞ‬ ‫ﺑﻪ‬ ‫ﻣﺜﺎل‬ ‫اﯾﻦ‬ ‫در‬ ‫اﻣﺎ‬.‫ﻓﺎﯾﻞ‬ ‫دو‬ ‫ﻧﺎﻣﻬﺎ‬ ‫ﺑﻪ‬‫ی‬EXP5_3‫و‬ode‫ﺷﺪه‬ ‫ﮔﺮﻓﺘﻪ‬ ‫درﻧﻈﺮ‬ ‫ﻣﺜﺎل‬ ‫اﯾﻦ‬ ‫ﺣﻞ‬ ‫ﺑﺮای‬ ‫زﯾﺮ‬ ‫ﺻﻮرت‬ ‫ﺑﻪ‬‫اﻧﺪ‬. ‫ض‬ ‫ﺷﮑﻞ‬1-1-‫ﻓﺎﯾﻞ‬EXP5_3 1 ode23, ode45, ode113, ode15s, ode23s, ode23t, ode23tb %~~ Chapter 5, Example 3 clc clear all; %~~~~~ PARAMETERS DEFINITION ~~~~~ m=.1; % Kg - mass of pendulum M=1; % Kg - mass of cart I=.06; % Kg.m^2 - moment of inertia g=9.81; % m/sec^2 L=.35; % meter (length of pendulum is 2*L) m1_bar=m*L/(m+M); m2_bar=m*L/(I+m*L^2); %~~~~~~~ Simulation Time=5 sec t=0.01:.01:5; [rt,ct]=size(t); par=[m,M,I,g,L,m1_bar,m2_bar]; %~~~~~ 1. teta(0)=5 deg ~~~~~~~~~~~~~ teta_0=5*(pi/180); % teta(0) in radian x(:,1)=[0;0;teta_0;0]; % initial state teta_5=ode(par,ct,x(:,1)); % calling user-defined function: ode plot(t,teta_5,'b-'); %~~~~~ 2. teta(0)=20 deg ~~~~~~~~~~~~~ teta_0=20*(pi/180); % teta(0) in radian x(:,1)=[0;0;teta_0;0]; % initial state teta_5=ode(par,ct,x(:,1)); % calling user-defined function: ode hold on;plot(t,teta_5,'b--');
  • 33. 33 ‫ض‬ ‫ﺷﮑﻞ‬1-1-)‫اداﻣﻪ‬(‫ﻓﺎﯾﻞ‬EXP5_3.m ‫ض‬ ‫ﺷﮑﻞ‬1-2-‫ﻓﺎﯾﻞ‬ode.m %~~~~~ 4. teta(0)=33.4 deg ~~~~~~~~~~~~~ teta_0=33.4*(pi/180); % teta(0) in radian x(:,1)=[0;0;teta_0;0]; % initial state teta_5=ode(par,ct,x(:,1)); % calling user-defined function: ode hold on;plot(t,teta_5,'b:'); legend('initial angle= 5 deg','initial angle= 20 deg','initial angle= 33.4 deg',3); function [teta]=ode(par_in,ct,x); x(:,1)=x; % initial state %~~~~~ DEFINITION OF PARAMETERS ~~~~~ m=par_in(1); M=par_in(2); I=par_in(3); g=par_in(4); L=par_in(5); m1_bar=par_in(6); m2_bar=par_in(7); mb=m1_bar*m2_bar; %parameter definition only for convenience! for k=2:ct %~~~~~ STATE FEEDBACK ~~~~~~~~~~~~~~~ ke=[-1.91 -4.262 -45.49 -15.64]; u=-ke*x(:,k-1); %~~~~~ NONLINEAR DYNAMIC EQUATION ~~~~~ x1_dot=x(2,k-1); x2_dot1=-mb*g*cos(x(3,k-1))*sin(x(3,k-1))/(1- mb*cos(x(3,k-1))^2); x2_dot2=(m1_bar*sin(x(3,k-1))*x(4,k-1)^2)/(1- mb*cos(x(3,k-1))^2); x2_dot3=u/((m+M)*(1-mb*cos(x(3,k-1))^2)); x2_dot=x2_dot1+x2_dot2+x2_dot3; x3_dot=x(4,k-1); x4_dot1=g*m2_bar*sin(x(3,k-1))/(1-mb*cos(x(3,k-1))^2); x4_dot2=-(mb*sin(x(3,k-1))*x(4,k-1)^2)/(1-mb*cos(x(3,k- 1))^2); x4_dot3=-m2_bar*cos(x(3,k-1))*u/((m+M)*(1-mb*cos(x(3,k- 1))^2));