A Point Set Connection Problem for Autonomous Mobile Robots in a Grid

In: Computing and Informatics, vol. 31, no. 2

A. Kosowski - I. Suzuki - P. Źyliński

Details:

Year, pages: 2012, 349 - 369

Keywords:

Asynchronous algorithm, autonomous mobile robot, distributed algorithm, connected network, oblivious algorithm, grid

About article:

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.

How to cite:

ISO 690:

Kosowski, A., Suzuki, I., Źyliński, P. 2012. A Point Set Connection Problem for Autonomous Mobile Robots in a Grid. In Computing and Informatics, vol. 31, no.2, pp. 349-369. 1335-9150.

APA:

Kosowski, A., Suzuki, I., Źyliński, P. (2012). A Point Set Connection Problem for Autonomous Mobile Robots in a Grid. Computing and Informatics, 31(2), 349-369. 1335-9150.