Papers
13
Total Citations
156
H-Index
5
About
Pierre Courtieu is a leading researcher in formal methods for distributed robotics, specializing in the certified correctness of protocols for oblivious mobile robots. His work focuses on rigorously proving the impossibility or universality of gathering algorithms—where robots must converge to a common point without prior knowledge—under asynchronous, Byzantine-tolerant conditions. Courtieu’s most influential contributions include the certified impossibility of gathering in Byzantine environments (46 citations) and a certified universal gathering algorithm for oblivious robots in ℝ² (26 citations). He also pioneered the comparison of continuous versus discrete asynchronous moves using formal verification (11 citations). His work on the Pactole framework (2022) unifies execution models, problem specifications, and protocol proofs, advancing the safety and versatility of robotic swarms. With over 150 citations across his top papers, Courtieu’s research bridges theoretical distributed computing and practical robotic systems, offering foundational insights for students and researchers interested in formal verification, fault tolerance, and swarm robotics.
Research Focus
Key Achievements
Top Papers
- 1Impossibility of gathering, a certification46 citations · 2014
- 2Certified Impossibility Results for Byzantine-Tolerant Mobile Robots44 citations · 2013
- 3
- 4
- 5A Certified Universal Gathering Algorithm for Oblivious Mobile Robots6 citations · 2015
- 6
- 7
- 8Swarms of Mobile Robots: Towards Versatility with Safety3 citations · 2022
- 9
- 10