IDEAS home Printed from https://ideas.repec.org/a/taf/tsysxx/v50y2019i16p2962-2978.html
   My bibliography  Save this article

Invariant set-based robust fault detection and optimal fault estimation for discrete-time LPV systems with bounded uncertainties

Author

Listed:
  • Junbo Tan
  • Feng Xu
  • Xueqian Wang
  • Jun Yang
  • Bin Liang

Abstract

This paper proposes an invariant set-based robust fault detection (FD) and optimal fault estimation (FE) method for discrete-time linear parameter varying (LPV) systems with bounded uncertainties. Firstly, a novel invariant-set construction method for discrete-time LPV systems is proposed if and only if the system is poly-quadratically stable, which need not satisfy the condition that there must exist a common quadratic Lyapunov function for all vertex matrices of the system compared to the traditional invariant-set construction methods. Furthermore, by using a shrinking procedure, we provide minimal robust positively invariant (mRPI) set approximations that are always positively invariant at each step of iteration and allow a priori desired precision to obtain a high sensitivity of FD. Owing to the existence of invariant set-based FD phase, the assumption that the initial faults should be bounded by a given set can be avoided for FE. We compute an optimal parametric matrix gain by minimising the Frobenius norm-based size of the corresponding FE set to obtain the optimal FE performance. Theoretically, any trajectory in the FE tube can be chosen as a specific-value estimation for the real fault signals. Finally, a vehicle dynamics system is used to illustrate the effectiveness of the proposed method.

Suggested Citation

  • Junbo Tan & Feng Xu & Xueqian Wang & Jun Yang & Bin Liang, 2019. "Invariant set-based robust fault detection and optimal fault estimation for discrete-time LPV systems with bounded uncertainties," International Journal of Systems Science, Taylor & Francis Journals, vol. 50(16), pages 2962-2978, December.
  • Handle: RePEc:taf:tsysxx:v:50:y:2019:i:16:p:2962-2978
    DOI: 10.1080/00207721.2019.1691283
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2019.1691283
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207721.2019.1691283?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tsysxx:v:50:y:2019:i:16:p:2962-2978. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TSYS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.