---
_id: '56298'
abstract:
- lang: eng
  text: "In the general pattern formation (GPF) problem, a swarm of simple autonomous,\r\ndisoriented
    robots must form a given pattern. The robots' simplicity imply a\r\nstrong limitation:
    When the initial configuration is rotationally symmetric,\r\nonly patterns with
    a similar symmetry can be formed [Yamashita, Suzyuki; TCS\r\n2010]. The only known
    algorithm to form large patterns with limited visibility\r\nand without memory
    requires the robots to start in a near-gathering (a swarm of\r\nconstant diameter)
    [Hahn et al.; SAND 2024]. However, not only do we not know\r\nany near-gathering
    algorithm guaranteed to preserve symmetry but most natural\r\ngathering strategies
    trivially increase symmetries [Castenow et al.; OPODIS\r\n2022].\r\n  Thus, we
    study near-gathering without changing the swarm's rotational\r\nsymmetry for disoriented,
    oblivious robots with limited visibility (the\r\nOBLOT-model, see [Flocchini et
    al.; 2019]). We introduce a technique based on\r\nthe theory of dynamical systems
    to analyze how a given algorithm affects\r\nsymmetry and provide sufficient conditions
    for symmetry preservation. Until\r\nnow, it was unknown whether the considered
    OBLOT-model allows for any\r\nnon-trivial algorithm that always preserves symmetry.
    Our first result shows\r\nthat a variant of Go-to-the-Average always preserves
    symmetry but may sometimes\r\nlead to multiple, unconnected near-gathering clusters.
    Our second result is a\r\nsymmetry-preserving near-gathering algorithm that works
    on swarms with a convex\r\nboundary (the outer boundary of the unit disc graph)
    and without holes (circles\r\nof diameter 1 inside the boundary without any robots)."
author:
- first_name: Raphael
  full_name: Gerlach, Raphael
  id: '32655'
  last_name: Gerlach
  orcid: 0009-0002-4750-2051
- first_name: Sören
  full_name: von der Gracht, Sören
  id: '97359'
  last_name: von der Gracht
  orcid: 0000-0002-8054-2058
- first_name: Christopher
  full_name: Hahn, Christopher
  last_name: Hahn
- first_name: Jonas
  full_name: Harbig, Jonas
  id: '47213'
  last_name: Harbig
- first_name: Peter
  full_name: Kling, Peter
  last_name: Kling
