Efficient multi-sensor path scheduling for cooperative target tracking

The Journal of Engineering

Wei Yi¹  Lingtong Meng¹  Tao Zhou¹ 

[1] University of Electronic Science and Technology of China;

关键词: 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;   

DOI  :  10.1049/joe.2019.0229

来源: DOAJ

【 摘 要 】

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.

【 授权许可】

Unknown