Anzeige
Erschienen in:
2012 | OriginalPaper | Buchkapitel
Gathering of Fat Robots with Limited Visibility and without Global Navigation
verfasst von : Kálmán Bolla, Tamás Kovacs, Gábor Fazekas
Erschienen in: Swarm and Evolutionary Computation
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In the present paper, we introduce two different algorithms for the two dimensional gathering problem for synchronous, fat (disk-like) robots with no global navigation or communication, and with limited visibility. One of the algorithms is a slightly modified version of the local smallest enclosing circle (local SEC) algorithm. The other algorithm uses a new method of the gathering: the robots moves towards the furthest visible robot, and the robots on the perimeter of the visibility graph applies a bigger extent of move than the others. With the help of computer simulations, the two proposed algorithms are shown to be applicable for the gathering problem above and they perform better than the earlier simple SEC algorithm developed for point like robots.