Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/23920
Full metadata record
DC FieldValueLanguage
dc.contributor.authorWang, C-
dc.contributor.authorWang, Z-
dc.contributor.authorHan, F-
dc.contributor.authorDong, H-
dc.contributor.authorLiu, H-
dc.date.accessioned2022-01-09T23:33:20Z-
dc.date.available2022-01-09T23:33:20Z-
dc.date.issued2021-11-25-
dc.identifier.citationWang, C., Wang, Z., Han, F., Dong, H. and Liu, H. (2021) 'A novel PID-like particle swarm optimizer: on terminal convergence analysis. Complex & Intelligent Systems, 8 (in press), pp. 1217 - 1228 (12). doi: 10.1007/s40747-021-00589-2.en_US
dc.identifier.issn2199-4536-
dc.identifier.urihttps://bura.brunel.ac.uk/handle/2438/23920-
dc.description.abstractCopyright © 2021 The Author(s). In this paper, a novel proportion-integral-derivative-like particle swarm optimization (PIDLPSO) algorithm is presented with improved terminal convergence of the particle dynamics. A derivative control term is introduced into the traditional particle swarm optimization (PSO) algorithm so as to alleviate the overshoot problem during the stage of the terminal convergence. The velocity of the particle is updated according to the past momentum, the present positions (including the personal best position and the global best position), and the future trend of the positions, thereby accelerating the terminal convergence and adjusting the search direction to jump out of the area around the local optima. By using a combination of the Routh stability criterion and the final value theorem of the Z-transformation, the convergence conditions are obtained for the developed PIDLPSO algorithm. Finally, the experiment results reveal the superiority of the designed PIDLPSO algorithm over several other state-of-the-art PSO variants in terms of the population diversity, searching ability and convergence rate.en_US
dc.description.sponsorshipNational Natural Science Foundation of China under Grants 61873148, 61933007 and 620730070; AHPU Youth Top-notch Talent Support Program of China under Grant 2018BJRC009; Natural Science Foundation of Anhui Province of China under Grant 2108085MA07; Royal Society of the UK; Alexander von Humboldt Foundation of Germany.en_US
dc.format.extent1217 - 1228 (12)-
dc.format.mediumPrint-Electronic-
dc.languageEnglish-
dc.language.isoen_USen_US
dc.publisherSpringer Science and Business Media LLCen_US
dc.rightsCopyright © 2021 The Author(s). Open Access. This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit https://creativecommons.org/licenses/by/4.0/.-
dc.rights.urihttps://creativecommons.org/licenses/by/4.0-
dc.subjectparticle swarm optimizationen_US
dc.subjectterminal convergence analysisen_US
dc.subjectproportional-integral-derivative strategyen_US
dc.subjectZ-transformtionen_US
dc.subjectRouth stability criterionen_US
dc.titleA novel PID-like particle swarm optimizer: on terminal convergence analysisen_US
dc.typeArticleen_US
dc.identifier.doihttps://doi.org/10.1007/s40747-021-00589-2-
dc.relation.isPartOfComplex & Intelligent Systems-
pubs.publication-statusPublished-
pubs.volume0-
dc.identifier.eissn2198-6053-
dc.rights.holderThe Author(s)-
Appears in Collections:Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdf922.16 kBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons