Show simple item record

dc.contributor.authorDomínguez-Garcia, A. D.en
dc.contributor.authorHadjicostis, Christoforos N.en
dc.creatorDomínguez-Garcia, A. D.en
dc.creatorHadjicostis, Christoforos N.en
dc.date.accessioned2019-04-08T07:45:39Z
dc.date.available2019-04-08T07:45:39Z
dc.date.issued2015
dc.identifier.urihttp://gnosis.library.ucy.ac.cy/handle/7/43313
dc.description.abstractWe consider a multicomponent system in which each component can receive/transmit information from/to components in its immediate neighborhood. Communication links between components are not required to be bidirectional, so that the information exchange between components in the system is in general described by a directed graph (digraph). Each component can contribute a certain amount of some resource (of the same type for each component), and the objective is for the components to distributively compute their individual resource contribution so as to collectively provide a requested amount of the resource. A further constraint is that each component's contribution is upper and lower bounded by locally known capacity constraints. In order to solve this resource coordination problem, we propose a distributed linear iterative algorithm in which each component maintains a set of values that are updated to be weighted linear combinations of its own previous value(s) and the values of the components it receives information from. Since the original choices of weights used by the components to perform the linear updates may not allow the components to solve the problem, the weights are allowed to adapt (also in a distributed fashion) as the algorithm progresses. Convergence of the proposed algorithm to a feasible solution is established analytically and demonstrated via examples. © 2015 Elsevier B.V. All rights reserved.en
dc.sourceSystems and Control Lettersen
dc.source.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84935892977&doi=10.1016%2fj.sysconle.2015.04.012&partnerID=40&md5=0210181952af3a63ada62cf39fa63043
dc.subjectAlgorithmsen
dc.subjectIterative methodsen
dc.subjectStochastic systemsen
dc.subjectGraph theoryen
dc.subjectIterative algorithmen
dc.subjectDirected graphsen
dc.subjectInformation exchangesen
dc.subjectCoordinationen
dc.subjectDistributed iterative algorithmsen
dc.subjectMulti-component systemsen
dc.subjectPerron-frobenius theoremen
dc.subjectResource coordinationsen
dc.subjectStochastic matricesen
dc.subjectWeighted linear combinationsen
dc.titleDistributed resource coordination in networked systems described by digraphsen
dc.typeinfo:eu-repo/semantics/article
dc.identifier.doi10.1016/j.sysconle.2015.04.012
dc.description.volume82
dc.description.issueJournal Articleen
dc.description.startingpage33
dc.description.endingpage39
dc.author.facultyΠολυτεχνική Σχολή / Faculty of Engineering
dc.author.departmentΤμήμα Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών / Department of Electrical and Computer Engineering
dc.type.uhtypeArticleen
dc.source.abbreviationSyst Control Letten
dc.contributor.orcidHadjicostis, Christoforos N. [0000-0002-1706-708X]


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record