Synchronous Gathering without Multiplicity Detection: a Certified Algorithm
Sign Up to like & getrecommendations! Published in 2017 at "Theory of Computing Systems"
DOI: 10.1007/s00224-017-9828-z
Abstract: In mobile robotic swarms, the gathering problem consists in coordinating all the robots so that in finite time they occupy the same location, not known beforehand. Multiplicity detection refers to the ability to detect that… read more here.
Keywords: multiplicity; gathering without; multiplicity detection; synchronous gathering ... See more keywords