citation:
  ama: 'Gerlach R, von der Gracht S, Hahn C, Harbig J, Kling P. Symmetry Preservation
    in Swarms of Oblivious Robots with Limited  Visibility. In: Bonomi S, Galletta
    L, Rivière  Etienne, Schiavoni  Valerio, eds. <i>28th International Conference
    on Principles of Distributed Systems (OPODIS 2024)</i>. Vol 324. Leibniz International
    Proceedings in Informatics (LIPIcs). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik;
    2025. doi:<a href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.13">10.4230/LIPIcs.OPODIS.2024.13</a>'
  apa: Gerlach, R., von der Gracht, S., Hahn, C., Harbig, J., &#38; Kling, P. (2025).
    Symmetry Preservation in Swarms of Oblivious Robots with Limited  Visibility.
    In S. Bonomi, L. Galletta,  Etienne Rivière, &#38;  Valerio Schiavoni (Eds.),
    <i>28th International Conference on Principles of Distributed Systems (OPODIS
    2024)</i> (Vol. 324). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. <a href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.13">https://doi.org/10.4230/LIPIcs.OPODIS.2024.13</a>
  bibtex: '@inproceedings{Gerlach_von der Gracht_Hahn_Harbig_Kling_2025, series={Leibniz
    International Proceedings in Informatics (LIPIcs)}, title={Symmetry Preservation
    in Swarms of Oblivious Robots with Limited  Visibility}, volume={324}, DOI={<a
    href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.13">10.4230/LIPIcs.OPODIS.2024.13</a>},
    booktitle={28th International Conference on Principles of Distributed Systems
    (OPODIS 2024)}, publisher={Schloss Dagstuhl -- Leibniz-Zentrum für Informatik},
    author={Gerlach, Raphael and von der Gracht, Sören and Hahn, Christopher and Harbig,
    Jonas and Kling, Peter}, editor={Bonomi, Silvia and Galletta, Letterio and Rivière,  Etienne
    and Schiavoni,  Valerio}, year={2025}, collection={Leibniz International Proceedings
    in Informatics (LIPIcs)} }'
  chicago: Gerlach, Raphael, Sören von der Gracht, Christopher Hahn, Jonas Harbig,
    and Peter Kling. “Symmetry Preservation in Swarms of Oblivious Robots with Limited 
    Visibility.” In <i>28th International Conference on Principles of Distributed
    Systems (OPODIS 2024)</i>, edited by Silvia Bonomi, Letterio Galletta,  Etienne
    Rivière, and  Valerio Schiavoni, Vol. 324. Leibniz International Proceedings in
    Informatics (LIPIcs). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, 2025.
    <a href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.13">https://doi.org/10.4230/LIPIcs.OPODIS.2024.13</a>.
  ieee: 'R. Gerlach, S. von der Gracht, C. Hahn, J. Harbig, and P. Kling, “Symmetry
    Preservation in Swarms of Oblivious Robots with Limited  Visibility,” in <i>28th
    International Conference on Principles of Distributed Systems (OPODIS 2024)</i>,
    Lucca, Italy, 2025, vol. 324, doi: <a href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.13">10.4230/LIPIcs.OPODIS.2024.13</a>.'
  mla: Gerlach, Raphael, et al. “Symmetry Preservation in Swarms of Oblivious Robots
    with Limited  Visibility.” <i>28th International Conference on Principles of Distributed
    Systems (OPODIS 2024)</i>, edited by Silvia Bonomi et al., vol. 324, Schloss Dagstuhl
    -- Leibniz-Zentrum für Informatik, 2025, doi:<a href="https://doi.org/10.4230/LIPIcs.OPODIS.2024.13">10.4230/LIPIcs.OPODIS.2024.13</a>.
  short: 'R. Gerlach, S. von der Gracht, C. Hahn, J. Harbig, P. Kling, in: S. Bonomi,
    L. Galletta,  Etienne Rivière,  Valerio Schiavoni (Eds.), 28th International Conference
    on Principles of Distributed Systems (OPODIS 2024), Schloss Dagstuhl -- Leibniz-Zentrum
    für Informatik, 2025.'
conference:
  end_date: 2024-12-13
  location: Lucca, Italy
  name: 28th International Conference on Principles of Distributed Systems (OPODIS
    2024)
  start_date: 2024-12-11
date_created: 2024-10-01T13:29:43Z
date_updated: 2025-01-09T11:39:19Z
department:
- _id: '101'
doi: 10.4230/LIPIcs.OPODIS.2024.13
editor:
- first_name: Silvia
  full_name: Bonomi, Silvia
  last_name: Bonomi
- first_name: Letterio
  full_name: Galletta, Letterio
  last_name: Galletta
- first_name: ' Etienne'
  full_name: Rivière,  Etienne
  last_name: Rivière
- first_name: ' Valerio'
  full_name: Schiavoni,  Valerio
  last_name: Schiavoni
external_id:
  arxiv:
  - '2409.19277'
intvolume: '       324'
keyword:
- Swarm Algorithm
- Swarm Robots
- Distributed Algorithm
- Pattern Formation
- Limited Visibility
- Oblivious
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/2409.19277
oa: '1'
project:
- _id: '106'
  grant_number: '453112019'
  name: 'Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme'
publication: 28th International Conference on Principles of Distributed Systems (OPODIS
  2024)
publication_identifier:
  isbn:
  - 978-3-95977-360-7
  issn:
  - 1868-8969
publication_status: published
publisher: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Symmetry Preservation in Swarms of Oblivious Robots with Limited  Visibility
type: conference
user_id: '97359'
volume: 324
year: '2025'
...
---
_id: '33947'
article_type: original
author:
- first_name: Jannik
  full_name: Castenow, Jannik
  id: '38705'
  last_name: Castenow
