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

Full description

Saved in:

Bibliographic Details
Published in:	Distributed computing Vol. 32; no. 2; pp. 91 - 132
Main Authors:	Cicerone, Serafino, Di Stefano, Gabriele, Navarra, Alfredo
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.04.2019 Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!