Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/82223
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Computing-
dc.creatorWang, L-
dc.creatorWu, Q-
dc.creatorLin, F-
dc.creatorLi, S-
dc.creatorChen, DC-
dc.date.accessioned2020-05-05T05:59:10Z-
dc.date.available2020-05-05T05:59:10Z-
dc.identifier.urihttp://hdl.handle.net/10397/82223-
dc.language.isoenen_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US
dc.rightsThis work is licensed under a Creative Commons Attribution 4.0 License. For more information, see http://creativecommons.org/licenses/by/4.0/en_US
dc.rightsThe following publication L. Wang, Q. Wu, F. Lin, S. Li and D. Chen, "A New Trajectory-Planning Beetle Swarm Optimization Algorithm for Trajectory Planning of Robot Manipulators," in IEEE Access, vol. 7, pp. 154331-154345, 2019 is available at https://dx.doi.org/10.1109/ACCESS.2019.2949271en_US
dc.subjectBeetle swarm optimizationen_US
dc.subjectRobot manipulatorsen_US
dc.subjectTrajectory planningen_US
dc.subjectOptimization algorithmsen_US
dc.subjectControl systemsen_US
dc.titleA new trajectory-planning beetle swarm optimization algorithm for trajectory planning of robot manipulatorsen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage154331-
dc.identifier.epage154345-
dc.identifier.volume7-
dc.identifier.doi10.1109/ACCESS.2019.2949271-
dcterms.abstractBased on a heuristic optimization algorithm, this paper proposes a new algorithm named trajectory-planning beetle swarm optimization (TPBSO) algorithm for solving trajectory planning of robots, especially robot manipulators. Firstly, two specific manipulator trajectory planning problems are presented as the practical application of the algorithm, which are point-to-point planning and fixed-geometric-path planning. Then, in order to verify the effectiveness of the algorithm, this paper develops a control model and conducts numerical experiments on two planning tasks. Moreover, it compares with existing algorithms to show the superiority of our proposed algorithm. Finally, the results of numerical comparisons show that algorithm has a relatively faster computational speed and better control performance without increasing computational complexity.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationIEEE access, 24 Oct. 2019, v. 7, p. 154331-154345-
dcterms.isPartOfIEEE access-
dcterms.issued2019-
dc.identifier.isiWOS:000510406100004-
dc.identifier.scopus2-s2.0-85077820178-
dc.identifier.eissn2169-3536-
dc.description.validate202006 bcrc-
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumberOA_Scopus/WOSen_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
Wang_Trajectory-Planning_Beetle_Swarm.pdf1.62 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

23
Citations as of Jul 3, 2022

Downloads

40
Citations as of Jul 3, 2022

SCOPUSTM   
Citations

16
Citations as of Jul 7, 2022

WEB OF SCIENCETM
Citations

11
Citations as of Jul 7, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.