Consensus of single-integrator multi-agent systems at a preset time

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper studies the preset time consensus problem of singintegrator multi-agent systems for reaching the desired state in both undirected and directed communication networks. Two linear consensus protocols with time-varying gain are proposed. In fixed undirected networks, if the undirected topology is connected, the proposed protocol can achieve the consensus at the preset time even if only a portion of agents can obtain the desired state. In fixed directed networks, if the directed topology has a directed spanning tree, the proposed protocol can solve the consensus problem at a given preset time. Finally, numerical simulation results are presented to demonstrate the effectiveness of the theoretical results.

Cite

CITATION STYLE

APA

Liu, C., Zhou, Q., & Liu, Y. (2014). Consensus of single-integrator multi-agent systems at a preset time. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8794, 431–441. https://doi.org/10.1007/978-3-319-11857-4_49

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