@inproceedings{b47f9a19795b4325979103f200ff7d8e,
title = "On distributed maximization of algebraic connectivity in robotic networks",
abstract = "We consider the problem of maximizing the algebraic connectivity of the communication graph in a network of mobile robots by moving them into appropriate positions. We describe the Laplacian of the graph as dependent on the pairwise distance between the robots and formulate an approximate problem as a Semi-Definite Program (SDP). We propose a consistent, non-iterative distributed solution by solving local SDP's which use information only from nearby neighboring robots. Numerical simulations show the performance of the algorithm with respect to the centralized solution.",
author = "Andrea Simonetto and Tam{\'a}s Keviczky and Robert Babu{\v s}ka",
year = "2011",
month = jan,
day = "1",
doi = "10.1109/acc.2011.5990911",
language = "English",
isbn = "9781457700804",
series = "Proceedings of the American Control Conference",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "2180--2185",
booktitle = "Proceedings of the 2011 American Control Conference, ACC 2011",
}