A Connectivity Reduction Strategy for Multi-agent Systems

Xiaojun Geng () and David Jeffcoat ()
Additional contact information
Xiaojun Geng: California State University
David Jeffcoat: Air Force Research Laboratory

Chapter Chapter 14 in Dynamics of Information Systems, 2010, pp 275-286 from Springer

Abstract: 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.

Keywords: Directed Graph; Transmission Range; Multiagent System; Communication Graph; Triangle Closure (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-1-4419-5689-7_14

Ordering information: This item can be ordered from
http://www.springer.com/9781441956897

DOI: 10.1007/978-1-4419-5689-7_14

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().