Matthias Fischer

Paderborn University, Heinz Nixdorf Stiftung

Papers

Total Citations

159

H-Index

About

Matthias Fischer is a leading researcher in distributed computing and swarm robotics, with a focus on the coordination and movement of autonomous mobile robots. His work centers on developing efficient algorithms for anonymous, oblivious robots operating in discrete environments like grids. Fischer’s major contributions include solving the fundamental gathering problem—where robots must converge to a single point—in asymptotically optimal time. His 2016 paper on “Asymptotically Optimal Gathering on a Grid” demonstrates a breakthrough: a swarm of \(n\) indistinguishable, point-shaped robots can gather in \(O(n)\) time in the fully synchronous FSYNC model, a result that has garnered 24 citations for its theoretical elegance and practical implications. His earlier work, such as “A New Approach for Analyzing Convergence Algorithms for Mobile Robots” (54 citations) and “Collisionless Gathering of Robots with an Extent” (43 citations), introduced novel convergence analysis techniques and addressed the challenge of collision avoidance for robots with physical size. Fischer’s research, spanning over a decade, has been cited more than 150 times, establishing him as a key figure in algorithmic robotics. His grid-based gathering solutions are particularly notable for their optimality and scalability, offering foundational insights for distributed systems and multi-agent coordination.