Friedhelm Meyer auf der Heide 1 HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Local Strategies for Building Geometric Formations Friedhelm Meyer auf der Heide University of Paderborn Joint work with Bastian Degener Barbara Kempkes
13
Embed
Friedhelm Meyer auf der Heide 1 HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Local Strategies for Building Geometric Formations.
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Friedhelm Meyer auf der Heide 1
HEINZ NIXDORF INSTITUTEUniversity of Paderborn
Algorithms and Complexity
Local Strategies for Building Geometric Formations
Friedhelm Meyer auf der Heide University of Paderborn
Joint work with
Bastian Degener
Barbara Kempkes
Friedhelm Meyer auf der Heide 2
HEINZ NIXDORF INSTITUTEUniversity of Paderborn
Algorithms and Complexity
Gathering problem:Robots gather in one point
Sparse network formation problem:
Robots form a sparse network connecting stations
Circle formation problem:Robots form a circle
Relay chain problem:Robots minimize the length of a chain between two stations
Geometric formation problems
Friedhelm Meyer auf der Heide 3
HEINZ NIXDORF INSTITUTEUniversity of Paderborn
Algorithms and ComplexityThe model
In a step,
- a robot senses its neighborhood (robots in distance one),- decides where to move solely based on the relative
positions of its neighbors,- moves.
A round finishes as soon as each robot was active at least once. We assume an initial random order of the robots.
Asynchronous, random order sense-compute-move model