On the controlled agreement problem

Amirreza Rahmani; Mehran Mesbahi

doi:10.1109/acc.2006.1656409

On the controlled agreement problem

Amirreza Rahmani, Mehran Mesbahi

Mechanical & Aerospace Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

57 Scopus citations

Abstract

Our work examines the controlled agreement problem over a network of interconnected dynamic units. The agreement protocol has recently been a focus of a large number of research work in systems and control community. Most of the existing work in this area, however, consider the uncontrolled agreement protocol. In this work, we consider the controlled agreement problem and introduce algebraic and graph theoretic conditions for its controllability. We then proceed to provide a graphical interpretation of these controllability conditions. In addition, we explore the role of anchored vertex position in the information structure to improve the convergence properties of the controlled agreement protocol.

Original language	English (US)
Title of host publication	Proceedings of the 2006 American Control Conference
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1376-1381
Number of pages	6
ISBN (Print)	1424402107, 9781424402106
DOIs	https://doi.org/10.1109/acc.2006.1656409
State	Published - Jan 1 2006
Event	2006 American Control Conference - Minneapolis, MN, United States Duration: Jun 14 2006 → Jun 16 2006

Publication series

Name	Proceedings of the American Control Conference
Volume	2006
ISSN (Print)	0743-1619

Other

Other	2006 American Control Conference
Country	United States
City	Minneapolis, MN
Period	6/14/06 → 6/16/06

Keywords

Agreement dynamics
Algebraic graph theory
Controllability
Graph symmetry

ASJC Scopus subject areas

Control and Systems Engineering

Access to Document

10.1109/acc.2006.1656409

Fingerprint Dive into the research topics of 'On the controlled agreement problem'. Together they form a unique fingerprint.

Cite this

Rahmani, A & Mesbahi, M 2006, On the controlled agreement problem. in Proceedings of the 2006 American Control Conference., 1656409, Proceedings of the American Control Conference, vol. 2006, Institute of Electrical and Electronics Engineers Inc., pp. 1376-1381, 2006 American Control Conference, Minneapolis, MN, United States, 6/14/06. https://doi.org/10.1109/acc.2006.1656409

@inproceedings{6b8668d47cd64351b6ae4e87674528be,

title = "On the controlled agreement problem",

abstract = "Our work examines the controlled agreement problem over a network of interconnected dynamic units. The agreement protocol has recently been a focus of a large number of research work in systems and control community. Most of the existing work in this area, however, consider the uncontrolled agreement protocol. In this work, we consider the controlled agreement problem and introduce algebraic and graph theoretic conditions for its controllability. We then proceed to provide a graphical interpretation of these controllability conditions. In addition, we explore the role of anchored vertex position in the information structure to improve the convergence properties of the controlled agreement protocol.",

keywords = "Agreement dynamics, Algebraic graph theory, Controllability, Graph symmetry",

author = "Amirreza Rahmani and Mehran Mesbahi",

year = "2006",

month = jan,

day = "1",

doi = "10.1109/acc.2006.1656409",

language = "English (US)",

isbn = "1424402107",

series = "Proceedings of the American Control Conference",

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

pages = "1376--1381",

booktitle = "Proceedings of the 2006 American Control Conference",

note = "2006 American Control Conference ; Conference date: 14-06-2006 Through 16-06-2006",

}

TY - GEN

T1 - On the controlled agreement problem

AU - Rahmani, Amirreza

AU - Mesbahi, Mehran

PY - 2006/1/1

Y1 - 2006/1/1

N2 - Our work examines the controlled agreement problem over a network of interconnected dynamic units. The agreement protocol has recently been a focus of a large number of research work in systems and control community. Most of the existing work in this area, however, consider the uncontrolled agreement protocol. In this work, we consider the controlled agreement problem and introduce algebraic and graph theoretic conditions for its controllability. We then proceed to provide a graphical interpretation of these controllability conditions. In addition, we explore the role of anchored vertex position in the information structure to improve the convergence properties of the controlled agreement protocol.

AB - Our work examines the controlled agreement problem over a network of interconnected dynamic units. The agreement protocol has recently been a focus of a large number of research work in systems and control community. Most of the existing work in this area, however, consider the uncontrolled agreement protocol. In this work, we consider the controlled agreement problem and introduce algebraic and graph theoretic conditions for its controllability. We then proceed to provide a graphical interpretation of these controllability conditions. In addition, we explore the role of anchored vertex position in the information structure to improve the convergence properties of the controlled agreement protocol.

KW - Agreement dynamics

KW - Algebraic graph theory

KW - Controllability

KW - Graph symmetry

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

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

U2 - 10.1109/acc.2006.1656409

DO - 10.1109/acc.2006.1656409

M3 - Conference contribution

AN - SCOPUS:34047240864

SN - 1424402107

SN - 9781424402106

T3 - Proceedings of the American Control Conference

SP - 1376

EP - 1381

BT - Proceedings of the 2006 American Control Conference

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2006 American Control Conference

Y2 - 14 June 2006 through 16 June 2006

ER -