Abstract
This paper investigates distributed dynamic average consensus problems for a class of nonlinear multi-agent systems in the presence of local disturbances over a directed graph, where local disturbances are generated by an external system. In order to solve such problems, we establish a distributed consensus protocol based on the internal model (IM) principle such that states of the first-order nonlinear system converge to the average of multiple time-varying inputs and local disturbances are rejected. By means of Lyapunov stability theory and graph theory, a two-step mechanism is established to certify that the proposed algorithm is exponentially convergent. Furthermore, a neoteric distributed consensus algorithm is proposed to solve a dynamic average consensus problem of the second-order nonlinear multi-agent system. The proposed algorithm can guarantee that positions and velocities of the second-order nonlinear multi-agent system converge exponentially to the average of multiple time-varying inputs and their derivative and local disturbances are rejected, respectively. Finally, three numerical examples are provided to demonstrate the effectiveness of the obtained results.
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.
