An improved adaptive hybrid firefly differential evolution algorithm for passive target localization
| Autor: | Predrag Pejovic, Maja B. Rosić, Mirjana Simic |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Semidefinite programming
0209 industrial biotechnology Mutation operator Optimization problem Computer science Estimator Computational intelligence 02 engineering and technology Theoretical Computer Science 020901 industrial engineering & automation Differential evolution 0202 electrical engineering electronic engineering information engineering Benchmark (computing) 020201 artificial intelligence & image processing Firefly algorithm Geometry and Topology Algorithm Software |
| Zdroj: | Soft Computing. 25:5559-5585 |
| ISSN: | 1433-7479 1432-7643 |
| DOI: | 10.1007/s00500-020-05554-8 |
| Popis: | This paper considers a passive target localization problem based on the noisy time of arrival measurements obtained from multiple receivers and a single transmitter. The maximum likelihood (ML) estimator for this localization problem is formulated as a highly nonlinear and non-convex optimization problem, where conventional optimization methods are not suitable for solving such a problem. Consequently, this paper proposes an improved adaptive hybrid firefly differential evolution (AHFADE) algorithm, based on hybridization of firefly algorithm (FA) and differential evolution (DE) algorithm to estimate the unknown position of the target. The proposed AHFADE algorithm dynamically adjusts the control parameters, thus maintaining high population diversity during the evolution process. This paper aims to improve the accuracy of the global optimal solution by incorporating evolutionary operators of the DE in different searching stages of the FA. In this regard, an adaptive parameter is employed to select an appropriate mutation operator for achieving a proper balance between global exploration and local exploitation. In order to efficiently solve the ML estimation problem, this paper proposes the well-known semidefinite programming (SDP) method to convert the non-convex problem into a convex one. The simulation results obtained from the proposed AHFADE algorithm and well-known algorithms, such as SDP, DE and FA, are compared against Cramer–Rao lower bound (CRLB). The statistical analysis has been performed to compare the performance of the proposed AHFADE algorithm with several well-known algorithms on CEC2014 benchmark problems. The obtained simulation results show that the proposed AHFADE algorithm is more robust in high-noise environments compared to existing algorithms. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink