{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:35:59Z","timestamp":1740148559369,"version":"3.37.3"},"reference-count":42,"publisher":"Wiley","license":[{"start":{"date-parts":[[2022,6,25]],"date-time":"2022-06-25T00:00:00Z","timestamp":1656115200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Special Fund for Bagui Scholars and 100 Scholar Plan of the Guangxi Zhuang Autonomous Region","award":["2018KYQD39"],"award-info":[{"award-number":["2018KYQD39"]}]},{"DOI":"10.13039\/501100016074","name":"Beibu Gulf University","doi-asserted-by":"publisher","award":["2018KYQD39"],"award-info":[{"award-number":["2018KYQD39"]}],"id":[{"id":"10.13039\/501100016074","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Sensors"],"published-print":{"date-parts":[[2022,6,25]]},"abstract":"<jats:p>This paper demonstrates an improved version of the Salp Swarm Algorithm (SSA) to solve the problems of slow convergence and local minima of the original version. In the population initialization of this scheme, ten chaotic searches with dynamic inertia coefficients are introduced to increase the diversity so that the probability of being trapped in local minima is reduced. Genetic algorithms are then applied to improve the global search ability and convergence speed. The experiments with 12 test functions show that the improved version achieves better accuracy and convergence speed over the original SSA. In the test with robot path planning problem, the proposed algorithm shows improved performance in the average number of iterations, path length, and average number of turns by 69.2%, 19.1%, and 43%, respectively, compared with the original SSA.<\/jats:p>","DOI":"10.1155\/2022\/2559955","type":"journal-article","created":{"date-parts":[[2022,6,25]],"date-time":"2022-06-25T23:05:22Z","timestamp":1656198322000},"page":"1-16","source":"Crossref","is-referenced-by-count":7,"title":["Robot Path Planning Based on an Improved Salp Swarm Algorithm"],"prefix":"10.1155","volume":"2022","author":[{"given":"Xianbao","family":"Cheng","sequence":"first","affiliation":[{"name":"School of Electronics and Information Engineering, Beibu Gulf University, No. 12, Binhai Avenue, Qinzhou, Guangxi, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5260-295X","authenticated-orcid":true,"given":"Liucun","family":"Zhu","sequence":"additional","affiliation":[{"name":"Advanced Science and Technology Research Institute, Beibu Gulf University, No. 12, Binhai Avenue, Qinzhou, Guangxi, China"}]},{"given":"Huihui","family":"Lu","sequence":"additional","affiliation":[{"name":"School of Electronics and Information Engineering, Beibu Gulf University, No. 12, Binhai Avenue, Qinzhou, Guangxi, China"}]},{"given":"Jinzhan","family":"Wei","sequence":"additional","affiliation":[{"name":"Advanced Science and Technology Research Institute, Beibu Gulf University, No. 12, Binhai Avenue, Qinzhou, Guangxi, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4951-6337","authenticated-orcid":true,"given":"Ning","family":"Wu","sequence":"additional","affiliation":[{"name":"Advanced Science and Technology Research Institute, Beibu Gulf University, No. 12, Binhai Avenue, Qinzhou, Guangxi, China"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"crossref","first-page":"1942","DOI":"10.1109\/ICNN.1995.488968","article-title":"Particle swarm optimization","volume":"4","author":"R. Eberhart","year":"1995","journal-title":"Proceedings of the IEEE International Conference on Neural Networks"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2013.12.007"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2009.03.090"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2017.07.002"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2019.01.011"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/s00366-020-01067-y"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-12127-3_11"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/3206185.3206198"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/3231053.3231070"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-74690-6_5"},{"issue":"12","key":"11","first-page":"13","article-title":"Feature selection using salp swarm algorithm for real biomedical datasets","volume":"17","author":"H. T. Ibrahim","year":"2017","journal-title":"International Journal of Computer Science and Network Security"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3007336"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.3390\/sym12101651"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.3390\/s20195493"},{"key":"15","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/978-1-4615-6325-9_11","article-title":"Optimal and efficient path planning for partially known environments","volume-title":"Intelligent Unmanned Ground Vehicles","author":"A. Stentz","year":"1997"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.01.067"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.3390\/s20071880"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.3390\/sym10100450"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1080\/00207721.2014.929191"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2000.870304"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1016\/j.egypro.2012.01.276"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/j.proeng.2014.12.098"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/ICEICE.2011.5777723"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1109\/ICInfA.2015.7279630"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2011.11.011"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1016\/j.proeng.2014.04.023"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.01.007"},{"key":"28","first-page":"98","article-title":"Rapidly-Exploring Random Trees: A New Tool for Path Planning","author":"S. M. LaValle","year":"1998","journal-title":"The Annual Research Report"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCR49711.2021.9349402"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2969316"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106960"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1080\/10106049.2019.1595176"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1109\/ICCECE51280.2021.9342329"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.3233\/JIFS-201544"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2014.07.002"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1987.1087791"},{"issue":"1","key":"37","first-page":"7","article-title":"Near optimal hierarchical path-finding","volume":"1","author":"A. Botea","year":"2004","journal-title":"Journal of Game Development"},{"key":"38","article-title":"The ant algorithm for solving robot path planning problem","volume":"2","author":"G. Liu","year":"2005","journal-title":"Proceedings of the Third International Conference on Information Technology and Applications. (ICITA'05)"},{"issue":"5","key":"39","first-page":"147","article-title":"Grey wolf algorithm based on improved tent chaos and simulated annealing","volume":"51","author":"M. Qinghua","year":"2021","journal-title":"Mathematics Practice and Cognition"},{"key":"40","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/860289"},{"key":"41","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2016.01.008"},{"key":"42","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-018-1158-6"}],"container-title":["Journal of Sensors"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/js\/2022\/2559955.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/js\/2022\/2559955.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/js\/2022\/2559955.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,25]],"date-time":"2022-06-25T23:05:34Z","timestamp":1656198334000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/js\/2022\/2559955\/"}},"subtitle":[],"editor":[{"given":"Haidong","family":"Shao","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2022,6,25]]},"references-count":42,"alternative-id":["2559955","2559955"],"URL":"https:\/\/doi.org\/10.1155\/2022\/2559955","relation":{},"ISSN":["1687-7268","1687-725X"],"issn-type":[{"type":"electronic","value":"1687-7268"},{"type":"print","value":"1687-725X"}],"subject":[],"published":{"date-parts":[[2022,6,25]]}}}