Eichler, AnnikaAnnikaEichlerWerner, HerbertHerbertWerner2022-06-032022-06-032014-08-02Systems and Control Letters 71: 7-13 (2014)http://hdl.handle.net/11420/12799This paper considers the convergence speed of multi-agent systems with discrete-time double-integrator dynamics. The communication topology is assumed to be fixed and undirected. The speed of convergence of the associated average consensus protocol is analyzed, and the problem of maximizing the convergence speed over the free parameters in the consensus protocol is considered. A closed-form solution to this problem is proposed assuming that the ratios of weights of communication links are fixed. Furthermore it is shown that when the weight ratios are considered as decision variables, a global optimum of the convergence speed can be obtained by solving an LMI problem. Simulation results are provided that demonstrate the effectiveness of the proposed approach.en1872-79562014713ElsevierConsensus problemConsensus speedDiscrete-time systemsDouble-integrator dynamicsGraph LaplaciansMulti-agent systemsInformatikJournal Article10.1016/j.sysconle.2014.06.010Other