6 citations · 9 across the 5 of their papers we have counts for
5 papers
Computer Aided Formal Design of Swarm Robotics Algorithms
Thibaut Balabonski, Pierre Courtieu, Robin Pelle +3
Previous works on formally studying mobile robotic swarms consider necessary and sufficient system hypotheses enabling to solve theoretical benchmark problems (geometric pattern fo…
Certified Universal Gathering in for Oblivious Mobile Robots
Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil +1
We present a unified formal framework for expressing mobile robots models, protocols, and proofs, and devise a protocol design/proof methodology dedicated to mobile robots that tak…
A Certified Universal Gathering Algorithm for Oblivious Mobile Robots
Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil +1
We present a new algorithm for the problem of universal gathering mobile oblivious robots (that is, starting from any initial configuration that is not bivalent, using any number o…
Impossibility of Gathering, a Certification
Pierre Courtieu, Lionel Rieg, Xavier Urbain +1
Recent advances in Distributed Computing highlight models and algorithms for autonomous swarms of mobile robots that self-organise and cooperate to solve global objectives. The ove…
Certified Impossibility Results for Byzantine-Tolerant Mobile Robots
Cédric Auger, Zohir Bouzid, Pierre Courtieu +2
We propose a framework to build formal developments for robot networks using the COQ proof assistant, to state and to prove formally various properties. We focus in this paper on i…