关键词: 动态候选解窗口, 蚁群算法, 路径规划

Abstract: A method of dynamic window of candidate solution is proposed in this paper for path planning using ant colony algorithm. The method divides the window in which candidate solutions are distributed firmly and uniformly into several blocks, and then lets candidate solutions simulate the special ants to choose a certain block with a certain probability according to the heuristic and the sum of pheromone of the upper connection of all candidate solutions after several iteration of ant colony algorithm. Finally, candidate solutions and pheromone in every blocks are reallocated, so that solution can be refined. Ultimately, ant colony can search a best solution of path. Simulation experiments and comparison results show that the performance of dynamic window of candidate solution is better than the fixed window of candidate solution.

Key words: dynamic window of candidate solution, ant colony algorithm, path planning