Papers
13
Total Citations
151
H-Index
6
About
Lionel Rieg is a leading researcher in the formal verification of distributed mobile robotic systems, with a particular focus on the fundamental problem of *gathering*—ensuring that autonomous, oblivious robots converge to a single point. His most influential work, the 2014 paper "Impossibility of gathering, a certification" (46 citations), established a rigorous, proof-based framework for determining when gathering is impossible, a cornerstone result in the field. Rieg is best known for pioneering *certified algorithms* for mobile robots, providing machine-checked proofs that guarantee correctness under challenging models, such as synchronous rounds without multiplicity detection (21 citations) and asynchronous continuous or discrete moves (11 citations). His 2016 certified universal gathering algorithm (26 citations) is a landmark contribution, proving that robots can gather from any non-bivalent configuration without prior knowledge of the target point. Beyond gathering, Rieg has developed a foundational framework for certified impossibility results on graphs (12 citations) and has written influential surveys on formal methods for mobile robots. His work bridges the gap between theoretical distributed computing and practical verification, offering a blueprint for building provably correct swarm robotics systems.
Research Focus
Key Achievements
Top Papers
- 1Impossibility of gathering, a certification46 citations · 2014
- 2
- 3Synchronous Gathering without Multiplicity Detection: a Certified Algorithm21 citations · 2018
- 4
- 5
- 6Synchronous Gathering Without Multiplicity Detection: A Certified Algorithm11 citations · 2016
- 7A Certified Universal Gathering Algorithm for Oblivious Mobile Robots6 citations · 2015
- 8
- 9
- 10