Efficient multi-sensor path scheduling for cooperative target tracking
This study deals with path scheduling problem of cooperative target tracking by multiple sensors with bearings only measurements. First, the authors derive a closed-form expression of the determinant (D-optimality criterion) of the Fisher information matrix (FIM) as the cost function, which contains...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2019-07-01
|
Series: | The Journal of Engineering |
Subjects: | |
Online Access: | https://digital-library.theiet.org/content/journals/10.1049/joe.2019.0229 |
id |
doaj-bbb514ab25b0417c9496f3df1792afeb |
---|---|
record_format |
Article |
spelling |
doaj-bbb514ab25b0417c9496f3df1792afeb2021-04-02T13:07:37ZengWileyThe Journal of Engineering2051-33052019-07-0110.1049/joe.2019.0229JOE.2019.0229Efficient multi-sensor path scheduling for cooperative target trackingLingtong Meng0Wei Yi1Tao Zhou2University of Electronic Science and Technology of ChinaUniversity of Electronic Science and Technology of ChinaUniversity of Electronic Science and Technology of ChinaThis study deals with path scheduling problem of cooperative target tracking by multiple sensors with bearings only measurements. First, the authors derive a closed-form expression of the determinant (D-optimality criterion) of the Fisher information matrix (FIM) as the cost function, which contains the knowledge of the target and the locations of sensors. Second, a penalty function is introduced to modify the cost function for threats avoidance and physics constraints are applied to limit directions of sensors. Then, an efficient strategy based on steepest descent is proposed to solve the optimisation problem. Finally, the effectiveness of the proposed algorithm is demonstrated both in localisation of a stationary target and tracking a moving target. Simulation results show the trajectories of sensors for cooperative target tracking are almost identical to a grid-based search method; however, the computational complexity is reduced by several orders of magnitude.https://digital-library.theiet.org/content/journals/10.1049/joe.2019.0229optimisationgradient methodssensor fusiontarget trackingschedulingmatrix algebrapath scheduling problemFisher information matrixcost functionpenalty functionphysics constraintsoptimisation problemcooperative target trackingthreat avoidancemultisensor path schedulingsteepest descentmoving target tracking |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Lingtong Meng Wei Yi Tao Zhou |
spellingShingle |
Lingtong Meng Wei Yi Tao Zhou Efficient multi-sensor path scheduling for cooperative target tracking The Journal of Engineering optimisation gradient methods sensor fusion target tracking scheduling matrix algebra path scheduling problem Fisher information matrix cost function penalty function physics constraints optimisation problem cooperative target tracking threat avoidance multisensor path scheduling steepest descent moving target tracking |
author_facet |
Lingtong Meng Wei Yi Tao Zhou |
author_sort |
Lingtong Meng |
title |
Efficient multi-sensor path scheduling for cooperative target tracking |
title_short |
Efficient multi-sensor path scheduling for cooperative target tracking |
title_full |
Efficient multi-sensor path scheduling for cooperative target tracking |
title_fullStr |
Efficient multi-sensor path scheduling for cooperative target tracking |
title_full_unstemmed |
Efficient multi-sensor path scheduling for cooperative target tracking |
title_sort |
efficient multi-sensor path scheduling for cooperative target tracking |
publisher |
Wiley |
series |
The Journal of Engineering |
issn |
2051-3305 |
publishDate |
2019-07-01 |
description |
This study deals with path scheduling problem of cooperative target tracking by multiple sensors with bearings only measurements. First, the authors derive a closed-form expression of the determinant (D-optimality criterion) of the Fisher information matrix (FIM) as the cost function, which contains the knowledge of the target and the locations of sensors. Second, a penalty function is introduced to modify the cost function for threats avoidance and physics constraints are applied to limit directions of sensors. Then, an efficient strategy based on steepest descent is proposed to solve the optimisation problem. Finally, the effectiveness of the proposed algorithm is demonstrated both in localisation of a stationary target and tracking a moving target. Simulation results show the trajectories of sensors for cooperative target tracking are almost identical to a grid-based search method; however, the computational complexity is reduced by several orders of magnitude. |
topic |
optimisation gradient methods sensor fusion target tracking scheduling matrix algebra path scheduling problem Fisher information matrix cost function penalty function physics constraints optimisation problem cooperative target tracking threat avoidance multisensor path scheduling steepest descent moving target tracking |
url |
https://digital-library.theiet.org/content/journals/10.1049/joe.2019.0229 |
work_keys_str_mv |
AT lingtongmeng efficientmultisensorpathschedulingforcooperativetargettracking AT weiyi efficientmultisensorpathschedulingforcooperativetargettracking AT taozhou efficientmultisensorpathschedulingforcooperativetargettracking |
_version_ |
1721566344432844800 |