Bug algorithm

From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by imported>Eejit43Bot at 02:38, 26 April 2023 ([Task 1] Fix non-plural section headers, added orphan tag). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Bug algorithm is a class of algorithm that helps robots deal with motion planning.[1][2]

Basic assumptions

[edit | edit source]
  • 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.

Algorithm

[edit | edit source]

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

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

See also

[edit | edit source]

References

[edit | edit source]
  1. ^ BUG Algorithms.
  2. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
Retrieved from "http://70.231.62.181/index.php?title=Bug_algorithm&oldid=5220294"