蚁群算法动态寻路算法

输入参数列表

G 地形图为01矩阵，如果为1表示障碍物

Tau 初始信息素矩阵（认为前面的觅食活动中有残留的信息素）

K 迭代次数（指蚂蚁出动多少波）

M 蚂蚁个数（每一波蚂蚁有多少个）

S 起始点（最短路径的起始点）

E 终止点（最短路径的目的点）-Ant colony algorithm for dynamic pathfinding algorithm input parameter list　G topographic map 01 matrix, 1 obstacles Tau initial matrix elements (think front of the foraging activity of residual pheromone)　K iterations ( the ant sent the number of waves)　M ant number (number)　S the starting point (the starting point of the shortest path)　E, the end point (the shortest path to the destination point) for each wave of ants