Fast Consensus Seeking on Networks with Antagonistic Interactions
It is well known that all agents in a multiagent system can asymptotically converge to a common value based on consensus protocols. Besides, the associated convergence rate depends on the magnitude of the smallest nonzero eigenvalue of Laplacian matrix L. In this paper, we introduce a superposition...
Na minha lista:
| Principais autores: | , , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Wiley
2018-01-01
|
| coleção: | Complexity |
| Acesso em linha: | http://dx.doi.org/10.1155/2018/7831317 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|
