IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v17y2021i6p15501477211023022.html
   My bibliography  Save this article

Optimal sensor placements using modified Fisher information matrix and effective information algorithm

Author

Listed:
  • Eun-Taik Lee
  • Hee-Chang Eun

Abstract

This article presents an optimal sensor placement algorithm for modifying the Fisher information matrix and effective information. The modified Fisher information matrix and effective information are expressed using a dynamic equation constrained by the condensed relationship of the incomplete mode shape matrix. The mode shape matrix row corresponding to the master degree of freedom of the lowest-contribution Fisher information matrix and effective information indices is moved to the slave degree of freedom during each iteration to obtain an updated shape matrix, which is then used in subsequent calculations. The iteration is repeated until the target sensors attain the targeted number of modes. The numerical simulations are then applied to compare the optimal sensor placement results obtained using the number of installed sensors, and the contribution matrices using the Fisher information matrix and effective information approaches are compared based on the proposed parameter matrix. The mode-shape-based optimal sensor placement approach selects the optimal sensor layout at the positions to uniformly allocate the entire degree of freedom. The numerical results reveal that the proposed F-based and effective information–based approaches lead to slightly different results, depending on the number of parameter matrix modes; however, the resulting final optimal sensor placement is included in a group of common candidate sensor locations. However, the resulting final optimal sensor placement is included in a group of common candidate sensor locations.

Suggested Citation

  • Eun-Taik Lee & Hee-Chang Eun, 2021. "Optimal sensor placements using modified Fisher information matrix and effective information algorithm," International Journal of Distributed Sensor Networks, , vol. 17(6), pages 15501477211, June.
  • Handle: RePEc:sae:intdis:v:17:y:2021:i:6:p:15501477211023022
    DOI: 10.1177/15501477211023022
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/15501477211023022
    Download Restriction: no

    File URL: https://libkey.io/10.1177/15501477211023022?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
    ---><---

    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:sae:intdis:v:17:y:2021:i:6:p:15501477211023022. 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: SAGE Publications (email available below). General contact details of provider: .

    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.