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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Distributed computing Ročník 32; číslo 2; s. 91 - 132
Hlavní autoři:	Cicerone, Serafino, Di Stefano, Gabriele, Navarra, Alfredo
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.04.2019 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!