Sciweavers

7 search results - page 1 / 2
» CBUG: A Quadratically Competitive Mobile Robot Navigation Al...
Sort
View
ICRA
2005
IEEE
117views Robotics» more  ICRA 2005»
13 years 10 months ago
CBUG: A Quadratically Competitive Mobile Robot Navigation Algorithm
Abstract This paper is concerned with the problem where a mobile robot of size D has to navigate to a target in an unknown planar environment. The competitiveness of an on-line nav...
Yoav Gabriely, Elon Rimon
IJCGA
2010
155views more  IJCGA 2010»
13 years 3 months ago
Competitive Complexity of Mobile Robot on-Line Motion Planning Problems
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
Yoav Gabriely, Elon Rimon
ICRA
2006
IEEE
99views Robotics» more  ICRA 2006»
13 years 10 months ago
MRSAM: a Quadratically Competitive Multi-robot Online Navigation Algorithm
— We explore an online problem where a group of robots has to find a target whose position is unknown in an unknown planar environment whose geometry is acquired by the robots d...
Shahar Sarid, Amir Shapiro, Yoav Gabriely
ICRA
2007
IEEE
134views Robotics» more  ICRA 2007»
13 years 11 months ago
MRBUG: A Competitive Multi-Robot Path Finding Algorithm
— 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 du...
Shahar Sarid, Amir Shapiro, Yoav Gabriely
SODA
1996
ACM
101views Algorithms» more  SODA 1996»
13 years 5 months ago
Randomized Robot Navigation Algorithms
We consider the problem faced by a mobile robot that has to reach a given target by traveling through an unmapped region in the plane containing oriented rectangular obstacles. We...
Piotr Berman, Avrim Blum, Amos Fiat, Howard J. Kar...