Mark Cieliebak

Papers

Total Citations

547

H-Index

About

Mark Cieliebak is a leading figure in distributed computing, best known for his foundational work on the coordination of autonomous mobile robots. His research centers on the Gathering Problem, a fundamental challenge where multiple identical robots, operating with limited sensing and no direct communication, must converge at a common point. Cieliebak’s major contributions include formalizing the problem under weak robot models—decentralized, asynchronous, and without common knowledge—and proving that gathering is achievable even under these constraints. His seminal 2012 paper, “Distributed Computing by Mobile Robots: Gathering,” has garnered 241 citations, while his earlier 2003 work, “Solving the Robots Gathering Problem,” remains a cornerstone with 194 citations. These studies, alongside his 2002 and 2004 papers, have shaped the theoretical foundations of swarm robotics and distributed algorithms. Cieliebak’s impact is evident in the sustained citation of his work, which continues to inspire research in multi-agent systems and autonomous coordination. His achievements highlight a career dedicated to solving primitive yet profound problems in distributed computing, making him a key reference for students and researchers exploring robot swarms and decentralized control.