On the controlled agreement problem

Amirreza Rahmani, Mehran Mesbahi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

52 Citations (Scopus)

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 languageEnglish
Title of host publicationProceedings of the American Control Conference
Pages1376-1381
Number of pages6
Volume2006
StatePublished - Dec 1 2006
Event2006 American Control Conference - Minneapolis, MN, United States
Duration: Jun 14 2006Jun 16 2006

Other

Other2006 American Control Conference
CountryUnited States
CityMinneapolis, MN
Period6/14/066/16/06

Fingerprint

Controllability

Keywords

  • Agreement dynamics
  • Algebraic graph theory
  • Controllability
  • Graph symmetry

ASJC Scopus subject areas

  • Control and Systems Engineering

Cite this

Rahmani, A., & Mesbahi, M. (2006). On the controlled agreement problem. In Proceedings of the American Control Conference (Vol. 2006, pp. 1376-1381). [1656409]

On the controlled agreement problem. / Rahmani, Amirreza; Mesbahi, Mehran.

Proceedings of the American Control Conference. Vol. 2006 2006. p. 1376-1381 1656409.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Rahmani, A & Mesbahi, M 2006, On the controlled agreement problem. in Proceedings of the American Control Conference. vol. 2006, 1656409, pp. 1376-1381, 2006 American Control Conference, Minneapolis, MN, United States, 6/14/06.
Rahmani A, Mesbahi M. On the controlled agreement problem. In Proceedings of the American Control Conference. Vol. 2006. 2006. p. 1376-1381. 1656409
Rahmani, Amirreza ; Mesbahi, Mehran. / On the controlled agreement problem. Proceedings of the American Control Conference. Vol. 2006 2006. pp. 1376-1381
@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 = "12",
day = "1",
language = "English",
isbn = "1424402107",
volume = "2006",
pages = "1376--1381",
booktitle = "Proceedings of the American Control Conference",

}

TY - GEN

T1 - On the controlled agreement problem

AU - Rahmani, Amirreza

AU - Mesbahi, Mehran

PY - 2006/12/1

Y1 - 2006/12/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

M3 - Conference contribution

SN - 1424402107

SN - 9781424402106

VL - 2006

SP - 1376

EP - 1381

BT - Proceedings of the American Control Conference

ER -