Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/22116
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSong, B-
dc.contributor.authorWang, Z-
dc.contributor.authorZou, L-
dc.date.accessioned2021-01-18T15:47:07Z-
dc.date.available2021-01-18T15:47:07Z-
dc.date.issued2020-12-02-
dc.identifierORCiD: Zidong Wang https://orcid.org/0000-0002-9576-7401-
dc.identifierORCiD: Lei Zou https://orcid.org/0000-0002-0409-7941-
dc.identifierArticle number: 106960-
dc.identifier.citationSong, B., Wang, Z. and Zou, L. (2021) 'An improved PSO algorithm for smooth path planning of mobile robots using continuous high-degree Bezier curve', Applied Soft Computing, 100, 106960, pp. 1 - 11. doi: 10.1016/j.asoc.2020.106960.en_US
dc.identifier.issn1568-4946-
dc.identifier.urihttps://bura.brunel.ac.uk/handle/2438/22116-
dc.description.abstractIn this paper, a new strategy is developed to plan the smooth path for mobile robots through an improved PSO algorithm in combination with the continuous high-degree Bezier curve. Rather than connecting several low-degree Bezier curve segments, the use of continuous high-degree Bezier curves facilitates the fulfillment of the requirement of high-order continuity such as the continuous curvature derivative, which is critical for the motion control of the mobile robots. On the other hand, the smooth path planning of mobile robots is mathematically an optimization problem that can be dealt with by evolutionary computation algorithms. In this regard, an improved particle swarm optimization (PSO) algorithm is proposed to tackle the local trapping and premature convergence issues. In the improved PSO algorithm, an adaptive fractional-order velocity is introduced to enforce some disturbances on the particle swarm according to its evolutionary state, thereby enhancing its capability of jumping out of the local minima and exploring the searching space more thoroughly. The superiority of the improved PSO algorithm is verified by comparing with several standard and modified PSO algorithms on some benchmark functions, and the advantages of the new strategy is also confirmed by several comprehensive simulation experiments for the smooth path planning of mobile robots.en_US
dc.description.sponsorshipThis work was supported in part by the National Natural Science Foundation of China under Grants 61703242, 61703245, 61873148 and 61933007, the China Postdoctoral Science Foundation under Grant 2018T110702, the Postdoctoral Special Innovation Foundation of Shandong province of China Grant 201701015, and the Alexander von Humboldt Foundation of Germany .en_US
dc.format.extent1 - 11-
dc.format.mediumPrint-Electronic-
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.rightsCreative Commons Attribution-NonCommercial-NoDerivatives 4.0 International-
dc.rights.urihttps://creativecommons.org/licenses/by-nc-nd/4.0/-
dc.subjectmobile roboten_US
dc.subjectcontinuous Bezier curveen_US
dc.subjectsmooth path planningen_US
dc.subjectadaptive fractional-order velocityen_US
dc.subjectparticle swarm optimizationen_US
dc.titleAn improved PSO algorithm for smooth path planning of mobile robots using continuous high-degree Bezier curveen_US
dc.typeArticleen_US
dc.date.dateAccepted2020-11-25-
dc.identifier.doihttps://doi.org/10.1016/j.asoc.2020.106960-
dc.relation.isPartOfApplied Soft Computing-
pubs.publication-statusPublished-
pubs.volume100-
dc.identifier.eissn1872-9681-
dc.rights.licensehttps://creativecommons.org/licenses/by-nc-nd/4.0/legalcode.en-
dcterms.dateAccepted2020-11-25-
dc.rights.holderElsevier B.V.-
Appears in Collections:Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdfCopyright © 2020 Elsevier B.V. All rights reserved. This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/by-nc-nd/4.0/ (see: https://www.elsevier.com/about/policies/sharing).228.03 kBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons