In this paper, the situation of the real-time routing plan problems firstly is analyzed. In order to solve these problems, we propose a new optimization algorithm based on ant colony algorithm (modified ant colony algorithm, M-ACA) to optimize them. In M-ACA algorithm, the solution space is dispersed according to the minimum flight distance, and the judgment method of point’s validity in the basic ACA is changed. Simulation results show that modified ant colony algorithm (M-ACA) owns excellent and complete performance in solving real-time routing plan problems, and can quickly find out the feasible path, which can avoid all the threats, meanwhile, due to learning mechanism, updating mechanism and cooperative mechanism, M-ACA has strong search ability and stability.
Real-Time Routing Plan Based on Modified Ant Colony Algorithm
Lect. Notes Electrical Eng.
2021-10-30
11 pages
Article/Chapter (Book)
Electronic Resource
English
Real-Time Routing Plan Based on Modified Ant Colony Algorithm
TIBKAT | 2022
|Multi-UAVs Collaboration Routing Plan Based on Modified Artificial Bee Colony Algorithm
Springer Verlag | 2021
|Multi-UAVs Collaboration Routing Plan Based on Artificial Bee Colony Algorithm with Elite Strategy
Springer Verlag | 2021
|