Consensus Tracking via Iterative Learning for Multi-Agent Systems with Random Initial States

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, a distributed consensus iterative learning control algorithm is proposed for the finite-time consensus tracking of multi-agent systems with random initial states. The tracking errors from the agent itself and its neighbours are applied to successively rectify the control protocol when only some agents can obtain the desired trajectory information. Additionally, a time interval is designed in the control protocol, and the random initial state errors are rectified, one-by-one, in the time interval. The interval can gradually shorten as the number of iterations increases. Furthermore, the convergence of the algorithm is theoretically proven by the contraction mapping method, and the convergence condition is derived. The proposed algorithm can cause the time interval to gradually shorten with the iterations increase, during the time, the desired trajectory cannot be consistently tracked due to the random initial state errors. As a consequence, the algorithm gradually widens the time interval for full consensus tracking of the multi agents. Finally, the simulation examples are provided to verify the effectiveness of the algorithm.

Cite

CITATION STYLE

APA

Cao, W., Qiao, J., & Sun, M. (2020). Consensus Tracking via Iterative Learning for Multi-Agent Systems with Random Initial States. IEEE Access, 8, 215582–215591. https://doi.org/10.1109/ACCESS.2020.3041243

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free