Abstract
Consensus seeking is investigated for the discrete-time heterogeneous multi-agent systems composed of first-order agents and second-order agents, and two stationary consensus algorithms are constructed for the first-order agents and the second-order agents, respectively. Based on the properties of nonnegative matrices, sufficient consensus criteria are obtained for the agents with bounded communication delays under fixed topology and switching topologies, respectively. With some prerequisites on the coupling weights and the sampling interval, the asymptotic consensus achievement of the dynamic agents is independent of the communication delay, but strictly depends on the connectedness of the interconnection topology. Simulation results illustrate the correctness of the results.
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.