- first_name: Jonas
  full_name: Harbig, Jonas
  id: '47213'
  last_name: Harbig
- first_name: Daniel
  full_name: Jung, Daniel
  id: '37827'
  last_name: Jung
- first_name: Till
  full_name: Knollmann, Till
  id: '39241'
  last_name: Knollmann
  orcid: 0000-0003-2014-4696
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: Castenow J, Harbig J, Jung D, Knollmann T, Meyer auf der Heide F. Gathering
    a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for
    Chain-Formation. <i>Theoretical Computer Science</i>. 2023;939:261-291. doi:<a
    href="https://doi.org/10.1016/j.tcs.2022.10.031">10.1016/j.tcs.2022.10.031</a>
  apa: Castenow, J., Harbig, J., Jung, D., Knollmann, T., &#38; Meyer auf der Heide,
    F. (2023). Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved
    Algorithms for Chain-Formation. <i>Theoretical Computer Science</i>, <i>939</i>,
    261–291. <a href="https://doi.org/10.1016/j.tcs.2022.10.031">https://doi.org/10.1016/j.tcs.2022.10.031</a>
  bibtex: '@article{Castenow_Harbig_Jung_Knollmann_Meyer auf der Heide_2023, title={Gathering
    a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for
    Chain-Formation}, volume={939}, DOI={<a href="https://doi.org/10.1016/j.tcs.2022.10.031">10.1016/j.tcs.2022.10.031</a>},
    journal={Theoretical Computer Science}, publisher={Elsevier BV}, author={Castenow,
    Jannik and Harbig, Jonas and Jung, Daniel and Knollmann, Till and Meyer auf der
    Heide, Friedhelm}, year={2023}, pages={261–291} }'
  chicago: 'Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm
    Meyer auf der Heide. “Gathering a Euclidean Closed Chain of Robots in Linear Time
    and Improved Algorithms for Chain-Formation.” <i>Theoretical Computer Science</i>
    939 (2023): 261–91. <a href="https://doi.org/10.1016/j.tcs.2022.10.031">https://doi.org/10.1016/j.tcs.2022.10.031</a>.'
  ieee: 'J. Castenow, J. Harbig, D. Jung, T. Knollmann, and F. Meyer auf der Heide,
    “Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms
    for Chain-Formation,” <i>Theoretical Computer Science</i>, vol. 939, pp. 261–291,
    2023, doi: <a href="https://doi.org/10.1016/j.tcs.2022.10.031">10.1016/j.tcs.2022.10.031</a>.'
  mla: Castenow, Jannik, et al. “Gathering a Euclidean Closed Chain of Robots in Linear
    Time and Improved Algorithms for Chain-Formation.” <i>Theoretical Computer Science</i>,
    vol. 939, Elsevier BV, 2023, pp. 261–91, doi:<a href="https://doi.org/10.1016/j.tcs.2022.10.031">10.1016/j.tcs.2022.10.031</a>.
  short: J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, Theoretical
    Computer Science 939 (2023) 261–291.
date_created: 2022-10-28T05:11:16Z
date_updated: 2023-01-30T09:20:09Z
department:
- _id: '63'
doi: 10.1016/j.tcs.2022.10.031
external_id:
  arxiv:
  - '2010.04424 '
intvolume: '       939'
keyword:
- General Computer Science
- Theoretical Computer Science
language:
- iso: eng
page: 261-291
project:
- _id: '106'
  name: 'Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme'
publication: Theoretical Computer Science
publication_identifier:
  issn:
  - 0304-3975
publication_status: published
publisher: Elsevier BV
status: public
title: Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms
  for Chain-Formation
type: journal_article
user_id: '38705'
volume: 939
year: '2023'
...
---
_id: '34008'
author:
- first_name: Jannik
  full_name: Castenow, Jannik
  id: '38705'
  last_name: Castenow
- first_name: Jonas
  full_name: Harbig, Jonas
  id: '47213'
  last_name: Harbig
