Fault accommodation controller under Markovian jump linear systems with asynchronous modes

Summary We tackle the fault accommodation control (FAC) in the Markovian jump linear system (MJLS) framework for the discrete‐time domain, under the assumption that it is not possible to access the Markov chain mode. This premise brings some challenges since the controllers are no longer allowed to...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of robust and nonlinear control Vol. 30; no. 18; pp. 8503 - 8520
Main Authors Carvalho, L. P., Rosa, T. E., Jayawardhana, B., Costa, O. L. V.
Format Journal Article
LanguageEnglish
Published Bognor Regis Wiley Subscription Services, Inc 01.12.2020
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Summary We tackle the fault accommodation control (FAC) in the Markovian jump linear system (MJLS) framework for the discrete‐time domain, under the assumption that it is not possible to access the Markov chain mode. This premise brings some challenges since the controllers are no longer allowed to depend on the Markov chain, meaning that there is an asynchronism between the system and the controller modes. To tackle this issue, a hidden Markov chain (θ(k), θ^(k)) is used where θ(k) denotes the Markov chain mode, and θ^(k) denotes the estimated mode. The main novelty of this work is the design of ℋ∞ and ℋ2 FAC under the MJLS framework considering partial observation of the Markov chain. Both designs are obtained via bilinear matrix inequalities optimization problems, which are solved using coordinate descent algorithm. As secondary results, we present simulations using a two‐degree of freedom serial flexible joint robot to illustrate the viability of the proposed approach.
Bibliography:Funding information
Conselho Nacional de Desenvolvimento Científico e Tecnológico, 465755/2014‐3; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior, 88882.333365/2019‐01; Fundação de Amparo à Pesquisa do Estado de São Paulo, 2014/50279‐ 4; 304149/2019‐5
ISSN:1049-8923
1099-1239
DOI:10.1002/rnc.5252