@inproceedings{d9fbcfc401e340fa90a0035d07918c19,
title = "Local algorithms for autonomous robot systems",
abstract = "This paper studies local algorithms for autonomous robot systems, namely, algorithms that use only information of the positions of a bounded number of their nearest neighbors. The paper focuses on the spreading problem. It defines measures for the quality of spreading, presents a local algorithm for the one-dimensional spreading problem, prove its convergence to the equally spaced configuration and discusses its convergence rate in the synchronous and semi-synchronous settings. It then presents a local algorithm achieving the exact equally spaced configuration in finite time in the synchronous setting, and proves it is time optimal for local algorithms. Finally, the paper also proposes an algorithm for the two-dimensional case and presents simulation results of its effectiveness.",
author = "Reuven Cohen and David Peleg",
year = "2006",
doi = "10.1007/11780823_4",
language = "אנגלית",
isbn = "3540354743",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "29--43",
booktitle = "Structural Information and Communication Complexity - 13th International Colloquium, SIROCCO 2006, Proceedings",
address = "גרמניה",
note = "13th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2006 ; Conference date: 02-07-2006 Through 05-07-2006",
}