TY - JOUR
T1 - Spreading the control complexity in decentralized control of interconnected systems
AU - Anderson, Brian D.O.
AU - Linnemann, Arno
PY - 1984/10
Y1 - 1984/10
N2 - The problem is considered for large scale interconnected systems of designing decentralized dynamic controllers so that the sum of the orders of the local controllers is approximately the system order, while the separate controller orders are more evenly spread than permitted by the procedure of Corfmat and Morse, which generally leads to all memoriless controllers, save one of high complexity. The paper shows that under certain circumstances, it is possible to design dynamic feedback controllers for each channel which introduce stable uncontrollable or unobservable modes to the overall system, thus lowering the effective order of that system. This result is then used to spread the controller complexity.
AB - The problem is considered for large scale interconnected systems of designing decentralized dynamic controllers so that the sum of the orders of the local controllers is approximately the system order, while the separate controller orders are more evenly spread than permitted by the procedure of Corfmat and Morse, which generally leads to all memoriless controllers, save one of high complexity. The paper shows that under certain circumstances, it is possible to design dynamic feedback controllers for each channel which introduce stable uncontrollable or unobservable modes to the overall system, thus lowering the effective order of that system. This result is then used to spread the controller complexity.
KW - Complexity
KW - Decentralized control
KW - Interconnected systems
KW - Linear systems
KW - Local feedback
UR - http://www.scopus.com/inward/record.url?scp=0021506163&partnerID=8YFLogxK
U2 - 10.1016/0167-6911(84)90002-1
DO - 10.1016/0167-6911(84)90002-1
M3 - Article
AN - SCOPUS:0021506163
SN - 0167-6911
VL - 5
SP - 1
EP - 8
JO - Systems and Control Letters
JF - Systems and Control Letters
IS - 1
ER -