Self-stabilizing Determinsitic Gathering

Simple item page
dc.creatorDieudonné, Yoann
dc.creatorPetit, Franck
dc.date2009-05-06
dc.date.accessioned2026-07-07T13:12:10Z
dc.date.available2026-07-07T13:12:10Z
dc.descriptionIn this paper, we investigate the possibility to deterministically solve the gathering problem (GP) with weak robots (anonymous, autonomous, disoriented, deaf and dumb, and oblivious). We introduce strong multiplicity detection as the ability for the robots to detect the exact number of robots located at a given position. We show that with strong multiplicity detection, there exists a deterministic self-stabilizing algorithm solving GP for n robots if, and only if, n is odd.
dc.identifierhttps://arxiv.org/abs/0905.0747
dc.identifierhttp://arxiv.org/abs/0905.0747
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/229506
dc.subjectMultiagent Systems
dc.titleSelf-stabilizing Determinsitic Gathering
dc.typetext

Files

Collections

arXiv