Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
435623 | Theoretical Computer Science | 2015 | 18 Pages |
Abstract
We introduce and study a new problem concerning the exploration of a geometric domain by mobile robots. Consider a line segment [0,I][0,I] and a set of n mobile robots r1,r2,…,rnr1,r2,…,rn placed at one of its endpoints. Each robot has a searching speed sisi and a walking speed wiwi, where si
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Jurek Czyzowicz, Leszek Gąsieniec, Konstantinos Georgiou, Evangelos Kranakis, Fraser MacQuarrie,