Max Robotics — Global Service Robot Directory + US Certification

About

Evangelos Kranakis is a prominent computer scientist whose research lies at the intersection of distributed computing, mobile agents, and autonomous robot algorithms. His work has profoundly shaped our understanding of how mobile agents and robots can coordinate, explore, and survive in unknown or adversarial environments. Kranakis has made foundational contributions to the rendezvous problem — the challenge of enabling autonomous agents to meet in a network without centralized coordination — with his seminal 2006 paper on asynchronous deterministic rendezvous in graphs accumulating over 160 citations. His early work on memory-efficient tree exploration (135 citations) demonstrated that meaningful graph traversal is achievable under severe resource constraints. A significant thread of his research addresses evacuation algorithms, investigating how groups of robots can efficiently escape unknown environments such as disks and polygons, even in the presence of faulty or unreliable agents — a body of work that has attracted substantial community attention with dozens to hundreds of citations per paper. Kranakis has also advanced patrolling strategies for fragmented boundaries, optimizing how mobile robots perpetually guard critical regions. Collectively, his contributions have established essential theoretical foundations for swarm robotics, fault-tolerant distributed systems, and autonomous agent coordination.