Lawrence L. Larmore

Papers

Total Citations

H-Index

About

Lawrence L. Larmore is a leading theorist in distributed computing, best known for his pioneering work on the exploration of ring networks by autonomous robots. His research focuses on the fundamental challenges of coordinating multiple, identical, oblivious, and asynchronous robots that lack direct communication and have severely limited sensory capabilities—a model that captures the constraints of real-world swarm robotics. Larmore’s major contributions center on proving what minimal visibility is necessary and sufficient for a team of such “myopic” robots to collectively explore an unknown ring. His most cited work, “Enabling Ring Exploration with Myopic Oblivious Robots” (2015, 13 citations), established key feasibility results for robots with vision limited to just two or three nodes. This built on his earlier foundational papers (2012, 2013) that systematically characterized the exploration problem in discrete universes. By precisely defining the boundary between possible and impossible under extreme resource constraints, Larmore’s research has become essential reading for anyone studying minimalistic robot coordination, influencing subsequent work in distributed algorithms and autonomous systems.