{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T03:48:52Z","timestamp":1775274532664,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030042387","type":"print"},{"value":"9783030042394","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-04239-4_26","type":"book-chapter","created":{"date-parts":[[2018,11,17]],"date-time":"2018-11-17T01:55:08Z","timestamp":1542419708000},"page":"291-302","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Resilient Consensus for Multi-agent Networks with Mobile Detectors"],"prefix":"10.1007","author":[{"given":"Haofeng","family":"Yan","sequence":"first","affiliation":[]},{"given":"Yiming","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Ming","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Ting","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Jian","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Tong","family":"Qiao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,18]]},"reference":[{"issue":"11","key":"26_CR1","doi-asserted-by":"publisher","first-page":"3586","DOI":"10.1109\/TAC.2016.2522647","volume":"61","author":"L Cheng","year":"2016","unstructured":"Cheng, L., Wang, Y., Ren, W., Hou, Z.G., Tan, M.: On convergence rate of leader-following consensus of linear multi-agent systems with communication noises. IEEE Trans. Autom. Control. 61(11), 3586\u20133592 (2016)","journal-title":"IEEE Trans. Autom. Control."},{"issue":"12","key":"26_CR2","doi-asserted-by":"publisher","first-page":"3004","DOI":"10.1109\/TCYB.2015.2494738","volume":"46","author":"L Cheng","year":"2016","unstructured":"Cheng, L., Wang, Y., Ren, W., Hou, Z.G., Tan, M.: Containment control of multiagent systems with dynamic leaders based on a $$PI^{n}$$-type approach. IEEE Trans. Cybern. 46(12), 3004\u20133017 (2016)","journal-title":"IEEE Trans. Cybern."},{"issue":"4","key":"26_CR3","doi-asserted-by":"publisher","first-page":"1359","DOI":"10.1109\/TNNLS.2017.2651402","volume":"29","author":"Y Zheng","year":"2018","unstructured":"Zheng, Y., Ma, J., Wang, L.: Consensus of hybrid multi-agent systems. IEEE Trans. Neural Netw. Learn. Syst. 29(4), 1359\u20131365 (2018)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"26_CR4","doi-asserted-by":"publisher","unstructured":"Zhu, Y., Li, S., Ma, J., Zheng, Y.: Bipartite consensus in networks of agents with antagonistic interactions and quantization. IEEE Trans. Circ. Syst. II Express Briefs (2018). https:\/\/doi.org\/10.1109\/TCSII.2018.2811803","DOI":"10.1109\/TCSII.2018.2811803"},{"issue":"3","key":"26_CR5","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/5925.5931","volume":"33","author":"D Dolev","year":"1986","unstructured":"Dolev, D., Lynch, N.A., Pinter, S.S., Stark, E.W., Weihl, W.E.: Reaching approximate agreement in the presence of faults. J. ACM (JACM) 33(3), 499\u2013516 (1986)","journal-title":"J. ACM (JACM)"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"LeBlanc, H.J., Koutsoukos, X.D.: Consensus in networked multi-agent systems with adversaries. In: 14th International Conference on Hybrid Systems: Computation and Control, pp. 281\u2013290. ACM (2011)","DOI":"10.1145\/1967701.1967742"},{"issue":"1","key":"26_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/71.262588","volume":"5","author":"RM Kieckhafer","year":"1994","unstructured":"Kieckhafer, R.M., Azadmanesh, M.H.: Reaching approximate agreement with mixed-mode faults. IEEE Trans. Parallel Distrib. Syst. 5(1), 53\u201363 (1994)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"4","key":"26_CR8","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1109\/JSAC.2013.130413","volume":"31","author":"HJ LeBlanc","year":"2013","unstructured":"LeBlanc, H.J., Zhang, H., Koutsoukos, X., Sundaram, S.: Resilient asymptotic consensus in robust networks. IEEE J. Sel. Areas Commun. 31(4), 766\u2013781 (2013)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"3\u20134","key":"26_CR9","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1080\/03081079.2014.892252","volume":"43","author":"Y Wu","year":"2014","unstructured":"Wu, Y., He, X., Liu, S., Xie, L.: Consensus of discrete-time multi-agent systems with adversaries and time delays. Int. J. Gen. Syst. 43(3\u20134), 402\u2013411 (2014)","journal-title":"Int. J. Gen. Syst."},{"issue":"22","key":"26_CR10","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.ifacol.2015.10.302","volume":"48","author":"SM Dibaji","year":"2015","unstructured":"Dibaji, S.M., Ishii, H.: Resilient multi-agent consensus with asynchrony and delayed information. IFAC-Pap. OnLine 48(22), 28\u201333 (2015)","journal-title":"IFAC-Pap. OnLine"},{"issue":"1","key":"26_CR11","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1109\/JAS.2016.7510010","volume":"4","author":"Y Wu","year":"2017","unstructured":"Wu, Y., He, X.: Secure consensus control for multi-agent systems with attacks and communication delays. IEEE\/CAA J. Autom. Sin. 4(1), 136\u2013142 (2017)","journal-title":"IEEE\/CAA J. Autom. Sin."},{"issue":"1","key":"26_CR12","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1109\/TSIPN.2017.2742859","volume":"4","author":"C Zhao","year":"2018","unstructured":"Zhao, C., He, J., Chen, J.: Resilient consensus with mobile detectors against malicious attacks. IEEE Trans. Signal Inf. Process. Netw. 4(1), 60\u201369 (2018)","journal-title":"IEEE Trans. Signal Inf. Process. Netw."},{"issue":"2","key":"26_CR13","doi-asserted-by":"publisher","first-page":"252","DOI":"10.3390\/s16020252","volume":"16","author":"S Mi","year":"2016","unstructured":"Mi, S., Han, H., Chen, C., Yan, J., Guan, X.: A secure scheme for distributed consensus estimation against data falsification in heterogeneous wireless sensor networks. Sensors 16(2), 252 (2016)","journal-title":"Sensors"},{"issue":"1","key":"26_CR14","first-page":"53","volume":"3","author":"R Kieckhafer","year":"1993","unstructured":"Kieckhafer, R., Azadmanesh, M.: Low cost approximate agreement in partially connected networks. J. Comput. Inf. 3(1), 53\u201385 (1993)","journal-title":"J. Comput. Inf."},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Vaidya, N.H., Tseng, L., Liang, G.: Iterative approximate byzantine consensus in arbitrary directed graphs. In: 2012 ACM Symposium on Principles of Distributed Computing, pp. 365\u2013374. ACM (2012)","DOI":"10.1145\/2332432.2332505"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Zhang, H., Sundaram, S.: Robustness of information diffusion algorithms to locally bounded adversaries. In: 2012 American Control Conference (ACC 2012), pp. 5855\u20135861. IEEE (2012)","DOI":"10.1109\/ACC.2012.6315661"},{"issue":"3","key":"26_CR17","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1109\/TCNS.2015.2413551","volume":"2","author":"H Zhang","year":"2015","unstructured":"Zhang, H., Fata, E., Sundaram, S.: A notion of robustness in complex networks. IEEE Trans. Control. Netw. Syst. 2(3), 310\u2013320 (2015)","journal-title":"IEEE Trans. Control. Netw. Syst."},{"issue":"9","key":"26_CR18","doi-asserted-by":"publisher","first-page":"2658","DOI":"10.1073\/pnas.0400054101","volume":"101","author":"F Radicchi","year":"2004","unstructured":"Radicchi, F., Castellano, C., Cecconi, F., Loreto, V., Parisi, D.: Defining and identifying communities in networks. Proc. Natl. Acad. Sci. U. S. A. 101(9), 2658\u20132663 (2004)","journal-title":"Proc. Natl. Acad. Sci. U. S. A."},{"issue":"6","key":"26_CR19","doi-asserted-by":"publisher","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset, A., Newman, M.E., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70(6), 066111 (2004)","journal-title":"Phys. Rev. E"},{"issue":"2","key":"26_CR20","doi-asserted-by":"publisher","first-page":"191","DOI":"10.7155\/jgaa.00124","volume":"10","author":"P Pons","year":"2006","unstructured":"Pons, P., Latapy, M.: Computing communities in large networks using random walks. J. Graph Algorithms Appl. 10(2), 191\u2013218 (2006)","journal-title":"J. Graph Algorithms Appl."},{"issue":"10","key":"26_CR21","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theory Exp. 2008(10), P10008 (2008)","journal-title":"J. Stat. Mech. Theory Exp."},{"issue":"6","key":"26_CR22","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1088\/1367-2630\/9\/6\/176","volume":"9","author":"A Arenas","year":"2007","unstructured":"Arenas, A., Duch, J., Fern\u00e1ndez, A., G\u00f3mez, S.: Size reduction of complex networks preserving modularity. New J. Phys. 9(6), 176 (2007)","journal-title":"New J. Phys."},{"issue":"12","key":"26_CR23","doi-asserted-by":"publisher","first-page":"1649","DOI":"10.1109\/TMC.2009.83","volume":"8","author":"C.Y.T. Ma","year":"2009","unstructured":"Ma, C.Y., Yau, D.K., Chin, J.c., Rao, N.S., Shankar, M.: Matching and fairness in threat-based mobile sensor coverage. IEEE Trans. Mob. Comput. 8(12), 1649\u20131662 (2009)","journal-title":"IEEE Transactions on Mobile Computing"},{"issue":"6","key":"26_CR24","doi-asserted-by":"publisher","first-page":"1993","DOI":"10.1109\/TCST.2016.2521802","volume":"24","author":"X Duan","year":"2016","unstructured":"Duan, X., He, J., Cheng, P., Chen, J.: Exploiting a mobile node for fast discrete time average consensus. IEEE Trans. Control. Syst. Technol. 24(6), 1993\u20132001 (2016)","journal-title":"IEEE Trans. Control. Syst. Technol."}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04239-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T02:55:41Z","timestamp":1775271341000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04239-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030042387","9783030042394"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04239-4_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"18 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICONIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Siem Reap","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cambodia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iconip2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conference.cs.cityu.edu.hk\/iconip\/","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":"575","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":"401","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":"70% - 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":"4","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":"6","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)"}}]}}