- first_name: Daniel
  full_name: Jung, Daniel
  id: '37827'
  last_name: Jung
- first_name: Peter
  full_name: Kling, Peter
  last_name: Kling
- first_name: Till
  full_name: Knollmann, Till
  id: '39241'
  last_name: Knollmann
  orcid: 0000-0003-2014-4696
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Castenow J, Harbig J, Jung D, Kling P, Knollmann T, Meyer auf der Heide F.
    A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited
    Visibility . In: Hillel E, Palmieri R, Riviére E, eds. <i>Proceedings of the 26th
    International Conference on Principles of Distributed Systems (OPODIS) </i>. Vol
    253. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl
    – Leibniz Zentrum für Informatik; 2023:15:1–15:25. doi:<a href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.15">10.4230/LIPIcs.OPODIS.2022.15</a>'
  apa: Castenow, J., Harbig, J., Jung, D., Kling, P., Knollmann, T., &#38; Meyer auf
    der Heide, F. (2023). A Unifying Approach to Efficient (Near-)Gathering of Disoriented
    Robots with Limited Visibility . In E. Hillel, R. Palmieri, &#38; E. Riviére (Eds.),
    <i>Proceedings of the 26th International Conference on Principles of Distributed
    Systems (OPODIS) </i> (Vol. 253, p. 15:1–15:25). Schloss Dagstuhl – Leibniz Zentrum
    für Informatik. <a href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.15">https://doi.org/10.4230/LIPIcs.OPODIS.2022.15</a>
  bibtex: '@inproceedings{Castenow_Harbig_Jung_Kling_Knollmann_Meyer auf der Heide_2023,
    place={Brussels}, series={Leibniz International Proceedings in Informatics (LIPIcs)},
    title={A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots
    with Limited Visibility }, volume={253}, DOI={<a href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.15">10.4230/LIPIcs.OPODIS.2022.15</a>},
    booktitle={Proceedings of the 26th International Conference on Principles of Distributed
    Systems (OPODIS) }, publisher={Schloss Dagstuhl – Leibniz Zentrum für Informatik},
    author={Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Kling, Peter and
    Knollmann, Till and Meyer auf der Heide, Friedhelm}, editor={Hillel, Eshcar and
    Palmieri, Roberto and Riviére, Etienne}, year={2023}, pages={15:1–15:25}, collection={Leibniz
    International Proceedings in Informatics (LIPIcs)} }'
  chicago: 'Castenow, Jannik, Jonas Harbig, Daniel Jung, Peter Kling, Till Knollmann,
    and Friedhelm Meyer auf der Heide. “A Unifying Approach to Efficient (Near-)Gathering
    of Disoriented Robots with Limited Visibility .” In <i>Proceedings of the 26th
    International Conference on Principles of Distributed Systems (OPODIS) </i>, edited
    by Eshcar Hillel, Roberto Palmieri, and Etienne Riviére, 253:15:1–15:25. Leibniz
    International Proceedings in Informatics (LIPIcs). Brussels: Schloss Dagstuhl
    – Leibniz Zentrum für Informatik, 2023. <a href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.15">https://doi.org/10.4230/LIPIcs.OPODIS.2022.15</a>.'
  ieee: 'J. Castenow, J. Harbig, D. Jung, P. Kling, T. Knollmann, and F. Meyer auf
    der Heide, “A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots
    with Limited Visibility ,” in <i>Proceedings of the 26th International Conference
    on Principles of Distributed Systems (OPODIS) </i>, Brussels, 2023, vol. 253,
    p. 15:1–15:25, doi: <a href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.15">10.4230/LIPIcs.OPODIS.2022.15</a>.'
  mla: Castenow, Jannik, et al. “A Unifying Approach to Efficient (Near-)Gathering
    of Disoriented Robots with Limited Visibility .” <i>Proceedings of the 26th International
    Conference on Principles of Distributed Systems (OPODIS) </i>, edited by Eshcar
    Hillel et al., vol. 253, Schloss Dagstuhl – Leibniz Zentrum für Informatik, 2023,
    p. 15:1–15:25, doi:<a href="https://doi.org/10.4230/LIPIcs.OPODIS.2022.15">10.4230/LIPIcs.OPODIS.2022.15</a>.
  short: 'J. Castenow, J. Harbig, D. Jung, P. Kling, T. Knollmann, F. Meyer auf der
    Heide, in: E. Hillel, R. Palmieri, E. Riviére (Eds.), Proceedings of the 26th
    International Conference on Principles of Distributed Systems (OPODIS) , Schloss
    Dagstuhl – Leibniz Zentrum für Informatik, Brussels, 2023, p. 15:1–15:25.'
