Abstract
This 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
