%PDF-1.5
%
1 0 obj
<<
/Metadata 2 0 R
/Names 3 0 R
/OpenAction 4 0 R
/Outlines 5 0 R
/PageMode /None
/Pages 6 0 R
/Type /Catalog
/ViewerPreferences <<
/FitWindow true
>>
>>
endobj
7 0 obj
<<
/Author (Debarghya Ghosh and Simone Baldi)
/CreationDate (D:20160304161229+08'00')
/Creator (LaTeX with hyperref package)
/Keywords (adaptive control; multiple model distribution)
/ModDate (D:20160812141136+02'00')
/PTEX.Fullbanner (This is pdfTeX, Version 3.14159265-2.6-1.40.15 \(TeX Live 2014/W32TeX\) kpathsea version 6.2.0)
/Producer (pdfTeX-1.40.15)
/Subject (Several multiple model adaptive control architectures have been proposed in the literature. Despite many advances in theory, the crucial question of how to synthesize the pairs model/controller in a structurally optimal way is to a large extent not addressed. In particular, it is not clear how to place the pairs model/controller is such a way that the properties of the switching algorithm \(e.g., number of switches, learning transient, final performance\) are optimal with respect to some criteria. In this work, we focus on the so-called multi-model unfalsified adaptive supervisory switching control \(MUASSC\) scheme; we define a suitable structural optimality criterion and develop algorithms for synthesizing the pairs model/controller in such a way that they are optimal with respect to the structural optimality criterion we defined. The peculiarity of the proposed optimality criterion and algorithms is that the optimization is carried out so as to optimize the entire behavior of the adaptive algorithm, i.e., both the learning transient and the steady-state response. A comparison is made with respect to the model distribution of the robust multiple model adaptive control \(RMMAC\), where the optimization considers only the steady-state ideal response and neglects any learning transient.)
/Title (Algorithms for Optimal Model Distributions in Adaptive Switching Control Schemes)
/Trapped /False
>>
endobj
2 0 obj
<<
/Length 5321
/Subtype /XML
/Type /Metadata
>>
stream
application/pdf
Debarghya Ghosh and Simone Baldi
Several multiple model adaptive control architectures have been proposed in the literature. Despite many advances in theory, the crucial question of how to synthesize the pairs model/controller in a structurally optimal way is to a large extent not addressed. In particular, it is not clear how to place the pairs model/controller is such a way that the properties of the switching algorithm (e.g., number of switches, learning transient, final performance) are optimal with respect to some criteria. In this work, we focus on the so-called multi-model unfalsified adaptive supervisory switching control (MUASSC) scheme; we define a suitable structural optimality criterion and develop algorithms for synthesizing the pairs model/controller in such a way that they are optimal with respect to the structural optimality criterion we defined. The peculiarity of the proposed optimality criterion and algorithms is that the optimization is carried out so as to optimize the entire behavior of the adaptive algorithm, i.e., both the learning transient and the steady-state response. A comparison is made with respect to the model distribution of the robust multiple model adaptive control (RMMAC), where the optimization considers only the steady-state ideal response and neglects any learning transient.
Algorithms for Optimal Model Distributions in Adaptive Switching Control Schemes
2016-03-04T16:12:29+08:00
LaTeX with hyperref package
2016-08-12T14:11:36+02:00
2016-08-12T14:11:36+02:00
adaptive control; multiple model distribution
pdfTeX-1.40.15
False
This is pdfTeX, Version 3.14159265-2.6-1.40.15 (TeX Live 2014/W32TeX) kpathsea version 6.2.0
uuid:e98935e7-d672-493f-852b-2ea45b612088
uuid:50f4a5b0-dcff-4268-bb0c-5909c2014eaf
endstream
endobj
3 0 obj
<<
/Dests 8 0 R
>>
endobj
4 0 obj
<<
/D [9 0 R /FitH]
/S /GoTo
>>
endobj
5 0 obj
<<
/Count 19
/First 10 0 R
/Last 11 0 R
/Type /Outlines
>>
endobj
6 0 obj
<<
/Count 20
/Kids [12 0 R 13 0 R 14 0 R 15 0 R]
/Type /Pages
>>
endobj
8 0 obj
<<
/Kids [16 0 R 17 0 R 18 0 R]
/Limits [(Doc-Start) (theorem.1)]
>>
endobj
9 0 obj
<<
/Annots [19 0 R 20 0 R 21 0 R 22 0 R 23 0 R 24 0 R 25 0 R]
/Contents [26 0 R 27 0 R 28 0 R 29 0 R 30 0 R 31 0 R 32 0 R 33 0 R]
/CropBox [0 0 595.276 841.89]
/MediaBox [0 0 595.276 841.89]
/Parent 12 0 R
/Resources 34 0 R
/Rotate 0
/Type /Page
>>
endobj
10 0 obj
<<
/A 35 0 R
/Next 36 0 R
/Parent 5 0 R
/Title (Introduction)
>>
endobj
11 0 obj
<<
/A 37 0 R
/Parent 5 0 R
/Prev 38 0 R
/Title (Results)
>>
endobj
12 0 obj
<<
/Count 7
/Kids [39 0 R 9 0 R 40 0 R 41 0 R 42 0 R 43 0 R 44 0 R]
/Parent 6 0 R
/Type /Pages
>>
endobj
13 0 obj
<<
/Count 6
/Kids [45 0 R 46 0 R 47 0 R 48 0 R 49 0 R 50 0 R]
/Parent 6 0 R
/Type /Pages
>>
endobj
14 0 obj
<<
/Count 6
/Kids [51 0 R 52 0 R 53 0 R 54 0 R 55 0 R 56 0 R]
/Parent 6 0 R
/Type /Pages
>>
endobj
15 0 obj
<<
/Count 1
/Kids [57 0 R]
/Parent 6 0 R
/Type /Pages
>>
endobj
16 0 obj
<<
/Kids [58 0 R 59 0 R 60 0 R 61 0 R 62 0 R 63 0 R]
/Limits [(Doc-Start) (equation.3.11)]
>>
endobj
17 0 obj
<<
/Kids [64 0 R 65 0 R 66 0 R 67 0 R 68 0 R 69 0 R]
/Limits [(equation.3.12) (page.9)]
>>
endobj
18 0 obj
<<
/Kids [70 0 R 71 0 R 72 0 R 73 0 R]
/Limits [(section.1) (theorem.1)]
>>
endobj
19 0 obj
<<
/A <<
/S /URI
/Type /Action
/URI (http://www.mdpi.com/journal/machines)
>>
/Border [0 0 0]
/C [0 1 1]
/H /I
/Rect [75.539 757.64 208.56 793.648]
/Subtype /Link
/Type /Annot
>>
endobj
20 0 obj
<<
/A <<
/S /URI
/Type /Action
/URI (http://www.mdpi.com)
>>
/Border [0 0 0]
/C [0 1 1]
/H /I
/Rect [478.247 757.64 523.223 793.648]
/Subtype /Link
/Type /Annot
>>
endobj
21 0 obj
<<
/A <<
/D (cite.r07)
/S /GoTo
>>
/Border [0 0 0]
/C [0 1 0]
/H /I
/Rect [418.561 294.986 425.535 303.912]
/Subtype /Link
/Type /Annot
>>
endobj
22 0 obj
<<
/A <<
/D (cite.r03)
/S /GoTo
>>
/Border [0 0 0]
/C [0 1 0]
/H /I
/Rect [498.52 254.458 505.493 263.384]
/Subtype /Link
/Type /Annot
>>
endobj
23 0 obj
<<
/A <<
/D (cite.r03e)
/S /GoTo
>>
/Border [0 0 0]
/C [0 1 0]
/H /I
/Rect [508.582 254.273 515.556 263.384]
/Subtype /Link
/Type /Annot
>>
endobj
24 0 obj
<<
/A <<
/D (cite.r24)
/S /GoTo
>>
/Border [0 0 0]
/C [0 1 0]
/H /I
/Rect [508.316 186.911 515.29 195.837]
/Subtype /Link
/Type /Annot
>>
endobj
25 0 obj
<<
/A <<
/S /URI
/Type /Action
/URI (http://www.mdpi.com/journal/machines)
>>
/Border [0 0 0]
/C [0 1 1]
/H /I
/Rect [392.479 39.132 519.737 49.282]
/Subtype /Link
/Type /Annot
>>
endobj
26 0 obj
<<
/Length 558
/Filter /FlateDecode
>>
stream
HRMs0W3˒mL30-Ĝl.{HHa|Ю}F D&!dh.H gi.:r}RD Gb悈"J C!I%$)ə"Ø eF2PQ9B.juu3LjUx`%%ijٱ%x38!fIweSz{C]~LVԸ8D0ڎǛ]9c7CT0ȅ f.wꒄar{˾mD3y.G`!9;b0EvX4
T]cvh#y}3C9=XBG7ݣx[6s9gu8cVG|&1EsSc*<
e_NnpT_6vs'~2z:YĒT5z{PU/E-Ɉ3Z4aԨK_rLO+}ypHjG Fla. #'
endstream
endobj
27 0 obj
<<
/Length 645
/Filter /FlateDecode
>>
stream
HtSMo0W(c*)?ˊu6`j"<[IѢfv2ItɤuK?MG?v0&Wy`\*NY#XJ{ZR9/E^:{\!bUU\Ԍ,uOĝ>_7:Vl /
߭`ۄ0NI.Z1vgl0|o7SVӽg` ͻ3HtT^ {!jҰ%Y?
eʲJo0in@ gM].8DHTYUVLI{.omzЭȃ!Dk>vdZ;3"~m1ѥڤOX[Sij$,OZp;2@^-4ތ^l$ QзEj
)&ϸv'?<~ %f'9R(\F+8S"k?H]%\9CƳ>fF/ei
Zt`6-7p8~"l9tԭTT@/siY=:^0;mY*dMTIDz:+|:
2=g:iOR-hSxIp6~raף+= bZ
endstream
endobj
28 0 obj
<<
/Length 563
/Filter /FlateDecode
>>
stream
HSM WH
ߠVinMbT_߱'m0op/ϪjhMv'>E͈w? ,/`uV%x(wHՒpqnP#FIo=.ziV6
yfQN=:wyKnU!&tK1!;Z҅;wӾd
bla{eӖ7Y%-GgyE.YpNzz?^(MЋ[%P}
ͫ_R wê휍l3q럷?ohդA]OlTYΫjK!@b0:d&ySқ8Ǭ^*t99@
cfi8U[PQ$. Vlb/5Ymy^-f0"w<ʗ ]a.+4+ՂVF^uo,fi',d0$chq L(jQ;UMEP~0 /H
endstream
endobj
29 0 obj
<<
/Length 544
/Filter /FlateDecode
>>
stream
HtRM0WJ;iA %VΦ bg̼7m;vayU#wIS͝ZQ%Es:gPr!Ųsʬh}'EiQ\p"WOW*KdA,nvZtݧDi*R@@hQ$2"_]U;.o$7agxgg ։Eu:b$PeO sے&)čAI喋uԼbq()dB6!&uFN4jll#\{n:5Mb{ݹP[?]Q
˩g!]9(MC*!
W5p+_ ǙFC$*hpĽLG[!D"G6¾SsF.%C-pK&`iou+9+H(-m}$[ԇ.Cf,A?:Yn7 an]0_ZaG |UG
endstream
endobj
30 0 obj
<<
/Length 576
/Filter /FlateDecode
>>
stream
HSn0+tZǠ@ȥqOIDYD)R)'wajHQ<ΛewsƲbUr
heSGrhlYQϛ!6nO9~P怚'J^