The Direction-finding Stations Scheduling Algorithm Based on BPSO

DOI

10.2991/nceece-15.2016.198How to use a DOI?

Keywords

Fisher information matrix; Binary Particle Swarm Optimization; finding co-location; cyclic shift initialization;

Abstract

To solve the scheduling problems of stations in cooperative localization, binary particle swarm algorithm of scheduling direction-finding stations is proposed based on Fisher information matrix(FIM).This paper makes the trace of FIM matrix as positioning accuracy measure,constructs scheduling model that contains positioning accuracy, signal to noise ratio(SNR) and task balanced three optimization objectives. In the process of solving the model,this paper uses the particle self-cyclic shift initialization method and checking the constraint of fitness function to improve the Binary Particle Swarm Optimization(BPSO).Simulation results show that optimizing the track of FIM can improve the positioning accuracy,compared with the penalty function method, the fitness function by constraint checking can greatly reduce the computational complexity and the improved BPSO convergences faster.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Tai-chuan Sun
AU  - Jing Zhang
AU  - Xiao-min Ran
AU  - Yao-dong Li
PY  - 2015/12
DA  - 2015/12
TI  - The Direction-finding Stations Scheduling Algorithm Based on BPSO
BT  - Proceedings of the 2015 4th National Conference on Electrical, Electronics and Computer Engineering
PB  - Atlantis Press
SP  - 1118
EP  - 1123
SN  - 2352-5401
UR  - https://doi.org/10.2991/nceece-15.2016.198
DO  - 10.2991/nceece-15.2016.198
ID  - Sun2015/12
ER  -