Collaborative dispersion by silent robots

In the dispersion problem, a set of k co-located mobile robots must relocate themselves in distinct nodes of an unknown network. The network is modeled as an anonymous graph G=(V,E), where the graph's nodes are not labeled. The edges incident to a node v with degree d are labeled with port numb...

Full description

Bibliographic Details

Published in:	Journal of parallel and distributed computing Vol. 188; p. 104852
Main Authors:	Gorain, Barun, Mandal, Partha Sarathi, Mondal, Kaushik, Pandit, Supantha
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.06.2024
Subjects:	Anonymous graphs Deterministic algorithm Dispersion Mobile robots Time and memory complexity Deterministic algorithm Mobile robots Anonymous graphs Time and memory complexity Dispersion
ISSN:	0743-7315, 1096-0848
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!