About

Xavier Urbain is a leading figure in the formal verification of distributed mobile robotic systems. His research centers on developing certified impossibility results and provably correct algorithms for oblivious mobile robots operating in the plane. Urbain’s major contributions lie in bridging the gap between theoretical distributed computing and formal methods, using proof assistants like Coq to mechanically verify robot protocols. His most influential work, "Impossibility of gathering, a certification" (46 citations), provides a machine-checked proof that gathering is impossible under certain adversarial conditions. This is complemented by his certified algorithms for universal gathering in ℝ² (26 citations) and synchronous gathering without multiplicity detection (21 citations), which offer rigorous guarantees for robot coordination. His 2013 paper on certified impossibility results for Byzantine-tolerant robots (44 citations) extends this approach to fault-tolerant settings. Urbain’s work has fundamentally advanced the use of formal methods in mobile robotics, establishing a new standard for correctness in distributed algorithms. His invited paper on formal methods for mobile robots (2015) surveys the field’s open problems, cementing his role as a pioneer in certified robotics.

Research Focus

Key Achievements

7
H-Index
16
Papers
195
Total Citations
12
Avg Citations/Paper
🏆 Most Cited Paper
Impossibility of gathering, a certification
46 citations · 2014
📈 Most Prolific Year: 2016 (3 Papers)
🤝 Key Collaborators: 16
🏛 Institutions: École Nationale Supérieure d’Informatique pour l’Industrie et l’Entreprise, Laboratoire de Recherche en Informatique, Université Paris-Saclay, Université Claude Bernard Lyon 1, Université Paris-Sud, Laboratoire d'Informatique en Images et Systèmes d'Information

Top Papers

  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 13 days ago