conference:
  end_date: 2022-12-15
  location: Brussels
  name: 26th International Conference on Principles of Distributed Systems (OPODIS)
  start_date: 2022-12-13
date_created: 2022-11-04T09:41:30Z
date_updated: 2023-02-15T14:53:12Z
department:
- _id: '63'
doi: 10.4230/LIPIcs.OPODIS.2022.15
editor:
- first_name: Eshcar
  full_name: Hillel, Eshcar
  last_name: Hillel
- first_name: Roberto
  full_name: Palmieri, Roberto
  last_name: Palmieri
- first_name: Etienne
  full_name: Riviére, Etienne
  last_name: Riviére
external_id:
  arxiv:
  - '2206.07567 '
intvolume: '       253'
language:
- iso: eng
page: 15:1–15:25
place: Brussels
project:
- _id: '106'
  name: 'Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme'
publication: 'Proceedings of the 26th International Conference on Principles of Distributed
  Systems (OPODIS) '
publication_identifier:
  isbn:
  - 978-3-95977-265-5
  issn:
  - 1868-8969
publication_status: published
publisher: Schloss Dagstuhl – Leibniz Zentrum für Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: 'A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with
  Limited Visibility '
type: conference
user_id: '38705'
volume: 253
year: '2023'
...
---
_id: '44769'
author:
- first_name: Jannik
  full_name: Castenow, Jannik
  id: '38705'
  last_name: Castenow
- first_name: Jonas
  full_name: Harbig, Jonas
  id: '47213'
  last_name: Harbig
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Castenow J, Harbig J, Meyer auf der Heide F. Unifying Gathering Protocols
    for Swarms of Mobile Robots. In: <i>Lecture Notes in Computer Science</i>. Springer
    International Publishing; 2023. doi:<a href="https://doi.org/10.1007/978-3-031-30448-4_1">10.1007/978-3-031-30448-4_1</a>'
  apa: Castenow, J., Harbig, J., &#38; Meyer auf der Heide, F. (2023). Unifying Gathering
    Protocols for Swarms of Mobile Robots. In <i>Lecture Notes in Computer Science</i>.
    Springer International Publishing. <a href="https://doi.org/10.1007/978-3-031-30448-4_1">https://doi.org/10.1007/978-3-031-30448-4_1</a>
  bibtex: '@inbook{Castenow_Harbig_Meyer auf der Heide_2023, place={Cham}, title={Unifying
    Gathering Protocols for Swarms of Mobile Robots}, DOI={<a href="https://doi.org/10.1007/978-3-031-30448-4_1">10.1007/978-3-031-30448-4_1</a>},
    booktitle={Lecture Notes in Computer Science}, publisher={Springer International
    Publishing}, author={Castenow, Jannik and Harbig, Jonas and Meyer auf der Heide,
    Friedhelm}, year={2023} }'
  chicago: 'Castenow, Jannik, Jonas Harbig, and Friedhelm Meyer auf der Heide. “Unifying
    Gathering Protocols for Swarms of Mobile Robots.” In <i>Lecture Notes in Computer
    Science</i>. Cham: Springer International Publishing, 2023. <a href="https://doi.org/10.1007/978-3-031-30448-4_1">https://doi.org/10.1007/978-3-031-30448-4_1</a>.'
  ieee: 'J. Castenow, J. Harbig, and F. Meyer auf der Heide, “Unifying Gathering Protocols
    for Swarms of Mobile Robots,” in <i>Lecture Notes in Computer Science</i>, Cham:
    Springer International Publishing, 2023.'
  mla: Castenow, Jannik, et al. “Unifying Gathering Protocols for Swarms of Mobile
    Robots.” <i>Lecture Notes in Computer Science</i>, Springer International Publishing,
    2023, doi:<a href="https://doi.org/10.1007/978-3-031-30448-4_1">10.1007/978-3-031-30448-4_1</a>.
  short: 'J. Castenow, J. Harbig, F. Meyer auf der Heide, in: Lecture Notes in Computer
    Science, Springer International Publishing, Cham, 2023.'
