Hirotsugu Kakugawa

Papers

Total Citations

H-Index

About

Hirotsugu Kakugawa is a leading theorist in distributed computing, with a focused expertise in the algorithmic coordination of autonomous mobile robots. His research primarily addresses fundamental problems in swarm robotics, such as gathering and pattern formation, under strict constraints of limited visibility, memory, and communication. Kakugawa’s major contributions lie in establishing precise trade-offs between computational resources—most notably, his work on the "Stand-Up Indulgent Gathering" problem on lines. This line of inquiry, culminating in papers from 2024 and 2025, explores how myopic (limited-sight) luminous robots can reliably converge, even when some robots are faulty or adversarial. By proving that a small amount of persistent memory can compensate for reduced visibility, he has provided elegant, provably correct solutions that push the boundaries of what is achievable with minimal hardware. His work is highly regarded for its rigorous mathematical foundations and practical implications for low-cost, resilient multi-robot systems. With his papers already garnering citations, Kakugawa is recognized as a key figure in the algorithmic robotics community, shaping how future generations of distributed systems will be designed.