The grey wolf optimizer (GWO) as a new intelligent optimization algorithm has been successfully applied in many fields because of its simple structure, few adjustment parameters and easy implementation. This paper mainly aims at the defects of GWO in path planning application, such as easily falling into local optimization, poor convergence and poor accuracy, and turn point grey wolf optimization (TPGWO) algorithm is proposed. First, the idea of cross-mutation and roulette is used to increase the initial population of GWO and improve the search range. At the same time, the convergence factor function is improved to become a nonlinear update. In the early stage, the search range is expanded, and in the later stage, the convergence speed is increased, while the parameters in the convergence factor function can be adjusted according to the number of obstacles and the map area to change the turning point of the function to improve the convergence speed and accuracy of the algorithm. The turning times and turning angles of the obtained path are added to the fitness function as penalty values to improve the path accuracy. The optimization test is carried out through 16 test functions, and the test results prove the convergence and robustness of TPGWO algorithm. Finally, the TPGWO algorithm is applied to the path planning of patrol robot for simulation experiments. Compared with the GWO algorithm and Particle Swarm Optimization, the simulation results show that the TPGWO algorithm has better convergence, stability and accuracy in the path planning of patrol robot.

No abstract

No abstract

The accurate location of an unknown radio emitter (URE) is a critical task in wireless communication security. The URE localization method based on the received signal strength difference (RSSD) has become popular due to the identification of unknown transmitting power and frequency. However, high computational complexity and low positioning accuracy have been caused by the RSSD fingerprint data’s redundancy and cross-correlation. In this article, an indoor RSSD-based positioning algorithm combining principal component analysis (PCA) and Pearson correlation coefficient (PCC), called RSSD-PCA-PCC, is proposed to realize efficient feature extraction and reduce false fingerprint matching. Firstly, to achieve reduction and decorrelation, the principal components of the RSSD fingerprint database are extracted by the singular value decomposition (SVD) method. Secondly, the PCC is applied to measure the relative distance between the principal component features. In particular, the PCC is used for selecting the reference points (RPs) in order to match the position accurately. The results show that the proposed algorithm can obtain a more superior performance compared with the conventional RSSD-based weighted k-nearest neighbor algorithm (RSSD-WKNN) and COS matching algorithm (RSSD-PCA-COS) in the case of different selected RP numbers, AP numbers, and grid distances.

No abstract