Max Robotics — Global Service Robot Directory + US Certification

About

Alessia Di Fonso is a leading researcher in distributed computing and algorithmic robotics, specializing in the coordination of autonomous mobile robots on discrete graph structures. Her work focuses on fundamental problems such as Arbitrary Pattern Formation (APF) and Geodesic Mutual Visibility, where robots must achieve global configurations without collisions or central control. In her highly cited 2022 paper (21 citations), she solved the APF problem on infinite regular tessellation graphs, providing a distributed algorithm that allows robots placed at distinct vertices to form any given multiset of target positions. This work, alongside its 2020 precursor (18 citations), established a foundational framework for pattern formation on grids and hexagonal lattices. Di Fonso also introduced the Geodesic Mutual Visibility problem, extending the classic collinearity-avoidance task to graphs, with optimal algorithms for grids and trees (12 and 8 citations). Her recent results include time-optimal solutions on grids within minimum area (5 citations) and efficient algorithms for hexagonal grids and butterfly networks. With a growing citation impact and a knack for tackling hard geometric constraints, Di Fonso’s research is essential reading for anyone interested in swarm robotics, distributed algorithms, and the theoretical limits of robot coordination on networks.