Fast path searching algorithm based on intelligent obstacle avoidance

The invention discloses a fast path searching algorithm based on intelligent obstacle avoidance. The fast path searching algorithm comprises the following steps: acquiring a grid graph of an area to be detected, identifying a start point, a target point and position information of an obstacle on the grid graph, calculating a path from the start point to the goal point by an approximation algorithm, and if the obstacle is encountered, performing intelligent placeholder bypassing until the obstacle is avoided, wherein intelligent placeholder bypassing adopts a counterclockwise bypassing or clockwise bypassing method; counterclockwise bypassing comprises the following specific processes: cyclically judging whether a placeholder exists in front of the forward direction, and if so, counterclockwise deflecting the forward direction; if no placeholder exists in front, making a step forward; if no placeholder exists in the side orientation, clockwise deflecting the forward direction so as to enable the forward direct