Max Robotics — Global Service Robot Directory + US Certification

About

Tom Kamphans is a researcher in algorithmic robotics, focusing on the online exploration and search problems that arise when autonomous mobile robots must navigate unknown environments. His work bridges theoretical computer science and practical motion planning, particularly for robots with limited sensing and error-prone hardware. Kamphans’ most-cited paper, “Exploring Simple Grid Polygons” (2005, 38 citations), laid foundational work for understanding how a short-sighted robot can systematically cover a cellular environment. He extended these ideas to swarms in “Exploring and Triangulating a Region by a Swarm of Robots” (2011, 19 citations), addressing coordination under minimal localization. His contributions to online algorithms include optimal competitive strategies for error-prone robots (“Optimal Competitive Online Ray Search with an Error-Prone Robot,” 2005, 13 citations) and the introduction of the Pledge Algorithm’s robustness to sensor and motion errors (2004, 8 citations). Kamphans also explored the computational complexity of robot movement constraints, proving that Randolph’s Robot Game is NP-hard (2006, 12 citations). His work on hexagonal and triangular grid polygons (2010, 5 citations) further expanded the theory of cellular exploration. With a total of over 100 citations across his publications, Kamphans has made lasting contributions to the algorithmic foundations of autonomous robot navigation.