A Connectivity Reduction Strategy for Multi-agent Systems
This paper considers the connectivity reduction of multi-agent systems which are represented with directed graphs. A simple distributed algorithm is presented for each agent to independently remove some of its incoming links based on only the local information of its neighbors. The algorithm results in an information graph with sparser connections. The goal is to reduce computational effort associated with communication while still maintaining overall system performance. The main contribution of this paper is a distributed algorithm that can, under certain conditions, find and remove redundant edges in a directed graph using only local information.
Unable to display preview. Download preview PDF.
- 4.Spanos, D.P., Murray, R.M.: Robust connectivity of networked vehicles. In: 43rd IEEE Conference on Decision and Control, pp. 2893–2898 (2004) Google Scholar
- 7.Ji, M., Egerstedt, M.: Distributed formation control while preserving connectedness. In: 45th IEEE Conference on Decision and Control, pp. 5962–5967 (2006) Google Scholar
- 11.Ren, W., Beard, R.W., Atkins, E.M.: A survey of consensus problems in multi-agent coordination. In: Proceedings of American Control Conference, pp. 1859–1864 (2005) Google Scholar
- 12.Kim, Y., Mesbahi, M.: On maximizing the second smallest eigenvalue of a state-dependent graph Laplacian. IEEE Trans. Autom. Control 116–120 (2006) Google Scholar