{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:49:58Z","timestamp":1787320198607,"version":"build-2736575974"},"reference-count":24,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Control Optim."],"published-print":{"date-parts":[[2009,1]]},"abstract":"<jats:p>This paper introduces a measure of communication complexity for a two-agent distributed control system where controls are subject to finite bandwidth communication constraints. The proposed complexity measure is an extension of the idea of communication complexity defined in distributed computing. Applying this classical concept to control problems with finite communication constraints leads to a new perspective and a host of new questions, some of which are investigated in this paper. In particular, one can connect the proposed complexity with the traditional communication complexity via upper bound and lower bound inequalities. Moreover, the proposed complexity is shown to be intricately related to the dynamical characteristics of the underlying system.<\/jats:p>","DOI":"10.1137\/060664720","type":"journal-article","created":{"date-parts":[[2009,5,20]],"date-time":"2009-05-20T18:27:35Z","timestamp":1242844055000},"page":"1722-1742","source":"Crossref","is-referenced-by-count":22,"title":["Control Communication Complexity of Distributed Control Systems"],"prefix":"10.1137","volume":"48","author":[{"given":"Wing Shing","family":"Wong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2009,5,20]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"J. Baillieul,\n                      Feedback designs in information-based control\n                      , Stochastic Theory and Control, Lecture Notes in Control and Inform. Sci. 280, Springer, Berlin, 2002, pp. 35\u201357.","DOI":"10.1007\/3-540-48022-6_3"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"A. Berman and R. J. Plemmons,\n                      Nonnegative Matrices in the Mathematical Sciences\n                      , Academic Press, New York, 1994.","DOI":"10.1137\/1.9781611971262"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1109\/9.867021"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"J. Conway and N. J. A. Sloane,\n                      Sphere Packings, Lattices and Groups\n                      , Springer, Berlin, 1999.","DOI":"10.1007\/978-1-4757-6568-7"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysconle.2004.05.003"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1109\/9.58500"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1109\/9.948466"},{"key":"R8","doi-asserted-by":"crossref","first-page":"53","DOI":"10.4310\/CIS.2004.v4.n1.a3","volume":"4","author":"Fagnani F.","year":"2004","journal-title":"Commun. Inf. Syst.","ISSN":"https:\/\/id.crossref.org\/issn\/1526-7555","issn-type":"print"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2003.816982"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2004.834111"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1980.11718"},{"key":"R12","unstructured":"N. Ishii and B. A. Francis,\n                      Limited Data Rate in Control Systems with Networks\n                      , Lecture Notes in Control and Inform. Sci. 275, Springer, Berlin, 2002."},{"key":"R13","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz and N. Nisan,\n                      Communication Complexity\n                      , Cambridge University Press, Cambridge, UK, 1997.","DOI":"10.1017\/CBO9780511574948"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.2307\/1911811"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2004.834106"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.2307\/1912686"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6911(00)00037-2"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1016\/S0005-1098(02)00285-6"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2004.831187"},{"key":"R20","doi-asserted-by":"crossref","unstructured":"S. Tatikonda, A. Sahai, and S. Mitter,\n                      Control of LQG systems under communication constraints\n                      , in Proceedings of the 37th IEEE Conference on Decision and Control, Vol. 1, Tampa, FL, 1998, pp. 1165\u20131170.","DOI":"10.1109\/CDC.1998.760856"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1109\/9.623096"},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.1109\/9.763226"},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2003.821418"},{"key":"R24","doi-asserted-by":"crossref","unstructured":"A. C.C. Yao,\n                      Some complexity questions related to distributive computing\n                      , in Proceedings of the 11th Annual ACM Symposium on Theory of Computing (STOC), 1979, pp. 209\u2013213.","DOI":"10.1145\/800135.804414"}],"container-title":["SIAM Journal on Control and Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/060664720","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T12:55:36Z","timestamp":1787316936000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/060664720"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["10.1137\/060664720"],"URL":"https:\/\/doi.org\/10.1137\/060664720","relation":{},"ISSN":["0363-0129","1095-7138"],"issn-type":[{"value":"0363-0129","type":"print"},{"value":"1095-7138","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1]]}}}