Abstract
This study addresses the robust consensus problem of a network of Lur'e systems coordinating over uncertain communication channels. The authors model each communication channel of the network as an ideal transmission system with the unitary transfer function perturbed by a norm-bounded uncertainty, which is particularly susceptible to describe quantisation errors and communication noises. Based on the uncertain relative state information among neighbouring agents, a distributed consensus protocol is proposed and designed in terms of linear matrix inequalities to ensure robust consensus for both undirected connected graphs and leader-follower graphs containing a directed spanning tree.
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.
