Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme

Project Period: 2021-08-01 – 2024-08-01
Externally Funded
Michael Dellnitz, Friedhelm Meyer auf der Heide
Funding Organisation

3 Publications

2021 | Conference Paper | LibreCat-ID: 23730
Gathering a Euclidean Closed Chain of Robots in Linear Time
J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, in: L. Gasieniec, R. Klasing, T. Radzik (Eds.), Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), Springer, 2021, pp. 29–44.
LibreCat | DOI | arXiv
2021 | Conference Paper | LibreCat-ID: 26986
The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation
J. Castenow, T. Götte, T. Knollmann, F. Meyer auf der Heide, in: C. Johnen, E.M. Schiller, S. Schmid (Eds.), Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021, Springer, 2021, pp. 289–304.
LibreCat | DOI | arXiv
2022 | Journal Article | LibreCat-ID: 29843
A Discrete and Continuous Study of the Max-Chain-Formation Problem
J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, Information and Computation (2022).
LibreCat | DOI