A Dynamic Random Graph Model for Diameter-Constrained Topologies in Networked Systems
نویسندگان
چکیده
منابع مشابه
Robust Graph Topologies for Networked Systems
Robustness of networked systems against noise corruption and structural changes in an underlying network topology is a critical issue for a reliable performance. In this paper, we investigate this issue of robustness in networked systems both from structural and functional viewpoints. Structural robustness deals with the effect of changes in a graph structure due to link or edge failures, while...
متن کاملControl of Networked Multiagent Systems with Uncertain Graph Topologies
Abstract — Multiagent systems consist of agents that locally exchange information through a physical network subject to a graph topology. Current control methods for networked multiagent systems assume the knowledge of graph topologies in order to design distributed control laws for achieving desired global system behaviors. However, this assumption may not be valid for situations where graph t...
متن کاملConstrained agreement protocols for tree graph topologies
This paper presents a novel way of manipulating the initial conditions in the consensus equation such that a constrained agreement problem is solved across a distributed network of agents, particularly for a network represented by a tree graph. The presented method is applied to the problem of coordinating multiple pendula attached to mobile bases. The pendula should move in such a way that the...
متن کاملStochastic Model Predictive Control for Constrained Networked Control Systems with Random Time Delay
In this paper the continuous time stochastic constrained optimal control problem is formulated for the class of networked control systems assuming that time delays follow a discrete-time, finite Markov chain . Polytopic overapproximations of the system’s trajectories are employed to produce a polyhedral inner approximation of the non-convex constraint set resulting from imposing the constraints...
متن کاملRandom Geometric Graph Diameter in the Unit
Let n be a positive integer, and λ > 0 a real number. Let Vn be a set of n points randomly located within the unit disk, which are mutually independent. For 1 ≤ p ≤ ∞, define Gp(λ, n) to be the graph with the vertex set Vn, in which two vertices are adjacent if and only if their `p-distance is at most λ. We call this graph a unit disk random graph. Let λ = c √ ln n/n and let X be the number of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Circuits and Systems II: Express Briefs
سال: 2014
ISSN: 1549-7747,1558-3791
DOI: 10.1109/tcsii.2014.2362676