Andreas Cord-Landwehr

Papers

Total Citations

121

H-Index

About

Andreas Cord-Landwehr is a leading researcher in distributed computing and swarm robotics, with a focus on the algorithmic foundations of robot coordination. His work primarily addresses fundamental problems in mobile robot swarms, including gathering, convergence, and collision avoidance. Cord-Landwehr’s major contributions include developing a novel framework for analyzing convergence algorithms for mobile robots, which has become a cornerstone in the field (54 citations). He also introduced strategies for collisionless gathering of robots with physical extent, solving a critical safety and efficiency challenge in multi-robot systems (43 citations). His landmark 2016 paper presents an asymptotically optimal solution for gathering a swarm of indistinguishable, point-shaped robots on a grid, achieving optimal time O(n) in the fully synchronous model—a result that significantly advanced the theoretical understanding of distributed gathering (24 citations). Through these works, Cord-Landwehr has shaped how researchers approach coordination in anonymous, oblivious robot swarms, providing both rigorous analysis and practical algorithmic insights.