## Aktuell:

#### 14. November 2019

## Dr. Ben Hermann vertritt die Professur IT-Sicherheit an der Universität Paderborn

Seit dem Wintersemester 19/20 hat die Fachgruppe IT-Sicherheit eine neue Leitung. Dr. Ben Hermann vom Heinz Nixdorf ...

# Publikationen

Kempkes, Barbara;Meyer auf der Heide, Friedhelm:

BibTeX in die Zwischenablage kopieren

# Continuous Local Strategies for Robotic Formation Problems.

In: Proceedings of the 11th International Symposium on Experimental Algorithms - SEA, Lecture Notes in Computer Science, Band 7276 , S. 9-17, Jun. 2012, Springer-Verlag## Abstract

We consider a scenario with a team of autonomous mobile robots which are placed in the plane. Their goal is to move in such a way that they eventually reach a prescribed formation. Such a formation may be a straight line between two given endpoints (Robot Chain Problem), a circle or any other geometric pattern, or just one point (Gathering Problem). In this survey, we assume that there is no central control that guides the robot's decisions, thus the robots have to self-organize in order to accomplish global tasks like the above-mentioned formation problems. Moreover, we restrict them to simple local strategies: the robots are limited to "see" only robots within a bounded viewing range; their decisions where to move next are solely based on the relative positions of robots within this range. Most strategies for these type of problems assume a discrete time model, i.e., time is divided into rounds, in a round, each robot moves to some target point defined by the observations of its environment. In this talk, we focus on a much less examined class of local strategies, namely continuous strategies. Here, each robot continuously observes his environment and continuously adapts its speed and direction to these observations. focus on these type of strategies and survey recent results on local strategies for short robot chains and gathering in the continuous time model. We present such strategies for the Robot Chain and the Gathering Problem and analyze them w.r.t. the distance traveled by the robots. For both problems, we survey bounds for the "price of locality", namely the ratio between the cost of our local algorithms and the optimal cost assuming global view, for each individual start configuration.## Bibtex

@inproceedings{hniid=6107,

author = {Kempkes, Barbara and Meyer auf der Heide, Friedhelm},

title = {Continuous Local Strategies for Robotic Formation Problems},

booktitle = { Proceedings of the 11th International Symposium on Experimental Algorithms - SEA},

volume = { 7276},

series = {Lecture Notes in Computer Science},

pages = {9-17},

publisher = {Springer-Verlag},

month = jun,

year = {2012},

}

author = {Kempkes, Barbara and Meyer auf der Heide, Friedhelm},

title = {Continuous Local Strategies for Robotic Formation Problems},

booktitle = { Proceedings of the 11th International Symposium on Experimental Algorithms - SEA},

volume = { 7276},

series = {Lecture Notes in Computer Science},

pages = {9-17},

publisher = {Springer-Verlag},

month = jun,

year = {2012},

}

BibTeX in die Zwischenablage kopieren