@inproceedings{64094,
author = {{Scheideler, Christian and Artmann, Matthias and Maurer, Tobias and Padalkin, Andreas and Warner, Daniel}},
title = {{{AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with Reconfigurable Circuits and Joint Movements (Media Exposition). }}},
year = {{2025}},
}
@article{55379,
abstract = {{AbstractThe amoebot model (Derakhshandeh et al. in: SPAA ACM, pp 220–222. https://doi.org/10.1145/2612669.2612712, 2014) has been proposed as a model for programmable matter consisting of tiny, robotic elements called amoebots. We consider the reconfigurable circuit extension (Feldmann et al. in J Comput Biol 29(4):317–343. https://doi.org/10.1089/cmb.2021.0363, 2022) of the geometric amoebot model that allows the amoebot structure to interconnect amoebots by so-called circuits. A circuit permits the instantaneous transmission of signals between the connected amoebots. In this paper, we examine the structural power of the reconfigurable circuits. We start with fundamental problems like the stripe computation problem where, given any connected amoebot structure S, an amoebot u in S, and some axis X, all amoebots belonging to axis X through u have to be identified. Second, we consider the global maximum problem, which identifies an amoebot at the highest possible position with respect to some direction in some given amoebot (sub)structure. A solution to this problem can be used to solve the skeleton problem, where a cycle of amoebots has to be found in the given amoebot structure which contains all boundary amoebots. A canonical solution to that problem can be used to come up with a canonical path, which provides a unique characterization of the shape of the given amoebot structure. Constructing canonical paths for different directions allows the amoebots to set up a spanning tree and to check symmetry properties of the given amoebot structure. The problems are important for a number of applications like rapid shape transformation, energy dissemination, and structural monitoring. Interestingly, the reconfigurable circuit extension allows polylogarithmic-time solutions to all of these problems.}},
author = {{Padalkin, Andreas and Scheideler, Christian and Warner, Daniel}},
issn = {{1567-7818}},
journal = {{Natural Computing}},
publisher = {{Springer Science and Business Media LLC}},
title = {{{The structural power of reconfigurable circuits in the amoebot model}}},
doi = {{10.1007/s11047-024-09981-6}},
year = {{2024}},
}
@article{64100,
author = {{Scheideler, Christian and Padalkin, Andreas and Warner, Daniel}},
journal = {{The structural power of reconfigurable circuits in the amoebot model. Nat. Comput. 23(4): 603-625 (2024)}},
pages = {{603 -- 625}},
title = {{{The structural power of reconfigurable circuits in the amoebot model. }}},
year = {{2024}},
}
@inproceedings{32602,
author = {{Padalkin, Andreas and Scheideler, Christian and Warner, Daniel}},
booktitle = {{28th International Conference on DNA Computing and Molecular Programming (DNA 28)}},
editor = {{Ouldridge, Thomas E. and Wickham, Shelley F. J.}},
isbn = {{978-3-95977-253-2}},
issn = {{1868-8969}},
pages = {{8:1–8:22}},
publisher = {{Schloss Dagstuhl – Leibniz-Zentrum für Informatik}},
title = {{{The Structural Power of Reconfigurable Circuits in the Amoebot Model}}},
doi = {{10.4230/LIPIcs.DNA.28.8}},
volume = {{238}},
year = {{2022}},
}
@inproceedings{32603,
author = {{Kostitsyna, Irina and Scheideler, Christian and Warner, Daniel}},
booktitle = {{28th International Conference on DNA Computing and Molecular Programming (DNA 28)}},
editor = {{Ouldridge, Thomas E. and Wickham, Shelley F. J.}},
isbn = {{978-3-95977-253-2}},
issn = {{1868-8969}},
pages = {{9:1–9:22}},
publisher = {{Schloss Dagstuhl – Leibniz-Zentrum für Informatik}},
title = {{{Fault-Tolerant Shape Formation in the Amoebot Model}}},
doi = {{10.4230/LIPIcs.DNA.28.9}},
volume = {{238}},
year = {{2022}},
}
@inproceedings{30987,
author = {{Kostitsyna, Irina and Scheideler, Christian and Warner, Daniel}},
booktitle = {{1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}},
editor = {{Aspnes, James and Michail, Othon}},
isbn = {{978-3-95977-224-2}},
issn = {{1868-8969}},
pages = {{23:1–23:3}},
publisher = {{Schloss Dagstuhl – Leibniz-Zentrum für Informatik}},
title = {{{Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model}}},
doi = {{10.4230/LIPIcs.SAND.2022.23}},
volume = {{221}},
year = {{2022}},
}
@inbook{20709,
author = {{Cord-Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus and auf der Heide, Friedhelm Meyer and Raupach, Christoph and Swierkot, Kamil and Warner, Daniel and Weddemann, Christoph and Wonisch, Daniel}},
booktitle = {{SOFSEM 2011: Theory and Practice of Computer Science}},
isbn = {{9783642183805}},
issn = {{0302-9743}},
title = {{{Collisionless Gathering of Robots with an Extent}}},
doi = {{10.1007/978-3-642-18381-2_15}},
year = {{2011}},
}
@inbook{20710,
author = {{Cord-Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus and Meyer auf der Heide, Friedhelm and Raupach, Christoph and Swierkot, Kamil and Warner, Daniel and Weddemann, Christoph and Wonisch, Daniel}},
booktitle = {{Automata, Languages and Programming}},
isbn = {{9783642220111}},
issn = {{0302-9743}},
title = {{{A New Approach for Analyzing Convergence Algorithms for Mobile Robots}}},
doi = {{10.1007/978-3-642-22012-8_52}},
year = {{2011}},
}
@inbook{20711,
author = {{Monien, Burkhard and Lorenz, Ulf and Warner, Daniel}},
booktitle = {{Taschenbuch der Algorithmen}},
isbn = {{9783540763932}},
title = {{{Der Alphabeta-Algorithmus für Spielbäume: Wie bringe ich meinen Computer zum Schachspielen?}}},
doi = {{10.1007/978-3-540-76394-9_28}},
year = {{2008}},
}