A Foundational Framework for Certified Impossibility Results with Mobile Robots on Graphs
Thibaut Balabonski, Robin Pelle, Lionel Rieg, Sébastien Tixeuil · 2018
Swarms of mobile robots recently attracted the focus of the Distributed Computing community. One of the fundamental problems in this context is that of exploration: the robots must coordinate to visit all locations that are reachable from their initial positions. Despite its apparent simplicity, this problem proved quite hard to characterise fully, due to many model variants, leading to informal error-prone reasoning.