|Publisher DOI:||10.1016/j.sysconle.2017.08.001||Title:||Optimal convergence speed of consensus under constrained damping for multi-agent systems with discrete-time double-integrator dynamics||Language:||English||Authors:||Eichler, Annika
|Keywords:||Consensus problem;Consensus speed;Damping;Discrete-time systems;Double-integrator dynamics;Graph Laplacians;Multi-agent systems||Issue Date:||13-Sep-2017||Publisher:||Elsevier||Source:||Systems and Control Letters (108): 48-55 (2017-10-01)||Journal or Series Name:||Systems & control letters||Abstract (english):||This paper considers the optimization of the convergence speed of consensus under given damping constraints for multi-agent systems with discrete-time double-integrator dynamics with fixed interconnection topology. This work summarizes and details existing results in the case of undirected topologies and extends them to directed ones. The interconnection topology is assumed to be connected or to contain a rooted-out branching, respectively. Depending on the minimum required damping, for undirected interconnection topologies in most cases analytic solutions are provided. The structure of these solutions is independent of the size of the network and only depends on the largest and second smallest eigenvalue of the corresponding Laplacian. For the remaining cases without analytic solutions provided, a combined bisection grid search is presented that solves the constrained optimization problem efficiently. This algorithm can also be applied to directed interconnection topologies and, as for the undirected case, converges to the single optimum. Simulation results are provided that demonstrate the effectiveness of the proposed approach.||URI:||http://hdl.handle.net/11420/3268||ISSN:||1872-7956||Institute:||Regelungstechnik E-14||Type:||(wissenschaftlicher) Artikel||Project:||Multi-Agent Systems|
|Appears in Collections:||Publications without fulltext|
Show full item record
checked on Sep 24, 2020
Add Files to Item
Note about this record
Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.