Startseite > Publikationen > Publikationen

Publikationen

Bonorden, Olaf;Degener, Bastian;Kempkes, Barbara;Pietrzyk, Peter:

Complexity and approximation of a geometric local robot assignment problem .

In: Algorithmic Aspects of Wireless Sensor Networks, S. 252 - 262, Jul. 2009, Springer Verlag

Abstract

We introduce a geometric multi-robot assignment problem. Robots positioned in a Euclidean space have to be assigned to treasures in such a way that their joint strength is sufficient to unearth a treasure with a given weight. The robots have a limited range and thus can only be assigned to treasures in their proximity. The objective is to unearth as many treasures as possible. We investigate the complexity of several variants of this problem and show whether they are in $\classP$ or are $\classNP$-complete. Furthermore, we provide a distributed and local constant-factor approximation algorithm using constant-factor resource augmentation for the two-dimensional setting with $\bigO(\log^*n)$ communication rounds.

Dateien

algosensors.pdf



Bibtex

@inproceedings{hniid=3960,
author = {Bonorden, Olaf and Degener, Bastian and Kempkes, Barbara and Pietrzyk, Peter},
title = {Complexity and approximation of a geometric local robot assignment problem },
booktitle = {Algorithmic Aspects of Wireless Sensor Networks},
pages = {252 - 262},
publisher = {Springer Verlag},
month = jul,
year = {2009},
}

BibTeX in die Zwischenablage kopieren

Permalink

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