TY - GEN
T1 - Edge-event-based multi-agent consensus with Zeno-free triggers under synchronized/unsynchronized clocks
AU - Fang, Pengfei
AU - Liu, Qingchen
AU - Hou, Xiaolei
AU - Qin, Jiahu
AU - Yu, Changbin
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/6/28
Y1 - 2017/6/28
N2 - In this paper, we present novel edge-event-based triggering algorithms to achieve multi-agent consensus with Zeno-free triggers. The control inputs and triggering conditions for each agent are designed based only on relative state measurements in each agent's own local coordinate system. The existence of strictly positive minimal inter-event times guarantees the elimination of Zeno behaviour. Two cases, namely the synchronized clock case and the unsynchronized clock case, are studied. In the synchronized clock case, all agents are activated simultaneously to measure the relative state information over edge links under a global clock. Edge events are defined and their occurrences trigger the update of control inputs for the two agents sharing the link. We show that average consensus can be achieved with our proposed algorithm. In the unsynchronized clock case, each agent executes control algorithms under its own clock which is not synchronized with other agents' clocks. An edge event only triggers control input update for an individual agent. Detailed explanations and analysis are provided to show that all agents will reach consensus in a totally asynchronous manner. Numerical simulations are given to verify the effectiveness of the proposed algorithms.
AB - In this paper, we present novel edge-event-based triggering algorithms to achieve multi-agent consensus with Zeno-free triggers. The control inputs and triggering conditions for each agent are designed based only on relative state measurements in each agent's own local coordinate system. The existence of strictly positive minimal inter-event times guarantees the elimination of Zeno behaviour. Two cases, namely the synchronized clock case and the unsynchronized clock case, are studied. In the synchronized clock case, all agents are activated simultaneously to measure the relative state information over edge links under a global clock. Edge events are defined and their occurrences trigger the update of control inputs for the two agents sharing the link. We show that average consensus can be achieved with our proposed algorithm. In the unsynchronized clock case, each agent executes control algorithms under its own clock which is not synchronized with other agents' clocks. An edge event only triggers control input update for an individual agent. Detailed explanations and analysis are provided to show that all agents will reach consensus in a totally asynchronous manner. Numerical simulations are given to verify the effectiveness of the proposed algorithms.
UR - http://www.scopus.com/inward/record.url?scp=85046128181&partnerID=8YFLogxK
U2 - 10.1109/CDC.2017.8264670
DO - 10.1109/CDC.2017.8264670
M3 - Conference contribution
T3 - 2017 IEEE 56th Annual Conference on Decision and Control, CDC 2017
SP - 6708
EP - 6713
BT - 2017 IEEE 56th Annual Conference on Decision and Control, CDC 2017
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 56th IEEE Annual Conference on Decision and Control, CDC 2017
Y2 - 12 December 2017 through 15 December 2017
ER -