Sayaka Kamei
Papers
22
Total Citations
283
H-Index
8
About
Sayaka Kamei is a prominent researcher in theoretical distributed computing, with a particular focus on the coordination and self-organization of autonomous mobile robots. Her work centers on one of the field's most fundamental challenges: the **gathering problem**, which asks how a group of anonymous, oblivious mobile robots can autonomously converge to a single location without pre-assigned meeting points or centralized control. Kamei has made significant contributions by tackling gathering under increasingly realistic and constrained conditions — including asynchronous execution models, symmetric initial configurations, ring-shaped networks, and robots with only local or limited sensing capabilities. Her most-cited work (2011, 66 citations) addressed the particularly difficult case of symmetric configurations without global multiplicity detection, a meaningful step toward practical robot coordination. She has also explored randomized strategies to overcome deterministic impossibility results, and more recently expanded her scope to luminous robots and independent set construction on grid networks. With a body of work spanning over a decade and accumulating nearly 250 citations, Kamei has established herself as a steady and influential voice in mobile robotics theory. Her research is essential reading for students and scholars working on distributed algorithms, fault-tolerant coordination, and the theoretical foundations of swarm robotics.
Research Focus
Key Achievements
Top Papers
- 1
- 2Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings48 citations · 2010
- 3
- 4Randomized Gathering of Mobile Robots with Local-Multiplicity Detection28 citations · 2009
- 5
- 6
- 7
- 8Asynchronous Ring Gathering by Oblivious Robots with Limited Vision9 citations · 2014
- 9Gathering on Rings for Myopic Asynchronous Robots with Lights8 citations · 2025
- 10