Jonas Harbig

Papers

Total Citations

H-Index

About

Jonas Harbig is a leading researcher in distributed computing and swarm robotics, with a particular focus on the coordination and control of autonomous, anonymous mobile robots. His work centers on fundamental problems in algorithmic robotics, most notably the gathering problem—the challenge of bringing a group of oblivious, disoriented robots together at a common location without centralized control. Harbig’s major contribution, detailed in his highly cited 2020 paper “Gathering Anonymous, Oblivious Robots on a Grid” (26 citations), provides a novel algorithm that achieves efficient gathering on grid topologies, even when robots have limited visibility and no memory of past actions. This work has become a cornerstone for understanding minimalistic robot coordination in constrained environments. His subsequent research, including a brief announcement on “Gathering in Linear Time: A Closed Chain of Disoriented and Luminous Robots with Limited Visibility” (3 citations), extends these ideas to luminous robots—devices that can communicate via colored lights—demonstrating how simple local interactions can achieve global convergence in linear time. Harbig’s contributions are vital for advancing the theoretical foundations of swarm intelligence and have practical implications for the design of resilient, low-cost robotic systems.