{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T13:49:44Z","timestamp":1780580984815,"version":"3.54.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100005270","name":"Fujian Provincial Department of Science and Technology","doi-asserted-by":"publisher","award":["2021J011070"],"award-info":[{"award-number":["2021J011070"]}],"id":[{"id":"10.13039\/501100005270","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005270","name":"Fujian Provincial Department of Science and Technology","doi-asserted-by":"publisher","award":["2021J011070"],"award-info":[{"award-number":["2021J011070"]}],"id":[{"id":"10.13039\/501100005270","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discov Computing"],"abstract":"<jats:sec>\n            <jats:title>Abstract<\/jats:title>\n            <jats:p>The obstacle avoidance path planning for robots has become a critical research focus, especially in the context of addressing complex tasks in dynamic, unstructured environments where unpredictable obstacles and varying conditions present significant challenges. This paper introduces the parallel cooperative strategy reptile search algorithm (PC-RSA) for multi-robot path planning in such dynamic settings. Path planning is crucial for mobile robots, especially in multi-robot systems, requiring solutions that adapt quickly to changes while ensuring efficiency and robustness. Traditional algorithms often struggle with dynamic obstacles and maintaining diversity during search processes. To address these issues, PC-RSA incorporates a parallel cooperative strategy, improving information utilization and balancing exploration with exploitation. The algorithm\u2019s performance was tested using 10-dimensional and 20-dimensional benchmark functions from the CEC2022 test suite and compared with other state-of-the-art algorithms, such as GA, PSO, and RSA. PC-RSA outperformed these methods, ranking first in the Friedman ranking. It was then applied to multi-robot path planning in environments with both static and dynamic obstacles. Simulation results showed notable improvements over the standard RSA, with enhancements of 90.96%, 52.53%, 55.73%, and 62.71% in average path deviation error, average untraveled goal distance, total fitness value, and average execution time, respectively. These findings suggest that PC-RSA could be a promising approach for multi-robot path planning in dynamic environments.<\/jats:p>\n          <\/jats:sec>\n          <jats:sec>\n            <jats:title>Graphical abstract<\/jats:title>\n          <\/jats:sec>","DOI":"10.1007\/s10791-025-09664-5","type":"journal-article","created":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T09:16:16Z","timestamp":1751361376000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Multi-robot path planning in online dynamic obstacle environments based on parallel cooperative strategy optimization algorithm"],"prefix":"10.1007","volume":"28","author":[{"given":"Chia-Hung","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kun","family":"Hu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaojing","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,7,1]]},"reference":[{"key":"9664_CR1","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1016\/j.jmsy.2021.06.008","volume":"60","author":"FJ Perez-Grau","year":"2021","unstructured":"Perez-Grau FJ, Martinez-de Dios JR, Paneque JL, Acevedo JJ, Torres-Gonz\u00e1lez A, Viguria A, Astorga JR, Ollero A. Introducing autonomous aerial robots in industrial manufacturing. J Manuf Syst. 2021;60:312\u201324.","journal-title":"J Manuf Syst"},{"key":"9664_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compag.2023.107701","volume":"206","author":"Q Yang","year":"2023","unstructured":"Yang Q, Du X, Wang Z, Meng Z, Ma Z, Zhang Q. A review of core agricultural robot technologies for crop productions. Comput Electron Agric. 2023;206: 107701.","journal-title":"Comput Electron Agric"},{"key":"9664_CR3","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/j.apm.2024.03.010","volume":"130","author":"C Zhang","year":"2024","unstructured":"Zhang C, Han Y, Liu W, Peng J. Kinematic modeling and simultaneous calibration for acupuncture robot. Appl Math Model. 2024;130:438\u201356.","journal-title":"Appl Math Model"},{"issue":"4","key":"9664_CR4","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s42341-022-00401-z","volume":"23","author":"D-S Kim","year":"2022","unstructured":"Kim D-S, Lee M-S, Cheon M-W. Development and driving characteristics analysis of the drive system for the pesticide control robot. Trans Electr Electron Mater. 2022;23(4):355\u201361.","journal-title":"Trans Electr Electron Mater"},{"key":"9664_CR5","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.apm.2022.08.009","volume":"112","author":"H Peng","year":"2022","unstructured":"Peng H, Bao J, Huang G, Li Z, Wang X. Chance-constrained sneaking trajectory planning for reconnaissance robots. Appl Math Model. 2022;112:224\u201337.","journal-title":"Appl Math Model"},{"issue":"4","key":"9664_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ifacol.2021.10.001","volume":"54","author":"D Paez","year":"2021","unstructured":"Paez D, Romero JP, Noriega B, Cardona GA, Calderon JM. Distributed particle swarm optimization for multi-robot system in search and rescue operations. IFAC-Papers OnLine. 2021;54(4):1\u20136.","journal-title":"IFAC-Papers OnLine"},{"key":"9664_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.114660","volume":"173","author":"\u00c1 Madridano","year":"2021","unstructured":"Madridano \u00c1, Al-Kaff A, Mart\u00edn D, De La Escalera A. Trajectory planning for multi-robot systems: methods and applications. Expert Syst Appl. 2021;173: 114660.","journal-title":"Expert Syst Appl"},{"issue":"2","key":"9664_CR8","doi-asserted-by":"crossref","first-page":"172988142091846","DOI":"10.1177\/1729881420918461","volume":"17","author":"J Song","year":"2020","unstructured":"Song J, Hao C, Su J. Path planning for unmanned surface vehicle based on predictive artificial potential field. Int J Adv Rob Syst. 2020;17(2):1729881420918461.","journal-title":"Int J Adv Rob Syst"},{"issue":"1\u20132","key":"9664_CR9","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.artint.2003.12.001","volume":"155","author":"S Koenig","year":"2004","unstructured":"Koenig S, Likhachev M, Furcy D. Lifelong planning a? Artif Intell. 2004;155(1\u20132):93\u2013146.","journal-title":"Artif Intell"},{"key":"9664_CR10","doi-asserted-by":"publisher","first-page":"1551","DOI":"10.1007\/s12541-013-0209-5","volume":"14","author":"B Dugarjav","year":"2013","unstructured":"Dugarjav B, Lee S-G, Kim D, Kim JH, Chong NY. Scan matching online cell decomposition for coverage path planning in an unknown environment. Int J Precis Eng Manuf. 2013;14:1551\u20138.","journal-title":"Int J Precis Eng Manuf"},{"issue":"7","key":"9664_CR11","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1177\/0278364911406761","volume":"30","author":"S Karaman","year":"2011","unstructured":"Karaman S, Frazzoli E. Sampling-based algorithms for optimal motion planning. Int J Robot Res. 2011;30(7):846\u201394.","journal-title":"Int J Robot Res"},{"issue":"1","key":"9664_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4070\/kcj.2019.0269","volume":"50","author":"JW Song","year":"2020","unstructured":"Song JW, Soh S, Shim J-K. Monitored anesthesia care for cardiovascular interventions. Korean Circul J. 2020;50(1):1.","journal-title":"Korean Circul J"},{"issue":"2","key":"9664_CR13","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart PE, Nilsson NJ, Raphael B. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybernet. 1968;4(2):100\u20137.","journal-title":"IEEE Trans Syst Sci Cybernet"},{"key":"9664_CR14","unstructured":"Lin Y, Chen Y, He B, Huang Y, Wang Y. Non-collision checking rrt* algorithm for mobile robot motion planning. Chin J Sci Instrument. 2020;41(10):257\u2013267."},{"key":"9664_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.116158","volume":"191","author":"L Abualigah","year":"2022","unstructured":"Abualigah L, Abd Elaziz M, Sumari P, Geem ZW, Gandomi AH. Reptile search algorithm (rsa): a nature-inspired meta-heuristic optimizer. Expert Syst Appl. 2022;191: 116158.","journal-title":"Expert Syst Appl"},{"issue":"8","key":"9664_CR16","doi-asserted-by":"publisher","first-page":"1800","DOI":"10.3390\/math11081800","volume":"11","author":"C-H Wang","year":"2023","unstructured":"Wang C-H, Chen S, Zhao Q, Suo Y. An efficient end-to-end obstacle avoidance path planning algorithm for intelligent vehicles based on improved whale optimization algorithm. Mathematics. 2023;11(8):1800.","journal-title":"Mathematics"},{"key":"9664_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2024.111459","volume":"288","author":"J Cui","year":"2024","unstructured":"Cui J, Wu L, Huang X, Xu D, Liu C, Xiao W. Multi-strategy adaptable ant colony optimization algorithm and its application in robot path planning. Knowl-Based Syst. 2024;288: 111459.","journal-title":"Knowl-Based Syst"},{"key":"9664_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.123762","volume":"249","author":"MN Ab Wahab","year":"2024","unstructured":"Ab Wahab MN, Nazir A, Khalil A, Ho WJ, Akbar MF, Noor MHM, Mohamed ASA. Improved genetic algorithm for mobile robot path planning in static environments. Expert Syst Appl. 2024;249: 123762.","journal-title":"Expert Syst Appl."},{"key":"9664_CR19","doi-asserted-by":"crossref","unstructured":"Biedrzycki R, Arabas J, Warchulski E. A version of nl-shade-rsp algorithm with midpoint for cec 2022 single objective bound constrained problems. In: 2022 IEEE Congress on Evolutionary Computation (CEC), 2022; 1\u20138. IEEE.","DOI":"10.1109\/CEC55065.2022.9870220"},{"issue":"8","key":"9664_CR20","doi-asserted-by":"publisher","first-page":"1324","DOI":"10.1007\/s42452-020-3093-5","volume":"2","author":"N Toufan","year":"2020","unstructured":"Toufan N, Niknafs A. Robot path planning based on laser range finder and novel objective functions in grey wolf optimizer. SN Appl Sci. 2020;2(8):1324.","journal-title":"SN Appl Sci"},{"issue":"1","key":"9664_CR21","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1038\/scientificamerican0792-66","volume":"267","author":"JH Holland","year":"1992","unstructured":"Holland JH. Genetic algorithms. Sci Am. 1992;267(1):66\u201373.","journal-title":"Sci Am"},{"key":"9664_CR22","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R. Particle swarm optimization. In: Proceedings of ICNN\u201995-international Conference on Neural Networks, 1995;4:1942\u20131948. IEEE.","DOI":"10.1109\/ICNN.1995.488968"},{"key":"9664_CR23","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.advengsoft.2016.01.008","volume":"95","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S, Lewis A. The whale optimization algorithm. Adv Eng Softw. 2016;95:51\u201367.","journal-title":"Adv Eng Softw"},{"issue":"1","key":"9664_CR24","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1080\/21642583.2019.1708830","volume":"8","author":"J Xue","year":"2020","unstructured":"Xue J, Shen B. A novel swarm intelligence optimization approach: sparrow search algorithm. Syst Sci Control Eng. 2020;8(1):22\u201334.","journal-title":"Syst Sci Control Eng"},{"issue":"7","key":"9664_CR25","doi-asserted-by":"publisher","first-page":"7305","DOI":"10.1007\/s11227-022-04959-6","volume":"79","author":"J Xue","year":"2023","unstructured":"Xue J, Shen B. Dung beetle optimizer: a new meta-heuristic algorithm for global optimization. J Supercomput. 2023;79(7):7305\u201336.","journal-title":"J Supercomput"},{"issue":"4","key":"9664_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10462-023-10620-2","volume":"57","author":"J Wang","year":"2024","unstructured":"Wang J, Wang W-C, Hu X-X, Qiu L, Zang H-F. Black-winged kite algorithm: a nature-inspired meta-heuristic for solving benchmark functions and engineering problems. Artif Intell Rev. 2024;57(4):1\u201353.","journal-title":"Artif Intell Rev."},{"key":"9664_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.107532","volume":"128","author":"R Sowmya","year":"2024","unstructured":"Sowmya R, Premkumar M, Jangir P. Newton-raphson-based optimizer: a new population-based metaheuristic algorithm for continuous optimization problems. Eng Appl Artif Intell. 2024;128: 107532.","journal-title":"Eng Appl Artif Intell"}],"container-title":["Discover Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-025-09664-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10791-025-09664-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-025-09664-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T09:16:19Z","timestamp":1751361379000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10791-025-09664-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,1]]},"references-count":27,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["9664"],"URL":"https:\/\/doi.org\/10.1007\/s10791-025-09664-5","relation":{},"ISSN":["2948-2992"],"issn-type":[{"value":"2948-2992","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,1]]},"assertion":[{"value":"4 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no confict of interest.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"132"}}