z-logo
Premium
Cooperative sensor deployment for multi‐target monitoring
Author(s) -
Tang Zhijun,
Özgüner Ümit
Publication year - 2007
Publication title -
international journal of robust and nonlinear control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.361
H-Index - 106
eISSN - 1099-1239
pISSN - 1049-8923
DOI - 10.1002/rnc.1220
Subject(s) - software deployment , computer science , mathematical optimization , set (abstract data type) , scheme (mathematics) , resource (disambiguation) , nonlinear system , real time computing , mathematics , computer network , mathematical analysis , physics , quantum mechanics , programming language , operating system
In this paper, the problem of deploying multiple sensor agents (MSAs) to monitor multiple stationary targets is studied. First, the problem is modelled as a special version of the general set‐covering problem. Then a novel motion control scheme is introduced to handle the nonlinear, non‐smooth and non‐additive nature of the multiple objectives that form the cost function in this type of sensor deployment problems. Based on that, a cooperative MSA deployment algorithm is developed. A lower bound for the optimal solution of the set‐covering problem is also derived. Simulation results are presented, demonstrating that given sufficient initial MSA resource, the proposed algorithm is able to lead the MSAs from an arbitrary initial configuration to a final coalition that only requires a near‐minimum number of MSAs to maintain the coverage of the targets. Copyright © 2007 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here