The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We consider spatially invariant consensus networks in which the directed graph describing the interconnection topology, the link weights, and the temporal dynamics, are all characterized by circulant matrices. We seek the best new links, subject to budget constraints, whose addition to the network maximally improves its rate of convergence to consensus. Motivated by small-world networks, we apply...
We study the problem of performance enhancement in stochastically-forced directed consensus networks by adding edges to an existing topology. We formulate the problem as a feedback control design, and represent the links as the elements of the controller graph Laplacian matrix. The topology design of the controller network can be cast as an ℓ1 regularized version of the ℋ2 optimal control problem...
This paper provides a distributed coordination law for energy distribution in smart grid networks. A distributed optimization scheme is designed to meet supply-demand balance in overall network. To impose lower and upper boundaries in energy flow, we use high-order polynomials in the definition of cost functions. By using high-order polynomials, we could develop a distributed optimization scheme taking...
We consider the weight design problem for the consensus algorithm under a finite time horizon. We assume that the underlying network is random where the links fail at each iteration with certain probability and the link failures can be spatially correlated. We formulate a family of weight design criteria (objective functions) that minimize n, n = 1, …,N (out of N possible) largest (slowest) eigenvalues...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.