Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
On traffic laws for mobile robots
Proceedings of the first international conference on Artificial intelligence planning systems
On social laws for artificial agent societies: off-line design
Artificial Intelligence - Special volume on computational research on interaction and agency, part 2
Hot-Potato Algorithms for Permutation Routing
IEEE Transactions on Parallel and Distributed Systems
Safe and Efficient Traffic Laws for Mobile Robots
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
One-to-Many routing on the mesh
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Anonymous graph exploration without collision by mobile robots
Information Processing Letters
On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
| Hi-index | 0.00 |
This paper studies a system of m robots operating in a set of n work locations connected by aisles in a nxn grid, where m≥n.Form time to the robots need to move along the aisles, in order to visit disjoint sets of locations. The movement of the robots must comply with the following constraints: (1) no two robots can collide at a grid node or traverse a grid edge at the same time; (2) a robot's sensory capability is limited to detecting the presence of another robot at a neighboring node. We present a deterministic protocol that, for any small constant e 0, allows m≤(1-e)n targets and no target is visited by more than one robot. We also prove a lower bound showing that our protocols were known only for m≤ n, while for general m≤ n only a suboptimal randomized protocols were known.