An improved atomic search algorithm for optimization and application in ML DOA estimation of vector hydrophone array

The atom search optimization (ASO) algorithm has the characteristics of fewer parameters and better performance than the traditional intelligent optimization algorithms, but it is found that ASO may easily fall into local optimum and its accuracy is not higher. Therefore, based on the idea of speed...

Full description

Saved in:
Bibliographic Details
Published inAIMS mathematics Vol. 7; no. 4; pp. 5563 - 5593
Main Authors Wang, Peng, He, Weijia, Guo, Fan, He, Xuefang, Huang, Jiajun
Format Journal Article
LanguageEnglish
Published AIMS Press 2022
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:The atom search optimization (ASO) algorithm has the characteristics of fewer parameters and better performance than the traditional intelligent optimization algorithms, but it is found that ASO may easily fall into local optimum and its accuracy is not higher. Therefore, based on the idea of speed update in particle swarm optimization (PSO), an improved atomic search optimization (IASO) algorithm is proposed in this paper. Compared with traditional ASO, IASO has a faster convergence speed and higher precision for 23 benchmark functions. IASO algorithm has been successfully applied to maximum likelihood (ML) estimator for the direction of arrival (DOA), under the conditions of the different number of signal sources, different signal-to-noise ratio (SNR) and different population size, the simulation results show that ML estimator with IASO algorithum has faster convergence speed, fewer iterations and lower root mean square error (RMSE) than ML estimator with ASO, sine cosine algorithm (SCA), genetic algorithm (GA) and particle swarm optimization (PSO). Therefore, the proposed algorithm holds great potential for not only guaranteeing the estimation accuracy but also greatly reducing the computational complexity of multidimensional nonlinear optimization of ML estimator.
ISSN:2473-6988
2473-6988
DOI:10.3934/math.2022308