Max Robotics — Global Service Robot Directory + US Certification

About

Christian Icking is a prominent researcher in computational geometry and autonomous robotics, whose work has fundamentally shaped our understanding of how mobile robots can navigate and explore unknown environments under incomplete information. His research centers on competitive strategies for robot motion planning, polygon exploration, and vision-based navigation — fields sitting at the intersection of theoretical computer science and robotics. Icking's most celebrated contribution is his work on the Polygon Exploration Problem, which garnered 117 citations and established a rigorous on-line strategy enabling a vision-equipped mobile robot to explore an unknown simple polygon with a tour provably no more than 26.5 times the length of the optimal offline watchman route. This result, grounded in novel geometric structures, remains a landmark achievement in competitive analysis. His earlier work on competitive searching in generalized streets (42 citations) broadened the class of navigable polygon types beyond previously known limitations, while his investigations into grid polygon exploration and cellular environments extended these ideas into practical robotic settings. Across his body of work, Icking consistently championed the concept of competitive strategies — algorithms that perform within a bounded factor of optimal despite operating with incomplete information — demonstrating their theoretical elegance and real-world utility for autonomous systems design. With over 270 combined citations, his contributions continue to inform both algorithmic robot motion planning and the broader field of online algorithms.