IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/2043727.html
   My bibliography  Save this article

A Risk-Based Multisensor Optimization Scheduling Method for Target Threat Assessment

Author

Listed:
  • Yunpu Zhang
  • Ganlin Shan

Abstract

The reasonable scheduling of multisensor systems to maximize combat benefits has become a research hotspot in the field of sensor management. To minimize the uncertainty in the threat level of targets and improve the survivability of sensors, a risk-based multisensor scheduling method is proposed in this paper. In this scheduling problem, the best sensors are systematically selected to observe targets for the trade-off between the threat assessment risk and the emission risk. First, the scheduling problem is modelled as a partially observable Markov decision process (POMDP) for target threat assessment. Second, the calculation methods of the threat assessment risk and the emission risk are proposed to quantify the potential loss caused by the uncertainty in the threat level of targets and the emission of sensors. Then, a nonmyopic sensor scheduling objective function is built to minimize the total risk which is the weighted sum of the threat assessment risk and the emission risk. Furthermore, to solve the high complexity computational problem in optimization, a decision tree search algorithm based on branch pruning is designed. Finally, simulations are conducted, and the results show that the proposed algorithm can significantly reduce the searching time and memory consumption in optimization compared with those of traditional algorithms, and the proposed method has a better risk control effect than the existing sensor scheduling methods.

Suggested Citation

  • Yunpu Zhang & Ganlin Shan, 2019. "A Risk-Based Multisensor Optimization Scheduling Method for Target Threat Assessment," Mathematical Problems in Engineering, Hindawi, vol. 2019, pages 1-14, August.
  • Handle: RePEc:hin:jnlmpe:2043727
    DOI: 10.1155/2019/2043727
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2019/2043727.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2019/2043727.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2019/2043727?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
    ---><---

    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:hin:jnlmpe:2043727. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.