Ryan Killick
Papers
12
Total Citations
98
H-Index
6
About
Ryan Killick is a leading researcher in theoretical computer science, specializing in the algorithmic foundations of mobile robotics, search and evacuation problems, and distributed coordination. His work focuses on developing optimal strategies for autonomous agents—often modeled as robots—operating in continuous environments like disks and lines, under constraints of limited communication, asymmetric capabilities, and adversarial conditions. Killick’s most significant contributions center on the “priority evacuation from a disk” problem, a series of highly cited papers (totaling over 50 citations) that introduced and solved a novel search-type problem where a distinguished “queen” robot must locate and evacuate through a hidden exit, aided by other robots with different priorities. He has also made influential advances in symmetry breaking, rendezvous with asymmetric clocks, and group search energy consumption. Notably, his work on “Symmetry Breaking in the Plane” (10 citations) addresses a fundamental question about deterministic coordination with minimal knowledge. With over 90 total citations across his top papers, Killick’s research is widely recognized for its rigorous theoretical models and practical implications for multi-robot systems, search-and-rescue operations, and distributed algorithms.
Research Focus
Key Achievements
Top Papers
- 1Priority Evacuation from a Disk Using Mobile Robots20 citations · 2018
- 2Priority evacuation from a disk: The case of n = 1,2,318 citations · 2019
- 3Priority evacuation from a disk: The case of n ≥ 415 citations · 2020
- 4Symmetry Breaking in the Plane10 citations · 2019
- 5Gathering in the Plane of Location-Aware Robots in the Presence of Spies7 citations · 2018
- 6Priority Evacuation from a Disk Using Mobile Robots6 citations · 2018
- 7Linear Rendezvous with Asymmetric Clocks5 citations · 2019
- 8Energy Consumption of Group Search on a Line4 citations · 2019
- 9
- 10