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

Information fusion robust guaranteed cost Kalman estimators with uncertain noise variances and missing measurements

Author

Listed:
  • Ying Zhao
  • Chunshan Yang

Abstract

For multisensor systems with uncertain noise variances and missing measurements, it can be converted into one only with uncertain noise variances by introducing fictitious measurement white noises. According to the minimax robust estimation principle and parameterisation representation of perturbances of uncertain noise variances, based on the worst-case system with conservative upper bounds of uncertain noise variances, the two classes of guaranteed cost robust weighted fusion Kalman estimators with matrix weights, diagonal matrix weights, scalar weights, and covariance intersection fusion matrix weights are presented. One class is the construction of a maximal perturbance region of uncertain noise variances, in which for all admissible perturbances, the accuracy deviations are guaranteed to remain within the prescribed range. The other class is the finding of minimal upper bound and maximal lower bound of accuracy deviations over the given perturbance region of uncertain noise variances. Two problems can be converted into the optimisation problems with constraints. Their optimal analytical solutions can simply be found respectively by the Lagrange multiplier method and the linear programme method. The guaranteed cost robustness is proved by the Lyapunov equation approach. A simulation example applied to the mass-spring system is provided to demonstrate the correctness and effectiveness of the proposed results.

Suggested Citation

  • Ying Zhao & Chunshan Yang, 2019. "Information fusion robust guaranteed cost Kalman estimators with uncertain noise variances and missing measurements," International Journal of Systems Science, Taylor & Francis Journals, vol. 50(15), pages 2853-2869, November.
  • Handle: RePEc:taf:tsysxx:v:50:y:2019:i:15:p:2853-2869
    DOI: 10.1080/00207721.2019.1690719
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207721.2019.1690719?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:15:p:2853-2869. 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.