The invention discloses a mobile robot path planning method. The method comprises the following steps: S1, creating a robot environment map by adopting a grid method, and defining a start point and atarget point; S2, searching an environment shortest path by adopting an ant colony, wherein the ant colony algorithm contains the following steps: S21, initializing parameters of the ant colony algorithm; S22, placing m ants at the start point, beginning searching to obtain a feasible path node grating; S23, selecting the next step of moving grid by utilizing a distance heuristic function, and adding the current grid into a tabu table; S24, judging whether all ants reach the target point, if all ants reach the target point, performing the step S25, or returning to step S23; S25, performing pheromone updating by utilizing a path deviation amplifying strategy; and S26, judging whether reaching the maximum number of iterations, ending the ant colony algorithm if reaching the maximum number ofiterations, or adding one on the number of iterations and returning to step S22; and S3, taking the shortest path obtained in the step S2 as the optimal path of the planning. The planning method disclosed by the invention not only improves the global optimal solution, but also improves the convergence speed.