Supervision : Sébastien TIXEUIL
The goal of this thesis is to survey and analyze the current work done by the distributed robotics community to find the more realistic variations of the standard OBLOT model, develop new such variations, and determine which approach should be used in the long term. We develop a new, optimal Rendezvous algorithm using lights, and prove it using a model checking framework based on the SPIN model checker. The same luminous model is used to build more robust Leader Election algorithms, which allow for stricter constraints. We design a new vision model for mobile robots, Uncertain Visibility, which introduces a vision adversary for sensors to register false negatives and prove tight bounds under this new model for several benchmark problems. We then define and investigate a new problem, Obstruction, Detection, for the obstructed visibility model. To facilitate analysis of complex models, we develop a framework for Monte-Carlo simulations of mobile robots, designed to simulate any model or algorithm with minimal effort. It is not a model checker and should be viewed as a replacement for researcher "intuition" to look for unexpected behavior in networks. We test this simulator against numerous algorithms and settings, yielding encouraging results. Finally, we introduce another two algorithms: the first algorithm ensures the distance traveled for convergence in ASYNC is minimal ; the second allows for Leader Election with errors in vision.
Defence : 12/09/2020 - 14h30 - https://zoom.us/j/95992511647?pwd=L1l1ZjRua0pOZmJ3RmdMZ21XWS8ydz09
FLOCCHINI Paola (Professor) [Rapportrice]
ILCINKAS David (Chargé de Recherche CNRS - HDR) [Rapporteur]
BRAMAS Quentin (Maître de Conférences)
POTOP-BUTUCARU (Professeur/ LIP6 - SU)
TIXEUIL Sébastien (Professeur/ LIP6 - SU)