{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T23:05:32Z","timestamp":1772060732698,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T00:00:00Z","timestamp":1719964800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T00:00:00Z","timestamp":1719964800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program","doi-asserted-by":"crossref","award":["2021YFB3301001"],"award-info":[{"award-number":["2021YFB3301001"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100018617","name":"Liaoning Revitalization Talents Program","doi-asserted-by":"crossref","award":["XLYC1902110"],"award-info":[{"award-number":["XLYC1902110"]}],"id":[{"id":"10.13039\/501100018617","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2024,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The window strategy, known for its flexibility and efficiency, is extensively used in dynamic path planning. To further enhance the performance of the Automated Guided Vehicles (AGVs) sorting system, the two processes of AGV movement and path planning can be executed concurrently based on the window strategy. Nonetheless, difficulties in matching the computing time of the planning server with the moving time of AGVs may cause delays or reduced path optimality. To address the problem, this paper proposes an optimal time reuse strategy. The proposed solution controls computing time by managing path length for each planning instance, ensuring alignment with the moving time of AGVs to maximize path optimality and avoid delays. To achieve this, two aspects need to be considered. Firstly, on a systemic level, we control the entry rate of AGVs by adjusting the replanning period, thus avoiding congestion caused by excessive AGVs and maintaining high system efficiency. Secondly, we reversely control the computing time by adjusting the path length that needs to be planned for each single planning, so that it matches the moving time of AGVs. Simulation results show that our method outperforms existing top-performing methods, achieving task completion rates 1.64, 1.57, and 1.12 times faster across various map sizes. This indicates its effectiveness in synchronizing planning and movement times. The method contributes significantly to dynamic path planning methodologies, offering a novel approach to time management in AGV systems.<\/jats:p>","DOI":"10.1007\/s40747-024-01511-2","type":"journal-article","created":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T07:02:14Z","timestamp":1719990134000},"page":"7089-7108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Optimal time reuse strategy-based dynamic multi-AGV path planning method"],"prefix":"10.1007","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7661-2597","authenticated-orcid":false,"given":"Ke","family":"Wang","sequence":"first","affiliation":[]},{"given":"Wei","family":"Liang","sequence":"additional","affiliation":[]},{"given":"Huaguang","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Jialin","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Qi","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,3]]},"reference":[{"issue":"2","key":"1511_CR1","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1016\/j.ejor.2018.08.023","volume":"277","author":"N Boysen","year":"2019","unstructured":"Boysen N, De Koster R, Weidinger F (2019) Warehousing in the e-commerce era: a survey. Eur J Oper Res 277(2):396\u2013411","journal-title":"Eur J Oper Res"},{"issue":"4","key":"1511_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TASE.2020.2964101","volume":"18","author":"Z Liu","year":"2020","unstructured":"Liu Z, Wang H, Wei H, Liu M, Liu Y-H (2020) Prediction, planning, and coordination of thousand-warehousing-robot networks with motion and communication uncertainties. IEEE Trans Autom Sci Eng 18(4):1\u201313","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"5","key":"1511_CR3","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1109\/TRO.2016.2593448","volume":"32","author":"J Yu","year":"2016","unstructured":"Yu J, LaValle SM (2016) Optimal multirobot path planning on graphs: complete algorithms and effective heuristics. IEEE Trans Robot 32(5):1163\u20131177","journal-title":"IEEE Trans Robot"},{"key":"1511_CR4","doi-asserted-by":"crossref","unstructured":"Li J, Tinka A, Kiesel S, Durham JW, Kumar TKS, Koenig S (2021) Lifelong multi-agent path finding in large-scale warehouses. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp 11272\u201311281","DOI":"10.1609\/aaai.v35i13.17344"},{"key":"1511_CR5","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1016\/j.ast.2018.11.027","volume":"84","author":"J Liu","year":"2019","unstructured":"Liu J, Han W, Peng H, Wang X (2019) Trajectory planning and tracking control for towed carrier aircraft system. Aerosp Sci Technol 84:830\u2013838","journal-title":"Aerosp Sci Technol"},{"issue":"12","key":"1511_CR6","doi-asserted-by":"publisher","first-page":"3039","DOI":"10.1016\/j.cja.2020.06.020","volume":"33","author":"X Wang","year":"2020","unstructured":"Wang X, Liu J, Su X, Peng H, Zhao X, Lu C (2020) A review on carrier aircraft dispatch path planning and control on deck. Chin J Aeronaut 33(12):3039\u20133057","journal-title":"Chin J Aeronaut"},{"issue":"2","key":"1511_CR7","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.dt.2020.11.013","volume":"18","author":"X Wang","year":"2022","unstructured":"Wang X, Peng H, Liu J, Dong X, Zhao X, Lu C (2022) Optimal control based coordinated taxiing path planning and tracking for multiple carrier aircraft on flight deck. Def Technol 18(2):238\u2013248","journal-title":"Def Technol"},{"key":"1511_CR8","doi-asserted-by":"crossref","unstructured":"Surynek P (2012) Towards optimal cooperative path planning in hard setups through satisfiability solving. In: Pacific Rim International Conference on Artificial Intelligence, Springer, pp 564\u2013576","DOI":"10.1007\/978-3-642-32695-0_50"},{"key":"1511_CR9","doi-asserted-by":"crossref","unstructured":"Bart\u00e1k R, \u0160vancara J (2019) On sat-based approaches for multi-agent path finding with the sum-of-costs objective. In: Proceedings of the International Symposium on Combinatorial Search, vol 10, pp 10\u201317","DOI":"10.1609\/socs.v10i1.18497"},{"key":"1511_CR10","doi-asserted-by":"crossref","unstructured":"Surynek P (2022) Sparse decision diagrams for sat-based compilation of multi-agent path finding. In: Proceedings of the International Symposium on Combinatorial Search, vol 15, pp 317\u2013319","DOI":"10.1609\/socs.v15i1.21798"},{"key":"1511_CR11","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1613\/jair.1.13818","volume":"75","author":"RA Ach\u00e1","year":"2022","unstructured":"Ach\u00e1 RA, L\u00f3pez R, Hagedorn S, Baier JA (2022) Multi-agent path finding: a new boolean encoding. J Artif Intell Res 75:323\u2013350","journal-title":"J Artif Intell Res"},{"key":"1511_CR12","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1613\/jair.4447","volume":"51","author":"B De Wilde","year":"2014","unstructured":"De Wilde B, Ter Mors AW, Witteveen C (2014) Push and rotate: a complete multi-agent pathfinding algorithm. J Artif Intell Res 51:443\u2013492","journal-title":"J Artif Intell Res"},{"key":"1511_CR13","doi-asserted-by":"crossref","unstructured":"Surynek P, \u0160vancara J, Felner A, Boyarski E (2017) Integration of independence detection into sat-based optimal multi-agent path finding a novel sat-based optimal mapf solver. In: 9th International Conference on Agents and Artificial Intelligence, ICAART 2017, SciTePress, pp 85\u201395","DOI":"10.5220\/0006126000850095"},{"key":"1511_CR14","doi-asserted-by":"crossref","unstructured":"Botea A, Surynek P (2015) Multi-agent path finding on strongly biconnected digraphs. In: Proceedings of the AAAI Conference on Artificial Intelligence, AAAI, pp 2024\u20132030","DOI":"10.1609\/aaai.v29i1.9430"},{"key":"1511_CR15","doi-asserted-by":"crossref","unstructured":"Standley T (2010) Finding optimal solutions to cooperative pathfinding problems. In: Proceedings of the AAAI Conference on Artificial Intelligence, AAAI, pp 173\u2013178","DOI":"10.1609\/aaai.v24i1.7564"},{"key":"1511_CR16","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1613\/jair.4171","volume":"50","author":"M Goldenberg","year":"2014","unstructured":"Goldenberg M, Felner A, Stern R, Sharon G, Sturtevant N, Holte RC, Schaeffer J (2014) Enhanced partial expansion A*. J Artif Intell Res 50:141\u2013187","journal-title":"J Artif Intell Res"},{"key":"1511_CR17","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.artint.2014.11.006","volume":"219","author":"G Sharon","year":"2015","unstructured":"Sharon G, Stern R, Felner A, Sturtevant NR (2015) Conflict-based search for optimal multi-agent pathfinding. Artif Intell 219:40\u201366","journal-title":"Artif Intell"},{"key":"1511_CR18","doi-asserted-by":"crossref","unstructured":"Barer M, Sharon G, Stern R, Felner A (2014) Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem. In: Seventh Annual Symposium on Combinatorial Search, AAAI, pp 19\u201327","DOI":"10.1609\/socs.v5i1.18315"},{"key":"1511_CR19","unstructured":"Boyarski E, Felner A, Stern R, Sharon G, Tolpin D, Betzalel O, Shimony E (2015) ICBS: Improved conflict-based search algorithm for multi-agent pathfinding. In: Proceedings of the 24th International Conference on Artificial Intelligence, AAAI, pp 740\u2013746"},{"key":"1511_CR20","doi-asserted-by":"crossref","unstructured":"Felner A, Li J, Boyarski E, Ma H, Cohen L, Kumar TS, Koenig S (2018) Adding heuristics to conflict-based search for multi-agent path finding. In: Proceedings of the International Conference on Automated Planning and Scheduling, AAAI, pp 83\u201387","DOI":"10.1609\/icaps.v28i1.13883"},{"key":"1511_CR21","doi-asserted-by":"crossref","unstructured":"Ma H, Harabor D, Stuckey PJ, Li J, Koenig S (2019) Searching with consistent prioritization for multi-agent path finding. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol 33, pp 7643\u20137650","DOI":"10.1609\/aaai.v33i01.33017643"},{"key":"1511_CR22","doi-asserted-by":"crossref","unstructured":"Li J, Chen Z, Harabor D, Stuckey PJ, Koenig S (2022) Mapf-lns2: fast repairing for multi-agent path finding via large neighborhood search. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol 36, pp 10256\u201310265","DOI":"10.1609\/aaai.v36i9.21266"},{"key":"1511_CR23","doi-asserted-by":"crossref","unstructured":"Zhang H, Li Y, Li J, Kumar TS, Koenig S (2022) Mutex propagation in multi-agent path finding for large agents. In: Proceedings of the International Symposium on Combinatorial Search, vol 15, pp 249\u2013253","DOI":"10.1609\/socs.v15i1.21776"},{"key":"1511_CR24","doi-asserted-by":"crossref","unstructured":"Ren Z, Rathinam S, Choset H (2021) Multi-objective conflict-based search for multi-agent path finding. In: 2021 IEEE International Conference on Robotics and Automation (ICRA), IEEE, pp 8786\u20138791","DOI":"10.1109\/ICRA48506.2021.9560985"},{"key":"1511_CR25","doi-asserted-by":"crossref","unstructured":"Ren Z, Rathinam S, Choset H (2022) Conflict-based Steiner search for multi-agent combinatorial path finding. In: Proceedings of Robotics: Science and Systems","DOI":"10.15607\/RSS.2022.XVIII.058"},{"key":"1511_CR26","doi-asserted-by":"crossref","unstructured":"Zhang K, Mao J, Zhang S, Wang N (2024) A priority-based hierarchical framework for k-robust multi-agent path finding. IEEE Trans Intell Veh","DOI":"10.1109\/TIV.2024.3355423"},{"key":"1511_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2014.11.001","volume":"219","author":"G Wagner","year":"2015","unstructured":"Wagner G, Choset H (2015) Subdimensional expansion for multirobot path planning. Artif Intell 219:1\u201324","journal-title":"Artif Intell"},{"key":"1511_CR28","unstructured":"Standley T, Korf R (2011) Complete algorithms for cooperative pathfinding problems. In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI), AAAI, pp 668\u2013673"},{"key":"1511_CR29","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.cie.2015.01.003","volume":"86","author":"M Saidi-Mehrabad","year":"2015","unstructured":"Saidi-Mehrabad M, Dehnavi-Arani S, Evazabadian F, Mahmoodian V (2015) An ant colony algorithm (ACA) for solving the new integrated model of job shop scheduling and conflict-free routing of agvs. Comput Ind Eng 86:2\u201313","journal-title":"Comput Ind Eng"},{"key":"1511_CR30","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.eswa.2016.03.035","volume":"58","author":"A Hidalgo-Paniagua","year":"2016","unstructured":"Hidalgo-Paniagua A, Vega-Rodr\u00edguez MA, Ferruz J (2016) Applying the MOVNS (multi-objective variable neighborhood search) algorithm to solve the path planning problem in mobile robotics. Expert Syst Appl 58:20\u201335","journal-title":"Expert Syst Appl"},{"issue":"2","key":"1511_CR31","doi-asserted-by":"publisher","first-page":"2666","DOI":"10.1109\/LRA.2021.3062803","volume":"6","author":"M Damani","year":"2021","unstructured":"Damani M, Luo Z, Wenzel E, Sartoretti G (2021) Primal $$ _2 $$: Pathfinding via reinforcement and imitation multi-agent learning-lifelong. IEEE Robot Autom Lett 6(2):2666\u20132673","journal-title":"IEEE Robot Autom Lett"},{"key":"1511_CR32","doi-asserted-by":"crossref","unstructured":"Sinkar M, Izhan M, Nimkar S, Kurhade S (2021) Multi-agent path finding using dynamic distributed deep learning model. In: 2021 International Conference on Communication Information and Computing Technology (ICCICT), IEEE, pp 1\u20136","DOI":"10.1109\/ICCICT50803.2021.9510155"},{"key":"1511_CR33","doi-asserted-by":"crossref","unstructured":"Chen L, Wang Y, Miao Z, Mo Y, Feng M, Zhou Z (2022) Multi-agent path finding using imitation-reinforcement learning with transformer. In: 2022 IEEE International Conference on Robotics and Biomimetics (ROBIO), IEEE, pp 445\u2013450","DOI":"10.1109\/ROBIO55434.2022.10011833"},{"issue":"01","key":"1511_CR34","doi-asserted-by":"publisher","first-page":"107","DOI":"10.3991\/ijim.v16i01.26663","volume":"16","author":"AH Wheeb","year":"2022","unstructured":"Wheeb AH, Al-Jamali NAS (2022) Performance analysis of olsr protocol in mobile ad hoc networks. Int J Interact Mob Technol 16(01):107","journal-title":"Int J Interact Mob Technol"},{"issue":"4","key":"1511_CR35","first-page":"3186","volume":"11","author":"AH Wheeb","year":"2021","unstructured":"Wheeb AH, Naser MT (2021) Simulation based comparison of routing protocols in wireless multihop adhoc networks. Int J Electr Comput Eng 11(4):3186","journal-title":"Int J Electr Comput Eng"},{"key":"1511_CR36","doi-asserted-by":"crossref","unstructured":"Nishi T, Tanaka Y (2012) Petri net decomposition approach for dispatching and conflict-free routing of bidirectional automated guided vehicle systems. IEEE Trans Syst Man Cybern Syst 42(5):1230-1243","DOI":"10.1109\/TSMCA.2012.2183353"},{"issue":"2","key":"1511_CR37","doi-asserted-by":"publisher","first-page":"1350","DOI":"10.1109\/LRA.2020.2967326","volume":"5","author":"SD Han","year":"2020","unstructured":"Han SD, Yu J (2020) DDM: Fast near-optimal multi-robot path planning using diversified-path and optimal sub-problem solution database heuristics. IEEE Robot Autom Lett 5(2):1350\u20131357","journal-title":"IEEE Robot Autom Lett"},{"key":"1511_CR38","doi-asserted-by":"crossref","unstructured":"Wan Q, Gu C, Sun S, Chen M, Huang H, Jia X (2018) Lifelong multi-agent path finding in a dynamic environment. In: 2018 15th International Conference on Control, Automation, Robotics and Vision (ICARCV), IEEE, pp 875\u2013882","DOI":"10.1109\/ICARCV.2018.8581181"},{"key":"1511_CR39","doi-asserted-by":"crossref","unstructured":"\u0160vancara J, Vlk M, Stern R, Atzmon D, Bart\u00e1k R (2019) Online multi-agent pathfinding. In: Proceedings of the AAAI Conference on Artificial Intelligence, AAAI, pp 7732\u20137739","DOI":"10.1609\/aaai.v33i01.33017732"},{"key":"1511_CR40","doi-asserted-by":"crossref","unstructured":"Stern R, Sturtevant NR, Felner A, Koenig S, Ma H, Walker TT, Li J, Atzmon D, Cohen L, Kumar TKS, Boyarski E, Bartak R (2019) Multi-agent pathfinding: definitions, variants, and benchmarks. Symposium on Combinatorial Search (SoCS), pp 151\u2013158","DOI":"10.1609\/socs.v10i1.18510"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01511-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-024-01511-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01511-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T15:21:59Z","timestamp":1726327319000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-024-01511-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,3]]},"references-count":40,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["1511"],"URL":"https:\/\/doi.org\/10.1007\/s40747-024-01511-2","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,3]]},"assertion":[{"value":"20 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Corresponding authors declare on behalf of all authors that there is no Conflict of interest. We declare that we do not have any commercial or associative interest that represents a Conflict of interest in connection with the work submitted.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}