This thesis investigates the average consensus of multi-agent systems with linear dynamics whose interconnections are modelled by balanced digraphs with matrixweights. The thesis first introduces the notion of balanced digraphs and mirror graphs for matrix weights. Then it proves that the matrix-weight-balanced consensus controller is indeed globally asymptotically stable. The Lyapunov stability analysis exploits the properties of the mirror graph of a balanced digraph. Further, the necessary and sufficient condition for the system to achieve average consensus is shown to be positive definiteness of the matrix weights of its balanced digraph. Simulations with robots in SIMULINK verify that positive definite matrix weights on balanced graphs are indeed necessary and sufficient for average consensus. Finally formation control of a multi-robot system is shown to be an application of the matrix-weight-balanced consensus algorithm using real time simulation of Clearpath Ridgeback robots in Gazebo and ROS.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.