Please use this identifier to cite or link to this item:
Title: Evaluation of identifier based and & non-identifier based adaptive supervisory & control using a benchmark example
Authors: Ioannou, Petros 
Baldi, Simone
Mosca, Edoardo
Keywords: Adaptive control schemes
Adaptive switching
Asymptotic performance
Candidate controllers
Extensive simulations
Finite time
Mixing control
Performance properties
Positive features
Prior information
Robust multiple model adaptive controls
Switching logic
Uncertain plants
Adaptive control systems
Feature extraction
Signal processing
Switching systems
Issue Date: 2010
Publisher: IEEE
Source: 4th International Symposium on Communications, Control, and Signal Processing, Limassol, Cyprus, 3-5 March 2010
Abstract: Several classes of identifier and non-identifier based adaptive control schemes using a supervisory switching logic have been proposed in the literature. These schemes are based on different assumptions and claim to guarantee certain stability and performance properties. The purpose of this paper is to clarify what each algorithm guarantess in theory and how it performs in simulations. The identifier based schemes: Robust Multiple Model Adaptive Control (RMMAC) and Adaptive Mixing Control (AMC) and the non-identifier based schemes: Unfalsified Adaptive Switching Control (UASC) and Multi-model Unfalsified Adaptive Switching Control (MUASC). For each scheme we present the basic features of the algorithm and state the stability and performance guaranteed in theory. The benchmark example of [1] is used to test the stability and performance properties of the schemes considered using extensive simulations. Our results show that the identifier based schemes require some knowledge about the plant whereas the non identifier based do not. The identifier based schemes however typically perform better than non-identifier based schemes when all the plant assumptions are satisfied, and can guarantee, from a theory viewpoint, at least for the AMC scheme, transient and asymptotic performance. The main positive feature the UASC and MUASC schemes is that, even in the absence of any prior information on the uncertain plant, they can select in finite time a final controller yielding, a finite affine gain from the reference to the data, under the minimal conceivable requirement, viz. the existence of a stabilizing candidate controller in the candidate controller set.
DOI: 10.1109/ISCCSP.2010.5463454
Rights: ©2010 IEEE
Appears in Collections:Δημοσιεύσεις σε συνέδρια/Conference papers

Show full item record

Page view(s)

Last Week
Last month
checked on Jul 23, 2017

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.