DocumentCode :
2114819
Title :
Efficient parallel algorithm for optimal block decomposition of transfer function matrices for decentralized control of large-scale systems
Author :
Balluchi, A. ; Balestrino, A. ; Bicchi, A.
Author_Institution :
Dipartimento di Sistemi Elettrici e Autom., Pisa Univ., Italy
fYear :
1993
fDate :
15-17 Dec 1993
Firstpage :
3750
Abstract :
The purpose of this paper is to present a parallel algorithm which can be used to determine how a large-scale system can be best decomposed in simpler subsystems to which decentralized control can be applied. The algorithm is based on an analysis in the frequency domain which employs the notion of block-diagonal dominance. The decentralization design problem is set as a combinatorial optimization problem and a “branch and bound” approach is applied to solve it. The proposed algorithm is conceived for parallel computational architectures. A discussion on the computational efficiency gained by parallelization is presented, and the implementation of the algorithm on a transputer network is briefly illustrated
Keywords :
decentralised control; frequency-domain analysis; large-scale systems; optimisation; parallel algorithms; MIMO systems; block-diagonal dominance; branch and bound; combinatorial optimization; decentralized control; frequency domain; large-scale systems; optimal block decomposition; parallel algorithm; transfer function matrices; transputer; Algorithm design and analysis; Concurrent computing; Distributed control; Frequency domain analysis; Large-scale systems; MIMO; Matrix decomposition; Parallel algorithms; Robustness; Transfer functions;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Decision and Control, 1993., Proceedings of the 32nd IEEE Conference on
Conference_Location :
San Antonio, TX
Print_ISBN :
0-7803-1298-8
Type :
conf
DOI :
10.1109/CDC.1993.325919
Filename :
325919
Link To Document :
بازگشت