Startseite > Publikationen > Publikationen

Publikationen

Degener, Bastian;Kempkes, Barbara;Meyer auf der Heide, Friedhelm:

A local O(n^2) gathering algorithm.

In: SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, S. 217-223, Jun. 2010, ACM

Abstract

The gathering problem, where n autonomous robots with restricted capabilities are required to meet in a single point of the plane, is widely studied. We consider the case that robots are limited to see only robots within a bounded vicinity and present an algorithm achieving gathering in O(n^2) rounds in expectation. A round consists of a movement of all robots, in random order. All previous algorithms with a proven time bound assume global view on the configuration of all robots.

Dateien

gathering.pdf



Bibtex

@inproceedings{hniid=4996,
author = {Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm},
title = {A local O(n^2) gathering algorithm},
booktitle = {SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures},
pages = {217-223},
publisher = {ACM},
month = jun,
year = {2010},
}

BibTeX in die Zwischenablage kopieren

Permalink

https://www.hni.uni-paderborn.de/pub/4996