Swarm Automated Planning Algorithm with Repairing Operators

Swarm automated planning algorithm is a planning method based on planning graph technology, and the algorithm which could improve the searching efficiency through importing swarm intelligence has the character of global and parallel. Yet sometimes the algorithm has the shortcoming in the local searching. For instance, maybe the quality of the best candidate planning solution would get lower after another around of searching. To enhance the ability of the local searching and the convergence acceleration, the swarm automated planning algorithm which with the local repairing operators is presented in this paper. The searching efficiency could be bettered through the pertinence repairing operators and the heuristic evaluation information to control the repairing processes.