Abstract
The consensus problem has always been the core of multi-agent systems. In recent years, the studies of multi-agent systems with symmetric delay or variable delay have some work. But few scholars are involved in the research of the study of multi-agent systems with asymmetric delay. In this paper, the consensus of discrete multi-agent systems with asymmetric delay are discussed under the network topology whose adjacency matrix is the stochastic matrix. The eigenvalue distribution consensus is proposed based on the predecessors’ research. Using the theory of stochastic matrix and stability theory of discrete system, the sufficient conditions of Lyapnov stability , eigenvalue distribution consensus and average consensus are given, respectively. Lastly, numerical simulations are given to show the effectiveness of our results.
Sign-in/Register to access full text options 
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.
