点击次数：

论文类型：期刊论文

发表时间：2015-12-01

发表刊物：AUTOMATICA

收录刊物：SCIE、EI、Scopus

卷号：62

页面范围：11-17

ISSN号：0005-1098

关键字：Consensus algorithms; Time-dependent graphs; Asymptotic convergence

摘要：In this paper, we propose a distributed max-min consensus algorithm for a discrete-time n-node system. Each node iteratively updates its state to a weighted average of its own state together with the minimum and maximum states of its neighbors. In order for carrying out this update, each node needs to know the positive direction of the state axis, as some additional information besides the relative states from the neighbors. Various necessary and/or sufficient conditions are established for the proposed max-min consensus algorithm under time-varying interaction graphs. These convergence conditions do not rely on the assumption on the positive lower bound of the arc weights. (C) 2015 Elsevier Ltd. All rights reserved.