期刊
AUTOMATICA
卷 59, 期 -, 页码 112-119出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.automatica.2015.06.011
关键词
Cooperative control; Dynamic average consensus; Event-triggered communication; Weight-balanced directed graphs
资金
- L3 Communications through UCSD Cymer Center for Control Systems and Dynamics
- UC President's postdoctoral fellowship
- National Science Foundation [ECCS-1307176]
- [AFOSR-11RSL548]
- Div Of Electrical, Commun & Cyber Sys
- Directorate For Engineering [1307176] Funding Source: National Science Foundation
This paper presents distributed algorithmic solutions that employ opportunistic inter-agent communication to achieve dynamic average consensus. In our solutions each agent is endowed with a local criterion that enables it to determine whether to broadcast its state to its neighbors. Our starting point is a continuous-time distributed coordination strategy that, under continuous-time communication, achieves practical asymptotic tracking of the dynamic average of the time-varying agents' reference inputs. Then, for this algorithm, depending on the directed or undirected nature of the time-varying interactions and under suitable connectivity conditions, we propose two different distributed event-triggered communication laws that prescribe agent communications at discrete time instants in an opportunistic fashion. In both cases, we establish positive lower bounds on the inter-event times of each agent and characterize their dependence on the algorithm design parameters. This analysis allows us to rule out the presence of Zeno behavior and characterize the asymptotic correctness of the resulting implementations. Several simulations illustrate the results. (C) 2015 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据