﻿<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD with MathML3 v1.2 20190208//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd">
<article
    xmlns:mml="http://www.w3.org/1998/Math/MathML"
    xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research-article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">JAIBD</journal-id>
      <journal-title-group>
        <journal-title>Journal of Artificial Intelligence and Big Data</journal-title>
      </journal-title-group>
      <issn pub-type="epub"></issn>
      <issn pub-type="ppub"></issn>
      <publisher>
        <publisher-name>Trend Research Publishing</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.31586/jaibd.2021.059</article-id>
      <article-id pub-id-type="publisher-id">JAIBD-59</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>
          Active Fault Tolerant Control of Faulty Uncertain Neutral Time-Delay Systems
        </article-title>
      </title-group>
      <contrib-group>
<contrib contrib-type="author">
<name>
<surname>Rabeb</surname>
<given-names>Benjemaa</given-names>
</name>
<xref rid="af1" ref-type="aff">1</xref>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Aicha</surname>
<given-names>Elhsoumi</given-names>
</name>
<xref rid="af2" ref-type="aff">2</xref>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Saloua</surname>
<given-names>Bel Hadj Ali</given-names>
</name>
<xref rid="af2" ref-type="aff">2</xref>
<xref rid="cr1" ref-type="corresp">*</xref>
</contrib>
      </contrib-group>
<aff id="af1"><label>1</label> Gabes University: MACS LR16ES22, National Engineering school of Gabes, 6029, Tunisia</aff>
<aff id="af2"><label>2</label> ElManar University, Preparatory Institute for Engineering studies-ElManar, 1068, Tunisia</aff>
<aff id="af3"><label>3</label>*Correspondence: Saloua.belhadjali@enit.rnu.tn;</aff>
<aff id="af4"><label>4</label></aff>
<author-notes>
<corresp id="c1">
<label>*</label>Corresponding author at: ElManar University, Preparatory Institute for Engineering studies-ElManar, 1068, Tunisia
</corresp>
</author-notes>
      <pub-date pub-type="epub">
        <day>04</day>
        <month>09</month>
        <year>2021</year>
      </pub-date>
      <volume>1</volume>
      <issue>1</issue>
      <history>
        <date date-type="received">
          <day>04</day>
          <month>09</month>
          <year>2021</year>
        </date>
        <date date-type="rev-recd">
          <day>04</day>
          <month>09</month>
          <year>2021</year>
        </date>
        <date date-type="accepted">
          <day>04</day>
          <month>09</month>
          <year>2021</year>
        </date>
        <date date-type="pub">
          <day>04</day>
          <month>09</month>
          <year>2021</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>&#xa9; Copyright 2021 by authors and Trend Research Publishing Inc. </copyright-statement>
        <copyright-year>2021</copyright-year>
        <license license-type="open-access" xlink:href="http://creativecommons.org/licenses/by/4.0/">
          <license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p>
        </license>
      </permissions>
      <abstract>
        The present paper attempts to investigate the problem of Fault Tolerant Control for a class of uncertain neutral time delay systems. In the first time, we consider an additive control that is based on adding a term to the nominal law when the fault occurs. This approach will be designed in three steps. The first step is fault detection while the second one is fault estimation. For these two steps, we consider the adaptive observer to guarantee the detection and estimation of the fault. The third step is the fault compensation. Lyapunov method and Linear Matrix Inequality (LMI) techniques were considered to improve the main method. Second, we propose a Pseudo Inverse Method "PIM" and determine the error between the closed loop and the nominal system. Finally, simulation results are presented to prove the theoretical development for an example of an uncertain neutral time delay system.
      </abstract>
      <kwd-group>
        <kwd-group><kwd>Uncertain neutral time delay system</kwd>
<kwd>Active Fault Tolerant Control (AFTC)</kwd>
<kwd>LMIs</kwd>
<kwd>additive control</kwd>
<kwd>PIM.</kwd>
</kwd-group>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec1">
<title>Introduction</title><p>In recent years, there has been a burst of research activities in the area of time-delay control systems [
<xref ref-type="bibr" rid="R1">1</xref>,<xref ref-type="bibr" rid="R2">2</xref>,<xref ref-type="bibr" rid="R3">3</xref>].</p>
<p>Time delay systems can be classified into two different categories: the first one expressed by retarded functional differential equations (RFDE) and the second one described by neutral functional differential equations (NFDE).</p>
<p>The presence of delays more precisely for neutral time-delay system induces poor performance and instability in closed-loop systems. Furthermore, some faults can be occur during the system operation.</p>
<p>Fault is understood as any sort of malfunction that occurs in actuator, sensor or process level and that leads to any deviation from the nominal condition.</p>
<p>The system treated in this work has the particularity of the uncertain elements.</p>
<p>Uncertain RFDE systems have been studied in [
<xref ref-type="bibr" rid="R1">1</xref>,<xref ref-type="bibr" rid="R3">3</xref>,<xref ref-type="bibr" rid="R4">4</xref>,<xref ref-type="bibr" rid="R9">9</xref>,<xref ref-type="bibr" rid="R10">10</xref>]. Their objective was to determine the stability and control of this type of system.</p>
<p>Uncertain NFDE systems have been studied in [
<xref ref-type="bibr" rid="R8">8</xref>,<xref ref-type="bibr" rid="R11">11</xref>] to achieve the adaptive robust control. </p>
<p>Benjemaa, R.; and al. in [
<xref ref-type="bibr" rid="R1">1</xref>] studied the stability and active fault tolerant control for a class of certain neutral time delay systems; this work is a continuity of [
<xref ref-type="bibr" rid="R1">1</xref>] such that, we will consider the neutral time delay systems with parametric uncertainty and we will compare two methods of active fault tolerant control.</p>
<p>The presence of parametric uncertainty, which can cause important error in system parameters identification, guide to more complexity of the system model. Thus, neutral variable time-delay and parameter uncertainty are sources of the oscillation generation, instability and poor performance.</p>
<p>An adaptive robust control scheme was proposed in [
<xref ref-type="bibr" rid="R7">7</xref>] to stabilize uncertain neutral time-delay systems, as well as in [
<xref ref-type="bibr" rid="R8">8</xref>]. The authors proposed an adaptive Robust control of uncertain neutral time-delay systems.</p>
<p>However, the main drawback of this work is that it assumes the delayed state of the system in the adaptive process.</p>
<p>In this article, the uncertain neutral time-delay systems are studied, and a new active fault-tolerant control is proposed to this type of system.</p>
<p>The comparison between additive and PIM control for uncertain neutral time delay systems is the principal contribution of this paper.</p>
<p>First, the additive control approach (AFTC) will be presented. The main idea of this control is based on adding a term to the nominal control law when the fault occurs, to compensate the fault effect.</p>
<p>Second, the Pseudo-Inverse Method (PIM) will be designed for this type of system based on the error determination between the closed loop system and the nominal one.</p>
<p>The remainder of the paper is organized as follows. The problems statement is given in section 2. In section 3, the main results of the AFTC are presented; the method of additive control (fault detection, estimation and fault compensation) and the PIM, for uncertain neutral time-delay systems.</p>
<p>Simulation results are presented in section 4 to demonstrate the efficacy of the proposed method and finally, some concluding remarks are drawn in section 5.</p>
<p><bold>Notation:</bold></p>
<p>Let us consider the following notations used in this paper.</p>
<p><math> <semantics>  <mrow>   <msup>    <mi>R</mi>    <mi>n</mi>   </msup>   </mrow>   </semantics></math> is the n-dimensional Euclidean space <math> <semantics>  <mrow>   <msup>    <mi>R</mi>    <mrow>     <mi>n</mi><mo>&#x00D7;</mo><mi>m</mi></mrow>   </msup>   </mrow>   </semantics></math> is the space of all real matrices, and the superscript "T" denotes the transpose and LMI denote Linear Matrix Inequality. I is the identity matrix of appropriate dimension. "*" denote the transposed elements in the symmetric position.</p>
</sec><sec id="sec2">
<title>Problems Statement</title><p>Consider a class of linear uncertain neutral time delay systems described by the following state space equation:</p>

<disp-formula id="FD1"><label>(1)</label><math> <semantics>  <mrow>   <mrow><mo>{</mo> <mtable columnalign='left'>    <mtr>     <mtd>      <mover>       <mrow>        <mover>         <mi>&#x03BE;</mi>         <mo>.</mo>        </mover>        <mo>=</mo><mrow><mo>(</mo>         <mrow>          <msub>           <mi>A</mi>           <mn>0</mn>          </msub>          <mo>+</mo><mi>&#x0394;</mi><msub>           <mi>A</mi>           <mn>0</mn>          </msub>          </mrow>        <mo>)</mo></mrow><mi>&#x03BE;</mi><mrow><mo>(</mo>         <mi>t</mi>        <mo>)</mo></mrow><mo>+</mo><mrow><mo>(</mo>         <mrow>          <msub>           <mi>A</mi>           <mn>1</mn>          </msub>          <mo>+</mo><mi>&#x0394;</mi><msub>           <mi>A</mi>           <mn>1</mn>          </msub>          </mrow>        <mo>)</mo></mrow><mi>&#x03BE;</mi><mrow><mo>(</mo>         <mrow>          <mi>t</mi><mo>&#x2212;</mo><mi>h</mi></mrow>        <mo>)</mo></mrow><mo>+</mo><mrow><mo>(</mo>         <mrow>          <msub>           <mi>A</mi>           <mn>2</mn>          </msub>          <mo>+</mo><mi>&#x0394;</mi><msub>           <mi>A</mi>           <mn>2</mn>          </msub>          </mrow>        <mo>)</mo></mrow><mover>         <mi>&#x03BE;</mi>         <mo>.</mo>        </mover>        <mrow><mo>(</mo>         <mrow>          <mi>t</mi><mo>&#x2212;</mo><mi>d</mi></mrow>        <mo>)</mo></mrow><mo>+</mo><mrow><mo>(</mo>         <mrow>          <mi>B</mi><mo>+</mo><mi>&#x0394;</mi><mi>B</mi></mrow>        <mo>)</mo></mrow><mi>u</mi><mrow><mo>(</mo>         <mi>t</mi>        <mo>)</mo></mrow></mrow>       <mrow></mrow>      </mover>           </mtd>    </mtr>    <mtr>     <mtd>      <mi>y</mi><mrow><mo>(</mo>       <mi>t</mi>      <mo>)</mo></mrow><mo>=</mo><mi>C</mi><mi>&#x03BE;</mi><mrow><mo>(</mo>       <mi>t</mi>      <mo>)</mo></mrow>     </mtd>    </mtr>    <mtr>     <mtd>      <mi>&#x03BE;</mi><mrow><mo>(</mo>       <mi>t</mi>      <mo>)</mo></mrow><mo>=</mo><mi>&#x03C6;</mi><mrow><mo>(</mo>       <mi>t</mi>      <mo>)</mo></mrow><mo>;</mo><mtext>&#x00A0;t</mtext><mo>&#x2208;</mo><mrow><mo>[</mo> <mrow>       <mo>&#x2212;</mo><mi>&#x03C4;</mi><mo>,</mo><mn>0</mn></mrow> <mo>]</mo></mrow>     </mtd>    </mtr>   </mtable>    </mrow></mrow>   </semantics></math></disp-formula><p>Where <math> <semantics>  <mrow>   <mi>&#x03BE;</mi><mrow><mo>(</mo>    <mi>t</mi>   <mo>)</mo></mrow><mo>&#x2208;</mo><msup>    <mi>R</mi>    <mi>n</mi>   </msup>   </mrow>   </semantics></math> is the state vector, <math> <semantics>  <mrow>   <mi>u</mi><mo stretchy='false'>(</mo><mi>t</mi><mo stretchy='false'>)</mo><mo>&#x2208;</mo><msup>    <mi>R</mi>    <mi>m</mi>   </msup>   </mrow>   </semantics></math> is the input vector, <math> <semantics>  <mrow>   <mi>y</mi><mo stretchy='false'>(</mo><mi>t</mi><mo stretchy='false'>)</mo><mo>&#x2208;</mo><msup>    <mi>R</mi>    <mi>p</mi>   </msup>   </mrow>   </semantics></math>is the output vector. h>0 and d>0 are respectively state and its derivative delay.</p>
<p><math> <semantics>  <mrow>   <msub>    <mtext>A</mtext>    <mn>0</mn>   </msub>   </mrow>   </semantics></math>,<math> <semantics>  <mrow>   <msub>    <mtext>A</mtext>    <mn>1</mn>   </msub>   </mrow>   </semantics></math>,<math> <semantics>  <mrow>   <msub>    <mtext>A</mtext>    <mn>2</mn>   </msub>   </mrow>   </semantics></math>, B and C are constant matrices with appropriate dimensions. <math> <semantics>  <mrow>   <mi>&#x0394;</mi><msub>    <mi>A</mi>    <mn>0</mn>   </msub>   </mrow>   </semantics></math>,<math> <semantics>  <mrow>   <mi>&#x0394;</mi><msub>    <mi>A</mi>    <mn>1</mn>   </msub>   </mrow>   </semantics></math>, <math> <semantics>  <mrow>   <mi>&#x0394;</mi><msub>    <mi>A</mi>    <mn>2</mn>   </msub>   </mrow>   </semantics></math> and <math> <semantics>  <mrow>   <mi>&#x0394;</mi><mi>B</mi></mrow>   </semantics></math>are matrix-valued functions representing the parameter uncertainties in the system model; and <math> <semantics>  <mrow>   <mi>&#x03C6;</mi><mo stretchy='false'>(</mo><mi>t</mi><mo stretchy='false'>)</mo></mrow>   </semantics></math> is a given continuous vector valued initial function.</p>
<p>The parameter uncertainties considered here are assumed that:</p>

<inline-formula><math> <semantics>  <mrow>   <mtable>    <mtr>     <mtd>      <mrow>       <mi>&#x0394;</mi><msub>        <mi>A</mi>        <mn>0</mn>       </msub>       <mo>=</mo><msub>        <mi>J</mi>        <mn>1</mn>       </msub>       <mi>&#x03B4;</mi><msub>        <mi>W</mi>        <mn>1</mn>       </msub>       </mrow>     </mtd>    </mtr>    <mtr>     <mtd>      <mrow>       <mi>&#x0394;</mi><msub>        <mi>A</mi>        <mn>1</mn>       </msub>       <mo>=</mo><msub>        <mi>J</mi>        <mn>2</mn>       </msub>       <mi>&#x03B4;</mi><msub>        <mi>W</mi>        <mn>2</mn>       </msub>       </mrow>     </mtd>    </mtr>    <mtr>     <mtd>      <mrow>       <mi>&#x0394;</mi><msub>        <mi>A</mi>        <mn>2</mn>       </msub>       <mo>=</mo><msub>        <mi>J</mi>        <mn>3</mn>       </msub>       <mi>&#x03B4;</mi><msub>        <mi>W</mi>        <mn>3</mn>       </msub>       </mrow>     </mtd>    </mtr>    <mtr>     <mtd>      <mrow>       <mi>&#x0394;</mi><mi>B</mi><mo>=</mo><msub>        <mi>J</mi>        <mn>4</mn>       </msub>       <mi>&#x03B4;</mi><msub>        <mi>W</mi>        <mn>4</mn>       </msub>       </mrow>     </mtd>    </mtr>       </mtable></mrow>   </semantics></math></inline-formula><p>Where: <math> <semantics>  <mrow>   <msub>    <mi>J</mi>    <mn>1</mn>   </msub>   </mrow>   </semantics></math>, <math> <semantics>  <mrow>   <msub>    <mi>J</mi>    <mn>2</mn>   </msub>   </mrow>   </semantics></math>, <math> <semantics>  <mrow>   <msub>    <mi>J</mi>    <mn>3</mn>   </msub>   </mrow>   </semantics></math>, <math> <semantics>  <mrow>   <msub>    <mi>J</mi>    <mn>4</mn>   </msub>   </mrow>   </semantics></math>, <math> <semantics>  <mrow>   <msub>    <mi>W</mi>    <mn>1</mn>   </msub>   </mrow>   </semantics></math>, <math> <semantics>  <mrow>   <msub>    <mi>W</mi>    <mn>2</mn>   </msub>   </mrow>   </semantics></math>, <math> <semantics>  <mrow>   <msub>    <mi>W</mi>    <mn>3</mn>   </msub>   </mrow>   </semantics></math>, <math> <semantics>  <mrow>   <msub>    <mi>W</mi>    <mn>4</mn>   </msub>   </mrow>   </semantics></math> and <math> <semantics>  <mi>&#x03B4;</mi>   </semantics></math> are constant matrices with appropriate dimensions.</p>
<p>Consider the uncertain neutral delay system affected by actuator fault:</p>

<disp-formula id="FD2"><label>(2)</label><math> <semantics>  <mrow>   <mrow><mo>{</mo> <mtable columnalign='left'>    <mtr>     <mtd>      <mover>       <mtable columnalign='left'>        <mtr>         <mtd>          <mover>           <mi>&#x03BE;</mi>           <mo>.</mo>          </mover>          <mo>=</mo><mrow><mo>(</mo>           <mrow>            <msub>             <mi>A</mi>             <mn>0</mn>            </msub>            <mo>+</mo><mi>&#x0394;</mi><msub>             <mi>A</mi>             <mn>0</mn>            </msub>            </mrow>          <mo>)</mo></mrow><mi>&#x03BE;</mi><mrow><mo>(</mo>           <mi>t</mi>          <mo>)</mo></mrow><mo>+</mo><mrow><mo>(</mo>           <mrow>            <msub>             <mi>A</mi>             <mn>1</mn>            </msub>            <mo>+</mo><mi>&#x0394;</mi><msub>             <mi>A</mi>             <mn>1</mn>            </msub>            </mrow>          <mo>)</mo></mrow><mi>&#x03BE;</mi><mrow><mo>(</mo>           <mrow>            <mi>t</mi><mo>&#x2212;</mo><mi>h</mi></mrow>          <mo>)</mo></mrow><mo>+</mo><mrow><mo>(</mo>           <mrow>            <msub>             <mi>A</mi>             <mn>2</mn>            </msub>            <mo>+</mo><mi>&#x0394;</mi><msub>             <mi>A</mi>             <mn>2</mn>            </msub>            </mrow>          <mo>)</mo></mrow><mover>           <mi>&#x03BE;</mi>           <mo>.</mo>          </mover>          <mrow><mo>(</mo>           <mrow>            <mi>t</mi><mo>&#x2212;</mo><mi>d</mi></mrow>          <mo>)</mo></mrow>         </mtd>        </mtr>        <mtr>         <mtd>          <mtext>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;</mtext><mo>+</mo><mrow><mo>(</mo>           <mrow>            <mi>B</mi><mo>+</mo><mi>&#x0394;</mi><mi>B</mi></mrow>          <mo>)</mo></mrow><mi>u</mi><mrow><mo>(</mo>           <mi>t</mi>          <mo>)</mo></mrow><mo>+</mo><mi>F</mi><mi>f</mi><mrow><mo>(</mo>           <mi>t</mi>          <mo>)</mo></mrow>         </mtd>        </mtr>       </mtable>              <mrow></mrow>      </mover>           </mtd>    </mtr>    <mtr>     <mtd>      <mi>y</mi><mrow><mo>(</mo>       <mi>t</mi>      <mo>)</mo></mrow><mo>=</mo><mi>C</mi><mi>&#x03BE;</mi><mrow><mo>(</mo>       <mi>t</mi>      <mo>)</mo></mrow>     </mtd>    </mtr>    <mtr>     <mtd>      <mi>&#x03BE;</mi><mrow><mo>(</mo>       <mn>0</mn>      <mo>)</mo></mrow><mo>=</mo><msub>       <mi>&#x03BE;</mi>       <mn>0</mn>      </msub>      <mo>;</mo><mtext>&#x00A0;t</mtext><mo>&#x2264;</mo><mtext>0</mtext>     </mtd>    </mtr>   </mtable>    </mrow></mrow>   </semantics></math></disp-formula><p>Where F is a constant matrix with appropriate dimensions and f (t) is actuator fault.</p>
<p>The presence of fault causes system damage. However, two fault tolerant control (FTC) approaches are proposed for uncertain neutral time delay systems possessing the ability to maintain nominal targets despite the presence of a fault.</p>
</sec><sec id="sec3">
<title>Main results</title><p>In this section, the two methods, as detailed in introduction are considered to design the FTC for the system (2).</p>
<title><i>3.1. Additive Control</i></title><title>3.1.1. Fault detection and estimation</title><p>Considering the system (2). As a first step, the following adaptive observer is used to detect the actuator fault:</p>

<disp-formula id="FD3"><label>(3)</label><math> <semantics>  <mrow>   <mrow><mo>{</mo> <mtable columnalign='left'>    <mtr>     <mtd>      <msub>       <mi>&#x03BE;</mi>       <mi>m</mi>      </msub>      <mrow><mo>(</mo>       <mi>t</mi>      <mo>)</mo></mrow><mo>=</mo><msub>       <mi>A</mi>       <mn>0</mn>      </msub>      <msub>       <mi>&#x03BE;</mi>       <mi>m</mi>      </msub>      <mrow><mo>(</mo>       <mrow>        <mi>t</mi><mo>&#x2212;</mo><mi>h</mi></mrow>      <mo>)</mo></mrow><mo>+</mo><msub>       <mi>A</mi>       <mn>2</mn>      </msub>      <msub>       <mi>&#x03BE;</mi>       <mi>m</mi>      </msub>      <mrow><mo>(</mo>       <mrow>        <mi>t</mi><mo>&#x2212;</mo><mi>d</mi></mrow>      <mo>)</mo></mrow><mo>+</mo><mi>B</mi><mi>u</mi><mrow><mo>(</mo>       <mi>t</mi>      <mo>)</mo></mrow>     </mtd>    </mtr>    <mtr>     <mtd>      <mtext>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;+L</mtext><mrow><mo>(</mo>       <mrow>        <mi>y</mi><mrow><mo>(</mo>         <mi>t</mi>        <mo>)</mo></mrow><mo>&#x2212;</mo><msub>         <mi>y</mi>         <mi>m</mi>        </msub>        <mrow><mo>(</mo>         <mi>t</mi>        <mo>)</mo></mrow></mrow>      <mo>)</mo></mrow><mo>+</mo><mi>H</mi><mrow><mo>(</mo>       <mrow>        <mi>y</mi><mrow><mo>(</mo>         <mrow>          <mi>t</mi><mo>&#x2212;</mo><mi>h</mi></mrow>        <mo>)</mo></mrow><mo>&#x2212;</mo><msub>         <mi>y</mi>         <mi>m</mi>        </msub>        <mrow><mo>(</mo>         <mrow>          <mi>t</mi><mo>&#x2212;</mo><mi>h</mi></mrow>        <mo>)</mo></mrow></mrow>      <mo>)</mo></mrow>     </mtd>    </mtr>    <mtr>     <mtd>      <msub>       <mi>y</mi>       <mi>m</mi>      </msub>      <mrow><mo>(</mo>       <mi>t</mi>      <mo>)</mo></mrow><mo>=</mo><mi>C</mi><msub>       <mi>&#x03BE;</mi>       <mi>m</mi>      </msub>      <mrow><mo>(</mo>       <mi>t</mi>      <mo>)</mo></mrow>     </mtd>    </mtr>    <mtr>     <mtd>      <mi>&#x03BE;</mi><mrow><mo>(</mo>       <mn>0</mn>      <mo>)</mo></mrow><mo>=</mo><msub>       <mi>&#x03BE;</mi>       <mn>0</mn>      </msub>      <mo>;</mo><mi>t</mi><mo>&#x2264;</mo><mn>0</mn>     </mtd>    </mtr>   </mtable>    </mrow></mrow>   </semantics></math></disp-formula><p>Where <math> <semantics>  <mrow>   <msub>    <mi>&#x03BE;</mi>    <mi>m</mi>   </msub>   <mo stretchy='false'>(</mo><mi>t</mi><mo stretchy='false'>)</mo><mo>&#x2208;</mo><msup>    <mi>R</mi>    <mi>n</mi>   </msup>   </mrow>   </semantics></math> and <math> <semantics>  <mrow>   <msub>    <mi>y</mi>    <mi>m</mi>   </msub>   <mo stretchy='false'>(</mo><mi>t</mi><mo stretchy='false'>)</mo><mo>&#x2208;</mo><msup>    <mi>R</mi>    <mi>p</mi>   </msup>   </mrow>   </semantics></math> denote respectively, the state and the output vector of the observer.</p>
<p>V: The residue weight.</p>
<p>The model error and residual are defined as follows:</p>

<disp-formula id="FD4"><label>(4)</label></disp-formula><p>To calculate L and H; we consider the following theorem:</p>
<p><bold>Theorem 1.[
<xref ref-type="bibr" rid="R1">1</xref>]</bold></p>
<p>Given scalar h>0, considering the following Linear Matrix Inequality such that, if there exist symmetric positive definite matrices P,  Q,  W, <math> <semantics>  <mrow>   <msub>    <mi>Z</mi>    <mn>1</mn>   </msub>   </mrow>   </semantics></math>, <math> <semantics>  <mrow>   <msub>    <mi>Z</mi>    <mn>2</mn>   </msub>   </mrow>   </semantics></math>, <math> <semantics>  <mrow>   <msub>    <mi>Z</mi>    <mn>3</mn>   </msub>   </mrow>   </semantics></math> ,  G <math> <semantics>  <mrow>   <mo>&#x2208;</mo><msup>    <mi>R</mi>    <mrow>     <mi>n</mi><mo>*</mo><mi>n</mi></mrow>   </msup>   </mrow>   </semantics></math>, and <math> <semantics>  <mrow>   <msub>    <mi>Y</mi>    <mn>1</mn>   </msub>   </mrow>   </semantics></math>, <math> <semantics>  <mrow>   <msub>    <mi>Y</mi>    <mn>2</mn>   </msub>   </mrow>   </semantics></math> <math> <semantics>  <mrow>   <mo>&#x2208;</mo><msup>    <mi>R</mi>    <mrow>     <mi>n</mi><mo>*</mo><mi>p</mi></mrow>   </msup>   </mrow>   </semantics></math>, <math> <semantics>  <mrow>   <msub>    <mi>M</mi>    <mi>i</mi>   </msub>   </mrow>   </semantics></math>,  <math> <semantics>  <mrow>   <msub>    <mi>N</mi>    <mi>i</mi>   </msub>   </mrow>   </semantics></math> <math> <semantics>  <mrow>   <mo>&#x2208;</mo><msup>    <mi>R</mi>    <mrow>     <mi>n</mi><mo>*</mo><mi>n</mi></mrow>   </msup>   </mrow>   </semantics></math>,  i=1,..,4, such that:</p>

<disp-formula id="FD5"><label>(5)</label></disp-formula><p>Where:</p>

<inline-formula><math> <semantics>  <mtable columnalign='left'>   <mtr>    <mtd>     <msub>      <mi>&#x03D5;</mi>      <mrow>       <mn>22</mn></mrow>     </msub>     <mo>=</mo><mo>&#x2212;</mo><msubsup>      <mi>A</mi>      <mn>2</mn>      <mi>T</mi>     </msubsup>     <mi>P</mi><msub>      <mi>A</mi>      <mn>1</mn>     </msub>     <mo>&#x2212;</mo><msubsup>      <mi>A</mi>      <mn>1</mn>      <mi>T</mi>     </msubsup>     <mi>P</mi><msub>      <mi>A</mi>      <mn>2</mn>     </msub>     <mo>+</mo><msubsup>      <mi>A</mi>      <mn>2</mn>      <mi>T</mi>     </msubsup>     <msub>      <mi>Y</mi>      <mn>2</mn>     </msub>     <mi>C</mi><mo>+</mo><msup>      <mi>C</mi>      <mi>T</mi>     </msup>     <msubsup>      <mi>Y</mi>      <mn>2</mn>      <mi>T</mi>     </msubsup>     <msub>      <mi>A</mi>      <mn>2</mn>     </msub>     <mo>&#x2212;</mo><mi>Q</mi><mo>+</mo><mi>W</mi><mo>&#x2212;</mo><msub>      <mi>M</mi>      <mn>2</mn>     </msub>     <mo>&#x2212;</mo><msubsup>      <mi>M</mi>      <mn>2</mn>      <mi>T</mi>     </msubsup>     <mo>&#x2212;</mo><msub>      <mi>N</mi>      <mn>2</mn>     </msub>     <mo stretchy='false'>(</mo><msub>      <mi>A</mi>      <mn>2</mn>     </msub>     <mo>+</mo><mi>I</mi><mo stretchy='false'>)</mo>    </mtd>   </mtr>   <mtr>    <mtd>     <mo>&#x2212;</mo><msup>      <mrow><mo>(</mo>       <mrow>        <msub>         <mi>A</mi>         <mn>2</mn>        </msub>        <mo>+</mo><mi>I</mi></mrow>      <mo>)</mo></mrow>      <mi>T</mi>     </msup>     <msubsup>      <mi>N</mi>      <mn>2</mn>      <mi>T</mi>     </msubsup>         </mtd>   </mtr>  </mtable>     </semantics></math></inline-formula>
<inline-formula><math> <semantics>  <mrow>   <msub>    <mi>&#x03D5;</mi>    <mrow>     <mn>23</mn></mrow>   </msub>   <mo>=</mo><mo>&#x2212;</mo><msubsup>    <mi>M</mi>    <mn>3</mn>    <mi>T</mi>   </msubsup>   <mo>+</mo><msub>    <mi>N</mi>    <mn>2</mn>   </msub>   <msub>    <mi>A</mi>    <mn>2</mn>   </msub>   <mo>&#x2212;</mo><msup>    <mrow>     <mrow><mo>(</mo>      <mrow>       <msub>        <mi>A</mi>        <mn>2</mn>       </msub>       <mo>+</mo><mi>I</mi></mrow>     <mo>)</mo></mrow></mrow>    <mi>T</mi>   </msup>   <msubsup>    <mi>N</mi>    <mn>3</mn>    <mi>T</mi>   </msubsup>   </mrow>   </semantics></math></inline-formula>
<inline-formula><math> <semantics>  <mrow>   <msub>    <mi>&#x03D5;</mi>    <mrow>     <mn>24</mn></mrow>   </msub>   <mo>=</mo><mo>&#x2212;</mo><msubsup>    <mi>M</mi>    <mn>4</mn>    <mi>T</mi>   </msubsup>   <mo>&#x2212;</mo><msup>    <mrow>     <mrow><mo>(</mo>      <mrow>       <msub>        <mi>A</mi>        <mn>2</mn>       </msub>       <mo>+</mo><mi>I</mi></mrow>     <mo>)</mo></mrow></mrow>    <mi>T</mi>   </msup>   <msubsup>    <mi>N</mi>    <mn>4</mn>    <mi>T</mi>   </msubsup>   </mrow>   </semantics></math></inline-formula>
<inline-formula><math> <semantics>  <mtable columnalign='left'>   <mtr>    <mtd>     <msub>      <mi>&#x03D5;</mi>      <mrow>       <mn>25</mn></mrow>     </msub>     <mo>=</mo><mo>&#x2212;</mo><msubsup>      <mi>A</mi>      <mn>2</mn>      <mi>T</mi>     </msubsup>     <mi>P</mi><mi>F</mi><mo>&#x2212;</mo><msubsup>      <mi>A</mi>      <mn>1</mn>      <mi>T</mi>     </msubsup>     <mi>P</mi><mi>F</mi><mo>+</mo><msup>      <mi>C</mi>      <mi>T</mi>     </msup>     <msubsup>      <mi>Y</mi>      <mn>2</mn>      <mi>T</mi>     </msubsup>     <mi>F</mi>    </mtd>   </mtr>   <mtr>    <mtd>     <msub>      <mi>&#x03D5;</mi>      <mrow>       <mn>28</mn></mrow>     </msub>     <mo>=</mo><msubsup>      <mi>A</mi>      <mn>1</mn>      <mi>T</mi>     </msubsup>     <mi>P</mi><mo>&#x2212;</mo><msup>      <mi>C</mi>      <mi>T</mi>     </msup>     <msubsup>      <mi>Y</mi>      <mn>2</mn>      <mi>T</mi>     </msubsup>         </mtd>   </mtr>   <mtr>    <mtd>     <msub>      <mi>&#x03D5;</mi>      <mrow>       <mn>29</mn></mrow>     </msub>     <mo>=</mo><msub>      <mi>&#x03D5;</mi>      <mrow>       <mn>210</mn></mrow>     </msub>     <mo>=</mo><mi>h</mi><msubsup>      <mi>A</mi>      <mn>2</mn>      <mi>T</mi>     </msubsup>     <mi>P</mi><mo>&#x2212;</mo><mi>h</mi><msup>      <mi>C</mi>      <mi>T</mi>     </msup>     <msubsup>      <mi>Y</mi>      <mn>2</mn>      <mi>T</mi>     </msubsup>         </mtd>   </mtr>   <mtr>    <mtd>     <msub>      <mi>&#x03D5;</mi>      <mrow>       <mn>33</mn></mrow>     </msub>     <mo>=</mo><mo>&#x2212;</mo><mi>W</mi><mo>+</mo><msub>      <mi>N</mi>      <mn>3</mn>     </msub>     <msub>      <mi>A</mi>      <mn>2</mn>     </msub>     <mo>+</mo><msubsup>      <mi>A</mi>      <mn>2</mn>      <mi>T</mi>     </msubsup>     <msubsup>      <mi>N</mi>      <mn>3</mn>      <mi>T</mi>     </msubsup>         </mtd>   </mtr>   <mtr>    <mtd>     <msub>      <mi>&#x03D5;</mi>      <mrow>       <mn>55</mn></mrow>     </msub>     <mo>=</mo><mo>&#x2212;</mo><mn>2</mn><msup>      <mi>F</mi>      <mi>T</mi>     </msup>     <mi>P</mi><mi>F</mi><mo>+</mo><mi>G</mi>    </mtd>   </mtr>  </mtable>     </semantics></math></inline-formula><p>Then:</p>

<disp-formula id="FD6"><label>(6)</label><math> <semantics>  <mrow>   <msub>    <mtext>Y</mtext>    <mn>1</mn>   </msub>   <mtext>&#x00A0;=&#x00A0;PL</mtext></mrow>   </semantics></math></disp-formula>
<disp-formula id="FD7"><label>(7)</label><math> <semantics>  <mrow>   <msub>    <mtext>Y</mtext>    <mn>2</mn>   </msub>   <mtext>&#x00A0;=&#x00A0;PH</mtext></mrow>   </semantics></math></disp-formula><p>In step 2, we use the same observer to estimate the fault with the following form:</p>

<disp-formula id="FD8"><label>(8)</label></disp-formula><p>Where:</p>

<disp-formula id="FD9"><label>(9)</label><math> <semantics>  <mrow>   <mover accent='true'>    <mover accent='true'>     <mi>f</mi>     <mo>&#x005E;</mo>    </mover>        <mo>&#x02D9;</mo>   </mover>   <mrow><mo>(</mo>    <mi>t</mi>   <mo>)</mo></mrow><mo>=</mo><mo>&#x2212;</mo><mi>&#x0393;</mi><mi>F</mi><mi>r</mi><mrow><mo>(</mo>    <mi>t</mi>   <mo>)</mo></mrow></mrow>   </semantics></math></disp-formula><p>To find <math> <semantics>  <mi>&#x0393;</mi>   </semantics></math> the following theorem is considered:</p>
<p><bold>Theorem 2</bold><bold>. [
<xref ref-type="bibr" rid="R2">2</xref>]</bold></p>
<p>If there exists R>0, S>0 and T>0 symmetric positive matrices such that:</p>

<disp-formula id="FD10"><label>(10)</label><math> <semantics>  <mrow>   <mrow><mo>[</mo> <mrow>    <mtable>     <mtr>      <mtd>       <mrow>        <mn>2</mn><mi>R</mi><msub>         <mi>A</mi>         <mn>0</mn>        </msub>        <mo>&#x2212;</mo><mn>2</mn><mi>S</mi><mi>C</mi><mo>+</mo><msup>         <mi>C</mi>         <mi>T</mi>        </msup>        <mi>Z</mi><mi>C</mi><mo>+</mo><mi>T</mi></mrow>      </mtd>      <mtd>       <mrow>        <mi>R</mi><msub>         <mi>A</mi>         <mn>2</mn>        </msub>        </mrow>      </mtd>      <mtd>       <mrow>        <mo>&#x2212;</mo><mi>R</mi><mi>F</mi><mo>+</mo><msup>         <mi>C</mi>         <mi>T</mi>        </msup>        <msup>         <mi>V</mi>         <mi>T</mi>        </msup>        <mi>F</mi></mrow>      </mtd>      <mtd>       <mn>0</mn>      </mtd>      <mtd>       <mn>0</mn>      </mtd>     </mtr>     <mtr>      <mtd>       <mo>*</mo>      </mtd>      <mtd>       <mrow>        <mo>&#x2212;</mo><mrow><mo>(</mo>         <mrow>          <mn>1</mn><mo>&#x2212;</mo><mi>&#x03B2;</mi></mrow>        <mo>)</mo></mrow><mi>T</mi></mrow>      </mtd>      <mtd>       <mn>0</mn>      </mtd>      <mtd>       <mn>0</mn>      </mtd>      <mtd>       <mn>0</mn>      </mtd>     </mtr>     <mtr>      <mtd>       <mo>*</mo>      </mtd>      <mtd>       <mo>*</mo>      </mtd>      <mtd>       <mrow>        <msup>         <mi>&#x0393;</mi>         <mn>2</mn>        </msup>        </mrow>      </mtd>      <mtd>       <mn>0</mn>      </mtd>      <mtd>       <mn>0</mn>      </mtd>     </mtr>     <mtr>      <mtd>       <mo>*</mo>      </mtd>      <mtd>       <mo>*</mo>      </mtd>      <mtd>       <mo>*</mo>      </mtd>      <mtd>       <mn>0</mn>      </mtd>      <mtd>       <mn>0</mn>      </mtd>     </mtr>     <mtr>      <mtd>       <mo>*</mo>      </mtd>      <mtd>       <mo>*</mo>      </mtd>      <mtd>       <mo>*</mo>      </mtd>      <mtd>       <mo>*</mo>      </mtd>      <mtd>       <mn>0</mn>      </mtd>     </mtr>         </mtable></mrow> <mo>]</mo></mrow><mo>&#x227A;</mo><mn>0</mn></mrow>   </semantics></math></disp-formula><p>With:</p>

<inline-formula><math> <semantics>  <mrow>   <mtable>    <mtr>     <mtd>      <mrow>       <mi>S</mi><mo>=</mo><mi>H</mi><mi>R</mi></mrow>     </mtd>    </mtr>    <mtr>     <mtd>      <mrow>       <mi>Z</mi><mo>=</mo><msup>        <mi>V</mi>        <mi>T</mi>       </msup>       <mi>V</mi></mrow>     </mtd>    </mtr>       </mtable></mrow>   </semantics></math></inline-formula><title>3.1.2. Fault compensation</title><p>To ensure a zero-static error between the system output and the desired one, we add an integrator to the control law. Therefore, we can design the following state feedback controller to stabilize the closed-loop system:</p>

<disp-formula id="FD11"><label>(11)</label><math> <semantics>  <mrow>   <mi>u</mi><mrow><mo>(</mo>    <mi>t</mi>   <mo>)</mo></mrow><mo>=</mo><mi>K</mi><mi>&#x03BE;</mi><mrow><mo>(</mo>    <mi>t</mi>   <mo>)</mo></mrow><mo>+</mo><mi>&#x03B5;</mi><mrow><mo>(</mo>    <mi>t</mi>   <mo>)</mo></mrow></mrow>   </semantics></math></disp-formula><p>Where:</p>

<inline-formula><math> <semantics>  <mrow>   <mi>&#x03B5;</mi><mrow><mo>(</mo>    <mi>t</mi>   <mo>)</mo></mrow><mo>=</mo><mstyle displaystyle='true'>    <mrow><munderover>     <mo>&#x222B;</mo>     <mn>0</mn>     <mi>t</mi>    </munderover>    <mrow>     <mrow><mo>(</mo>      <mrow>       <msub>        <mi>y</mi>        <mi>r</mi>       </msub>       <mrow><mo>(</mo>        <mi>&#x03B8;</mi>       <mo>)</mo></mrow><mo>&#x2212;</mo><mi>y</mi><mrow><mo>(</mo>        <mi>&#x03B8;</mi>       <mo>)</mo></mrow></mrow>     <mo>)</mo></mrow><mi>d</mi><mi>&#x03B8;</mi></mrow>   </mrow>     </mstyle></mrow> </semantics></math></inline-formula><p>And</p>

<inline-formula><math> <semantics>  <mrow>   <mover accent='true'>    <mi>&#x03B5;</mi>    <mo>&#x02D9;</mo>   </mover>   <mrow><mo>(</mo>    <mi>t</mi>   <mo>)</mo></mrow><mo>=</mo><msub>    <mi>y</mi>    <mi>r</mi>   </msub>   <mrow><mo>(</mo>    <mi>t</mi>   <mo>)</mo></mrow><mo>&#x2212;</mo><mi>y</mi><mrow><mo>(</mo>    <mi>t</mi>   <mo>)</mo></mrow></mrow>   </semantics></math></inline-formula><p>Where:</p>
<p><math> <semantics>  <mi>&#x03B5;</mi>   </semantics></math> : The static error.</p>
<p><math> <semantics>  <mrow>   <msub>    <mi>y</mi>    <mi>r</mi>   </msub>   </mrow>   </semantics></math>: The desired output.</p>
<p>Where K the feedback matrix gain obtained by LMI resolution in the following theorem.</p>
<p><bold>Theorem 3</bold><bold>.</bold></p>
<p>For given scalars <math> <semantics>  <mrow>   <msup>    <mi>&#x03C4;</mi>    <mo>*</mo>   </msup>   <mo>&#x227B;</mo><mn>0</mn></mrow>   </semantics></math> and <math> <semantics>  <mrow>   <mi>&#x03BC;</mi><mo>&#x227A;</mo><mn>1</mn></mrow>   </semantics></math>, the system (2) with  the matrices <math> <semantics>  <mrow>   <msub>    <mi>A</mi>    <mn>0</mn>   </msub>   </mrow>   </semantics></math>, <math> <semantics>  <mrow>   <msub>    <mi>A</mi>    <mn>1</mn>   </msub>   </mrow>   </semantics></math>,  and <math> <semantics>  <mrow>   <msub>    <mi>A</mi>    <mn>2</mn>   </msub>   </mrow>   </semantics></math> are constant, is asymptotically stabilizable by state feedback, if there exists <math> <semantics>  <mrow>   <msub>    <mi>P</mi>    <mn>1</mn>   </msub>   <mo>=</mo><msubsup>    <mi>P</mi>    <mn>1</mn>    <mi>T</mi>   </msubsup>   <mo>&#x227B;</mo><mn>0</mn></mrow>   </semantics></math>, <math> <semantics>  <mrow>   <msub>    <mi>Q</mi>    <mn>1</mn>   </msub>   <mo>=</mo><msubsup>    <mi>Q</mi>    <mn>1</mn>    <mi>T</mi>   </msubsup>   <mo>&#x227B;</mo><mn>0</mn></mrow>   </semantics></math>, <math> <semantics>  <mrow>   <mi>Z</mi><mo>=</mo><msup>    <mi>Z</mi>    <mi>T</mi>   </msup>   <mo>&#x227B;</mo><mn>0</mn></mrow>   </semantics></math> and matrices with appropriate dimensions <math> <semantics>  <mrow>   <msub>    <mi>G</mi>    <mi>i</mi>   </msub>   </mrow>   </semantics></math> (i=1,2,3) , D and O such that satisfy the following LMI:</p>

<disp-formula id="FD12"><label>(12)</label><math> <semantics>  <mrow>   <msup>    <mtext>E</mtext>    <mo>*</mo>   </msup>   <mo>=</mo><mrow><mo>[</mo> <mrow>    <mtable>     <mtr>      <mtd>       <mrow>        <msubsup>         <mtext>E</mtext>         <mrow>          <mn>11</mn></mrow>         <mo>*</mo>        </msubsup>        </mrow>      </mtd>      <mtd>       <mrow>        <msubsup>         <mtext>E</mtext>         <mrow>          <mn>12</mn></mrow>         <mo>*</mo>        </msubsup>        </mrow>      </mtd>      <mtd>       <mrow>        <msubsup>         <mtext>E</mtext>         <mrow>          <mn>13</mn></mrow>         <mo>*</mo>        </msubsup>        </mrow>      </mtd>      <mtd>       <mrow>        <msup>         <mi>&#x03C4;</mi>         <mo>*</mo>        </msup>        <msub>         <mi>G</mi>         <mn>1</mn>        </msub>        </mrow>      </mtd>     </mtr>     <mtr>      <mtd>       <mo>*</mo>      </mtd>      <mtd>       <mrow>        <msubsup>         <mtext>E</mtext>         <mrow>          <mn>22</mn></mrow>         <mo>*</mo>        </msubsup>        </mrow>      </mtd>      <mtd>       <mrow>        <msubsup>         <mtext>E</mtext>         <mrow>          <mn>23</mn></mrow>         <mo>*</mo>        </msubsup>        </mrow>      </mtd>      <mtd>       <mrow>        <msup>         <mi>&#x03C4;</mi>         <mo>*</mo>        </msup>        <msub>         <mi>G</mi>         <mn>2</mn>        </msub>        </mrow>      </mtd>     </mtr>     <mtr>      <mtd>       <mo>*</mo>      </mtd>      <mtd>       <mo>*</mo>      </mtd>      <mtd>       <mrow>        <msubsup>         <mtext>E</mtext>         <mrow>          <mn>33</mn></mrow>         <mo>*</mo>        </msubsup>        </mrow>      </mtd>      <mtd>       <mrow>        <msup>         <mi>&#x03C4;</mi>         <mo>*</mo>        </msup>        <msub>         <mi>G</mi>         <mn>3</mn>        </msub>        </mrow>      </mtd>     </mtr>     <mtr>      <mtd>       <mo>*</mo>      </mtd>      <mtd>       <mo>*</mo>      </mtd>      <mtd>       <mo>*</mo>      </mtd>      <mtd>       <mrow>        <mo>&#x2212;</mo><msup>         <mi>&#x03C4;</mi>         <mo>*</mo>        </msup>        <mi>Z</mi></mrow>      </mtd>     </mtr>         </mtable></mrow> <mo>]</mo></mrow><mo>&#x227A;</mo><mn>0</mn></mrow>   </semantics></math></disp-formula><p>Where:</p>
<p>Then</p>

<inline-formula><math> <semantics>  <mrow>   <mi>K</mi><mo>=</mo><mi>D</mi><msup>    <mi>O</mi>    <mrow>     <mo>&#x2212;</mo><mi>T</mi></mrow>   </msup>   </mrow>   </semantics></math></inline-formula><p><bold>Proof theorem 3.</bold></p>
<p>Lemma 1. the system (1) is asymptotically stable if it exists <math> <semantics>  <mrow>   <msub>    <mi>P</mi>    <mn>1</mn>   </msub>   <mo>=</mo><msubsup>    <mi>P</mi>    <mn>1</mn>    <mi>T</mi>   </msubsup>   <mo>&#x227B;</mo><mn>0</mn></mrow>   </semantics></math>, <math> <semantics>  <mrow>   <msub>    <mi>Q</mi>    <mn>1</mn>   </msub>   <mo>=</mo><msubsup>    <mi>Q</mi>    <mn>1</mn>    <mi>T</mi>   </msubsup>   <mo>&#x227B;</mo><mn>0</mn></mrow>   </semantics></math>, <math> <semantics>  <mrow>   <mi>Z</mi><mo>=</mo><msup>    <mi>Z</mi>    <mi>T</mi>   </msup>   <mo>&#x227B;</mo><mn>0</mn></mrow>   </semantics></math> and the matrices of appropriate dimensions <math> <semantics>  <mrow>   <msub>    <mi>G</mi>    <mi>i</mi>   </msub>   </mrow>   </semantics></math> and <math> <semantics>  <mrow>   <msub>    <mi>O</mi>    <mi>i</mi>   </msub>   </mrow>   </semantics></math> (i=1,2,3)  such that the following LMI is satisfied:</p>

<disp-formula id="FD13"><label>(13)</label><math> <semantics>  <mrow>   <mtext>E</mtext><mo>=</mo><mrow><mo>[</mo> <mrow>    <mtable>     <mtr>      <mtd>       <mrow>        <msub>         <mtext>E</mtext>         <mrow>          <mn>11</mn></mrow>        </msub>        </mrow>      </mtd>      <mtd>       <mrow>        <msub>         <mtext>E</mtext>         <mrow>          <mn>12</mn></mrow>        </msub>        </mrow>      </mtd>      <mtd>       <mrow>        <msub>         <mtext>E</mtext>         <mrow>          <mn>13</mn></mrow>        </msub>        </mrow>      </mtd>      <mtd>       <mrow>        <msup>         <mi>&#x03C4;</mi>         <mo>*</mo>        </msup>        <msub>         <mi>G</mi>         <mn>1</mn>        </msub>        </mrow>      </mtd>     </mtr>     <mtr>      <mtd>       <mo>*</mo>      </mtd>      <mtd>       <mrow>        <msub>         <mtext>E</mtext>         <mrow>          <mn>22</mn></mrow>        </msub>        </mrow>      </mtd>      <mtd>       <mrow>        <msub>         <mtext>E</mtext>         <mrow>          <mn>23</mn></mrow>        </msub>        </mrow>      </mtd>      <mtd>       <mrow>        <msup>         <mi>&#x03C4;</mi>         <mo>*</mo>        </msup>        <msub>         <mi>G</mi>         <mn>2</mn>        </msub>        </mrow>      </mtd>     </mtr>     <mtr>      <mtd>       <mo>*</mo>      </mtd>      <mtd>       <mo>*</mo>      </mtd>      <mtd>       <mrow>        <msub>         <mtext>E</mtext>         <mrow>          <mn>33</mn></mrow>        </msub>        </mrow>      </mtd>      <mtd>       <mrow>        <msup>         <mi>&#x03C4;</mi>         <mo>*</mo>        </msup>        <msub>         <mi>G</mi>         <mn>3</mn>        </msub>        </mrow>      </mtd>     </mtr>     <mtr>      <mtd>       <mo>*</mo>      </mtd>      <mtd>       <mo>*</mo>      </mtd>      <mtd>       <mo>*</mo>      </mtd>      <mtd>       <mrow>        <mo>&#x2212;</mo><msup>         <mi>&#x03C4;</mi>         <mo>*</mo>        </msup>        <mi>Z</mi></mrow>      </mtd>     </mtr>         </mtable></mrow> <mo>]</mo></mrow><mo>&#x227A;</mo><mn>0</mn></mrow>   </semantics></math></disp-formula><p>Where:</p>
<p>To prove LMI (13), we choose the following Lyapunov function:</p>

<disp-formula id="FD14"><label>(14)</label></disp-formula><p>Where the matrices<math> <semantics>  <mrow>   <msub>    <mi>P</mi>    <mn>1</mn>   </msub>   </mrow>   </semantics></math>,<math> <semantics>  <mrow>   <msub>    <mi>Q</mi>    <mn>1</mn>   </msub>   </mrow>   </semantics></math>, Z and D are to be determinate.</p>
<p>Then, the calculation of the derivative of <math> <semantics>  <mrow>   <mi>V</mi><mrow><mo>(</mo>    <mrow>     <mi>&#x03BE;</mi><mo>,</mo><mi>t</mi></mrow>   <mo>)</mo></mrow></mrow>   </semantics></math> gives:</p>

<disp-formula id="FD15"><label>(15)</label></disp-formula><p>The Leibniz-Newton formula provides:</p>

<inline-formula><math> <semantics>  <mrow>   <mi>&#x03BE;</mi><mrow><mo>(</mo>    <mi>t</mi>   <mo>)</mo></mrow><mo>&#x2212;</mo><mi>&#x03BE;</mi><mrow><mo>(</mo>    <mrow>     <mi>t</mi><mo>&#x2212;</mo><mi>h</mi></mrow>   <mo>)</mo></mrow><mo>&#x2212;</mo><mstyle displaystyle='true'>    <mrow>     <msubsup>      <mo>&#x222B;</mo>      <mrow>       <mo>&#x2212;</mo><mi>d</mi></mrow>      <mn>0</mn>     </msubsup>     <mrow>      <mi>&#x03BE;</mi><mrow><mo>(</mo>       <mrow>        <mi>t</mi><mo>&#x2212;</mo><mi>s</mi></mrow>      <mo>)</mo></mrow><mi>d</mi><mi>s</mi><mo>=</mo><mn>0</mn></mrow>    </mrow>       </mstyle></mrow>   </semantics></math></inline-formula><p>Therefore, for matrices of appropriate dimensions <math> <semantics>  <mrow>   <msub>    <mi>G</mi>    <mi>i</mi>   </msub>   <mrow><mo>(</mo>    <mrow>     <mi>i</mi><mo>=</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn></mrow>   <mo>)</mo></mrow></mrow>   </semantics></math> the following expression is true:</p>

<disp-formula id="FD16"><label>(16)</label><math> <semantics>  <mrow>   <mtable>    <mtr>     <mtd>      <mrow>       <mn>2</mn><mrow><mo>[</mo> <mrow>        <msup>         <mi>&#x03BE;</mi>         <mi>T</mi>        </msup>        <mrow><mo>(</mo>         <mi>t</mi>        <mo>)</mo></mrow><msub>         <mi>G</mi>         <mn>1</mn>        </msub>        <mo>+</mo><msup>         <mi>&#x03BE;</mi>         <mi>T</mi>        </msup>        <mrow><mo>(</mo>         <mrow>          <mi>t</mi><mo>&#x2212;</mo><mi>h</mi></mrow>        <mo>)</mo></mrow><msub>         <mi>G</mi>         <mn>2</mn>        </msub>        <mo>+</mo><msup>         <mover accent='true'>          <mi>&#x03BE;</mi>          <mo>&#x02D9;</mo>         </mover>                  <mi>T</mi>        </msup>        <mrow><mo>(</mo>         <mi>t</mi>        <mo>)</mo></mrow><msub>         <mi>G</mi>         <mn>3</mn>        </msub>        </mrow> <mo>]</mo></mrow><mo>*</mo><mrow><mo>[</mo> <mrow>        <mi>&#x03BE;</mi><mrow><mo>(</mo>         <mi>t</mi>        <mo>)</mo></mrow><mo>&#x2212;</mo><mi>&#x03BE;</mi><mrow><mo>(</mo>         <mrow>          <mi>t</mi><mo>&#x2212;</mo><mi>h</mi></mrow>        <mo>)</mo></mrow><mo>&#x2212;</mo><mstyle displaystyle='true'>         <mrow>          <msubsup>           <mo>&#x222B;</mo>           <mrow>            <mo>&#x2212;</mo><mi>d</mi></mrow>           <mn>0</mn>          </msubsup>          <mrow>           <mover accent='true'>            <mi>&#x03BE;</mi>            <mo>&#x02D9;</mo>           </mover>           <mrow><mo>(</mo>            <mrow>             <mi>t</mi><mo>&#x2212;</mo><mi>s</mi></mrow>           <mo>)</mo></mrow><mi>d</mi><mi>s</mi></mrow>         </mrow>                 </mstyle></mrow> <mo>]</mo></mrow><mo>=</mo><mn>0</mn></mrow>     </mtd>    </mtr>       </mtable></mrow>   </semantics></math></disp-formula><p>Moreover, from (1) for matrices of appropriate dimensions, <math> <semantics>  <mrow>   <msub>    <mi>O</mi>    <mi>i</mi>   </msub>   <mrow><mo>(</mo>    <mrow>     <mi>i</mi><mo>=</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn></mrow>   <mo>)</mo></mrow></mrow>   </semantics></math> we have:</p>

<disp-formula id="FD17"><label>(17)</label><math> <semantics>  <mrow>   <mtable>    <mtr>     <mtd>      <mrow>       <mn>2</mn><mrow><mo>[</mo> <mrow>        <msup>         <mi>&#x03BE;</mi>         <mi>T</mi>        </msup>        <mrow><mo>(</mo>         <mi>t</mi>        <mo>)</mo></mrow><msub>         <mi>O</mi>         <mn>1</mn>        </msub>        <mo>+</mo><msup>         <mi>&#x03BE;</mi>         <mi>T</mi>        </msup>        <mrow><mo>(</mo>         <mrow>          <mi>t</mi><mo>&#x2212;</mo><mi>h</mi></mrow>        <mo>)</mo></mrow><msub>         <mi>O</mi>         <mn>2</mn>        </msub>        <mo>+</mo><msup>         <mover accent='true'>          <mi>&#x03BE;</mi>          <mo>&#x02D9;</mo>         </mover>                  <mi>T</mi>        </msup>        <mrow><mo>(</mo>         <mi>t</mi>        <mo>)</mo></mrow><msub>         <mi>O</mi>         <mn>3</mn>        </msub>        </mrow> <mo>]</mo></mrow><mo>*</mo></mrow>     </mtd>    </mtr>    <mtr>     <mtd>      <mrow>       <mrow><mo>[</mo> <mrow>        <mrow><mo>(</mo>         <mrow>          <msub>           <mi>A</mi>           <mn>2</mn>          </msub>          <mo>+</mo><mi>&#x0394;</mi><msub>           <mi>A</mi>           <mn>2</mn>          </msub>          </mrow>        <mo>)</mo></mrow><mover accent='true'>         <mi>&#x03BE;</mi>         <mo>&#x02D9;</mo>        </mover>        <mrow><mo>(</mo>         <mrow>          <mi>t</mi><mo>&#x2212;</mo><mi>d</mi></mrow>        <mo>)</mo></mrow><mo>&#x2212;</mo><mrow><mo>(</mo>         <mrow>          <msub>           <mi>A</mi>           <mn>1</mn>          </msub>          <mo>+</mo><mi>&#x0394;</mi><msub>           <mi>A</mi>           <mn>1</mn>          </msub>          </mrow>        <mo>)</mo></mrow><mi>&#x03BE;</mi><mrow><mo>(</mo>         <mrow>          <mi>t</mi><mo>&#x2212;</mo><mi>h</mi></mrow>        <mo>)</mo></mrow><mo>&#x2212;</mo><mrow><mo>(</mo>         <mrow>          <msub>           <mi>A</mi>           <mn>0</mn>          </msub>          <mo>+</mo><mi>&#x0394;</mi><msub>           <mi>A</mi>           <mn>0</mn>          </msub>          </mrow>        <mo>)</mo></mrow><mi>&#x03BE;</mi><mrow><mo>(</mo>         <mi>t</mi>        <mo>)</mo></mrow></mrow> <mo>]</mo></mrow><mo>=</mo><mn>0</mn></mrow>     </mtd>    </mtr>       </mtable></mrow>   </semantics></math></disp-formula><p>For a positive semi-definite matrix</p>

<inline-formula><math> <semantics>  <mrow>   <mi>&#x0398;</mi><mo>=</mo><mrow><mo>[</mo> <mrow>    <mtable>     <mtr>      <mtd>       <mrow>        <msub>         <mi>&#x0398;</mi>         <mrow>          <mn>11</mn></mrow>        </msub>        </mrow>      </mtd>      <mtd>       <mrow>        <msub>         <mi>&#x0398;</mi>         <mrow>          <mn>12</mn></mrow>        </msub>        </mrow>      </mtd>      <mtd>       <mrow>        <msub>         <mi>&#x0398;</mi>         <mrow>          <mn>13</mn></mrow>        </msub>        </mrow>      </mtd>     </mtr>     <mtr>      <mtd>       <mrow>        <msub>         <mi>&#x0398;</mi>         <mrow>          <mn>21</mn></mrow>        </msub>        </mrow>      </mtd>      <mtd>       <mrow>        <msub>         <mi>&#x0398;</mi>         <mrow>          <mn>22</mn></mrow>        </msub>        </mrow>      </mtd>      <mtd>       <mrow>        <msub>         <mi>&#x0398;</mi>         <mrow>          <mn>23</mn></mrow>        </msub>        </mrow>      </mtd>     </mtr>     <mtr>      <mtd>       <mrow>        <msub>         <mi>&#x0398;</mi>         <mrow>          <mn>31</mn></mrow>        </msub>        </mrow>      </mtd>      <mtd>       <mrow>        <msub>         <mi>&#x0398;</mi>         <mrow>          <mn>32</mn></mrow>        </msub>        </mrow>      </mtd>      <mtd>       <mrow>        <msub>         <mi>&#x0398;</mi>         <mrow>          <mn>33</mn></mrow>        </msub>        </mrow>      </mtd>     </mtr>         </mtable></mrow> <mo>]</mo></mrow><mo>&#x2265;</mo><mn>0</mn></mrow>   </semantics></math></inline-formula><p>The following expression is verified:</p>

<disp-formula id="FD18"><label>(18)</label><math> <semantics>  <mrow>   <msup>    <mi>&#x03C4;</mi>    <mo>*</mo>   </msup>   <msup>    <mi>&#x03B7;</mi>    <mi>T</mi>   </msup>   <mrow><mo>(</mo>    <mi>t</mi>   <mo>)</mo></mrow><mi>&#x0398;</mi><mi>&#x03B7;</mi><mrow><mo>(</mo>    <mi>t</mi>   <mo>)</mo></mrow><mo>&#x2212;</mo><mstyle displaystyle='true'>    <mrow>     <msubsup>      <mo>&#x222B;</mo>      <mrow>       <mi>t</mi><mo>&#x2212;</mo><mi>d</mi></mrow>      <mi>t</mi>     </msubsup>     <mrow>      <msup>       <mi>&#x03B7;</mi>       <mi>T</mi>      </msup>      <mrow><mo>(</mo>       <mi>t</mi>      <mo>)</mo></mrow><mi>&#x0398;</mi><mi>&#x03B7;</mi><mrow><mo>(</mo>       <mi>t</mi>      <mo>)</mo></mrow><mi>d</mi><mi>s</mi></mrow>    </mrow>       </mstyle><mo>&#x2265;</mo><mn>0</mn></mrow>   </semantics></math></disp-formula><p>Where:</p>

<inline-formula><math> <semantics>  <mrow>   <mi>&#x03B7;</mi><mrow><mo>(</mo>    <mi>t</mi>   <mo>)</mo></mrow><mo>=</mo><msup>    <mrow>     <mrow><mo>[</mo> <mrow>      <mtable>       <mtr>        <mtd>         <mrow>          <msup>           <mi>&#x03BE;</mi>           <mi>T</mi>          </msup>          <mrow><mo>(</mo>           <mi>t</mi>          <mo>)</mo></mrow></mrow>        </mtd>        <mtd>         <mrow>          <msup>           <mi>&#x03BE;</mi>           <mi>T</mi>          </msup>          <mrow><mo>(</mo>           <mrow>            <mi>t</mi><mo>&#x2212;</mo><mi>h</mi></mrow>          <mo>)</mo></mrow></mrow>        </mtd>        <mtd>         <mrow>          <msup>           <mover accent='true'>            <mi>&#x03BE;</mi>            <mo>&#x02D9;</mo>           </mover>                      <mi>T</mi>          </msup>          <mrow><mo>(</mo>           <mrow>            <mi>t</mi><mo>&#x2212;</mo><mi>d</mi></mrow>          <mo>)</mo></mrow></mrow>        </mtd>       </mtr>             </mtable></mrow> <mo>]</mo></mrow></mrow>    <mi>T</mi>   </msup>   </mrow>   </semantics></math></inline-formula><p>Then, by adding the null terms (16) and (17) to the left part of the inequality (15) and by increasing <math> <semantics>  <mrow>   <mover accent='true'>    <mi>V</mi>    <mo>&#x02D9;</mo>   </mover>   <mrow><mo>(</mo>    <mrow>     <mi>&#x03BE;</mi><mo>,</mo><mi>t</mi></mrow>   <mo>)</mo></mrow></mrow>   </semantics></math> in the same inequality by the term (18), this allows us to express <math> <semantics>  <mrow>   <mover accent='true'>    <mi>V</mi>    <mo>&#x02D9;</mo>   </mover>   <mrow><mo>(</mo>    <mrow>     <mi>&#x03BE;</mi><mo>,</mo><mi>t</mi></mrow>   <mo>)</mo></mrow></mrow>   </semantics></math> as follows:</p>

<inline-formula><math> <semantics>  <mrow>   <mover accent='true'>    <mi>V</mi>    <mo>&#x02D9;</mo>   </mover>   <mrow><mo>(</mo>    <mrow>     <mi>&#x03BE;</mi><mo>,</mo><mi>t</mi></mrow>   <mo>)</mo></mrow><mo>&#x2264;</mo><msup>    <mi>&#x03B7;</mi>    <mi>T</mi>   </msup>   <mrow><mo>(</mo>    <mi>t</mi>   <mo>)</mo></mrow><mi>&#x0394;</mi><mi>&#x03B7;</mi><mrow><mo>(</mo>    <mi>t</mi>   <mo>)</mo></mrow><mo>&#x2212;</mo><mstyle displaystyle='true'>    <mrow>     <msubsup>      <mo>&#x222B;</mo>      <mrow>       <mi>t</mi><mo>&#x2212;</mo><mi>d</mi></mrow>      <mi>t</mi>     </msubsup>     <mrow>      <msup>       <mi>&#x03A9;</mi>       <mi>T</mi>      </msup>      <mrow><mo>(</mo>       <mrow>        <mi>t</mi><mo>,</mo><mi>s</mi></mrow>      <mo>)</mo></mrow><mi>&#x03C8;</mi><mi>&#x03A9;</mi><mrow><mo>(</mo>       <mrow>        <mi>t</mi><mo>,</mo><mi>s</mi></mrow>      <mo>)</mo></mrow><mi>d</mi><mi>s</mi></mrow>    </mrow>       </mstyle></mrow>   </semantics></math></inline-formula><p>Where:</p>

<inline-formula><math> <semantics>  <mrow>   <mi>&#x03A9;</mi><mrow><mo>(</mo>    <mrow>     <mi>t</mi><mo>,</mo><mi>s</mi></mrow>   <mo>)</mo></mrow><mo>=</mo><msup>    <mrow>     <mrow><mo>[</mo> <mrow>      <mtable>       <mtr>        <mtd>         <mrow>          <msup>           <mi>&#x03B7;</mi>           <mi>T</mi>          </msup>          <mrow><mo>(</mo>           <mi>t</mi>          <mo>)</mo></mrow></mrow>        </mtd>        <mtd>         <mrow>          <msup>           <mover accent='true'>            <mi>&#x03BE;</mi>            <mo>&#x02D9;</mo>           </mover>                      <mi>T</mi>          </msup>          <mrow><mo>(</mo>           <mi>s</mi>          <mo>)</mo></mrow></mrow>        </mtd>       </mtr>             </mtable></mrow> <mo>]</mo></mrow></mrow>    <mi>T</mi>   </msup>   </mrow>   </semantics></math></inline-formula>
<inline-formula><math> <semantics>  <mrow>   <mi>&#x03C8;</mi><mo>=</mo><mrow><mo>[</mo> <mrow>    <mtable>     <mtr>      <mtd>       <mrow>        <msub>         <mi>&#x0398;</mi>         <mrow>          <mn>11</mn></mrow>        </msub>        </mrow>      </mtd>      <mtd>       <mrow>        <msub>         <mi>&#x0398;</mi>         <mrow>          <mn>12</mn></mrow>        </msub>        </mrow>      </mtd>      <mtd>       <mrow>        <msub>         <mi>&#x0398;</mi>         <mrow>          <mn>13</mn></mrow>        </msub>        </mrow>      </mtd>      <mtd>       <mrow>        <msub>         <mi>G</mi>         <mn>1</mn>        </msub>        </mrow>      </mtd>     </mtr>     <mtr>      <mtd>       <mrow>        <msub>         <mi>&#x0398;</mi>         <mrow>          <mn>21</mn></mrow>        </msub>        </mrow>      </mtd>      <mtd>       <mrow>        <msub>         <mi>&#x0398;</mi>         <mrow>          <mn>22</mn></mrow>        </msub>        </mrow>      </mtd>      <mtd>       <mrow>        <msub>         <mi>&#x0398;</mi>         <mrow>          <mn>23</mn></mrow>        </msub>        </mrow>      </mtd>      <mtd>       <mrow>        <msub>         <mi>G</mi>         <mn>2</mn>        </msub>        </mrow>      </mtd>     </mtr>     <mtr>      <mtd>       <mrow>        <msub>         <mi>&#x0398;</mi>         <mrow>          <mn>31</mn></mrow>        </msub>        </mrow>      </mtd>      <mtd>       <mrow>        <msub>         <mi>&#x0398;</mi>         <mrow>          <mn>32</mn></mrow>        </msub>        </mrow>      </mtd>      <mtd>       <mrow>        <msub>         <mi>&#x0398;</mi>         <mrow>          <mn>33</mn></mrow>        </msub>        </mrow>      </mtd>      <mtd>       <mrow>        <msub>         <mi>G</mi>         <mn>3</mn>        </msub>        </mrow>      </mtd>     </mtr>     <mtr>      <mtd>       <mrow>        <msubsup>         <mi>G</mi>         <mn>1</mn>         <mi>T</mi>        </msubsup>        </mrow>      </mtd>      <mtd>       <mrow>        <msubsup>         <mi>G</mi>         <mn>2</mn>         <mi>T</mi>        </msubsup>        </mrow>      </mtd>      <mtd>       <mrow>        <msubsup>         <mi>G</mi>         <mn>3</mn>         <mi>T</mi>        </msubsup>        </mrow>      </mtd>      <mtd>       <mi>D</mi>      </mtd>     </mtr>         </mtable></mrow> <mo>]</mo></mrow></mrow>   </semantics></math></inline-formula><p>If <math> <semantics>  <mrow>   <mi>&#x0394;</mi><mo>&#x227A;</mo><mn>0</mn></mrow>   </semantics></math> and<math> <semantics>  <mrow>   <mi>&#x03C8;</mi><mo>&#x227B;</mo><mn>0</mn></mrow>   </semantics></math>, then, there exists <math> <semantics>  <mi>&#x03B5;</mi>   </semantics></math> sufficiently small such that<math> <semantics>  <mrow>   <mover accent='true'>    <mi>V</mi>    <mo>&#x02D9;</mo>   </mover>   <mrow><mo>(</mo>    <mrow>     <mi>&#x03BE;</mi><mo>,</mo><mi>t</mi></mrow>   <mo>)</mo></mrow><mo>&#x227A;</mo><mo>&#x2212;</mo><mi>&#x03B5;</mi><msup>    <mrow>     <mrow><mo>&#x2016;</mo> <mrow>      <mi>&#x03BE;</mi><mrow><mo>(</mo>       <mi>t</mi>      <mo>)</mo></mrow></mrow> <mo>&#x2016;</mo></mrow></mrow>    <mn>2</mn>   </msup>   </mrow>   </semantics></math>, we ensure then the asymptotically stability of the system (1). More precisely, if we select<math> <semantics>  <mrow>   <mi>D</mi><mo>&#x227B;</mo><mn>0</mn></mrow>   </semantics></math>, the matrix <math> <semantics>  <mi>&#x0398;</mi>   </semantics></math> can be chosen as:</p>

<inline-formula><math> <semantics>  <mrow>   <mi>&#x0398;</mi><mo>=</mo><mrow><mo>[</mo> <mrow>    <mtable>     <mtr>      <mtd>       <mrow>        <msub>         <mi>&#x0398;</mi>         <mn>1</mn>        </msub>        </mrow>      </mtd>     </mtr>     <mtr>      <mtd>       <mrow>        <msub>         <mi>&#x0398;</mi>         <mn>2</mn>        </msub>        </mrow>      </mtd>     </mtr>     <mtr>      <mtd>       <mrow>        <msub>         <mi>&#x0398;</mi>         <mn>3</mn>        </msub>        </mrow>      </mtd>     </mtr>         </mtable></mrow> <mo>]</mo></mrow><mo>=</mo><mrow><mo>[</mo> <mrow>    <mtable>     <mtr>      <mtd>       <mrow>        <msub>         <mi>G</mi>         <mn>1</mn>        </msub>        </mrow>      </mtd>     </mtr>     <mtr>      <mtd>       <mrow>        <msub>         <mi>G</mi>         <mn>2</mn>        </msub>        </mrow>      </mtd>     </mtr>     <mtr>      <mtd>       <mrow>        <msub>         <mi>G</mi>         <mn>3</mn>        </msub>        </mrow>      </mtd>     </mtr>         </mtable></mrow> <mo>]</mo></mrow><msup>    <mi>D</mi>    <mrow>     <mo>&#x2212;</mo><mn>1</mn></mrow>   </msup>   <msup>    <mrow>     <mrow><mo>[</mo> <mrow>      <mtable>       <mtr>        <mtd>         <mrow>          <msub>           <mi>G</mi>           <mn>1</mn>          </msub>          </mrow>        </mtd>       </mtr>       <mtr>        <mtd>         <mrow>          <msub>           <mi>G</mi>           <mn>2</mn>          </msub>          </mrow>        </mtd>       </mtr>       <mtr>        <mtd>         <mrow>          <msub>           <mi>G</mi>           <mn>3</mn>          </msub>          </mrow>        </mtd>       </mtr>             </mtable></mrow> <mo>]</mo></mrow></mrow>    <mi>T</mi>   </msup>   </mrow>   </semantics></math></inline-formula><p>Which allows having</p>

<inline-formula><math> <semantics>  <mrow>   <mi>&#x0398;</mi><mo>&#x2265;</mo><mn>0</mn><mtable>    <mtr>     <mtd>      <mrow>       <mi>a</mi><mi>n</mi><mi>d</mi></mrow>     </mtd>     <mtd>      <mrow>       <mi>&#x03C8;</mi><mo>&#x2265;</mo><mn>0</mn></mrow>     </mtd>    </mtr>       </mtable></mrow>   </semantics></math></inline-formula><p>In this case <math> <semantics>  <mrow>   <mi>&#x0394;</mi><mo>&#x227A;</mo><mn>0</mn></mrow>   </semantics></math> is equivalent to <math> <semantics>  <mrow>   <mtext>E</mtext><mo>&#x227A;</mo><mn>0</mn></mrow>   </semantics></math> according to Schur complement.</p>
<p>For theorem 3 based on Lemma 1, we will determine the return gain K.</p>
<p>Consider the following hypothesis <math> <semantics>  <mrow>   <msub>    <mi>&#x03B8;</mi>    <mn>3</mn>   </msub>   <mo>=</mo><msub>    <mi>&#x03B8;</mi>    <mn>2</mn>   </msub>   <mo>=</mo><msub>    <mi>&#x03B8;</mi>    <mn>1</mn>   </msub>   </mrow>   </semantics></math> and substitute the control law in (19), the closed loop system then becomes:</p>

<disp-formula id="FD19"><label>(19)</label><math> <semantics>  <mrow>   <mrow><mo>{</mo> <mrow>    <mtable>     <mtr>      <mtd>       <mrow>        <mtable>         <mtr>          <mtd>           <mrow>            <mover accent='true'>             <mi>&#x03BE;</mi>             <mo>&#x02D9;</mo>            </mover>            <mrow><mo>(</mo>             <mi>t</mi>            <mo>)</mo></mrow><mo>=</mo><mrow><mo>(</mo>             <mrow>              <msub>               <mover accent='true'>                <mi>A</mi>                <mo>&#x00AF;</mo>               </mover>                              <mn>0</mn>              </msub>              <mo>+</mo><mover accent='true'>               <mi>B</mi>               <mo>&#x00AF;</mo>              </mover>              <mi>K</mi></mrow>            <mo>)</mo></mrow><mi>&#x03BE;</mi><mrow><mo>(</mo>             <mi>t</mi>            <mo>)</mo></mrow><mo>+</mo><msub>             <mover accent='true'>              <mi>A</mi>              <mo>&#x00AF;</mo>             </mover>                          <mn>1</mn>            </msub>            <mi>&#x03BE;</mi><mrow><mo>(</mo>             <mrow>              <mi>t</mi><mo>&#x2212;</mo><mi>h</mi></mrow>            <mo>)</mo></mrow><mo>+</mo><msub>             <mover accent='true'>              <mi>A</mi>              <mo>&#x00AF;</mo>             </mover>                          <mn>2</mn>            </msub>            <mover accent='true'>             <mi>&#x03BE;</mi>             <mo>&#x02D9;</mo>            </mover>            <mrow><mo>(</mo>             <mrow>              <mi>t</mi><mo>&#x2212;</mo><mi>d</mi></mrow>            <mo>)</mo></mrow><mo>+</mo><mi>F</mi><mi>f</mi><mrow><mo>(</mo>             <mi>t</mi>            <mo>)</mo></mrow></mrow>          </mtd>         </mtr>         <mtr>          <mtd>           <mrow></mrow>          </mtd>         </mtr>                 </mtable></mrow>      </mtd>     </mtr>     <mtr>      <mtd>       <mrow>        <mi>&#x03BE;</mi><mrow><mo>(</mo>         <mi>t</mi>        <mo>)</mo></mrow><mo>=</mo><mi>&#x03C6;</mi><mrow><mo>(</mo>         <mi>t</mi>        <mo>)</mo></mrow><mtable>         <mtr>          <mtd>           <mo>;</mo>          </mtd>          <mtd>           <mrow>            <mi>t</mi><mo>&#x2208;</mo><mrow><mo>[</mo> <mrow>             <mo>&#x2212;</mo><mi>&#x03C4;</mi><mo>,</mo><mn>0</mn></mrow> <mo>]</mo></mrow></mrow>          </mtd>         </mtr>                 </mtable></mrow>      </mtd>     </mtr>         </mtable></mrow> </mrow></mrow>   </semantics></math></disp-formula><p>To determine the return gain K, it suffices to replace the matrix <math> <semantics>  <mrow>   <msub>    <mover accent='true'>     <mi>A</mi>     <mo>&#x00AF;</mo>    </mover>        <mn>0</mn>   </msub>   </mrow>   </semantics></math> by <math> <semantics>  <mrow>   <mrow><mo>(</mo>    <mrow>     <msub>      <mover accent='true'>       <mi>A</mi>       <mo>&#x00AF;</mo>      </mover>            <mn>0</mn>     </msub>     <mo>+</mo><mover accent='true'>      <mi>B</mi>      <mo>&#x00AF;</mo>     </mover>     <mi>K</mi></mrow>   <mo>)</mo></mrow></mrow>   </semantics></math> in LMI (13) of Lemma 1.</p>
<p>Where <math> <semantics>  <mrow>   <msub>    <mover accent='true'>     <mi>A</mi>     <mo>&#x00AF;</mo>    </mover>        <mn>0</mn>   </msub>   <mo>=</mo><msub>    <mi>A</mi>    <mn>0</mn>   </msub>   <mo>+</mo><mi>&#x0394;</mi><msub>    <mi>A</mi>    <mn>0</mn>   </msub>   <mo>,</mo><msub>    <mover accent='true'>     <mi>A</mi>     <mo>&#x00AF;</mo>    </mover>        <mn>1</mn>   </msub>   <mo>=</mo><msub>    <mi>A</mi>    <mn>1</mn>   </msub>   <mo>+</mo><mi>&#x0394;</mi><msub>    <mi>A</mi>    <mn>1</mn>   </msub>   <mo>,</mo><msub>    <mover accent='true'>     <mi>A</mi>     <mo>&#x00AF;</mo>    </mover>        <mn>2</mn>   </msub>   <mo>=</mo><msub>    <mi>A</mi>    <mn>2</mn>   </msub>   <mo>+</mo><mi>&#x0394;</mi><msub>    <mi>A</mi>    <mn>2</mn>   </msub>   </mrow>   </semantics></math> and<math> <semantics>  <mrow>   <mover accent='true'>    <mi>B</mi>    <mo>&#x00AF;</mo>   </mover>   <mo>=</mo><mi>B</mi><mo>+</mo><mi>&#x0394;</mi><mi>B</mi></mrow>   </semantics></math>.</p>
<p>By developing the computation, we end up with a nonlinear LMI. To solve this problem, we recourse to the dual system.</p>
<p>A system is stable. Then, its dual is also stable, since solution of:</p>

<inline-formula><math> <semantics>  <mrow>   <mi>det</mi><mrow><mo>(</mo>    <mrow>     <mi>s</mi><mi>I</mi><mo>&#x2212;</mo><mrow><mo>(</mo>      <mrow>       <msub>        <mover accent='true'>         <mi>A</mi>         <mo>&#x00AF;</mo>        </mover>                <mn>0</mn>       </msub>       <mo>+</mo><mover accent='true'>        <mi>B</mi>        <mo>&#x00AF;</mo>       </mover>       <mi>K</mi></mrow>     <mo>)</mo></mrow><mo>&#x2212;</mo><msub>      <mover accent='true'>       <mi>A</mi>       <mo>&#x00AF;</mo>      </mover>            <mn>1</mn>     </msub>     <msup>      <mi>e</mi>      <mrow>       <mo>&#x2212;</mo><msup>        <mi>&#x03C4;</mi>        <mo>*</mo>       </msup>       <mi>s</mi></mrow>     </msup>     <mo>&#x2212;</mo><msub>      <mover accent='true'>       <mi>A</mi>       <mo>&#x00AF;</mo>      </mover>            <mn>2</mn>     </msub>     <msup>      <mi>e</mi>      <mrow>       <mo>&#x2212;</mo><msup>        <mi>&#x03C4;</mi>        <mo>*</mo>       </msup>       <mi>s</mi></mrow>     </msup>     </mrow>   <mo>)</mo></mrow><mo>=</mo><mn>0</mn></mrow>   </semantics></math></inline-formula><p>Is the same that of:</p>

<inline-formula><math> <semantics>  <mrow>   <mi>det</mi><mrow><mo>(</mo>    <mrow>     <mi>s</mi><mi>I</mi><mo>&#x2212;</mo><msup>      <mrow>       <mrow><mo>(</mo>        <mrow>         <msub>          <mover accent='true'>           <mi>A</mi>           <mo>&#x00AF;</mo>          </mover>                    <mn>0</mn>         </msub>         <mo>+</mo><mover accent='true'>          <mi>B</mi>          <mo>&#x00AF;</mo>         </mover>         <mi>K</mi></mrow>       <mo>)</mo></mrow></mrow>      <mi>T</mi>     </msup>     <mo>&#x2212;</mo><msubsup>      <mover accent='true'>       <mi>A</mi>       <mo>&#x00AF;</mo>      </mover>            <mn>1</mn>      <mi>T</mi>     </msubsup>     <msup>      <mi>e</mi>      <mrow>       <mo>&#x2212;</mo><msup>        <mi>&#x03C4;</mi>        <mo>*</mo>       </msup>       <mi>s</mi></mrow>     </msup>     <mo>&#x2212;</mo><msubsup>      <mover accent='true'>       <mi>A</mi>       <mo>&#x00AF;</mo>      </mover>            <mn>2</mn>      <mi>T</mi>     </msubsup>     <msup>      <mi>e</mi>      <mrow>       <mo>&#x2212;</mo><msup>        <mi>&#x03C4;</mi>        <mo>*</mo>       </msup>       <mi>s</mi></mrow>     </msup>     </mrow>   <mo>)</mo></mrow><mo>=</mo><mn>0</mn></mrow>   </semantics></math></inline-formula><p>Therefore, is equivalent to the following system:</p>

<disp-formula id="FD20"><label>(20)</label><math> <semantics>  <mrow>   <mrow><mo>{</mo> <mrow>    <mtable>     <mtr>      <mtd>       <mrow>        <mtable>         <mtr>          <mtd>           <mrow>            <mover accent='true'>             <mi>&#x03BE;</mi>             <mo>&#x02D9;</mo>            </mover>            <mrow><mo>(</mo>             <mi>t</mi>            <mo>)</mo></mrow><mo>=</mo><msup>             <mrow>              <mrow><mo>(</mo>               <mrow>                <msub>                 <mover accent='true'>                  <mi>A</mi>                  <mo>&#x00AF;</mo>                 </mover>                                  <mn>0</mn>                </msub>                <mo>+</mo><mover accent='true'>                 <mi>B</mi>                 <mo>&#x00AF;</mo>                </mover>                <mi>K</mi></mrow>              <mo>)</mo></mrow></mrow>             <mi>T</mi>            </msup>            <mi>&#x03BE;</mi><mrow><mo>(</mo>             <mi>t</mi>            <mo>)</mo></mrow><mo>+</mo><msubsup>             <mover accent='true'>              <mi>A</mi>              <mo>&#x00AF;</mo>             </mover>                          <mn>1</mn>             <mi>T</mi>            </msubsup>            <mi>&#x03BE;</mi><mrow><mo>(</mo>             <mrow>              <mi>t</mi><mo>&#x2212;</mo><mi>h</mi></mrow>            <mo>)</mo></mrow><mo>+</mo><msubsup>             <mover accent='true'>              <mi>A</mi>              <mo>&#x00AF;</mo>             </mover>                          <mn>2</mn>             <mi>T</mi>            </msubsup>            <mover accent='true'>             <mi>&#x03BE;</mi>             <mo>&#x02D9;</mo>            </mover>            <mrow><mo>(</mo>             <mrow>              <mi>t</mi><mo>&#x2212;</mo><mi>d</mi></mrow>            <mo>)</mo></mrow></mrow>          </mtd>         </mtr>         <mtr>          <mtd>           <mrow></mrow>          </mtd>         </mtr>                 </mtable></mrow>      </mtd>     </mtr>     <mtr>      <mtd>       <mrow>        <mi>&#x03BE;</mi><mrow><mo>(</mo>         <mi>t</mi>        <mo>)</mo></mrow><mo>=</mo><mi>&#x03C6;</mi><mrow><mo>(</mo>         <mi>t</mi>        <mo>)</mo></mrow><mtable>         <mtr>          <mtd>           <mo>;</mo>          </mtd>          <mtd>           <mrow>            <mi>t</mi><mo>&#x2208;</mo><mrow><mo>[</mo> <mrow>             <mo>&#x2212;</mo><mi>&#x03C4;</mi><mo>,</mo><mn>0</mn></mrow> <mo>]</mo></mrow></mrow>          </mtd>         </mtr>                 </mtable></mrow>      </mtd>     </mtr>         </mtable></mrow> </mrow></mrow>   </semantics></math></disp-formula><p>To determine the return gain we replace <math> <semantics>  <mrow>   <msub>    <mover accent='true'>     <mi>A</mi>     <mo>&#x00AF;</mo>    </mover>        <mn>0</mn>   </msub>   </mrow>   </semantics></math> by <math> <semantics>  <mrow>   <msup>    <mrow>     <mrow><mo>(</mo>      <mrow>       <msub>        <mover accent='true'>         <mi>A</mi>         <mo>&#x00AF;</mo>        </mover>                <mn>0</mn>       </msub>       <mo>+</mo><mover accent='true'>        <mi>B</mi>        <mo>&#x00AF;</mo>       </mover>       <mi>K</mi></mrow>     <mo>)</mo></mrow></mrow>    <mi>T</mi>   </msup>   </mrow>   </semantics></math> in (13) and we obtain (12).</p>
<p>We propose computing a new control law <math> <semantics>  <mrow>   <msub>    <mi>u</mi>    <mrow>     <mi>a</mi><mi>d</mi></mrow>   </msub>   <mrow><mo>(</mo>    <mi>t</mi>   <mo>)</mo></mrow></mrow>   </semantics></math> to be added to the nominal one to compensate the fault effect on the system. With <math> <semantics>  <mrow>   <msub>    <mi>u</mi>    <mrow>     <mi>a</mi><mi>d</mi></mrow>   </msub>   <mrow><mo>(</mo>    <mi>t</mi>   <mo>)</mo></mrow></mrow>   </semantics></math> satisfies the following equation:</p>

<disp-formula id="FD21"><label>(21)</label><math> <semantics>  <mrow>   <mover accent='true'>    <mi>B</mi>    <mo>&#x00AF;</mo>   </mover>   <msub>    <mi>u</mi>    <mrow>     <mi>a</mi><mi>d</mi></mrow>   </msub>   <mrow><mo>(</mo>    <mi>t</mi>   <mo>)</mo></mrow><mo>+</mo><mi>F</mi><mi>f</mi><mrow><mo>(</mo>    <mi>t</mi>   <mo>)</mo></mrow><mo>=</mo><mn>0</mn></mrow>   </semantics></math></disp-formula><p>Then:</p>

<disp-formula id="FD22"><label>(22)</label><math> <semantics>  <mrow>   <msub>    <mi>u</mi>    <mrow>     <mi>a</mi><mi>d</mi></mrow>   </msub>   <mrow><mo>(</mo>    <mi>t</mi>   <mo>)</mo></mrow><mo>=</mo><mo>&#x2212;</mo><msup>    <mover accent='true'>     <mi>B</mi>     <mo>&#x00AF;</mo>    </mover>        <mo>+</mo>   </msup>   <mi>F</mi><mi>f</mi><mrow><mo>(</mo>    <mi>t</mi>   <mo>)</mo></mrow></mrow>   </semantics></math></disp-formula><p>Where:</p>

<inline-formula><math> <semantics>  <mrow>   <mover accent='true'>    <mi>B</mi>    <mo>&#x00AF;</mo>   </mover>   <mo>=</mo><mi>B</mi><mo>+</mo><mi>&#x0394;</mi><mi>B</mi></mrow>   </semantics></math></inline-formula><p>In addition, <math> <semantics>  <mrow>   <msup>    <mover accent='true'>     <mi>B</mi>     <mo>&#x00AF;</mo>    </mover>        <mo>+</mo>   </msup>   </mrow>   </semantics></math> is the pseudo-inverse of matrix<math> <semantics>  <mover accent='true'>   <mi>B</mi>   <mo>&#x00AF;</mo>  </mover>     </semantics></math>.</p>
<title><i>3.2. PIM for uncertain neutral time-delay system</i></title><p>In this part, the Pseudo-Inverse-Method is based on the error determination between the closed loop system and the nominal one.</p>
<p>The main idea of this method is to modify the constant feedback gains of nominal system, then, synthesized controller gains that can stabilize the faulty systems.</p>
<p>The reference model is defined as:</p>

<disp-formula id="FD23"><label>(23)</label><math> <semantics>  <mrow>   <mover accent='true'>    <mi>&#x03BE;</mi>    <mo>&#x02D9;</mo>   </mover>   <mrow><mo>(</mo>    <mi>t</mi>   <mo>)</mo></mrow><mo>=</mo><msub>    <mi>X</mi>    <mn>1</mn>   </msub>   <mi>&#x03BE;</mi><mrow><mo>(</mo>    <mi>t</mi>   <mo>)</mo></mrow><mo>+</mo><msub>    <mi>X</mi>    <mn>2</mn>   </msub>   <mi>&#x03BE;</mi><mrow><mo>(</mo>    <mrow>     <mi>t</mi><mo>&#x2212;</mo><mi>h</mi></mrow>   <mo>)</mo></mrow><mo>+</mo><msub>    <mi>X</mi>    <mn>3</mn>   </msub>   <mover accent='true'>    <mi>&#x03BE;</mi>    <mo>&#x02D9;</mo>   </mover>   <mrow><mo>(</mo>    <mrow>     <mi>t</mi><mo>&#x2212;</mo><mi>d</mi></mrow>   <mo>)</mo></mrow></mrow>   </semantics></math></disp-formula><p>Where<math> <semantics>  <mrow>   <msub>    <mi>X</mi>    <mn>1</mn>   </msub>   </mrow>   </semantics></math>, <math> <semantics>  <mrow>   <msub>    <mi>X</mi>    <mn>2</mn>   </msub>   </mrow>   </semantics></math> and <math> <semantics>  <mrow>   <msub>    <mi>X</mi>    <mn>3</mn>   </msub>   </mrow>   </semantics></math> are given.</p>
<p>Considering the state feedback, the set of admissible controls is:</p>

<disp-formula id="FD24"><label>(24)</label><math> <semantics>  <mrow>   <msub>    <mi>u</mi>    <mrow>     <mi>n</mi><mi>o</mi><mi>m</mi></mrow>   </msub>   <mrow><mo>(</mo>    <mi>t</mi>   <mo>)</mo></mrow><mo>=</mo><msub>    <mi>G</mi>    <mrow>     <mi>n</mi><mi>o</mi><mi>m</mi></mrow>   </msub>   <msub>    <mi>v</mi>    <mrow>     <mi>r</mi><mi>e</mi><mi>f</mi></mrow>   </msub>   <mrow><mo>(</mo>    <mi>t</mi>   <mo>)</mo></mrow><mo>&#x2212;</mo><msub>    <mi>K</mi>    <mrow>     <mi>n</mi><mi>o</mi><mi>m</mi></mrow>   </msub>   <mi>&#x03BE;</mi><mrow><mo>(</mo>    <mi>t</mi>   <mo>)</mo></mrow></mrow>   </semantics></math></disp-formula><p>Where:</p>
<p><math> <semantics>  <mrow>   <msub>    <mi>v</mi>    <mrow>     <mi>r</mi><mi>e</mi><mi>f</mi></mrow>   </msub>   <mrow><mo>(</mo>    <mi>t</mi>   <mo>)</mo></mrow></mrow>   </semantics></math> is the reference signal.</p>
<p><math> <semantics>  <mrow>   <msub>    <mi>G</mi>    <mrow>     <mi>n</mi><mi>o</mi><mi>m</mi></mrow>   </msub>   </mrow>   </semantics></math> and <math> <semantics>  <mrow>   <msub>    <mi>K</mi>    <mrow>     <mi>n</mi><mi>o</mi><mi>m</mi></mrow>   </msub>   </mrow>   </semantics></math> are the nominal feedback matrix obtained as:</p>
<p>When the fault is detected, the system (1) can be presented as:</p>

<disp-formula id="FD25"><label>(25)</label></disp-formula><p>Where <math> <semantics>  <mrow>   <msub>    <mi>u</mi>    <mrow>     <mi>P</mi><mi>I</mi><mi>M</mi></mrow>   </msub>   <mrow><mo>(</mo>    <mi>t</mi>   <mo>)</mo></mrow></mrow>   </semantics></math> represent the control law of the PIM and it is represented as:</p>

<disp-formula id="FD26"><label>(26)</label><math> <semantics>  <mrow>   <msub>    <mi>u</mi>    <mrow>     <mi>P</mi><mi>I</mi><mi>M</mi></mrow>   </msub>   <mrow><mo>(</mo>    <mi>t</mi>   <mo>)</mo></mrow><mo>=</mo><mo>&#x2212;</mo><msub>    <mi>K</mi>    <mi>f</mi>   </msub>   <mi>&#x03BE;</mi><mrow><mo>(</mo>    <mi>t</mi>   <mo>)</mo></mrow><mo>+</mo><msub>    <mi>G</mi>    <mi>f</mi>   </msub>   <msub>    <mi>v</mi>    <mrow>     <mi>r</mi><mi>e</mi><mi>f</mi></mrow>   </msub>   <mrow><mo>(</mo>    <mi>t</mi>   <mo>)</mo></mrow></mrow>   </semantics></math></disp-formula><p>Where <math> <semantics>  <mrow>   <msub>    <mi>K</mi>    <mi>f</mi>   </msub>   </mrow>   </semantics></math> and <math> <semantics>  <mrow>   <msub>    <mi>G</mi>    <mi>f</mi>   </msub>   </mrow>   </semantics></math> are the new feedback gain matrices to be determined.</p>
<p>The expressions of the controllers gain can be represented as follows:</p>
</sec><sec id="sec4">
<title>Simulation Results</title><p>In this section, a numerical example is presented to demonstrate the effectiveness of the proposed theoretical development. Considering the linear neutral time-delay system (2), with the system matrices described by: </p>

<inline-formula><math> <semantics>  <mrow>   <mtable>    <mtr>     <mtd>      <mrow>       <mi>f</mi><mrow><mo>(</mo>        <mi>t</mi>       <mo>)</mo></mrow><mo>=</mo><mrow><mo>{</mo> <mrow>        <mtable>         <mtr>          <mtd>           <mn>2</mn>          </mtd>          <mtd>           <mrow>            <mo>;</mo><mn>25</mn><mo>&#x2264;</mo><mi>t</mi><mo>&#x2264;</mo><mn>40</mn></mrow>          </mtd>         </mtr>         <mtr>          <mtd>           <mn>0</mn>          </mtd>          <mtd>           <mrow>            <mo>;</mo><mi>o</mi><mi>t</mi><mi>h</mi><mi>e</mi><mi>r</mi><mi>w</mi><mi>i</mi><mi>s</mi><mi>e</mi></mrow>          </mtd>         </mtr>                 </mtable></mrow> </mrow></mrow>     </mtd>    </mtr>    <mtr>     <mtd>      <mrow>       <mtable>        <mtr>         <mtd>          <mrow>           <mtable>            <mtr>             <mtd>              <mrow>               <msup>                <mi>&#x03C4;</mi>                <mo>*</mo>               </msup>               <mo>=</mo><mn>2.236</mn><mo>;</mo></mrow>             </mtd>             <mtd>              <mrow>               <mi>&#x03BC;</mi><mo>=</mo><mn>0.5</mn></mrow>             </mtd>            </mtr>                       </mtable></mrow>         </mtd>        </mtr>        <mtr>         <mtd>          <mrow>           <mi>&#x03C4;</mi><mrow><mo>(</mo>            <mi>t</mi>           <mo>)</mo></mrow><mo>=</mo><mn>0.5</mn><mi>sin</mi><mrow><mo>(</mo>            <mrow>             <mn>10</mn><mi>t</mi></mrow>           <mo>)</mo></mrow><mo>+</mo><mn>0.5</mn></mrow>         </mtd>        </mtr>               </mtable></mrow>     </mtd>    </mtr>       </mtable></mrow>   </semantics></math></inline-formula><p>From theorem 1 and 2, we obtain respectively:</p>

<inline-formula><math> <semantics>  <mrow>   <mtable>    <mtr>     <mtd>      <mrow>       <mi>L</mi><mo>=</mo><mrow><mo>[</mo> <mrow>        <mtable>         <mtr>          <mtd>           <mrow>            <mn>16.0459</mn></mrow>          </mtd>          <mtd>           <mrow>            <mo>&#x2212;</mo><mn>14.8568</mn></mrow>          </mtd>         </mtr>         <mtr>          <mtd>           <mrow>            <mo>&#x2212;</mo><mn>9.0311</mn></mrow>          </mtd>          <mtd>           <mrow>            <mn>11.1109</mn></mrow>          </mtd>         </mtr>                 </mtable></mrow> <mo>]</mo></mrow></mrow>     </mtd>     <mtd>      <mrow>       <mtable>        <mtr>         <mtd>          <mo>;</mo>         </mtd>         <mtd>          <mrow>           <mi>H</mi><mo>=</mo><mrow><mo>[</mo> <mrow>            <mtable>             <mtr>              <mtd>               <mrow>                <mn>13.3768</mn></mrow>              </mtd>              <mtd>               <mrow>                <mo>&#x2212;</mo><mn>10.9836</mn></mrow>              </mtd>             </mtr>             <mtr>              <mtd>               <mrow>                <mo>&#x2212;</mo><mn>7.4135</mn></mrow>              </mtd>              <mtd>               <mrow>                <mn>8.3279</mn></mrow>              </mtd>             </mtr>                         </mtable></mrow> <mo>]</mo></mrow></mrow>         </mtd>        </mtr>               </mtable></mrow>     </mtd>    </mtr>       </mtable></mrow>   </semantics></math></inline-formula><p>And</p>

<inline-formula><math> <semantics>  <mrow>   <mi>&#x0393;</mi><mo>=</mo><mn>2.684</mn></mrow>   </semantics></math></inline-formula><p>From theorem 3, the feedback matrix gain is obtained as:</p>

<inline-formula><math> <semantics>  <mrow>   <mi>K</mi><mo>=</mo><mrow><mo>[</mo> <mrow>    <mtable>     <mtr>      <mtd>       <mrow>        <mo>&#x2212;</mo><mn>0.5406</mn></mrow>      </mtd>      <mtd>       <mrow>        <mo>&#x2212;</mo><mn>0.1999</mn></mrow>      </mtd>     </mtr>     <mtr>      <mtd>       <mrow>        <mo>&#x2212;</mo><mn>0.3194</mn></mrow>      </mtd>      <mtd>       <mrow>        <mo>&#x2212;</mo><mn>1.2802</mn></mrow>      </mtd>     </mtr>         </mtable></mrow> <mo>]</mo></mrow></mrow>   </semantics></math></inline-formula>
<inline-formula><math> <semantics>  <mrow>   <mtable>    <mtr>     <mtd>      <mrow>       <msub>        <mi>K</mi>        <mi>f</mi>       </msub>       <mo>=</mo><mrow><mo>[</mo> <mrow>        <mtable>         <mtr>          <mtd>           <mrow>            <mn>2.815</mn></mrow>          </mtd>          <mtd>           <mrow>            <mn>2.2157</mn></mrow>          </mtd>         </mtr>         <mtr>          <mtd>           <mrow>            <mn>1.6215</mn></mrow>          </mtd>          <mtd>           <mrow>            <mn>2.1157</mn></mrow>          </mtd>         </mtr>                 </mtable></mrow> <mo>]</mo></mrow><mo>;</mo></mrow>     </mtd>     <mtd>      <mrow>       <msub>        <mi>G</mi>        <mi>f</mi>       </msub>       <mo>=</mo><mrow><mo>[</mo> <mrow>        <mtable>         <mtr>          <mtd>           <mn>2</mn>          </mtd>          <mtd>           <mn>2</mn>          </mtd>         </mtr>         <mtr>          <mtd>           <mn>2</mn>          </mtd>          <mtd>           <mn>2</mn>          </mtd>         </mtr>                 </mtable></mrow> <mo>]</mo></mrow></mrow>     </mtd>    </mtr>       </mtable></mrow>   </semantics></math></inline-formula><fig id="fig1">
<label>Figure 1</label>
<caption>
<p>y1 (t) with PIM and additive control law.</p>
</caption>
<graphic xlink:href="59.fig.001" />
</fig><fig id="fig2">
<label>Figure 2</label>
<caption>
<p>y2 (t) with PIM and additive control law.</p>
</caption>
<graphic xlink:href="59.fig.002" />
</fig><p>By the use of additive control law method.Figure <xref ref-type="fig" rid="fig1"> 1</xref> andFigure <xref ref-type="fig" rid="figfigure 2"> figure 2</xref> show that this control is able to compensate the fault (for y1add (t) and y2add (t)).</p>
<p>The PIM method can minimize the error between the faulty system and the reference one,Figure <xref ref-type="fig" rid="figfigure 1"> figure 1</xref> (y1PIM (t)), but it is not the case inFigure <xref ref-type="fig" rid="figfigure 2"> figure 2</xref> (y2PIM (t)) where the performance is minimized.</p>
<p></p>
</sec><sec id="sec5">
<title>Conclusion</title><p>In this paper, two methods of active fault tolerant control are presented for an uncertain neutral time delay system.</p>
<p>With an additive control law added to the nominal control, the proposed AFTC achieves the minimization of fault effects.</p>
<p>By using a Pseudo-Inverse Method (PIM), the performance satisfaction is guaranteed for y1PIM (t) but for y2PIM (t) is not totally guaranteed. A numerical example has been given to show the effectiveness and limitation of the proposed methods.</p>
</sec>
  </body>
  <back>
    <ref-list>
      <title>References</title>
      
<ref id="R1">
<label>[1]</label>
<mixed-citation publication-type="other">Benjemaa, R.; Elhsoumi A.; and Bel Hadj Ali, S."Stability and Active Fault Tolerant Control design for a class of neutral time delay systems". In: International Conference on Signal, Control and Communication (SCC) 2019. IEEE, 2019. pp. 24-29.
</mixed-citation>
</ref>
<ref id="R2">
<label>[2]</label>
<mixed-citation publication-type="other">Benjemaa, R.; Elhsoumi, A.; and Bel Hadj Ali, S. "Active Fault Tolerant Control for uncertain neutral time delay system". In the International Multi-Conference on Systems, Signals and Devices 2020.
</mixed-citation>
</ref>
<ref id="R3">
<label>[3]</label>
<mixed-citation publication-type="other">Soltani, H.; Bel Hadj Ali, S.; and El Harabi, R. " Fault tolerant control for uncertain state time-delay systems", International Multi-conference on systems, Signals and Devices 2015, Sfax, Tunisia, pp. 1-6.
</mixed-citation>
</ref>
<ref id="R4">
<label>[4]</label>
<mixed-citation publication-type="other">Abdelkrim, N.; Gassara, H.; and Chaabane, M. "Robust stabilization of time delay systems with polytopic-type uncertainties: lmi approach". The 4th International conference on systems and control 2015, 28-30 April. Sousse, Tunisia.
</mixed-citation>
</ref>
<ref id="R5">
<label>[5]</label>
<mixed-citation publication-type="other">Benjemaa, R.; Elhsoumi, A.; and Bel Hadj Ali, S. "Robust and PIM Control for Transmission Line with variable time delay". In the International conference on Sciences and Techniques of Automatic, control computer engineering (STA) 2020.
</mixed-citation>
</ref>
<ref id="R6">
<label>[6]</label>
<mixed-citation publication-type="other">Blanke, M.; Lunze, J.; Staroswiecki, M.; and Schroder, J. "Diagnosis and Fault-tolerant Control". Springer-Vcrlag, 2006, Berlin.
</mixed-citation>
</ref>
<ref id="R7">
<label>[7]</label>
<mixed-citation publication-type="other">Sun, X.; and Zhao, J. "Robust adaptive control for a class of nonlinear uncertain neutral delay systems", in Proceedings of American Control Conference 2004, Boston, Massachusetts, pp.609-613.
</mixed-citation>
</ref>
<ref id="R8">
<label>[8]</label>
<mixed-citation publication-type="other">Kaveh, M.; and Amir, G.A. "Adaptive robust control of uncertain neutral time-delay systems". American Control Conference 2008, Washington, USA, pp. 5162-5167.
</mixed-citation>
</ref>
<ref id="R9">
<label>[9]</label>
<mixed-citation publication-type="other">Carlos, E.; and Xi, L. "Delay-dependent robust control for uncertain linear state delayed systems", in Automatica 1999, vol. 35, No. 13, pp.1313-1321.
</mixed-citation>
</ref>
<ref id="R10">
<label>[10]</label>
<mixed-citation publication-type="other">Xu, S.; Shi, P.; Chu, Y.; and Zou, Y. "Robust stochastic stabilization and control of uncertain neutral stochastic time delay systems". Journal of Mathematical Analysis and Applications 2006, vol. 314, No. 1, pp. 1-16.
</mixed-citation>
</ref>
<ref id="R11">
<label>[11]</label>
<mixed-citation publication-type="other">Wei, Q.; Juan, L.; and Shumin, F. "Stability for uncertain neutral systems with time-varying delay". Chinese Control and Decision Conference 2010, Xuzhou, China, pp.1963-1965.
</mixed-citation>
</ref>
    </ref-list>
  </back>
</article>