Daniel Wonisch

Heinz Nixdorf Stiftung, Paderborn University

Papers

Total Citations

H-Index

About

Daniel Wonisch has made foundational contributions to the algorithmic foundations of autonomous mobile robotics, with a particular focus on the coordination and convergence of distributed robot swarms. His work centers on the theoretical analysis of how simple, oblivious robots can achieve complex collective behaviors without centralized control or explicit communication. Wonisch is best known for introducing a novel framework for analyzing convergence algorithms, as detailed in his highly cited 2011 paper (54 citations), which provided rigorous tools for proving that distributed robots will reliably gather at a common point. He further advanced the field by tackling the challenging problem of collisionless gathering for robots with physical extent—robots that occupy space and cannot overlap—a breakthrough that resolved a long-standing open problem in the area (43 citations). His research has been instrumental in bridging the gap between idealized point-robot models and more realistic, embodied systems, influencing subsequent work in distributed computing, robotics, and control theory. Wonisch’s elegant proofs and clear problem formulations continue to serve as essential references for researchers designing provably correct multi-robot systems.