Time Complexity of Decentralized Fixed Mode Verification
An interconnected system consists of a number of interacting subsystems, which could be homogeneous or heterogeneous. It is evident that many real-world systems can be modeled as interconnected systems, some of which are communication networks, large space structures, power systems, and chemical processes [1, 2, 3, 4, 5]. The classical control techniques often fail to control such systems, in light of some well-known practical issues such as computation or communication constraints. This has given rise to the emergence of the decentralized control area that aims to design non-classical structurally constrained controllers . More precisely, a (conventional) decentralized controller comprises a set of non-interacting local controllers corresponding to different subsystems.
KeywordsTime Complexity Bipartite Graph Matrix Multiplication Deterministic Algorithm Interconnected System
Unable to display preview. Download preview PDF.
- 6.D. D. Siljak, Decentralized control of complex systems, Cambridge: Academic Press, 1991.Google Scholar
- 13.E. J. Davison, “Decentralized stabilization and regulation in large multivariable systems,” in Directions in Large Scale Systems, Y. C. Ho and S. K. Mitter, Eds. New York: Plenum, pp. 303–323, 1976.Google Scholar
- 15.T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, “Introduction to Algorithms,” The MIT Press, 2nd edition, 2001.Google Scholar
- 18.P. B¨urgisser, M. Clausen and M. A. Shokrollahi, “Algebraic complexity theory,” Springer, 1997.Google Scholar