A sharp bound on the s-energy and its applications to averaging systems

Bernard Chazelle

doi:10.1109/TAC.2019.2899509

A sharp bound on the s-energy and its applications to averaging systems

Bernard Chazelle

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

Abstract

The s-energy is a generating function of wide applicability in network-based dynamics. We derive an (essentially) optimal bound of (3/ρs)^n-1 on the s-energy of an n-agent symmetric averaging system, for any positive real s ≤ 1, where ρ is a lower bound on the nonzero weights. This is done by introducing the new dynamics of twist systems. We show how to use the new bound on the s-energy to tighten the convergence rates of systems in opinion dynamics, flocking, and synchronization.

Original language	English (US)
Article number	8642407
Pages (from-to)	4385-4390
Number of pages	6
Journal	IEEE Transactions on Automatic Control
Volume	64
Issue number	10
DOIs	https://doi.org/10.1109/TAC.2019.2899509
State	Published - Oct 2019
Externally published	Yes

All Science Journal Classification (ASJC) codes

Control and Systems Engineering
Computer Science Applications
Electrical and Electronic Engineering

Keywords

S-energy

Access to Document

10.1109/TAC.2019.2899509

Cite this

@article{ab66ad79eba543058274358e65bead7c,

title = "A sharp bound on the s-energy and its applications to averaging systems",

abstract = "The s-energy is a generating function of wide applicability in network-based dynamics. We derive an (essentially) optimal bound of (3/ρs)n-1 on the s-energy of an n-agent symmetric averaging system, for any positive real s ≤ 1, where ρ is a lower bound on the nonzero weights. This is done by introducing the new dynamics of twist systems. We show how to use the new bound on the s-energy to tighten the convergence rates of systems in opinion dynamics, flocking, and synchronization.",

keywords = "S-energy",

author = "Bernard Chazelle",

note = "Publisher Copyright: {\textcopyright} 2019 IEEE.",

year = "2019",

month = oct,

doi = "10.1109/TAC.2019.2899509",

language = "English (US)",

volume = "64",

pages = "4385--4390",

journal = "IEEE Transactions on Automatic Control",

issn = "0018-9286",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "10",

}

TY - JOUR

T1 - A sharp bound on the s-energy and its applications to averaging systems

AU - Chazelle, Bernard

PY - 2019/10

Y1 - 2019/10

N2 - The s-energy is a generating function of wide applicability in network-based dynamics. We derive an (essentially) optimal bound of (3/ρs)n-1 on the s-energy of an n-agent symmetric averaging system, for any positive real s ≤ 1, where ρ is a lower bound on the nonzero weights. This is done by introducing the new dynamics of twist systems. We show how to use the new bound on the s-energy to tighten the convergence rates of systems in opinion dynamics, flocking, and synchronization.

AB - The s-energy is a generating function of wide applicability in network-based dynamics. We derive an (essentially) optimal bound of (3/ρs)n-1 on the s-energy of an n-agent symmetric averaging system, for any positive real s ≤ 1, where ρ is a lower bound on the nonzero weights. This is done by introducing the new dynamics of twist systems. We show how to use the new bound on the s-energy to tighten the convergence rates of systems in opinion dynamics, flocking, and synchronization.

KW - S-energy

UR - http://www.scopus.com/inward/record.url?scp=85075546547&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85075546547&partnerID=8YFLogxK

U2 - 10.1109/TAC.2019.2899509

DO - 10.1109/TAC.2019.2899509

M3 - Article

AN - SCOPUS:85075546547

SN - 0018-9286

VL - 64

SP - 4385

EP - 4390

JO - IEEE Transactions on Automatic Control

JF - IEEE Transactions on Automatic Control

IS - 10

M1 - 8642407

ER -

A sharp bound on the s-energy and its applications to averaging systems

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this