Distributed resource coordination in networked systems described by digraphs

DOI10.1016/J.SYSCONLE.2015.04.012zbMATH Open1327.93036OpenAlexW560911797MaRDI QIDQ899121FDOQ899121

Alejandro D. Domínguez-García, Christoforos N. Hadjicostis

Publication date: 21 December 2015

Published in: Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.sysconle.2015.04.012

Recommendations

• Distributed optimal resource allocation over strongly connected digraphs: a surplus-based approach
• Distributed average consensus in digraphs
• Distributed optimal in-network resource allocation algorithm design via a control theoretic approach
• Distributed resource allocation on dynamic networks in quadratic time
• Distributed resource allocation via multi-agent systems under time-varying networks

zbMATH Keywords

stochastic matricescoordinationPerron-Frobenius theoremdistributed iterative algorithms

Mathematics Subject Classification ID

Large-scale systems (93A15) Stochastic systems in control theory (general) (93E03) Applications of graph theory to circuits and networks (94C15)

Cites Work

• Consensus and Cooperation in Networked Multi-Agent Systems
• Non-negative matrices and Markov chains.
• Distributed strategies for generating weight-balanced and doubly stochastic digraphs
• Distributed control of robotic networks: a mathematical approach to motion coordination algorithms.
• Achieving Proportional Fairness Using Local Information in Aloha Networks
• Methods for scaling to doubly stochastic form

Cited In (2)

• Distributed predefined-time constrained social cost minimization problem under the partial information setting
• Distributed algorithm for social cost minimization with second-order nonlinear dynamics over weight-unbalanced digraphs

This page was built for publication: Distributed resource coordination in networked systems described by digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q899121)