Abstract
A distributed algorithms are devoted to studying consensus problem for a class of strong nonlinear multi-agent systems with switching graphs and arbitrarily bounded communication delays. The communication graphs are directed and changing dynamically, and we assume that the union of the graphs is connected strongly among each certain time interval. A consensus algorithm is introduced for switching graphs and zero communication delays, which guarantees that all agents’ states ultimately achieve a consensus convergence. Then, the other consensus algorithm is given for switching graphs and arbitrarily bounded communication delays. we show that the distributed continuous-time consensus problem is able to be addressed as time evolves.
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 call
