Ant Colony Optimization Dynamic Pathfinding Algorithm
Input parameter list for Ant Colony Optimization dynamic pathfinding algorithm: G (terrain map as binary matrix where 1 represents obstacles), Tau (initial pheromone matrix considering residual pheromones from previous foraging activities), K (number of iterations representing how many ant waves are dispatched), M (number of ants per wave), S (starting point for shortest path), E (ending point/destination for shortest path)