{"language":[{"iso":"eng"}],"_id":"16397","year":"2015","date_updated":"2022-01-06T06:52:50Z","author":[{"first_name":"Sebastian","full_name":"Abshoff, Sebastian","last_name":"Abshoff"},{"first_name":"Andreas","full_name":"Andreas Cord-Landwehr, Andreas","last_name":"Andreas Cord-Landwehr"},{"last_name":"Jung","full_name":"Jung, Daniel","first_name":"Daniel","id":"37827"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"status":"public","publication":"ArXiv: 1501.04877","date_created":"2020-04-03T09:36:54Z","external_id":{"arxiv":["1501.04877"]},"title":"Towards Gathering Robots with Limited View in Linear Time: The Closed  Chain Case","type":"preprint","citation":{"ieee":"S. Abshoff, A. Andreas Cord-Landwehr, D. Jung, and F. Meyer auf der Heide, “Towards Gathering Robots with Limited View in Linear Time: The Closed  Chain Case,” <i>ArXiv: 1501.04877</i>. 2015.","apa":"Abshoff, S., Andreas Cord-Landwehr, A., Jung, D., &#38; Meyer auf der Heide, F. (2015). Towards Gathering Robots with Limited View in Linear Time: The Closed  Chain Case. <i>ArXiv: 1501.04877</i>.","mla":"Abshoff, Sebastian, et al. “Towards Gathering Robots with Limited View in Linear Time: The Closed  Chain Case.” <i>ArXiv: 1501.04877</i>, 2015.","ama":"Abshoff S, Andreas Cord-Landwehr A, Jung D, Meyer auf der Heide F. Towards Gathering Robots with Limited View in Linear Time: The Closed  Chain Case. <i>ArXiv: 150104877</i>. 2015.","bibtex":"@article{Abshoff_Andreas Cord-Landwehr_Jung_Meyer auf der Heide_2015, title={Towards Gathering Robots with Limited View in Linear Time: The Closed  Chain Case}, journal={ArXiv: 1501.04877}, author={Abshoff, Sebastian and Andreas Cord-Landwehr, Andreas and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2015} }","chicago":"Abshoff, Sebastian, Andreas Andreas Cord-Landwehr, Daniel Jung, and Friedhelm Meyer auf der Heide. “Towards Gathering Robots with Limited View in Linear Time: The Closed  Chain Case.” <i>ArXiv: 1501.04877</i>, 2015.","short":"S. Abshoff, A. Andreas Cord-Landwehr, D. Jung, F. Meyer auf der Heide, ArXiv: 1501.04877 (2015)."},"user_id":"15415","department":[{"_id":"63"}],"abstract":[{"lang":"eng","text":"In the gathering problem, n autonomous robots have to meet on a single point.\r\nWe consider the gathering of a closed chain of point-shaped, anonymous robots\r\non a grid. The robots only have local knowledge about a constant number of\r\nneighboring robots along the chain in both directions. Actions are performed in\r\nthe fully synchronous time model FSYNC. Every robot has a limited memory that\r\nmay contain one timestamp of the global clock, also visible to its direct\r\nneighbors. In this synchronous time model, there is no limited view gathering\r\nalgorithm known to perform better than in quadratic runtime. The configurations\r\nthat show the quadratic lower bound are closed chains. In this paper, we\r\npresent the first sub-quadratic---in fact linear time---gathering algorithm for\r\nclosed chains on a grid."}]}