Path Planning for Conformal Antenna Surface Detection Based on Improved Genetic Algorithm
Source abstract
Abstract
The conformal antenna is a precision device installed on the wing of an aircraft, and its components are distributed on a curved surface. Quality detection is required after assembly. In solving the path planning problem for conformal antenna surface detection, the traditional genetic algorithm faces problems such as slow convergence and easily falling into a local optimal solution. To solve this problem, an improved genetic algorithm combining the historical optimal population (CHOP-IGA) is proposed. First, the algorithm uses the probability-based four-nearest-neighbor method to construct an initial population. Subsequently, the probabilities of the crossover and mutation operators are dynamically adjusted. Next, the algorithm applies the crossover and mutation operators to the population and performs mutation operations on each individual of the historical optimal population. Then, the fitness value is calculated and the next generation of individuals is selected from the parent, offspring, and historical optimal populations according to the elite selection strategy. Finally, the current best fitness is checked to determine whether updating the historical optimal population is necessary. When the termination condition is satisfied, the algorithm outputs the optimal result. Experiments showed that the algorithm satisfactorily solved the path planning problem for conformal antenna surface detection, with a 48.44% improvement in detection efficiency.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Robotic Path Planning Algorithms · Vehicle Routing Optimization Methods · Metaheuristic Optimization Algorithms Research
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
College of Mechanical and Electrical Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China
No. 29 Research Institute of China Electronics Technology Group Corporation, Chengdu 610036, China
Funding
National key R & D program of China · National Defense Basic Scientific Research Program of China
References (27)
Show source-provided references
1. Continuous evaluation method of outfield reliability for airborne electronic countermeasure system
2. Li, R.L., Niu, Z.Y., and Lin, R.S. (2011, January 26–30). A novel method for the RCS reduction of conformal microstrip antenna. Proceedings of the 2011 Cross Strait Quad-Regional Radio Science and Wireless Technology Conference, Harbin, China.
3. A novel broad beamwidth conformal antenna on unmanned aerial vehicle10.1109/LAWP.2012.2187321 ↗
4. Key process control technology for airborne conformal antenna manufacturing
5. Dynamic programming treatment of the travelling salesman problem10.1145/321105.321111 ↗
6. A branch-and-bound approach to the traveling salesman problem with a drone10.1287/ijoc.2018.0826 ↗
7. Improved particle swarm optimization algorithm based on Hamming distance for traveling salesman problem
8. Improving ant colony optimization efficiency for solving large TSP instances10.1016/j.asoc.2022.108653 ↗
9. Enhanced list-based simulated annealing algorithm for large-scale traveling salesman problem10.1109/ACCESS.2019.2945570 ↗
10. Discrete sparrow search algorithm for symmetric traveling salesman problem10.1016/j.asoc.2022.108469 ↗
11. Simulation of traveling salesman path planning based on ant colony algorithm and genetic algorithm
12. A review on genetic algorithm: Past, present, and future10.1007/s11042-020-10139-6 ↗
13. Bioinformation heuristic genetic algorithm for solving TSP
14. A novel multi-parent order crossover in genetic algorithm for combinatorial optimization problems10.1016/j.cie.2019.05.012 ↗
15. A genetic algorithm with jumping gene and heuristic operators for traveling salesman problem10.1016/j.asoc.2022.109339 ↗
16. Bi-heuristic ant colony optimization-based approaches for traveling salesman problem10.1007/s00500-020-05406-5 ↗
17. Akter, S., Nahar, N., ShahadatHossain, M., and Andersson, K. (2019, January 7–9). A new crossover technique to improve genetic algorithm and its application to TSP. Proceedings of the 2019 International Conference on Electrical, Computer and Communication Engineering (ECCE), Cox’s Bazar, Bangladesh.10.1109/ECACE.2019.8679367 ↗
18. Improved genetic algorithms for the travelling salesman problem10.1504/IJPMB.2014.059449 ↗
19. A comparative study of genetic algorithms for solving TSP problems
20. Discrete particle swarm optimization algorithm for TSP
21. Gene-level population diversity mathematical model of real-coded GA
22. Improve solution of TSP based on route-intersection inspection and elimination method and neighbor nodes interchanging method
23. Hassanat, A., Almohammadi, K., Alkafaween, E., Abunawas, E., Hammouri, A., and Prasath, V.B.S. (2019). Choosing mutation and crossover ratios for genetic algorithms—A review with a new dynamic approach. Information, 10.10.3390/info10120390 ↗
24. Li, M.J. (2002). Theory and Applications of Partheno-Genetic Algorithm. [Ph.D. Thesis, Hunan University].
25. A multi-population genetic algorithm based on cross accessibility evaluation
26. Discrete spider monkey optimization for travelling salesman problem10.1016/j.asoc.2019.105887 ↗
27. Annealing simulation algorithms for three-dimensional constrained TSP