On the power of bounded asynchrony: convergence by autonomous robots with limited visibility

A distributed algorithm A solves the Point Convergence task if an arbitrarily large collection of entities, starting in an arbitrary configuration, move under the control of A to eventually form and thereafter maintain configurations in which the separation between all entities is arbitrarily small....

Full description

Saved in:

Bibliographic Details
Published in:	Distributed computing Vol. 37; no. 3; pp. 279 - 308
Main Authors:	Kirkpatrick, David, Kostitsyna, Irina, Navarra, Alfredo, Prencipe, Giuseppe, Santoro, Nicola
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2024 Springer Nature B.V
Subjects:	Algorithms Computer Communication Networks Computer Hardware Computer Science Computer Systems Organization and Communication Networks Configurations Constraints Convergence Euclidean geometry Power Robot control Robots Scheduling Software Engineering/Programming and Operating Systems Theory of Computation Visibility Mobile robots Asynchronous computation Distributed geometric 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!