date_created: 2023-05-11T13:13:45Z
date_updated: 2023-05-11T13:14:43Z
department:
- _id: '63'
doi: 10.1007/978-3-031-30448-4_1
language:
- iso: eng
place: Cham
project:
- _id: '106'
  name: 'Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme'
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783031304477'
  - '9783031304484'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Unifying Gathering Protocols for Swarms of Mobile Robots
type: book_chapter
user_id: '38705'
year: '2023'
...
---
_id: '23730'
author:
- first_name: Jannik
  full_name: Castenow, Jannik
  id: '38705'
  last_name: Castenow
- first_name: Jonas
  full_name: Harbig, Jonas
  id: '47213'
  last_name: Harbig
- first_name: Daniel
  full_name: Jung, Daniel
  id: '37827'
  last_name: Jung
- first_name: Till
  full_name: Knollmann, Till
  id: '39241'
  last_name: Knollmann
  orcid: 0000-0003-2014-4696
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Castenow J, Harbig J, Jung D, Knollmann T, Meyer auf der Heide F. Gathering
    a Euclidean Closed Chain of Robots in Linear Time. In: Gasieniec L, Klasing R,
    Radzik T, eds. <i>Proceedings of the 17th International Symposium on Algorithms
    and Experiments for Wireless Sensor Networks (ALGOSENSORS)</i>. Vol 12961. LNCS.
    Springer; 2021:29-44. doi:<a href="https://doi.org/10.1007/978-3-030-89240-1_3">10.1007/978-3-030-89240-1_3</a>'
  apa: Castenow, J., Harbig, J., Jung, D., Knollmann, T., &#38; Meyer auf der Heide,
    F. (2021). Gathering a Euclidean Closed Chain of Robots in Linear Time. In L.
    Gasieniec, R. Klasing, &#38; T. Radzik (Eds.), <i>Proceedings of the 17th International
    Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)</i>
    (Vol. 12961, pp. 29–44). Springer. <a href="https://doi.org/10.1007/978-3-030-89240-1_3">https://doi.org/10.1007/978-3-030-89240-1_3</a>
  bibtex: '@inproceedings{Castenow_Harbig_Jung_Knollmann_Meyer auf der Heide_2021,
    series={LNCS}, title={Gathering a Euclidean Closed Chain of Robots in Linear Time},
    volume={12961}, DOI={<a href="https://doi.org/10.1007/978-3-030-89240-1_3">10.1007/978-3-030-89240-1_3</a>},
    booktitle={Proceedings of the 17th International Symposium on Algorithms and Experiments
    for Wireless Sensor Networks (ALGOSENSORS)}, publisher={Springer}, author={Castenow,
    Jannik and Harbig, Jonas and Jung, Daniel and Knollmann, Till and Meyer auf der
    Heide, Friedhelm}, editor={Gasieniec, Leszek and Klasing, Ralf and Radzik, Tomasz},
    year={2021}, pages={29–44}, collection={LNCS} }'
  chicago: Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm
    Meyer auf der Heide. “Gathering a Euclidean Closed Chain of Robots in Linear Time.”
    In <i>Proceedings of the 17th International Symposium on Algorithms and Experiments
    for Wireless Sensor Networks (ALGOSENSORS)</i>, edited by Leszek Gasieniec, Ralf
    Klasing, and Tomasz Radzik, 12961:29–44. LNCS. Springer, 2021. <a href="https://doi.org/10.1007/978-3-030-89240-1_3">https://doi.org/10.1007/978-3-030-89240-1_3</a>.
  ieee: 'J. Castenow, J. Harbig, D. Jung, T. Knollmann, and F. Meyer auf der Heide,
    “Gathering a Euclidean Closed Chain of Robots in Linear Time,” in <i>Proceedings
    of the 17th International Symposium on Algorithms and Experiments for Wireless
    Sensor Networks (ALGOSENSORS)</i>, Lissabon, 2021, vol. 12961, pp. 29–44, doi:
    <a href="https://doi.org/10.1007/978-3-030-89240-1_3">10.1007/978-3-030-89240-1_3</a>.'
  mla: Castenow, Jannik, et al. “Gathering a Euclidean Closed Chain of Robots in Linear
    Time.” <i>Proceedings of the 17th International Symposium on Algorithms and Experiments
    for Wireless Sensor Networks (ALGOSENSORS)</i>, edited by Leszek Gasieniec et
    al., vol. 12961, Springer, 2021, pp. 29–44, doi:<a href="https://doi.org/10.1007/978-3-030-89240-1_3">10.1007/978-3-030-89240-1_3</a>.
  short: '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.'
