Dynamic Self-Organization and Clustering in Distributed Networked Systems for Improvement
J.S. Baras, P.Hovareshti and S.Perumal
Proceedings of the Forty-Seventh Annual Allerton Conference on Communication, Control, and Computing (Allerton Conference 2009), pp. 968-975, University of Illinois at Urbana-Champaign, Monticello, Illinois, September 30 - October 2, 2009.
We consider two closely related dynamic self-organization problems in networked control systems. Both are forms of dynamic clustering of nodes. The structure of networked control systems is often abstracted using graph theory. In this abstraction, the nodes of the graph represent the agents and the edges between them represent the connectivity or the possibility of communication between the corresponding agents. The topology of the communication network supporting a networked control system has critical consequences for its performance. The first problem we address is the development of a distributed self-organization algorithm, resulting into a dynamic two level hierarchy of leader and regular agents, which substantially improves the convergence speed of distributed algorithms utilized by the networked control system. For the second problem, we consider the collaborative control of a group of autonomous mobile agents (e.g. vehicles, robots) supported by a mobile wireless network, consisting of many ground and a few aerial nodes. The agents collaborate to achieve a common goal or objective, like to move in a particular area and cover it, while avoiding obstacles and collisions. Building upon our earlier work on deterministic, randomized and hybrid distributed coordination algorithms we consider the communication needs of the agents, and in particular the connectivity of their communication network as they move. We develop distributed algorithms that automatically select some agents and move them appropriately so as to maintain certain degree of desired connectivity among the moving agents. We characterize the trade-off between the gain from maintaining a certain degree of connectivity vs. the combined cost of communications and the associated dynamic re-positioning of agents. We also describe classes of efficient communication topologies and in particular their similarity to dynamic small world topologies and extensions.