Jannik Castenow

Papers

Total Citations

H-Index

About

Jannik Castenow is a leading researcher in the algorithmic foundations of swarm robotics, specializing in the coordination of autonomous, simple mobile agents. His work focuses on fundamental problems such as gathering and chain formation, where robots with severely restricted capabilities—no common coordinate system, limited visibility, and no memory—must collectively achieve complex tasks. Castenow’s most cited paper, "Gathering Anonymous, Oblivious Robots on a Grid" (2020, 26 citations), provides a breakthrough solution to the classic gathering problem in discrete environments, demonstrating how anonymous robots can converge without explicit communication. His research on the Max-Chain-Formation problem (2020) reveals a counterintuitive principle: slowing down individual robots can actually accelerate the overall formation of a connected chain. Additionally, his brief announcement on gathering in linear time (2020) presents a closed-chain algorithm for disoriented, luminous robots with limited visibility, achieving optimal time complexity. With a growing citation impact, Castenow’s work bridges theoretical computer science and practical multi-robot systems, offering elegant algorithms that push the boundaries of what minimalistic robots can achieve. His contributions are essential reading for anyone exploring distributed algorithms, autonomous systems, or the limits of collective intelligence.