Passive Localization Algorithm for Remote Multitarget Localization Information
The development of wireless communication has led to the wide application of passive localization. Although passive localization has strong antijamming and concealment, its accuracy will be reduced due to false location. In order to solve the above problem, particle swarm optimization–back‐propagati...
Saved in:
| Published in: | IEEJ transactions on electrical and electronic engineering Vol. 15; no. 8; pp. 1183 - 1187 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Hoboken, USA
John Wiley & Sons, Inc
01.08.2020
Wiley Subscription Services, Inc |
| Subjects: | |
| ISSN: | 1931-4973, 1931-4981 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The development of wireless communication has led to the wide application of passive localization. Although passive localization has strong antijamming and concealment, its accuracy will be reduced due to false location. In order to solve the above problem, particle swarm optimization–back‐propagation (PSO‐BP) algorithm was used to improve the accuracy of passive location model in this study, and it was compared with the traditional BP algorithm and extreme learning machine (ELM) algorithm by simulation. The results showed that the coordinate error calculated by the PSO‐BP neural network was smaller than that of the BP neural network and ELM algorithms, and the error fluctuation was smaller; with the increase of the number of multitarget localization, the average error and positioning time of the BP algorithm gradually increased, while the average positioning error and positioning time of the PSO‐BP algorithm basically remained stable, smaller than the BP algorithm. © 2020 Institute of Electrical Engineers of Japan. Published by Wiley Periodicals LLC. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 1931-4973 1931-4981 |
| DOI: | 10.1002/tee.23179 |