{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T16:47:21Z","timestamp":1776444441539,"version":"3.51.2"},"reference-count":46,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100020595","name":"National Science and Technology Council","doi-asserted-by":"publisher","award":["112\\u20132221-E-027\\u2013125 -MY2"],"award-info":[{"award-number":["112\\u20132221-E-027\\u2013125 -MY2"]}],"id":[{"id":"10.13039\/100020595","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100020595","name":"National Science and Technology Council","doi-asserted-by":"publisher","award":["114-2221-E-011-144-"],"award-info":[{"award-number":["114-2221-E-011-144-"]}],"id":[{"id":"10.13039\/100020595","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational Science"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1016\/j.jocs.2026.102843","type":"journal-article","created":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T14:09:19Z","timestamp":1773756559000},"page":"102843","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Efficient path planning for autonomous mobile robots in e-commerce warehouses: An improved particle swarm optimization approach with dynamic replanning"],"prefix":"10.1016","volume":"96","author":[{"given":"Shih-Chi","family":"Tseng","sequence":"first","affiliation":[]},{"given":"Chyh-Ming","family":"Lai","sequence":"additional","affiliation":[]},{"given":"Yu-Chi","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Chia-Tzu","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Wei-Ming","family":"Kuo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0004-2026-3649","authenticated-orcid":false,"given":"Chun-Chih","family":"Chiu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jocs.2026.102843_bib1","article-title":"Path planning for mobile robots based on the Time&Space-efficient improved A* algorithm","author":"Zhao","year":"2022","journal-title":"3rd International Conference Information Science Parallel Distributed Systems (ISPDS"},{"key":"10.1016\/j.jocs.2026.102843_bib2","doi-asserted-by":"crossref","DOI":"10.1016\/j.robot.2023.104592","article-title":"Mobile robot\u2019s path-planning and path-tracking in static and dynamic environments: dynamic programming approach","volume":"172","author":"Marashian","year":"2024","journal-title":"Robot. Auton. Syst."},{"key":"10.1016\/j.jocs.2026.102843_bib3","doi-asserted-by":"crossref","DOI":"10.1016\/j.robot.2024.104698","article-title":"Collision-free path planning for multiple robots using efficient turn-angle assignment","volume":"177","author":"Rodr\u00edguez","year":"2024","journal-title":"Robot. Auton. Syst."},{"key":"10.1016\/j.jocs.2026.102843_bib4","doi-asserted-by":"crossref","DOI":"10.1016\/j.compeleceng.2023.108957","article-title":"Hybrid ant colony and intelligent water drop algorithm for route planning of unmanned aerial vehicles","volume":"111","author":"Sun","year":"2023","journal-title":"Comput. Electr. Eng."},{"key":"10.1016\/j.jocs.2026.102843_bib5","doi-asserted-by":"crossref","DOI":"10.1016\/j.compag.2022.107274","article-title":"Many-objective evolutionary algorithm based agricultural mobile robot route planning","volume":"200","author":"Zhang","year":"2022","journal-title":"Comput. Electron. Agric."},{"key":"10.1016\/j.jocs.2026.102843_bib6","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2023.109339","article-title":"A study on the route planning of aviation emergency rescue considering disaster victims splitting according to backpacks","volume":"181","author":"Li","year":"2023","journal-title":"Comput. & Ind. Eng."},{"issue":"5","key":"10.1016\/j.jocs.2026.102843_bib7","doi-asserted-by":"crossref","first-page":"6962","DOI":"10.1109\/JSEN.2020.3039275","article-title":"Mobile robot path planning based on improved localized particle swarm optimization","volume":"21","author":"Zhang","year":"2020","journal-title":"IEEE Sens. J."},{"key":"10.1016\/j.jocs.2026.102843_bib8","doi-asserted-by":"crossref","unstructured":"H. Miao, Y.C. Tian, 2008. Robot path planning in dynamic environments using a simulated annealing based approach. 10th International Conference on Control, Automation, Robotics and Vision.","DOI":"10.1109\/ICARCV.2008.4795701"},{"key":"10.1016\/j.jocs.2026.102843_bib9","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/j.procs.2018.01.113","article-title":"Genetic algorithm based approach for autonomous mobile robot path planning","volume":"127","author":"Lamini","year":"2018","journal-title":"Procedia Comput. Sci."},{"issue":"7B","key":"10.1016\/j.jocs.2026.102843_bib10","first-page":"281","article-title":"FPGA-based hybrid GA-PSO algorithm and its application to global path planning for mobile robots","volume":"88","author":"Huang","year":"2012","journal-title":"Prz. Elektrotech."},{"key":"10.1016\/j.jocs.2026.102843_bib11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s42452-020-03498-0","article-title":"Hybrid PSO-HSA and PSO-GA algorithm for 3D path planning in autonomous UAVs","volume":"2","author":"Abhishek","year":"2020","journal-title":"SN Appl. Sci."},{"key":"10.1016\/j.jocs.2026.102843_bib12","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2023.110868","article-title":"A mixing algorithm of ACO and ABC for solving path planning of mobile robot","volume":"148","author":"Li","year":"2023","journal-title":"Appl. Soft Comput."},{"issue":"6","key":"10.1016\/j.jocs.2026.102843_bib13","first-page":"1640","article-title":"Advanced study of Shortest Route Problem and its applications \u2013 bellman-ford algorithm","volume":"8","author":"Kempepatil","year":"2023","journal-title":"Int. J. Sci. Dev. Res."},{"key":"10.1016\/j.jocs.2026.102843_bib14","article-title":"A comprehensive study of Dijkstra's algorithm","author":"Khan","year":"2020","journal-title":"Soc. Sci. Res. Netw."},{"issue":"2","key":"10.1016\/j.jocs.2026.102843_bib15","doi-asserted-by":"crossref","DOI":"10.1371\/journal.pone.0263841","article-title":"The EBS-A* algorithm: an improved A* algorithm for path planning","volume":"17","author":"Wang","year":"2022","journal-title":"PloS One"},{"key":"10.1016\/j.jocs.2026.102843_bib16","article-title":"On the heuristics of A* or A algorithm in ITS and robot path-planning","author":"Goto","year":"2003","journal-title":"Proc. IEEE\/RSJ Int. Conf. Intell. Robots Syst. (IROS 2003)"},{"key":"10.1016\/j.jocs.2026.102843_bib17","article-title":"An implementation of path planning algorithms for mobile robots on a grid based map","author":"Y\u00fcksel","year":"2023","journal-title":"Ondokuz May\u0131S. Univ. Electr. & Electron. Eng. Dep."},{"key":"10.1016\/j.jocs.2026.102843_bib18","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.120254","article-title":"Path planning techniques for mobile robots: review and prospect","volume":"227","author":"Liu","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.jocs.2026.102843_bib19","doi-asserted-by":"crossref","first-page":"1555","DOI":"10.1007\/s00521-019-04172-2","article-title":"Research on path planning of mobile robot based on improved ant colony algorithm","volume":"32","author":"Luo","year":"2020","journal-title":"Neural Comput. Appl."},{"key":"10.1016\/j.jocs.2026.102843_bib20","first-page":"2290","article-title":"UAV path planning based on K-means algorithm and simulated annealing algorithm","volume":"2018","author":"Yue","year":"2018","journal-title":"37th Chin. Control Conf. (CCC)"},{"key":"10.1016\/j.jocs.2026.102843_bib21","first-page":"1943","article-title":"Research on AGV scheduling based on point-to-point mode","author":"Yu","year":"2020","journal-title":"5th Int. Conf. Mech. Control Comput. Eng. (ICMCCE)"},{"issue":"part B","key":"10.1016\/j.jocs.2026.102843_bib22","article-title":"An improved fault-tolerant cultural-PSO with probability for multi-AGV path planning","volume":"237","author":"Lin","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.jocs.2026.102843_bib23","doi-asserted-by":"crossref","DOI":"10.1016\/j.jocs.2022.101938","article-title":"An intelligence-based hybrid PSO-SA for mobile robot path planning in warehouse","volume":"67","author":"Lin","year":"2023","journal-title":"J. Comput. Sci."},{"issue":"1","key":"10.1016\/j.jocs.2026.102843_bib24","article-title":"Enhanced path planning algorithm via hybrid WOA-PSO for differential wheeled mobile robots","volume":"12","author":"Najm","year":"2024","journal-title":"Syst. Sci. & Control Eng."},{"key":"10.1016\/j.jocs.2026.102843_bib25","article-title":"Graph neural network based method for robot path planning","volume":"4","author":"Diao","year":"2024","journal-title":"Biomim. Intell. Robot."},{"issue":"9","key":"10.1016\/j.jocs.2026.102843_bib26","first-page":"3069","article-title":"Path planning for mobile robot based on improved ant colony Q-learning algorithm","volume":"19","author":"Cui","year":"2025","journal-title":"Int. J. Interact. Des. Manuf. (IJIDeM)."},{"key":"10.1016\/j.jocs.2026.102843_bib27","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/s11760-025-03957-4","article-title":"A path planning algorithm based on actor\u2013critic model in complex environments","volume":"19","author":"Yu","year":"2025","journal-title":"Signal Image Video Process."},{"issue":"12","key":"10.1016\/j.jocs.2026.102843_bib28","doi-asserted-by":"crossref","first-page":"5177","DOI":"10.1016\/j.eswa.2015.02.033","article-title":"Path planning for mobile robots using Bacterial Potential Field for avoiding static and dynamic obstacles","volume":"42","author":"Montiel","year":"2015","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"10.1016\/j.jocs.2026.102843_bib29","doi-asserted-by":"crossref","first-page":"10491","DOI":"10.1016\/j.asej.2021.05.005","article-title":"An intelligent approach for autonomous mobile robots path planning based on adaptive neuro-fuzzy inference system","volume":"13","author":"Samadi Gharajeh","year":"2022","journal-title":"Ain Shams Eng. J."},{"key":"10.1016\/j.jocs.2026.102843_bib30","article-title":"Path planning in an environment with static and dynamic obstacles using Genetic Algorithm: a simplified search space approach","volume":"2006","author":"Mahjoubi","year":"2006","journal-title":"IEEE Int. Conf. Evolut. Comput."},{"key":"10.1016\/j.jocs.2026.102843_bib31","doi-asserted-by":"crossref","first-page":"13155","DOI":"10.1007\/s00521-020-04764-3","article-title":"Adaptive path finding algorithm in dynamic environment for warehouse robot","volume":"32","author":"Ng","year":"2020","journal-title":"Neural Comput. Appl."},{"key":"10.1016\/j.jocs.2026.102843_bib32","series-title":"Proceedings of the 9th International Conference on Computing, Intelligence and Data Analytics (ICCIDA), Ho Chi Minh City, Vietnam","article-title":"Efficient algorithms on dynamic obstacle avoidance for multi-robot agents in automated warehouse system (AutoStore)","author":"Banh","year":"2024"},{"key":"10.1016\/j.jocs.2026.102843_bib33","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.neucom.2022.05.006","article-title":"A deep reinforcement learning based method for real-time path planning and dynamic obstacle avoidance","volume":"497","author":"Chen","year":"2022","journal-title":"Neurocomputing"},{"key":"10.1016\/j.jocs.2026.102843_bib34","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/978-3-319-26054-9_5","article-title":"M, A universal grid map library: implementation and use case for rough terrain navigation","volume":"1","author":"Fankhauser","year":"2016","journal-title":"Robot Oper. Syst. (ROS) Complet. Ref."},{"issue":"2","key":"10.1016\/j.jocs.2026.102843_bib35","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0146-664X(82)90104-6","article-title":"Geometric modeling using octree encoding","volume":"19","author":"Meagher","year":"1982","journal-title":"Comput. Graph. Image Process."},{"key":"10.1016\/j.jocs.2026.102843_bib36","doi-asserted-by":"crossref","DOI":"10.1109\/ICNN.1995.488968","article-title":"Particle swarm optimization","author":"Kennedy","year":"1995","journal-title":"Proc. ICNN'95 Int. Conf. Neural Netw."},{"key":"10.1016\/j.jocs.2026.102843_bib37","doi-asserted-by":"crossref","first-page":"17018","DOI":"10.1109\/ACCESS.2022.3150036","article-title":"Local path planning: dynamic window approach with virtual manipulators considering dynamic obstacles","volume":"10","author":"Kobayashi","year":"2022","journal-title":"IEEE Access"},{"key":"10.1016\/j.jocs.2026.102843_bib38","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1109\/TEVC.2015.2503422","article-title":"An analysis of the inertia weight parameter for binary particle swarm optimization","volume":"20","author":"Liu","year":"2016","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"10.1016\/j.jocs.2026.102843_bib39","first-page":"633","article-title":"Inertia weight strategies in particle swarm optimization","author":"Bansal","year":"2011","journal-title":"Third World Congr. Nat. Biol. Inspired Comput."},{"key":"10.1016\/j.jocs.2026.102843_bib40","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s00500-016-2474-6","article-title":"Particle swarm optimization algorithm: an overview","volume":"22","author":"Wang","year":"2018","journal-title":"Soft Comput."},{"key":"10.1016\/j.jocs.2026.102843_bib41","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1109\/4235.985692","article-title":"The particle swarm - explosion, stability, and convergence in a multidimensional complex space","volume":"6","author":"Clerc","year":"2002","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"10.1016\/j.jocs.2026.102843_bib42","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.119410","article-title":"Modified adaptive ant colony optimization algorithm and its application for solving path planning of mobile robot","volume":"215","author":"Wu","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.jocs.2026.102843_bib43","doi-asserted-by":"crossref","first-page":"40728","DOI":"10.1109\/ACCESS.2021.3062375","article-title":"Path planning and obstacle avoiding of the USV based on improved ACO-APF hybrid algorithm with adaptive early-warning","volume":"9","author":"Chen","year":"2021","journal-title":"IEEE Access"},{"key":"10.1016\/j.jocs.2026.102843_bib44","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2021.107230","article-title":"Path planning optimization of indoor mobile robot based on adaptive ant colony algorithm","volume":"156","author":"Miao","year":"2021","journal-title":"Comput. & Ind. Eng."},{"key":"10.1016\/j.jocs.2026.102843_bib45","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2023.110540","article-title":"An improved heuristic mechanism ant colony optimization algorithm for solving path planning","volume":"271","author":"Liu","year":"2023","journal-title":"Knowl. Based Syst."},{"key":"10.1016\/j.jocs.2026.102843_bib46","doi-asserted-by":"crossref","first-page":"8961","DOI":"10.1007\/s00500-022-07293-4","article-title":"Research on path planning algorithm of mobile robot based on reinforcement learning","volume":"26","author":"Pan","year":"2022","journal-title":"Soft Comput."}],"container-title":["Journal of Computational Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S187775032600061X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S187775032600061X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T15:55:42Z","timestamp":1776441342000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S187775032600061X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":46,"alternative-id":["S187775032600061X"],"URL":"https:\/\/doi.org\/10.1016\/j.jocs.2026.102843","relation":{},"ISSN":["1877-7503"],"issn-type":[{"value":"1877-7503","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Efficient path planning for autonomous mobile robots in e-commerce warehouses: An improved particle swarm optimization approach with dynamic replanning","name":"articletitle","label":"Article Title"},{"value":"Journal of Computational Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jocs.2026.102843","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"102843"}}