Max Robotics — Global Service Robot Directory + US Certification

About

Andrzej Pelc is a prominent theoretical computer scientist whose research has profoundly shaped the field of distributed computing, with a particular focus on mobile agent algorithms, graph exploration, and robot coordination. His work addresses fundamental questions about what autonomous agents can accomplish under severe constraints — including asynchrony, obliviousness, and limited memory — in unknown environments. Pelc's most influential contributions center on two interconnected problems: graph exploration and rendezvous. His early work on exploring unknown undirected graphs (185 citations) established foundational complexity results, while subsequent papers tackled tree exploration under tight memory constraints (135 citations). In parallel, he made landmark advances in rendezvous theory — the challenge of making mobile agents meet without centralized coordination — publishing both seminal algorithms (162 citations) and a comprehensive survey that unified the field (111 citations). His studies of gathering oblivious mobile robots, whether in rings (190 citations) or the continuous plane (141 citations), demonstrate remarkable ingenuity in proving what is achievable without persistent memory or communication. With over 1,300 citations across these ten papers alone, Pelc's research has become essential reading for anyone studying autonomous mobile agents, and his systematic approach continues to define the theoretical boundaries of distributed robot computing.