For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Stability Analysis of Pinning Consensus Control of Discrete-time Multi-agent Systems
Dongwu XU Akinori SAKAGUCHI Toshimitsu USHIO
A - Abstracts of IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences (Japanese Edition)
Publication Date: 2018/07/01
Online ISSN: 1881-0195
Type of Manuscript: PAPER
discrete-time, consensus, pinning control, multi-agent system,
Full Text(in Japanese): PDF(702.4KB)
>>Buy this Article
In this paper, we consider the consensus problem of discrete-time multi-agent systems with a pinning control method. We select a single agent that is the root of a spanning tree as the pinning agent and consider a transfer function from the pinning input to the state of the pinning agent. Then using the root-locus method, we show that there exists an upper bound of the pinning gain to achieve the pinning consensus. With Gershgorin theorem, we show that under a certain assumption, root loci converging to zeros of the open-loop system always stay in the unit circle as the pinning gain increases from 0 to infinity.