Article ID Journal Published Year Pages File Type
427857 Information Processing Letters 2011 5 Pages PDF
Abstract

We consider the problem of exploring an anonymous line by a team of k identical, oblivious, asynchronous deterministic mobile robots that can view the environment but cannot communicate. We completely characterize sizes of teams of robots capable of exploring an n  -node line. For k

► Characterization of numbers k4k>4, or k=4k=4 and n is odd. ► When exploration is possible, we give an exploration algorithm. ► For other values, we prove an impossibility result.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
How many oblivious robots can explore a line
Authors
, , , ,