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 [6]. More precisely, a (conventional) decentralized controller comprises a set of non-interacting local controllers corresponding to different subsystems.


Time Complexity Bipartite Graph Matrix Multiplication Deterministic Algorithm Interconnected System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    D. M. Stipanovic, G. Inalhan, R. Teo, and C. J. Tomlin, “Decentralized overlapping control of a formation of unmanned aerial vehicles,” Automatica, vol. 40, no. 8, pp. 1285–1296, 2004.MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    A. I. Zecevic, G. Neskovic, and D. D. Siljak, “Robust decentralized exciter control with linear feedback,” IEEE Transactions on Power Systems, vol. 19, no. 2, pp. 1096–1103, 2004.CrossRefGoogle Scholar
  3. 3.
    J. A. Fax and R. M. Murray, “Information flow and cooperative control of vehicle formations,” IEEE Transactions on Automatic Control, vol. 49, no. 9, pp. 1465–1476, 2004.MathSciNetCrossRefGoogle Scholar
  4. 4.
    J. Lavaei, A. Momeni, and A. G. Aghdam, “Spacecraft formation control in deep space with reduced communication requirement”, IEEE Transactions on Control System Technology, vol. 16, no. 2, pp. 268–278, 2008.CrossRefGoogle Scholar
  5. 5.
    K. L. Kosmatopoulos, E. B. Ioannou, and P. A. Ryaciotaki-Boussalis, “Large segmented telescopes: centralized decentralized and overlapping control designs,” IEEE Control Systems Magazine, vol. 20, no. 5, pp. 59–72, 2000.CrossRefGoogle Scholar
  6. 6.
    D. D. Siljak, Decentralized control of complex systems, Cambridge: Academic Press, 1991.Google Scholar
  7. 7.
    S. H. Wang and E. J. Davison, “On the stabilization of decentralized control systems,” IEEE Transactions on Automatic Control, vol. 18, no. 5, pp. 473–478, 1973.MathSciNetMATHCrossRefGoogle Scholar
  8. 8.
    B. L. O. Anderson and D. J. Clements, “Algebraic characterizations of fixed modes in decentralized systems,” Automatica, vol. 17, no. 5, pp. 703–712, 1981.MathSciNetCrossRefGoogle Scholar
  9. 9.
    B. L. O. Anderson, “Transfer function matrix description of decentralized fixed modes,” IEEE Transactions on Automatic Control, vol. 27, no. 6, pp. 1176–1182, 1982.MATHCrossRefGoogle Scholar
  10. 10.
    E. J. Davison and T. N. Chang, “Decentralized stabilization and pole assignment for general proper systems,” IEEE Transactions on Automatic Control, vol. 35, no. 6, pp. 652–664, 1990.MathSciNetMATHCrossRefGoogle Scholar
  11. 11.
    J. Lavaei and A. G. Aghdam, “A graph theoretic method to find decentralized fixed modes of LTI systems,” Automatica, vol. 43, no. 12, pp. 2129–2133, 2007.MathSciNetMATHCrossRefGoogle Scholar
  12. 12.
    E. J. Davison and S. H. Wang, “A characterization of decentralized fixed modes in terms of transmission zeros,” IEEE Transactions on Automatic Control, vol. 30, no. 1, pp. 81–82, 1985.MathSciNetMATHCrossRefGoogle Scholar
  13. 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
  14. 14.
    A. G. Aghdam and E. J. Davison, “Discrete-time control of continuous systems with approximate decentralized fixed modes,” Automatica, vol. 44, no. 1, pp. 75–87, 2008.MathSciNetMATHCrossRefGoogle Scholar
  15. 15.
    T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, “Introduction to Algorithms,” The MIT Press, 2nd edition, 2001.Google Scholar
  16. 16.
    R. Tarjan, “Depth-first search and linear graph algorithms,” SIAM Journal on Computing, vol. 1, no. 2, pp. 146–160, 1972.MathSciNetMATHCrossRefGoogle Scholar
  17. 17.
    J. Cheriyan and K. Mehlhorn, “Algorithms for dense graphs and networks on the random access computer,” Algorithmica, vol. 15, no. 6, pp. 521–549, 1996.MathSciNetMATHCrossRefGoogle Scholar
  18. 18.
    P. B¨urgisser, M. Clausen and M. A. Shokrollahi, “Algebraic complexity theory,” Springer, 1997.Google Scholar
  19. 19.
    D. Coppersmith and S.Winograd, “Matrix multiplication via arithmetic progressions,” Journal of Symbolic Computation, vol. 9, no. 3, pp. 251–280, 1990.MathSciNetMATHCrossRefGoogle Scholar
  20. 20.
    J. Lavaei and A. G. Aghdam, “Control of continuous-Time LTI systems by means of structurally constrained controllers,” Automatica, vol. 44, no. 1, pp. 141–148, 2008.MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer US 2011

Authors and Affiliations

  • Somayeh Sojoudi
    • 1
  • Javad Lavaei
    • 1
  • Amir G. Aghdam
    • 2
  1. 1.Control & Dynamical Systems Dept.California Institute of TechnologyPasadenaUSA
  2. 2.Dept. Electrical & Computer EngineeringConcordia UniversityMontreal QuébecCanada

Personalised recommendations