59 search results - page 1 / 12 » Efficient Boustrophedon Multi-Robot Coverage: an algorithmic... |
AMAI
2008
Springer
13 years 5 months ago
2008
Springer
CIRA
2007
IEEE
13 years 11 months ago
2007
IEEE
— In this paper, a communication-efficient dynamic task scheduling algorithm for a heterogeneous multi-robot system is proposed. To make this task scheduling algorithm to be scal...
ICRA
2002
IEEE
13 years 9 months ago
2002
IEEE
We introduce a new algorithm to cover an unknown space with a homogeneous team of circular mobile robots. Our approach is based on a single robot coverage algorithm, a boustrophed...
ICRA
2006
IEEE
13 years 11 months ago
2006
IEEE
– In this paper, we proposed an improved algorithm for the multi-robot complete coverage problem. Real world applications such as lawn mowing, chemical spill clean-up, and humani...
JAIR
2008
13 years 4 months ago
2008
Multi-robot path planning is difficult due to the combinatorial explosion of the search space with every new robot added. Complete search of the combined state-space soon intracta...