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 |
|---|---|
| Title of host publication | Proceedings of the American Control Conference |
| Pages | 1376-1381 |
| Number of pages | 6 |
| Volume | 2006 |
| State | Published - Dec 1 2006 |
| Event | 2006 American Control Conference - Minneapolis, MN, United States Duration: Jun 14 2006 → Jun 16 2006 |
Other
| Other | 2006 American Control Conference |
|---|---|
| Country | United States |
| City | Minneapolis, MN |
| Period | 6/14/06 → 6/16/06 |
Fingerprint
Keywords
- Agreement dynamics
- Algebraic graph theory
- Controllability
- Graph symmetry
ASJC Scopus subject areas
- Control and Systems Engineering
Cite this
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 proceeding › Conference contribution
}
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
AN - SCOPUS:34047240864
SN - 1424402107
SN - 9781424402106
VL - 2006
SP - 1376
EP - 1381
BT - Proceedings of the American Control Conference
ER -