Abstract
ABSTRACTThis paper investigates the consensus of identical linear multi-agent systems with aperiodic intermittent communication topology by using the information of second-order neighbours (two-hop neighbourhood). The protocols based on two-hop neighbourhood information and intermittent communication topology are designed, under which consensus is reached. If the communication rate is larger than the corresponding threshold value, the networks will accelerate consensus by using two-hop neighbourhood information. By means of switching systems theory and Lyapunov–Razumikhin theorem, consensus of multi-agent systems with communication delays and intermittent communication topology is reached by two-hop neighbourhood information. Finally, simulation examples are provided to show the effectiveness of the theoretical results.
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
