Bug algorithm - Revision history

Eejit43Bot: [Task 1] Fix non-plural section headers, added orphan tag

2023-04-26T02:38:08Z

[Task 1] Fix non-plural section headers, added orphan tag

← Previous revision		Revision as of 02:38, 26 April 2023
Line 1:		Line 1:
			{{Multiple issues\|
			{{Orphan\|date=April 2023}}
	{{More citations needed\|date=June 2021}}		{{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 ==		== Basic assumptions ==
	*The robot is treated as a point inside a 2D world.		*The robot is treated as a point inside a 2D world.
Line 19:		Line 24:
	*[[Motion planning]]		*[[Motion planning]]
	{{clear}}		{{clear}}

	== Reference ==
			== References ==
	{{reflist}}		{{reflist}}

47.218.100.104 at 06:11, 31 January 2023

2023-01-31T06:11:40Z

← Previous revision		Revision as of 06:11, 31 January 2023
Line 9:		Line 9:

	== Algorithm ==		== Algorithm ==
	The most basic form of Bug algorithm (Bug 0) is as follows:		The most basic form of Bug algorithm (Bug 1) is as follows:
	#The robot moves towards the goal until an obstacle is encountered.		#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).		#Follow a canonical direction (clockwise) until the robot reaches the location of initial encounter with the obstacle (in short, walking around the obstacle).

WikiCleanerBot: v2.04b - Bot T20 CW#61 - Fix errors for CW project (Reference before punctuation)

2021-06-21T03:48:11Z

v2.04b - Bot T20 CW#61 - Fix errors for CW project (Reference before punctuation)

← Previous revision		Revision as of 03:48, 21 June 2021
Line 1:		Line 1:
	{{More citations needed\|date=June 2021}}		{{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 ==		== Basic assumptions ==
	*The robot is treated as a point inside a 2D world.		*The robot is treated as a point inside a 2D world.

Dr. Greywolf: /* Algorithm */

2021-06-05T10:26:41Z

Algorithm

← Previous revision		Revision as of 10:26, 5 June 2021
Line 9:		Line 9:

	== Algorithm ==		== Algorithm ==
			The most basic form of Bug algorithm (Bug 0) is as follows:
	#The robot moves towards the goal until an obstacle is encountered.		#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).		#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.		#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.		#Go back to step 1. Repeat this until the goal is reached.

	== See also ==		== See also ==
	*[[Pathfinding]]		*[[Pathfinding]]

Dr. Greywolf: OK, how about this?

2021-06-05T10:26:06Z

OK, how about this?

← Previous revision		Revision as of 10:26, 5 June 2021
Line 1:		Line 1:
	{{More citations needed\|date=June 2021}}		{{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>.		'''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 ==		== Basic assumptions ==
	*The robot is treated as a point inside a 2D world.		*The robot is treated as a point inside a 2D world.

Gpkp: Added {{More citations needed}} tag

2021-06-04T07:19:15Z

Added {{More citations needed}} tag

← Previous revision		Revision as of 07:19, 4 June 2021
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>.		'''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>.
	== Basic assumptions ==		== Basic assumptions ==

Dr. Greywolf: Nothing. Just noted that this topic lacks a wiki page.

2021-06-04T04:04:46Z

Nothing. Just noted that this topic lacks a wiki page.

New page

'''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>.
== Basic assumptions ==
*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 ==
#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.
== See also ==
*[[Pathfinding]]
*[[Motion planning]]
{{clear}}
== Reference ==
{{reflist}}

[[Category:Robot kinematics]]