Connectedness preserving distributed coordination control over dynamic graphs
Meng Ji, Magnus Egerstedt · 2005
This paper presents a solution to the limited information rendezvous problem over dynamic interaction graphs. In particular, we show how we, by adding appropriate weights to the edges in the graphs, can guarantee that the graph stays connected. In previous work on graph-based coordination, connectedness have been assumed, and this paper thus shows how to overcome this limitation even when the graphs are subject to dynamic changes.