Summary
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aho, A., Garey, M., Ullman, J.: The transitive reduction of a directed graph. SIAM J. Comput. 1(2), 131–137 (1972)
Jadbabaie, A., Lin, J., Morse, A.S.: Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Trans. Autom. Control 48(9), 988–1001 (2003)
Moyles, D.M., Thompson, G.L.: An algorithm for finding a minimum equivalent graph of a digraph. J. Assoc. Comput. Mach. 16(3), 455–460 (1969)
Spanos, D.P., Murray, R.M.: Robust connectivity of networked vehicles. In: 43rd IEEE Conference on Decision and Control, pp. 2893–2898 (2004)
Lafferriere, G., Williams, A., Caughman, J., Veerman, J.J.P.: Decentralized control of vehicle formations. Syst. Control Lett. 54, 899–910 (2005)
Fiedler, M.: Algebraic connectivity of graphs. Czechoslov. Math. J. 23(98), 298–305 (1973)
Ji, M., Egerstedt, M.: Distributed formation control while preserving connectedness. In: 45th IEEE Conference on Decision and Control, pp. 5962–5967 (2006)
Olfati-Saber, R., Fax, J.A., Murray, R.M.: Consensus and cooperation in networked multi-agent systems. Proc. IEEE 95(1), 215–233 (2007)
Khuller, S., Raghavachari, B., Young, N.: Approximating the minimum equivalent digraph. SIAM J. Comput. 24(4), 859–872 (1995)
Ren, W., Beard, R.W.: Consensus seeking in multiagent systems under dynamically changing interaction topologies. IEEE Trans. Autom. Control 50(5), 655–661 (2005)
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)
Kim, Y., Mesbahi, M.: On maximizing the second smallest eigenvalue of a state-dependent graph Laplacian. IEEE Trans. Autom. Control 116–120 (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Geng, X., Jeffcoat, D. (2010). A Connectivity Reduction Strategy for Multi-agent Systems. In: Hirsch, M., Pardalos, P., Murphey, R. (eds) Dynamics of Information Systems. Springer Optimization and Its Applications, vol 40. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-5689-7_14
Download citation
DOI: https://doi.org/10.1007/978-1-4419-5689-7_14
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-5688-0
Online ISBN: 978-1-4419-5689-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)