Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Computer Aided Formal Design of Swarm Robotics Algorithms

Abstract : 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.
Complete list of metadatas

https://hal.sorbonne-universite.fr/hal-03111541
Contributor : Sébastien Tixeuil <>
Submitted on : Monday, January 18, 2021 - 10:08:08 AM
Last modification on : Wednesday, January 20, 2021 - 3:38:00 AM

Files

rapport.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-03111541, version 1
  • ARXIV : 2101.06966

Citation

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

Share

Metrics

Record views

148

Files downloads

18