Max Robotics — Global Service Robot Directory + US Certification

About

Lawrence H. Erickson’s research lies at the intersection of robotics, computational geometry, and theoretical computer science, with a focus on minimal sensing and fundamental limits of robot navigation. His most influential work, “Probabilistic localization with a blind robot” (40 citations), challenges conventional assumptions by demonstrating that a robot equipped with only a clock and contact sensor can still achieve probabilistic localization—a striking result that redefines what is possible with severely limited hardware. Erickson also introduced the chromatic art gallery problem (26 citations), a novel variant of the classic art gallery problem that asks how many landmark colors are needed to ensure a robot never sees two identical landmarks simultaneously, blending geometry with graph coloring. His paper “A Simple, but NP-Hard, Motion Planning Problem” (35 citations) reveals that even seemingly straightforward obstacle-crossing scenarios can be computationally intractable, providing deep insights into the complexity of path planning. With over 130 total citations, Erickson’s work on blind bouncing robots and visually connected landmark sets continues to inspire researchers exploring minimalistic, provably-correct navigation strategies. His contributions are particularly valuable for students and researchers interested in the theoretical foundations of robotics and the power of simple sensors.