Connectedness Preserving Distributed Coordination Control Over Dynamic Graphs
Author(s)
Ji, Meng
Advisor(s)
Editor(s)
Collections
Supplementary to:
Permanent Link
Abstract
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.
Sponsor
Date
2005-06
Extent
Resource Type
Text
Resource Subtype
Proceedings