Search
Abstract
Consider an orthogonal grid of streets and avenues in a Manhattan-like city populated by stationary sensor modules at some intersections and mobile robots that can serve as relays of information that the modules exchange, where both module-module and module-robot communication is limited to a straight line of sight within the grid. The robots are oblivious and move asynchronously. We present a distributed algorithm that, given the sensor locations as input, moves the robots to suitable locations in the grid so that a connected network of all modules is established. The number of robots that the algorithm uses is worst case optimal.
Authors (3)
Cite as
Full text
full text is not available in portal
Keywords
Details
- Category:
- Articles
- Type:
- artykuł w czasopiśmie wyróżnionym w JCR
- Published in:
-
COMPUTING AND INFORMATICS
no. 31,
pages 349 - 369,
ISSN: 1335-9150 - Language:
- English
- Publication year:
- 2012
- Bibliographic description:
- Kosowski A., Suzuki I., Zylinski P.: A Point Set Connection Problem for Autonomous Mobile Robots in a Grid// COMPUTING AND INFORMATICS. -Vol. 31, nr. iss. 2 (2012), s.349-369
- Verified by:
- Gdańsk University of Technology
seen 105 times