Scalable Global and Local Hashing Strategies for Duplicate Pruning in Parallel A* Graph Search
IEEE Transactions on Parallel and Distributed Systems
Ant colony algorithm for the shortest loop design problem
Computers and Industrial Engineering - Special issue: Sustainability and globalization: Selected papers from the 32 nd ICC&IE
An ant algorithm for optimization of hole-making operations
Computers and Industrial Engineering
Genetic algorithm with ant colony optimization (GA-ACO) for multiple sequence alignment
Applied Soft Computing
Ant colony optimization with hill climbing for the bandwidth minimization problem
Applied Soft Computing
Ant colony optimization for resource-constrained project scheduling
IEEE Transactions on Evolutionary Computation
Parametric study for an ant algorithm applied to water distribution system optimization
IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Structural topology optimization using ant colony optimization algorithm
Applied Soft Computing
Multi-UCAV cooperative path planning using improved coevolutionary multi-ant-colony algorithm
ICIC'09 Proceedings of the 5th international conference on Emerging intelligent computing technology and applications
| Hi-index | 0.00 |
A modified ant algorithms is presented as a fast and efficient approach for path planning of UCAV in this paper. To fleetly and reliably accomplish the air combat task, the path planning plays an extremely important role in the design of UCAV. The planned path can ensure UCAV reach the destination along the optimization path with the minimum probability of being found and the minimum energy consumed cost. Due to the big search space, the original ant algorithm can easily converge to local best solutions, and the search speed is slow. For avoiding these disadvantages, an improved ant algorithm is given and it is used to optimize path of UCAV. The modified ant algorithm can improve the speed of selection course, and decrease the probability of local best solutions. When UCAV meets the unexpected threat during its fly, it needs to revise the aforehand given path with re-planning technology. Based on the modified ant algorithm, a new method of three-dimensional real-time path re-planning is presented for UCAV. The simulation results show that this proposed path-planning scheme can obtain the optimization path which can be re-optimized when the unexpected threats appear.