Abstract
This paper deals with the distributed iterative learning control (ILC) problem of leaderless consensus in a network of heterogeneous nonlinear agents. For a general case that the topology graph is dynamically changing with respect to both iteration and time axes, an ILC-based consensus protocol is designed for each agent by utilizing its control input and neighboring information from the last iteration. It is shown that under a basic joint spanning tree condition, the states of all agents can exponentially agree on a common trajectory along the iteration axis. Interestingly, by the appropriate design of the agents’ dynamics, it is found that the consensus trajectory and the network state can approach the unique optimal point of a convex optimization problem as the time evolves. Simulations demonstrate the validity of the proposed algorithms and theoretical analysis.
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.
