Arnaud Casteigts

University of Ottawa, Université de Bordeaux, Centre National de la Recherche Scientifique

Papers

Total Citations

H-Index

About

Arnaud Casteigts is a leading researcher in distributed computing and network algorithms, with a focus on the coordination and control of mobile robotic swarms and time-varying graphs. His major contributions include pioneering work on self-deploying networks of wireless mobile robots, where he introduced a novel solution using virtual angular forces to achieve biconnectivity—ensuring fault tolerance—while simultaneously optimizing coverage, network diameter, and movement efficiency. This work, published in 2010 and 2011, has garnered over 44 citations combined, underscoring its impact on topology control in sensor, actuator, and mobile robot networks. Casteigts has also advanced the theoretical understanding of dynamic networks through his study of the expressivity of time-varying graphs, a concept that captures the temporal evolution of connectivity. More recently, he has tackled the Freeze-Tag Problem in L₁ metric, proving that wake-up time is five with linear complexity, a notable achievement in swarm robotics. His research bridges practical deployment challenges with rigorous algorithmic analysis, making him a key figure in the field.