Bug algorithm: Difference between revisions

Content deleted Content added

Inline

Revision as of 03:48, 21 June 2021

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.

The most basic form of Bug algorithm (Bug 0) is as follows:

The robot moves towards the goal until an obstacle is encountered.
Follow a canonical direction (clockwise) until the robot reaches the location of initial encounter with the obstacle (in short, walking around the obstacle).
The robot then follows the obstacle's boundary to reach the point on the boundary that is closest to the goal.
Go back to step 1. Repeat this until the goal is reached.

@@ Line 1: / Line 1: @@
 {{More citations needed|date=June 2021}}
-'''Bug algorithm''' is a class of [[algorithm]] that helps robots deal with [[motion planning]]<ref>[http://msl.cs.uiuc.edu/~lavalle/cs497_2001/book/uncertain/node3.html BUG Algorithms].</ref><ref>{{Cite book|last=Choset|first=Howie|url=https://www.cs.cmu.edu/~motionplanning/lecture/Chap2-Bug-Alg_howie.pdf|title=Robotic Motion Planning: Bug Algorithms|publisher=Carnegie Mellon University}}</ref>.
+'''Bug algorithm''' is a class of [[algorithm]] that helps robots deal with [[motion planning]].<ref>[http://msl.cs.uiuc.edu/~lavalle/cs497_2001/book/uncertain/node3.html BUG Algorithms].</ref><ref>{{Cite book|last=Choset|first=Howie|url=https://www.cs.cmu.edu/~motionplanning/lecture/Chap2-Bug-Alg_howie.pdf|title=Robotic Motion Planning: Bug Algorithms|publisher=Carnegie Mellon University}}</ref>
 == Basic assumptions ==
 *The robot is treated as a point inside a 2D world.