Arnaud Labourel

About

Arnaud Labourel is a computer scientist whose research sits at the intersection of distributed computing, mobile robotics, and algorithmic theory. He is best known for his foundational contributions to the rendezvous problem — the challenge of designing deterministic strategies that allow autonomous mobile agents to locate one another in unknown environments without centralized coordination. His landmark 2012 paper, "How to Meet Asynchronously (Almost) Everywhere," which has garnered over 126 citations, established elegant solutions for asynchronous rendezvous in arbitrary infinite graphs and planar terrains, a result widely regarded as a cornerstone of the field. His 2010 work on infinite multidimensional grids (72 citations) further demonstrated near-optimal strategies under highly constrained asynchronous conditions. Beyond rendezvous, Labourel has investigated terrain exploration, studying worst-case optimal algorithms for robots navigating obstacle-laden environments, and collaborative delivery problems where energy-constrained robots must cooperate efficiently. His 2018 contributions extend these themes to faulty robot scenarios and general graph settings, reflecting a sustained commitment to robustness and generality. Through rigorous algorithmic analysis, Labourel has significantly advanced our understanding of what autonomous, label-based agents can achieve in adversarial and uncertain settings.

Research Focus

Key Achievements

Top Papers

1. 1
   How to meet asynchronously (almost) everywhere

   126 citations · 2012
2. 2
   Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids

   72 citations · 2010
3. 3
   Collaborative delivery with energy-constrained mobile robots

   24 citations · 2017
4. 4
   Worst-case optimal exploration of terrains with obstacles

   20 citations · 2013
5. 5
   Asynchronous deterministic rendezvous in bounded terrains

   16 citations · 2011
6. 6
   Asynchronous Deterministic Rendezvous in Bounded Terrains

   13 citations · 2010
7. 7
   Collaborative Delivery with Energy-Constrained Mobile Robots

   11 citations · 2016
8. 8
   Optimality and competitiveness of exploring polygons by mobile robots

   6 citations · 2010
9. 9
   On asynchronous rendezvous in general graphs

   6 citations · 2018
10. 10
    Group search of the plane with faulty robots

    6 citations · 2018

Key Collaborators

Contact & Links