Computer Aided Formal Design of Swarm Robotics Algorithms - Sorbonne Université Access content directly
Preprints, Working Papers, ... Year : 2021

Computer Aided Formal Design of Swarm Robotics Algorithms

Thibaut Balabonski
Pierre Courtieu
Robin Pelle
Lionel Rieg


Previous works on formally studying mobile robotic swarms consider necessary and sufficient system hypotheses enabling to solve theoretical benchmark problems (geometric pattern formation, gathering, scattering, etc.). We argue that formal methods can also help in the early stage of mobile robotic swarms protocol design, to obtain protocols that are correct-by-design, even for problems arising from real-world use cases, not previously studied theoretically. Our position is supported by a concrete case study. Starting from a real-world case scenario, we jointly design the formal problem specification, a family of protocols that are able to solve the problem, and their corresponding proof of correctness, all expressed with the same formal framework. The concrete framework we use for our development is the PACTOLE library based on the COQ proof assistant.
Fichier principal
Vignette du fichier
rapport.pdf (237.39 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03111541 , version 1 (18-01-2021)



Thibaut Balabonski, Pierre Courtieu, Robin Pelle, Lionel Rieg, Sébastien Tixeuil, et al.. Computer Aided Formal Design of Swarm Robotics Algorithms. 2021. ⟨hal-03111541⟩
514 View
144 Download



Gmail Facebook X LinkedIn More