Asynchronous Arbitrary Pattern Formation: the effects of a rigorous approach

Given any multiset F of points in the Euclidean plane and a set R of robots such that | R | = | F | , the Arbitrary Pattern Formation ( APF ) problem asks for a distributed algorithm that moves robots so as to reach a configuration similar to F . Similarity means that robots must be disposed as F re...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Distributed computing Jg. 32; H. 2; S. 91 - 132
Hauptverfasser:	Cicerone, Serafino, Di Stefano, Gabriele, Navarra, Alfredo
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 01.04.2019 Springer Nature B.V
Schlagworte:	Algorithms Chirality Computer Communication Networks Computer Hardware Computer networks Computer Science Computer Systems Organization and Communication Networks Cybersecurity Distributed processing Euclidean geometry Privacy Robots Software Engineering/Programming and Operating Systems Theory of Computation Translations Pattern formation Asynchrony Mobile robots Distributed algorithms
ISSN:	0178-2770, 1432-0452
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!