Abstract
This paper deals with fully distributed consensus control of linear multi-agent systems in continuous-time. The subsystems or the agents are connected by an undirected graph with unknown network connectivity, which is then estimated by a carefully designed adaptive scheme. With this adaptive scheme, the proposed control design only uses the relative state information of the subsystems in a neighbourhood. This makes the proposed control fully distributed, without the use of the network connectivity that requires the Laplacian matrix of the entire network. The proposed control is also guaranteed to achieve an optimal control performance index.
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.
