Papers
5
Total Citations
29
H-Index
3
About
Nikos Leonardos is a leading researcher in distributed algorithms and fault-tolerant search and evacuation problems, with a particular focus on multi-agent coordination under adversarial conditions. His most influential work, "Optimal Circle Search Despite the Presence of Faulty Robots" (2019, 15 citations), establishes fundamental lower bounds and optimal strategies for searching a circular region when some robots may be faulty—a critical step toward robust autonomous systems. Building on this, Leonardos has developed a series of Byzantine fault-tolerant protocols for symmetric-persistent circle evacuation, showing how groups of robots can safely and efficiently evacuate a circle even when a subset behave maliciously. His 2023 papers on Byzantine fault-tolerant symmetric-persistent evacuation (5 citations each) and the general (n, f)-evacuation framework (2 citations) extend these results to more complex scenarios, providing rigorous theoretical guarantees for safety and termination. Leonardos’s work bridges theoretical computer science and practical robotics, offering provably optimal solutions that ensure reliability in the presence of failures. His contributions are essential reading for researchers in distributed computing, swarm robotics, and fault-tolerant systems.
Research Focus
Key Achievements
Top Papers
- 1Optimal Circle Search Despite the Presence of Faulty Robots15 citations · 2019
- 2Optimal circle search despite the presence of faulty robots5 citations · 2023
- 3Byzantine fault tolerant symmetric-persistent circle evacuation5 citations · 2023
- 4Byzantine Fault Tolerant Symmetric-Persistent Circle Evacuation2 citations · 2021
- 5Byzantine Fault-Tolerant Protocols for (n, f)-Evacuation from a Circle2 citations · 2023