Local algorithms for the continuous gathering problem / vorgelegt von Pavel Podlipyan ; [Betreuer: Prof. Dr. Friedhelm Meyer auf der Heide, Universität Paderborn, Gutachter: Prof. Dr. Friedhelm Meyer auf der Heide, Universität Paderborn, Prof. Dr. Christian Scheideler, Universität Paderborn]. Paderborn, 2017
Content
Introduction
Gathering in the Continuous Time Model
Collisionless Gathering
Go-To-The-Center Algorithm is not Collisionless
Go-To-The-Relative-Center Algorithm in One Dimension
Go-To-The-Relative-Center Algorithm in Two Dimensions
Collisions in Go-To-The-Relative-Center Algorithm
The Collisionless Conjecture for Four Robots
Collisionless Gathering with Some Algorithmic Extensions
Safe-Go-To-The-Relative-Center Algorithm
Correctness and Runtime Analysis of the Safe-Go-To-The-Relative-Center Algorithm
Collisionless Property of the Safe-Go-To-The-Relative-Center Algorithm
The Near Gathering Problem
Conclusion and Outlook
Bibliography