{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,3]],"date-time":"2026-10-03T17:18:50Z","timestamp":1791047930238,"version":"4.1.0"},"reference-count":45,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["2017XKZD11"],"award-info":[{"award-number":["2017XKZD11"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2017M621860"],"award-info":[{"award-number":["2017M621860"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61403393"],"award-info":[{"award-number":["61403393"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11711530203"],"award-info":[{"award-number":["11711530203"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000288","name":"Royal Society","doi-asserted-by":"publisher","award":["IE161252"],"award-info":[{"award-number":["IE161252"]}],"id":[{"id":"10.13039\/501100000288","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Appl. Math."],"published-print":{"date-parts":[[2019,1]]},"abstract":"<jats:p>In this paper we investigate the finite-time and fixed-time consensus problems of multiagent networks with pinning control and noise perturbation. In order to reach the finite-time and fixed-time consensus, several pinning protocols are proposed. Compared with the consensus protocols without pinning control, the proposed finite-time and fixed-time protocols need to control only a small fraction of agents, which is practical and has advantages from the physical viewpoint of energy consumption. More specifically, the deterministic and stochastic protocols include the graph $(p+1)$-Laplacian, a nonlinear generalization of the standard graph Laplacian. We show that, unlike the protocols with the standard (linear) graph Laplacian, those with the graph $(p+1)$-Laplacian solve the finite-time as well as the fixed-time consensus problems. By using the finite-time and fixed-time stability theory and the algebra graph theory, sufficient conditions are established to ensure the finite-time and fixed-time consensus. Finally, numerical simulations are presented to illustrate the correctness of the theoretical results.<\/jats:p>","DOI":"10.1137\/18m1174143","type":"journal-article","created":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T14:32:33Z","timestamp":1548858753000},"page":"111-130","source":"Crossref","is-referenced-by-count":45,"title":["Finite-Time and Fixed-Time Consensus of Multiagent Networks with Pinning Control and Noise Perturbation"],"prefix":"10.1137","volume":"79","author":[{"given":"Yongzheng","family":"Sun","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wang","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hongjun","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Donghua","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sandro","family":"Azaele","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2019,1,30]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1064106"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1016\/S0362-546X(97)00530-0"},{"key":"atypb3","first-page":"283","volume":"67","author":"Amghibech S.","year":"2003","journal-title":"Ars Combin."},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012997321358"},{"key":"atypb6","doi-asserted-by":"crossref","unstructured":"T. B\u00fchler and M. Hein,\n                      Spectral clustering based on the graph p-Laplacian\n                      , in Proceedings of the 26th Annual International Conference on Machine Learning, 2009, pp. 81-88.","DOI":"10.1145\/1553374.1553385"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-016-0555-2"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1137\/090757290"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2007.895383"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2006.06.015"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1038\/nature03236"},{"key":"atypb12","first-page":"1455","volume":"15","author":"Dunworth J.B.","year":"2016","journal-title":"SIAM J. Math. Anal."},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1137\/15M1030467"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2389531"},{"key":"atypb15","first-page":"26","author":"Hardy G.","year":"1952","journal-title":"UK"},{"key":"atypb16","first-page":"1325","volume":"8","author":"Hein M.","year":"2007","journal-title":"J. Mach. Learn. Res."},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2016.2623634"},{"key":"atypb18","doi-asserted-by":"crossref","unstructured":"R. Horn and C. Johnson,\n                      Matrix Analysis,\n                      Cambridge University Press, New York, 1985.","DOI":"10.1017\/CBO9780511810817"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1016\/j.physd.2009.04.011"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1007\/s11071-016-3157-7"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2304368"},{"key":"atypb22","doi-asserted-by":"crossref","unstructured":"W. Liu, X. Ma, Y. Zhou, D. Tao, and J. Cheng,\n                      p-Laplacian regularization for scene recognition\n                      . IEEE Trans. Cybern. (2018),https:\/\/doi.org\/10.1109\/TCYB.2018.2833843.","DOI":"10.1109\/TCYB.2018.2833843"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1016\/j.nonrwa.2010.12.013"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.80.066121"},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2016.04.011"},{"key":"atypb26","first-page":"1","volume":"99","author":"Liu X.","year":"2016","journal-title":"IEEE Trans. Cybernet."},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2015.11.004"},{"key":"atypb28","doi-asserted-by":"crossref","unstructured":"R. Olfati-Saber,\n                      Ultrafast consensus in small-world networks\n                      , in Proceedings of the 2005 American Control Conference, 2005, pp. 2371-2378.","DOI":"10.1109\/ACC.2005.1470321"},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2005.864190"},{"key":"atypb30","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2004.834113"},{"key":"atypb31","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2179869"},{"key":"atypb32","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfranklin.2016.12.018"},{"key":"atypb33","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.119.198301"},{"key":"atypb34","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.90.062708"},{"key":"atypb35","doi-asserted-by":"publisher","DOI":"10.1063\/1.4958927"},{"key":"atypb36","doi-asserted-by":"publisher","DOI":"10.1063\/1.4929496"},{"key":"atypb37","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2015.08.005"},{"key":"atypb38","doi-asserted-by":"publisher","DOI":"10.1063\/1.4721997"},{"key":"atypb39","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.75.1226"},{"key":"atypb40","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2012.03.004"},{"key":"atypb41","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2010.2041610"},{"key":"atypb42","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysconle.2016.11.012"},{"key":"atypb43","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2011.08.050"},{"key":"atypb44","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2008.07.016"},{"key":"atypb45","doi-asserted-by":"crossref","unstructured":"J. Yu, S. Yu, J. Li, and Y. Yan,\n                      Fixed time stability theorem of stochastic nonlinear systems\n                      , Internat. J. Control (2018),https:\/\/doi.org\/10.1080\/00207179.2018.1430900.","DOI":"10.1080\/00207179.2018.1430900"}],"container-title":["SIAM Journal on Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/18M1174143","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:29:43Z","timestamp":1787336983000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/18M1174143"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["10.1137\/18M1174143"],"URL":"https:\/\/doi.org\/10.1137\/18m1174143","relation":{},"ISSN":["0036-1399","1095-712X"],"issn-type":[{"value":"0036-1399","type":"print"},{"value":"1095-712X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1]]}}}