| 000 | 02975nam a22005055i 4500 | ||
|---|---|---|---|
| 001 | 978-1-84996-453-1 | ||
| 003 | DE-He213 | ||
| 005 | 20140220083737.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 110204s2011 xxk| s |||| 0|eng d | ||
| 020 |
_a9781849964531 _9978-1-84996-453-1 |
||
| 024 | 7 |
_a10.1007/978-1-84996-453-1 _2doi |
|
| 050 | 4 | _aTJ212-225 | |
| 072 | 7 |
_aTJFM _2bicssc |
|
| 072 | 7 |
_aTEC004000 _2bisacsh |
|
| 082 | 0 | 4 |
_a629.8 _223 |
| 100 | 1 |
_aStefanovic, Margareta. _eauthor. |
|
| 245 | 1 | 0 |
_aSafe Adaptive Control _h[electronic resource] : _bData-Driven Stability Analysis and Robust Synthesis / _cby Margareta Stefanovic, Michael G. Safonov. |
| 264 | 1 |
_aLondon : _bSpringer London, _c2011. |
|
| 300 |
_aXII, 148p. 89 illus., 21 illus. in color. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aLecture Notes in Control and Information Sciences, _x0170-8643 ; _v405 |
|
| 505 | 0 | _aIntroduction -- Definitions and Preliminary Facts -- Stability Results -- Generalization to the Time-varying Case -- Switched Adaptive Controller: Robust Synthesis -- Comparison with Other Switching Adaptive Schemes -- Conclusion. | |
| 520 | _aSafe Adaptive Control gives a formal and complete algorithm for assuring the stability of a switched control system when at least one of the available candidate controllers is stabilizing. The possibility of having an unstable switched system even in the presence of a stabilizing candidate controller is demonstrated by referring to several well-known adaptive control approaches, where the system goes unstable when a large mismatch between the unknown plant and the available models exists ("plant-model mismatch instability"). Sufficient conditions for this possibility to be avoided are formulated, and a "recipe" to be followed by the control system designer to guarantee stability and desired performance is provided. The problem is placed in a standard optimization setting. Unlike the finite controller sets considered elsewhere, the candidate controller set is allowed to be continuously parametrized so that it can deal with plants with a very large range of uncertainties. | ||
| 650 | 0 | _aEngineering. | |
| 650 | 0 | _aArtificial intelligence. | |
| 650 | 0 | _aSystems theory. | |
| 650 | 0 | _aMathematical optimization. | |
| 650 | 1 | 4 | _aEngineering. |
| 650 | 2 | 4 | _aControl. |
| 650 | 2 | 4 | _aSystems Theory, Control. |
| 650 | 2 | 4 | _aOptimization. |
| 650 | 2 | 4 | _aArtificial Intelligence (incl. Robotics). |
| 700 | 1 |
_aSafonov, Michael G. _eauthor. |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9781849964524 |
| 830 | 0 |
_aLecture Notes in Control and Information Sciences, _x0170-8643 ; _v405 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-1-84996-453-1 |
| 912 | _aZDB-2-ENG | ||
| 999 |
_c106483 _d106483 |
||