Bug algorithm
From Wikipedia, the free encyclopedia
Bug algorithm is a class of algorithm that helps robots deal with motion planning.[1][2]
- The robot is treated as a point inside a 2D world.
- The obstacles (if any) are unknown and nonconvex.
- There are clearly defined starting point and goal.
- The robot is able to detect obstacle boundary from a distance of known length.
- The robot always knows the direction and how far (in terms of Euclidean distance) it is from the goal.