conference:
  end_date: 2021-09-10
  location: Lissabon
  name: 17th International Symposium on Algorithms and Experiments for Wireless Sensor
    Networks (ALGOSENSORS) 2021
  start_date: 2021-09-09
date_created: 2021-09-03T09:01:25Z
date_updated: 2022-01-06T06:55:58Z
department:
- _id: '63'
doi: 10.1007/978-3-030-89240-1_3
editor:
- first_name: Leszek
  full_name: Gasieniec, Leszek
  last_name: Gasieniec
- first_name: Ralf
  full_name: Klasing, Ralf
  last_name: Klasing
- first_name: Tomasz
  full_name: Radzik, Tomasz
  last_name: Radzik
external_id:
  arxiv:
  - '2010.04424'
intvolume: '     12961'
language:
- iso: eng
page: 29 - 44
project:
- _id: '106'
  name: 'Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme'
publication: Proceedings of the 17th International Symposium on Algorithms and Experiments
  for Wireless Sensor Networks (ALGOSENSORS)
publication_status: published
publisher: Springer
series_title: LNCS
status: public
title: Gathering a Euclidean Closed Chain of Robots in Linear Time
type: conference
user_id: '38705'
volume: 12961
year: '2021'
...
---
_id: '20185'
author:
- first_name: Jannik
  full_name: Castenow, Jannik
  id: '38705'
  last_name: Castenow
- first_name: Jonas
  full_name: Harbig, Jonas
  id: '47213'
  last_name: Harbig
- first_name: Daniel
  full_name: Jung, Daniel
  id: '37827'
  last_name: Jung
