{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:39:17Z","timestamp":1742913557958,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811534140"},{"type":"electronic","value":"9789811534157"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-981-15-3415-7_5","type":"book-chapter","created":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T19:02:58Z","timestamp":1585767778000},"page":"58-67","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Controllability of Some Special Topologies with Time-Delays"],"prefix":"10.1007","author":[{"given":"Yaoyao","family":"Ping","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ningsheng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiahui","family":"Bai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xue","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,2]]},"reference":[{"key":"5_CR1","unstructured":"Tanner, H.G.: On the controllability of nearest neighbor interconnections. In: IEEE Conference on Decision Control, vol. 3, no. 3, pp. 2467\u20132472 (2004)"},{"issue":"3","key":"5_CR2","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1109\/18.568722","volume":"43","author":"L Tassiulas","year":"1997","unstructured":"Tassiulas, L.: Scheduling and performance limits of networks with constantly changing topology. IEEE Trans. Inf. Theory 43(3), 1067\u20131073 (1997)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"5_CR3","unstructured":"Gasteier, M., Munch, M., Glesner, M.: Generation of interconnect topologies for communication synthesis. In: Proceedings Design, Automation and Test in Europe (1998)"},{"issue":"3","key":"5_CR4","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1109\/4234.913157","volume":"5","author":"H Sayoud","year":"2001","unstructured":"Sayoud, H., Takahashi, K., Vaillant, B.: Designing communication network topologies using steady-state genetic algorithms. IEEE Commun. Lett. 5(3), 113\u2013115 (2001)","journal-title":"IEEE Commun. Lett."},{"key":"5_CR5","unstructured":"Mandal, S., Saha, D., Mukherjee, R., Roy, A.: An efficient algorithm for designing optimal backbone topology for a communication networks. In: International Conference on Communication Technology Proceedings (2003)"},{"key":"5_CR6","unstructured":"Ji, Z., Lin, H.: Topologies construction and leaders location in multi-agent controllability. In: Proceedings of the 31st Chinese Control Conference (2012)"},{"key":"5_CR7","unstructured":"Ji, Z., Lin, H.: Multi-agent controllability with tree topology. In: Proceedings of the 2010 American Control Conference (2010)"},{"issue":"2","key":"5_CR8","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1109\/TAC.2012.2208314","volume":"58","author":"M Cao","year":"2013","unstructured":"Cao, M., Zhang, S., Camlibel, M.K.: A class of uncontrollable diffusively coupled multiagent systems with multichain topologies. IEEE Trans. Autom. Control 58(2), 465\u2013469 (2013)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"4","key":"5_CR9","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1109\/TAC.2008.919548","volume":"53","author":"B Liu","year":"2008","unstructured":"Liu, B., Chu, T., Wang, L., Xie, G.: Controllability of a leader-follower dynanic network with switching topology. IEEE Trans. Autom. Control 53(4), 1009\u20131013 (2008)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"6","key":"5_CR10","doi-asserted-by":"publisher","first-page":"1471","DOI":"10.1109\/TCYB.2016.2549034","volume":"47","author":"Z Ji","year":"2017","unstructured":"Ji, Z., Yu, H.: A new perspective to graphical characterization of multi-agent controllability. IEEE Trans. Cybern. 47(6), 1471\u20131483 (2017)","journal-title":"IEEE Trans. Cybern."},{"issue":"3","key":"5_CR11","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1109\/TAC.2014.2335971","volume":"60","author":"Z Ji","year":"2015","unstructured":"Ji, Z., Lin, H., Yu, H.: Protocols design and uncontrollable topologies construction for multi-agent networks. IEEE Trans. Autom. Control. 60(3), 781\u2013786 (2015)","journal-title":"IEEE Trans. Autom. Control."},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1137\/060674909","volume":"48","author":"A Rahmani","year":"2009","unstructured":"Rahmani, A., Ji, M., Mesbahi, M., Egerstedt, M.: Controllability of multi-agent systems from a graph theoretic perspective. SIAM J. Control Optim. 48(1), 162\u2013186 (2009)","journal-title":"SIAM J. Control Optim."},{"issue":"4","key":"5_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11432-018-9450-8","volume":"62","author":"X Liu","year":"2019","unstructured":"Liu, X., Ji, Z., Hou, T.: Graph partitions and the controllability of directed signed networks. Sci. China Inf. Sci. 62(4), 1\u201311 (2019). \nhttps:\/\/doi.org\/10.1007\/s11432-018-9450-8","journal-title":"Sci. China Inf. Sci."},{"issue":"11","key":"5_CR14","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1109\/LCOMM.2009.091183","volume":"13","author":"H-S Koo","year":"2009","unstructured":"Koo, H.-S., Kwon, O.-H., Ra, S.-W.: A tree key graph design scheme for hierarchical multi-group access control. IEEE Commun. Lett. 13(11), 874\u2013876 (2009)","journal-title":"IEEE Commun. Lett."},{"issue":"4","key":"5_CR15","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1109\/TCNS.2014.2357532","volume":"1","author":"Y Alain","year":"2014","unstructured":"Alain, Y., Kibangou, C.C.: Observability in connected strongly regular graphs and distance regular graphs. IEEE Trans. Control Netw. Syst. 1(4), 360\u2013369 (2014)","journal-title":"IEEE Trans. Control Netw. Syst."},{"issue":"10","key":"5_CR16","doi-asserted-by":"publisher","first-page":"2877","DOI":"10.1109\/TAC.2015.2504265","volume":"61","author":"Z Lin","year":"2016","unstructured":"Lin, Z., Wang, L., Chen, Z.: Necessary and sufficient graphical conditions for affine formation control. IEEE Trans. Autom. Control 61(10), 2877\u20132891 (2016)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1","key":"5_CR17","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/s11768-010-9184-x","volume":"8","author":"F Jiang","year":"2010","unstructured":"Jiang, F., Wang, L., Xie, G.: Consensus of high-order dynamic multi-agent systems with switching topology and time-varying delays. J. Control Theory Appl. 8(1), 52\u201360 (2010)","journal-title":"J. Control Theory Appl."},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Ji, M., Egersted, M.: A graph-theoretic characterization of controllability for multi-agent systems. In: American Control Conference (2007)","DOI":"10.1109\/ACC.2007.4283010"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Yongcui, C., Zhijian, J., Yaowei, W.: Controllability of path graphs by using information of second-order neighbors. In: IEEE 2015 34th Chinese Control Conference, pp. 6619\u20136623 (2015)","DOI":"10.1109\/ChiCC.2015.7260682"},{"issue":"6","key":"5_CR20","doi-asserted-by":"publisher","first-page":"1611","DOI":"10.1109\/TAC.2014.2381435","volume":"60","author":"CO Aguilar","year":"2015","unstructured":"Aguilar, C.O., Gharesifard, B.: Graph controllability classes for the Laplacian leader-follower dynamics. Autom. Control. IEEE Trans. 60(6), 1611\u20131623 (2015)","journal-title":"Autom. Control. IEEE Trans."},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1016\/j.cam.2013.08.024","volume":"228","author":"B Liu","year":"2014","unstructured":"Liu, B., Su, H., Li, R.: Switching controllability of discrete-time multi-agent systems with multiple leaders and time-delays. Appl. Math. Comput. 228, 571\u2013588 (2014)","journal-title":"Appl. Math. Comput."}],"container-title":["Communications in Computer and Information Science","Bio-inspired Computing: Theories and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-3415-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T01:22:16Z","timestamp":1585790536000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-3415-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811534140","9789811534157"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-3415-7_5","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BIC-TA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Bio-Inspired Computing: Theories and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zhengzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bicta2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2019.bicta.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"197","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"121","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"61% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}