Abstract
This paper researches the problem of information consensus in networked multi-agent Continuous-time systems in the presence of undirected connected graph and different time delays. The analysis showed the essential relationship between the information consensus of multi-agent systems and the stability of continuous-time systems. Based on the theories of generalized Nyquist stability criterion and eigenvalue, it derived a sufficient condition to ensure the consensus of multi-agent continuous-time systems in the presence of undirected connected graph and input time delay. The simulation results coincide with the theoretical analysis, with the condition of undirected connected graph, and when the input delays are less than or equal to the standard delays given by the sufficient condition, the multi-agent systems can achieve consensus asymptotically.
Sign-in/Register to access full text options 
Free) 
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 call
