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

Multiple actuator-fault detectability analysis using invariant sets for discrete-time LPV systems

Author

Listed:
  • Bo Min
  • Feng Xu
  • Junbo Tan
  • Xueqian Wang
  • Bin Liang

Abstract

This paper characterises and analyses the minimum detectable fault (MDF) (named generalised MDF here) for multiple multiplicative actuator faults based on set-separation constraints of healthy and faulty residual sets for discrete-time linear parameter varying (LPV) systems with bounded inputs and uncertainties. First, multiple multiplicative actuator faults are equivalently transformed into the form of multiple additive actuator faults for the sake of obtaining the simplified faulty residual set explicitly. Then, two different generalised MDF for different multiple actuator faults are, respectively, defined, which can be computed via solving simple linear programming (LP) problems. Moreover, we propose three detectability conditions to guarantee the detection of multiple multiplicative actuator faults by using the invariant set-based method. Finally, we provide effective selection guidance for the detection of different multiple multiplicative actuator faults by systematically analysing the conservatism and characteristics of these three guaranteed detectability conditions. At the end of this paper, an electrical circuit example is used to illustrate the effectiveness of the proposed method.

Suggested Citation

  • Bo Min & Feng Xu & Junbo Tan & Xueqian Wang & Bin Liang, 2020. "Multiple actuator-fault detectability analysis using invariant sets for discrete-time LPV systems," International Journal of Systems Science, Taylor & Francis Journals, vol. 51(16), pages 3451-3470, December.
  • Handle: RePEc:taf:tsysxx:v:51:y:2020:i:16:p:3451-3470
    DOI: 10.1080/00207721.2020.1817610
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207721.2020.1817610?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:51:y:2020:i:16:p:3451-3470. 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.