Abstract
We study the GATHERING PROBLEM, where we want to gather a set of n autonomous mobile robots at a point in the plane. This point is not fixed in advance. The robots are very weak, in the sense that they have no common coordinate system, no identities, no central coordination, no means of direct communication, and no synchronization. Each robot can only sense the positions of the other robots, perform a deterministic algorithm, and then move towards a destination point. It is known that these simple robots cannot gather if they have no additional capabilities. In this paper, we show that the GATHERING PROBLEM can be solved if the robots are non-oblivious, i.e., if they are equipped with memory. © Springer-Verlag 2004.
Cite
CITATION STYLE
Cieliebak, M. (2004). Gathering non-oblivious mobile robots. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2976, 577–588. https://doi.org/10.1007/978-3-540-24698-5_60
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
