Robust stability for multiple model adaptive control: part II - gain bounds
Robust stability for multiple model adaptive control: part II - gain bounds
The axiomatic development of a wide class of Estimation based Multiple Model Switched Adaptive Control (EMMSAC) algorithms considered in the first part of this two part contribution forms the basis for the proof of the gain bounds given in this paper. The bounds are determined in terms of a cover of the uncertainty set, and in particular, in many instances, are independent of the number of candidate plant models under consideration.The full interpretation, implications and usage of these bounds within design synthesis are discussed in part I. Here in part II, key features of the bounds are also discussed and a simulation example is considered. It is shown that a dynamic EMMSAC design can be universal and hence non-conservative and hence outperforms static EMMSAC and other conservative designs. A wide range of possible dynamic algorithms are outlined, motivated by both performance and implementation considerations.
693-708
Buchstaller, Dominic
a73fb875-97b5-4fd9-a8c8-591efe28636d
French, Mark
22958f0e-d779-4999-adf6-2711e2d910f8
March 2016
Buchstaller, Dominic
a73fb875-97b5-4fd9-a8c8-591efe28636d
French, Mark
22958f0e-d779-4999-adf6-2711e2d910f8
Buchstaller, Dominic and French, Mark
(2016)
Robust stability for multiple model adaptive control: part II - gain bounds.
IEEE Transactions on Automatic Control, 61 (3), .
(doi:10.1109/TAC.2015.2492503).
Abstract
The axiomatic development of a wide class of Estimation based Multiple Model Switched Adaptive Control (EMMSAC) algorithms considered in the first part of this two part contribution forms the basis for the proof of the gain bounds given in this paper. The bounds are determined in terms of a cover of the uncertainty set, and in particular, in many instances, are independent of the number of candidate plant models under consideration.The full interpretation, implications and usage of these bounds within design synthesis are discussed in part I. Here in part II, key features of the bounds are also discussed and a simulation example is considered. It is shown that a dynamic EMMSAC design can be universal and hence non-conservative and hence outperforms static EMMSAC and other conservative designs. A wide range of possible dynamic algorithms are outlined, motivated by both performance and implementation considerations.
Text
journal_B.1.0.pdf
- Accepted Manuscript
More information
Accepted/In Press date: 5 January 2015
e-pub ahead of print date: 15 October 2015
Published date: March 2016
Organisations:
Electronics & Computer Science
Identifiers
Local EPrints ID: 388530
URI: http://eprints.soton.ac.uk/id/eprint/388530
ISSN: 0018-9286
PURE UUID: 9f9101ac-fbb0-4bb3-8d5e-d336f37814b7
Catalogue record
Date deposited: 29 Feb 2016 10:22
Last modified: 14 Mar 2024 22:58
Export record
Altmetrics
Contributors
Author:
Dominic Buchstaller
Author:
Mark French
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics