Taisuke Izumi
Papers
20
Total Citations
408
H-Index
11
About
Taisuke Izumi is a prominent theoretical computer scientist whose research sits at the intersection of distributed computing and autonomous mobile robotics. His work focuses primarily on the coordination and motion planning of anonymous, oblivious mobile robots — systems where individual agents have no memory, no unique identifiers, and must still achieve collective tasks through local observation alone. Izumi's most celebrated contributions center on the **gathering problem**, the challenge of directing multiple autonomous robots to converge at a single point without predefined coordination. His 2012 paper on gathering with unreliable compasses has garnered 97 citations, establishing foundational results about the limits and possibilities of synchronous versus asynchronous robot models. His 2007 work on dynamic compasses (50 citations) demonstrated optimal gathering strategies, while subsequent papers explored ring topologies, local multiplicity detection, and randomized approaches to overcome deterministic impossibility results. Beyond gathering, Izumi has made notable contributions to connectivity-preserving scattering and probabilistic agreement in oblivious robot networks, broadening the theoretical landscape of swarm coordination. With over 330 cumulative citations across his key works, his research has become essential reading for anyone studying fault-tolerant, decentralized robotic systems and the fundamental computability questions they raise.
Research Focus
Key Achievements
Top Papers
- 1The Gathering Problem for Two Oblivious Robots with Unreliable Compasses97 citations · 2012
- 2Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result50 citations · 2007
- 3Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings48 citations · 2010
- 4Randomized Gathering of Mobile Robots with Local-Multiplicity Detection28 citations · 2009
- 5Connectivity-Preserving Scattering of Mobile Robots with Limited Visibility27 citations · 2010
- 6
- 7
- 8The cost of probabilistic agreement in oblivious robot networks17 citations · 2010
- 9Brief Announcement: The BG-Simulation for Byzantine Mobile Robots16 citations · 2011
- 10On time complexity for connectivity-preserving scattering of mobile robots14 citations · 2018