Christian Ortolf

Papers

Total Citations

H-Index

About

Christian Ortolf’s research lies at the intersection of algorithmic robotics, graph theory, and multi-agent coordination, with a particular focus on exploration and cleaning problems in constrained environments. His most influential work, “Online multi-robot exploration of grid graphs with rectangular obstacles” (2012, 34 citations), tackles the challenge of coordinating multiple robots to systematically cover unknown grid worlds cluttered with obstacles—a foundational problem for search-and-rescue or planetary exploration. Ortolf’s key contribution is a recursive, communication-efficient strategy that guarantees complete coverage while minimizing redundant steps, even when robots have only local information. He extended these ideas to tree structures in his 2014 paper (10 citations), and later to “parallel unaware cleaners” (2015), where robots operate without explicit coordination. His work is notable for bridging theoretical graph exploration with practical multi-robot constraints, offering provable performance bounds that inform real-world swarm robotics. For students, Ortolf’s research demonstrates how elegant algorithmic recursion can solve messy real-world navigation problems—a lesson in turning geometric complexity into tractable, scalable solutions.