Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Multi-strategy improved Aquila optimizer and its application in path planning
Suqian WU, Jianguo YAN, Bin YANG, Tao QIN, Ying LIU, Jing YANG
Journal of Computer Applications    2025, 45 (3): 937-945.   DOI: 10.11772/j.issn.1001-9081.2024020242
Abstract68)   HTML4)    PDF (1988KB)(71)       Save

Aiming at the shortcomings of the original Aquila Optimizer (AO), such as insufficient local development ability, low optimization accuracy and slow convergence speed, a Multi-Strategy Improved AO (MSIAO) for robot path planning was proposed. Firstly, the Sobol sequence was introduced to initialize the Aquila population, which was conducive to diversity of the initial population and improved the convergence speed. Secondly, the local search method was improved by using golden sine operator and idea of self-learning and social learning of particle swarm, which enhanced exploitation ability of the algorithm and reduced the possibility of falling into the local optimum. Meanwhile, a non-linear balance factor was used as switching condition of the two stages, which made better communication among the populations, and was able to balance the global exploration and local exploitation more effectively. Finally, multiple experiments were carried out. Through the simulation on 12 benchmark functions and 10 CEC2017 complex functions, it can be seen that the proposed improvement strategies enhance the global optimization ability of MSIAO greatly. Results of applying MSIAO to robot path planning show that MSIAO can obtain shorter and more reliable moving paths. In 20×20 grid map, the average path of MSIAO is shortened by 2.53%, 3.83%, and 6.70% compared to those of Particle Swarm Optimization (PSO) algorithm, the original AO, and Butterfly Optimization Algorithm (BOA), respectively; and in 40×40 grid map, the average path of MSIAO is shortened by 10.65%, 5.27%, and 14.88% compared to those of the above three algorithms, verifying that the path-finding of MSIAO is more efficient.

Table and Figures | Reference | Related Articles | Metrics
Algorithm of near-duplicate image detection based on Bag-of-words and Hash coding
WANG Yutian YUAN Jiangtao QIN Haiquan LIU Xin
Journal of Computer Applications    2013, 33 (03): 667-669.   DOI: 10.3724/SP.J.1087.2013.00667
Abstract994)      PDF (529KB)(573)       Save
To solve the low efficiency and precision of the traditional methods, a near-duplicate image detection algorithm based on Bag-of-words and Hash coding was proposed in this paper. Firstly, a 500-dimensional feature vector was used to represent an image by Bag-of-words; secondly, feature dimension was reduced by Principal Component Analysis (PCA) and Scale-Invariant Feature Transform (SIFT) and features were encoded by Hash coding; finally, dynamic distance metric was used to detect near-duplicate images. The experimental results show that the algorithm based on Bag-of-words and Hash coding is feasible in detecting near-duplicate images. This algorithm can achieve a good balance between precision and recall rate: the precision rate can reach 90%-95%, and entire recall rate can reach 70%-80%.
Reference | Related Articles | Metrics