- first_name: Till
  full_name: Knollmann, Till
  id: '39241'
  last_name: Knollmann
  orcid: 0000-0003-2014-4696
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Castenow J, Harbig J, Jung D, Knollmann T, Meyer auf der Heide F. Brief Announcement:
    Gathering in Linear Time: A Closed Chain of Disoriented &#38; Luminous Robots
    with Limited Visibility . In: Devismes S,  Mittal N, eds. <i>Stabilization, Safety,
    and Security of Distributed Systems - 22nd International Symposium, SSS 2020,
    Austin, Texas, USA, November 18-21, 2020, Proceedings </i>. Vol 12514. Lecture
    Notes in Computer Science (LNCS). Springer; 2020:60-64. doi:<a href="https://doi.org/10.1007/978-3-030-64348-5_5">10.1007/978-3-030-64348-5_5</a>'
  apa: 'Castenow, J., Harbig, J., Jung, D., Knollmann, T., &#38; Meyer auf der Heide,
    F. (2020). Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented
    &#38; Luminous Robots with Limited Visibility . In S. Devismes &#38; N.  Mittal
    (Eds.), <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International
    Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings </i>
    (Vol. 12514, pp. 60–64). Springer. <a href="https://doi.org/10.1007/978-3-030-64348-5_5">https://doi.org/10.1007/978-3-030-64348-5_5</a>'
  bibtex: '@inproceedings{Castenow_Harbig_Jung_Knollmann_Meyer auf der Heide_2020,
    series={Lecture Notes in Computer Science (LNCS)}, title={Brief Announcement:
    Gathering in Linear Time: A Closed Chain of Disoriented &#38; Luminous Robots
    with Limited Visibility }, volume={12514}, DOI={<a href="https://doi.org/10.1007/978-3-030-64348-5_5">10.1007/978-3-030-64348-5_5</a>},
    booktitle={Stabilization, Safety, and Security of Distributed Systems - 22nd International
    Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings },
    publisher={Springer}, author={Castenow, Jannik and Harbig, Jonas and Jung, Daniel
    and Knollmann, Till and Meyer auf der Heide, Friedhelm}, editor={Devismes, Stéphane  and  Mittal,
    NeerajEditors}, year={2020}, pages={60–64}, collection={Lecture Notes in Computer
    Science (LNCS)} }'
  chicago: 'Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm
    Meyer auf der Heide. “Brief Announcement: Gathering in Linear Time: A Closed Chain
    of Disoriented &#38; Luminous Robots with Limited Visibility .” In <i>Stabilization,
    Safety, and Security of Distributed Systems - 22nd International Symposium, SSS
    2020, Austin, Texas, USA, November 18-21, 2020, Proceedings </i>, edited by Stéphane  Devismes
    and Neeraj  Mittal, 12514:60–64. Lecture Notes in Computer Science (LNCS). Springer,
    2020. <a href="https://doi.org/10.1007/978-3-030-64348-5_5">https://doi.org/10.1007/978-3-030-64348-5_5</a>.'
  ieee: 'J. Castenow, J. Harbig, D. Jung, T. Knollmann, and F. Meyer auf der Heide,
    “Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &#38;
    Luminous Robots with Limited Visibility ,” in <i>Stabilization, Safety, and Security
    of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas,
    USA, November 18-21, 2020, Proceedings </i>, 2020, vol. 12514, pp. 60–64.'
  mla: 'Castenow, Jannik, et al. “Brief Announcement: Gathering in Linear Time: A
    Closed Chain of Disoriented &#38; Luminous Robots with Limited Visibility .” <i>Stabilization,
    Safety, and Security of Distributed Systems - 22nd International Symposium, SSS
    2020, Austin, Texas, USA, November 18-21, 2020, Proceedings </i>, edited by Stéphane  Devismes
    and Neeraj  Mittal, vol. 12514, Springer, 2020, pp. 60–64, doi:<a href="https://doi.org/10.1007/978-3-030-64348-5_5">10.1007/978-3-030-64348-5_5</a>.'
  short: 'J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, in:
    S. Devismes, N.  Mittal (Eds.), Stabilization, Safety, and Security of Distributed
    Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November
    18-21, 2020, Proceedings , Springer, 2020, pp. 60–64.'
date_created: 2020-10-23T08:50:28Z
date_updated: 2022-01-06T06:54:21Z
department:
- _id: '63'
doi: 10.1007/978-3-030-64348-5_5
editor:
- first_name: 'Stéphane '
  full_name: 'Devismes, Stéphane '
  last_name: Devismes
- first_name: Neeraj
  full_name: ' Mittal, Neeraj'
  last_name: ' Mittal'
external_id:
  arxiv:
  - '2010.04424 '
intvolume: '     12514'
language:
- iso: eng
page: 60-64
publication: 'Stabilization, Safety, and Security of Distributed Systems - 22nd International
  Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings '
publication_identifier:
  isbn:
  - 978-3-030-64347-8
publication_status: published
publisher: Springer
series_title: Lecture Notes in Computer Science (LNCS)
status: public
title: 'Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented
  & Luminous Robots with Limited Visibility '
type: conference
user_id: '38705'
volume: 12514
year: '2020'
...
