Max Robotics — Global Service Robot Directory + US Certification

About

Aris Pagourtzis is a leading researcher in theoretical computer science, with a focus on distributed algorithms, fault tolerance, and search and evacuation problems. His work addresses critical challenges in multi-agent systems, particularly when robots or agents must coordinate despite failures or adversarial interference. Pagourtzis is best known for his contributions to optimal circle search and evacuation protocols, where he has developed strategies that guarantee efficient performance even in the presence of faulty or Byzantine robots. His 2019 paper on "Optimal Circle Search Despite the Presence of Faulty Robots" (15 citations) established foundational bounds for this problem, while subsequent work on Byzantine fault-tolerant symmetric-persistent circle evacuation (2023, 5 citations) advanced the field by introducing resilient coordination mechanisms. His research on rendezvous problems, such as "Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs" (2017, 7 citations), demonstrates how minimal assumptions—like varying agent speeds—can enable guaranteed meeting in complex environments. With over 30 citations across his most-cited works, Pagourtzis continues to shape the design of robust, fault-tolerant distributed systems, making his research essential for students and engineers working on autonomous robotics, network coordination, and safety-critical applications.