Gabriele Di Stefano
Papers
36
Total Citations
818
H-Index
18
About
Gabriele Di Stefano is a prominent computer scientist whose research sits at the intersection of distributed computing and autonomous mobile robotics. He is best known for his foundational contributions to the theory of swarm robotics, particularly the coordination and self-organization of oblivious, anonymous mobile robots operating in geometric and graph-based environments. Di Stefano's work has systematically addressed some of the field's most challenging problems, including the gathering problem — enabling a group of robots to converge at a single point without pre-assigned identities or persistent memory. His investigations span diverse topologies, from Euclidean planes to rings, grids, trees, and general anonymous graphs, rigorously analyzing feasibility conditions and developing optimal algorithms under various computational models such as Look–Compute–Move. Notable contributions include his unified frameworks for rings and grids, and his rigorous treatment of asynchronous pattern formation without chirality. With a combined citation count exceeding 450 across his top ten works alone, Di Stefano's research has become essential reading for scholars studying distributed algorithms and multi-agent systems. His blend of theoretical depth and algorithmic precision has significantly advanced understanding of what minimal-capability robots can collectively compute.
Research Focus
Key Achievements
Top Papers
- 1
- 2Gathering on rings under the Look–Compute–Move model59 citations · 2014
- 3Asynchronous Arbitrary Pattern Formation: the effects of a rigorous approach54 citations · 2018
- 4
- 5
- 6
- 7Embedded pattern formation by asynchronous robots without chirality40 citations · 2018
- 8
- 9Gathering of Robots on Anonymous Grids without Multiplicity Detection32 citations · 2012
- 10