Abstract
In this paper, we discuss the dynamic behavior of networks of dynamic agents with general communication topologies. We first analyze the basic case: systems with communication topologies that have spanning trees, i.e., the systems that solve consensus problems. We establish an algebraic condition to characterize each agent's contributions to the final state. And we also study the influence of time-delays on each agent's contributions. Then, we investigate the general case: systems with weakly connected topologies. By using matrix theory, we prove that the states of internal agents will converge to a convex combination of boundary agents in the absence or presence of communication time-delays, and we also show that the coefficients of the convex combination are independent of time-delays even if the delays are time-varying. These results have broad applications in other areas, e.g., study of swarm behavior, formation control of vehicles, etc.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Physica A: Statistical Mechanics and its Applications
Disclaimer: 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.