2007 # MRBUG: A Competitive Multi-Robot Path Finding Algorithm

**Abstract:** Abstract-We explore an on-line problem where a group of robots has to reach a target whose position is known in an unknown planar environment whose geometry is acquired by the robots during task execution. The critical parameter in such a problem is the physical motion time, which, under the assumption of uniform velocity of all the robots, corresponds to length or cost of the path traveled by the robot which reached the target. The Competitiveness of an on-line algorithm measures its performance relative to t…

Help me understand this report

Search citation statements

Paper Sections

Select...

2

Citation Types

0

2

0

Year Published

2013

2023

Publication Types

Select...

3

1

1

Relationship

0

5

Authors

Journals

(2 citation statements)

(7 reference statements)

0

2

0

“…Many navigation algorithms emerge in this research, e.g., artificial potential field (APF) method, 1 vector field histogram (VFH), 2 fuzzy logic control approach, 3 behavior control method, 4 neural network algorithm, 5 genetic algorithm, 6 Bug algorithm, etc. Some representatives include Bug1, 9 Bug2, 9 VisBug, 10 DistBug, 11 TangentBug, 12 Rev, 13 CautiousBug, 14 MRBUG, 15 ABUG, 16 etc. Some representatives include Bug1, 9 Bug2, 9 VisBug, 10 DistBug, 11 TangentBug, 12 Rev, 13 CautiousBug, 14 MRBUG, 15 ABUG, 16 etc.…”

confidence: 99%

“…Many navigation algorithms emerge in this research, e.g., artificial potential field (APF) method, 1 vector field histogram (VFH), 2 fuzzy logic control approach, 3 behavior control method, 4 neural network algorithm, 5 genetic algorithm, 6 Bug algorithm, etc. Some representatives include Bug1, 9 Bug2, 9 VisBug, 10 DistBug, 11 TangentBug, 12 Rev, 13 CautiousBug, 14 MRBUG, 15 ABUG, 16 etc. Some representatives include Bug1, 9 Bug2, 9 VisBug, 10 DistBug, 11 TangentBug, 12 Rev, 13 CautiousBug, 14 MRBUG, 15 ABUG, 16 etc.…”

confidence: 99%

“…As a famous reactive algorithm, the prototype Bug algorithm was firstly proposed by Lumelsky et al in 1987, 7,8 and later extended to an algorithm cluster in order to improve navigation path in aspects of safety, efficiency, smoothness, and so on. Some representatives include Bug1, 9 Bug2, 9 VisBug, 10 DistBug, 11 TangentBug, 12 Rev, 13 CautiousBug, 14 MRBUG, 15 ABUG, 16 etc. The fundamental characteristic of the Bug algorithm cluster is embodied in its motion manner, in which the whole collision-free path of the robot is combined by two basic motion modes, namely, motion toward the target and obstacle-boundary following if any.…”

confidence: 99%