Name
Abstract | ||
|---|---|---|
In this paper, we study graphs that arise from certain sensory and communication limitations on the local interactions in multi-agent systems. In particular, we show that the set of graphs that can represent formations corresponds to a proper subset of all graphs and we denote such graphs as connectivity graphs. These graphs have a special structure that allows them to be composed from a small number of atomic generators using a certain kind of graph amalgamation. This structure moreover allows us to give connectivity graphs a topological characterization in terms of their simplicial complexes. Finally, we outline some applications of this topological characterization to the construction of decentralized algorithms. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1016/j.amc.2004.08.039 | Applied Mathematics and Computation |
Keywords | Field | DocType |
connectivity graph,communication limitation,formations corresponds,graph amalgamation,atomic generator,local interaction,certain kind,special structure,topological characterization,decentralized algorithm,graph theory,simplicial complex,mobile robots,multi agent system,connected graph,multi agent systems | Graph theory,Small number,Discrete mathematics,Graph,Modular decomposition,Computer science,Multi-agent system,Mobile robot | Journal |
Volume | Issue | ISSN |
168 | 1 | Applied Mathematics and Computation |
Citations | PageRank | References |
27 | 5.31 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Abubakr Muhammad | 1 | 308 | 30.59 |
| Magnus Egerstedt | 2 | 2862 | 384.94 |