Tight bound on parameter of surplus-based averaging algorithm over balanced digraphs
MetadataShow full item record
This is an accepted manuscript of an article published by Taylor & Francis in International Journal of Control on 11/10/2018 available online at http://www.tandfonline.com/10.1080/00207179.2018.1535200
© 2018 Informa UK Limited, trading as Taylor & Francis Group. We study a continuous-time surplus-based algorithm for multi-agent average consensus, and derive a tight upper bound on the key parameter included in this algorithm that ensures convergence over strongly connected and balanced digraphs. We specialise the upper bound result to undirected (connected) graphs and unweighted cyclic digraphs; in particular, for undirected graphs the algorithm converges for arbitrary positive values of the parameter, and for cyclic digraphs the upper bound on the parameter depends only on the number of agents and may be easily calculated. Moreover, it is suggested through extensive simulation that, for the same number of agents, the upper bound for cyclic digraphs be smaller than that for other strongly connected and possibly unbalanced digraphs; this implies that as long as the parameter satisfies the upper bound for cyclic digraphs, this parameter can work for other digraphs.
Showing items related by title, author, creator and subject.
Ye, Mengbin ; Anderson, B.D.O.; Yu, C. (2017)This paper proposes a distributed model-independent algorithm to achieve leaderless consensus on a directed network where each fully-actuated agent has self-dynamics described by Euler–Lagrange equations of motion. ...
Lam, Bee K. (1999)A network is a system that involves movement or flow of some commodities such as goods and services. In fact any structure that is in the form of a system of components some of which interact can be considered as a network. ...
Liu, Q.; Ye, Mengbin ; Qin, J.; Yu, C. (2019)This paper proposes three different distributed event-triggered control algorithms to achieve leader-follower consensus for a network of Euler-Lagrange agents. We first propose two model-independent algorithms for a ...