Tight estimates for non-stationary consensus with fixed underlying spanning tree-Reference-Cited by-同舟云学术

Tight estimates for non-stationary consensus with fixed underlying spanning tree

Published:2008 Issue:2 Volume:41 Page:9021-9026
ISSN:1474-6670
Container-title:IFAC Proceedings Volumes
language:en
Short-container-title:IFAC Proceedings Volumes

Author:

Angeli David,Bliman Pierre-Alexandre

Publisher

Elsevier BV

Subject

General Medicine

Reference15 articles.

1. Stability of leaderless discrete-time multi-agent systems;Angeli;Mathematics of Control, Signals and Systems,2006

2. D. Angeli, P.-A. Bliman (2006b). Convergence speed of unsteady distributed consensus: decay estimates along the settling spanning trees, Available at arxiv.org/abs/math.OC/0610854

3. D. Angeli, P.-A. Bliman (2007). Tight estimates for convergence of some non-stationary consensus algorithms, Available at arxiv.org/abs/0706.0630

4. Parallel and distributed computation;Bertsekas,1989

5. M. Cao, D.A. Spielman, A.S. Morse (2005). A Lower Bound on Convergence of a Distributed Network Consensus Algorithm. In Proceedings of the Joint European

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Distributed combination of belief functions;Information Fusion;2021-01

2. An Overview of Cooperative and Consensus Control of Multiagent Systems;Wiley Encyclopedia of Electrical and Electronics Engineering;2016-08-15

3. Conclusions and FutureWork;Team Cooperation in a Network of Multi-Vehicle Unmanned Systems;2012-10-20

4. Linear Matrix Inequalities in the Team Cooperation Problem;Team Cooperation in a Network of Multi-Vehicle Unmanned Systems;2012-10-20

5. Nonideal Considerations for Semi-decentralized Optimal Team Cooperation;Team Cooperation in a Network of Multi-Vehicle Unmanned Systems;2012-10-20