Aiming at the problem that the traditional ant colony algorithm for mobile robot path planning easier to stagnation behavior and slower convergence. Local update rule and self-adaptive method construction of dynamic path planning of mobile robot in the maze model are made. Computer simulation and micro-mouse walking robot actual experiments show that the optimal path planning algorithms can effectively work under any complicated situation.