{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T00:47:41Z","timestamp":1770166061407,"version":"3.49.0"},"reference-count":25,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T00:00:00Z","timestamp":1594166400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2020,10,21]]},"abstract":"<jats:p>To overcome the disadvantages of low optimization accuracy and prematurity of the canonical PSO algorithm, we proposed an improved particle swarm optimization based on the interaction mechanism between leaders and individuals (PSO-IBLI), and used it to implement robot global path planning. In the PSO-IBLI algorithm, in different stages, each particle learns from the elites according to different regular. Moreover, the improved algorithm divides the execution state into two categories, where the parameters and the evaluation mechanisms are varied accordingly. In this way, the global best particles no longer walk randomly and have more learning objects. At the same time, other particles learn from not only the global best position, their historical best positions, but also the other elites. The learning strategy makes the search mode always in the adaptive adjustment, and it improves the speed of convergence and promotes this algorithm to find a more precise solution. The experimental results suggest that the precision and convergence speed of the PSO-IBLI algorithm is higher than the other three different algorithms. Additionally, some experiments are carried out to plan the robot\u2019s entire collision-free path using the PSO-IBLI algorithm and the other three algorithms. The results show that the PSO-IBLI algorithm can obtain the shortest collision-free way in four algorithms.<\/jats:p>","DOI":"10.3233\/jifs-179978","type":"journal-article","created":{"date-parts":[[2020,7,10]],"date-time":"2020-07-10T10:19:46Z","timestamp":1594376386000},"page":"4925-4933","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":11,"title":["Robot global path planning using PSO algorithm based on the interaction mechanism between leaders and individuals"],"prefix":"10.1177","volume":"39","author":[{"given":"Shasha","family":"Tian","sequence":"first","affiliation":[{"name":"School of Computer Science, Wuhan University, Wuhan, China"},{"name":"School of Computer Science, South-Central University for Nationalities, Wuhan, China"},{"name":"Hubei Provincial Engineering Research Center for Intelligent Management of Manufacturing Enterprises, South-Central University for Nationalities, Wuhan, China"}]},{"given":"Yuanxiang","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer Science, Wuhan University, Wuhan, China"}]},{"given":"Juan","family":"Li","sequence":"additional","affiliation":[{"name":"School of Information Engineering, Wuhan Technology and Business University, Wuhan, China"}]},{"given":"Guifeng","family":"Liu","sequence":"additional","affiliation":[{"name":"Southwest Institute of Technology and Physics, Cheng Du, China"}]}],"member":"179","published-online":{"date-parts":[[2020,7,8]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"crossref","unstructured":"GemeinderM. and GerkeM. An Active Search Algorithm Extending GA Based Path Planning for Mobile Robot Systems[J] Soft Computing and Industry 2002 589\u2013596.","DOI":"10.1007\/978-1-4471-0123-9_50"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2011.07.007"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.4028\/www.scientific.net\/AMM.527.203"},{"issue":"2","key":"e_1_3_1_5_2","first-page":"373","article-title":"Welding robot path planning based on Levy-PSO[J]","volume":"32","author":"Wang X.W.","year":"2017","unstructured":"WangX.W., YanY.X. and GuX.S., Welding robot path planning based on Levy-PSO[J], Kong zhi Yu Juece\/control & Decision 32(2) (2017), 373\u2013377.","journal-title":"Kong zhi Yu Juece\/control & Decision"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2015.2443789"},{"key":"e_1_3_1_7_2","doi-asserted-by":"crossref","unstructured":"Eberhart1R.C. and KennedyJ. A new optimizer using particle swarm theory Proceedings of the Sixth International Symposium on Micro Machine and Human Science[J] Nagoya: IEEE 1995 39\u201343.","DOI":"10.1109\/MHS.1995.494215"},{"issue":"2","key":"e_1_3_1_8_2","first-page":"334","article-title":"Aircraft Engine Gas Path Fault Diagnosis Based on Hybrid PSO-TWSVM[J]","volume":"35","author":"Du Y.","year":"2018","unstructured":"DuY., XiaoL. and ChenY., Aircraft Engine Gas Path Fault Diagnosis Based on Hybrid PSO-TWSVM[J], Transactions of Nanjing University of Aeronautics and Astronautics 35(2) (2018), 334\u2013342.","journal-title":"Transactions of Nanjing University of Aeronautics and Astronautics"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.54216\/JCIM.010101"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.54216\/JISIoT.010102"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/4235.985692"},{"issue":"2","key":"e_1_3_1_12_2","first-page":"90","article-title":"Three Possible Applications of Neutrosophic Logic in Fundamental and Applied Sciences","volume":"1","author":"Christianto V.","year":"2020","unstructured":"ChristiantoV., BoydR.N. and SmarandacheF., Three Possible Applications of Neutrosophic Logic in Fundamental and Applied Sciences, International Journal of Neutrosophic Science 1(2) (2020), 90\u201395.","journal-title":"International Journal of Neutrosophic Science"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.07.034"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-018-3624-9"},{"key":"e_1_3_1_15_2","doi-asserted-by":"crossref","unstructured":"LiangJ.J. and SuganthanP.N. Dynamic multi-swarm particle swarm optimizer with a novel constraint-handling mechanism[C]. In: Evol. Comput. 2006. CEC\/2006. IEEE Congr 2006 9\u201316.","DOI":"10.1109\/CEC.2006.1688284"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2015.2459690"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.06.042"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2009.2015956"},{"key":"e_1_3_1_19_2","unstructured":"ShiY and EberhartR.C. A modified particle swarm optimizer[C]. In Proc. IEEE World Congr. Comput. Intell. Anchorage AK USA 1998:68\u201373."},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2014.10.065"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-015-1716-3"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2018.12.009"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2018.2875430"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2015.05.002"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2475174"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.12.043"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-179978","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-179978","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-179978","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T11:58:30Z","timestamp":1770119910000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-179978"}},"subtitle":[],"editor":[{"given":"Andino","family":"Maseleno","sequence":"additional","affiliation":[]},{"given":"Xiaohui","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Valentina E.","family":"Balas","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2020,7,8]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,10,21]]}},"alternative-id":["10.3233\/JIFS-179978"],"URL":"https:\/\/doi.org\/10.3233\/jifs-179978","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,8]]}}}