Abstract
The consensus tracking problem is investigated for multi-agent systems with directed graph. To avoid using any global information, a novel adaptive protocol is proposed based only on the relative state information. A monotonically increasing function for each agent is inserted into the protocol to provide extra freedom for design. By using matrix theory and appropriate Lyapunov techniques, it is shown that the consensus tracking can be achieved in a fully distributed fashion if agents׳ dynamics are stabilizable and the topological graph contains a directed spanning tree with the leader as the root node. A simulation example shows the effectiveness of the design method.
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.
