Alfredo Navarra
Papers
58
Total Citations
1,251
H-Index
21
About
Alfredo Navarra is a prominent computer scientist whose research lies at the intersection of distributed computing, swarm robotics, and algorithm design. He is best known for his foundational contributions to the theory of autonomous mobile robots — specifically, systems of oblivious, asynchronous agents operating in anonymous environments without persistent memory or direct communication. Navarra's work has significantly advanced our understanding of two core coordination problems: *gathering*, where robots must converge to a single point, and *pattern formation*, where they must self-organize into prescribed geometric configurations. His research systematically explores these challenges across diverse topologies — rings, grids, trees, and infinite planes — and under increasingly realistic, weak assumptions such as the absence of chirality or multiplicity detection. His 2010 paper on gathering on rings, exploiting symmetry to coordinate asynchronous oblivious robots, has garnered over 100 citations and remains a landmark reference in the field. With a total of more than 540 citations across his top ten works alone, Navarra has established himself as a leading authority in robot coordination theory. His rigorous algorithmic frameworks and optimality results have provided the distributed computing community with both theoretical depth and practical insight into the limits and possibilities of decentralized robotic systems.
Research Focus
Key Achievements
Top Papers
- 1
- 2
- 3Gathering on rings under the Look–Compute–Move model59 citations · 2014
- 4Asynchronous Arbitrary Pattern Formation: the effects of a rigorous approach54 citations · 2018
- 5
- 6
- 7
- 8
- 9Embedded pattern formation by asynchronous robots without chirality40 citations · 2018
- 10