{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T01:48:14Z","timestamp":1776563294232,"version":"3.51.2"},"reference-count":51,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100018556","name":"Science and Technology Program of Suzhou","doi-asserted-by":"publisher","award":["SYG202351"],"award-info":[{"award-number":["SYG202351"]}],"id":[{"id":"10.13039\/501100018556","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U24A20263"],"award-info":[{"award-number":["U24A20263"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62576238"],"award-info":[{"award-number":["62576238"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62503348"],"award-info":[{"award-number":["62503348"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Swarm and Evolutionary Computation"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1016\/j.swevo.2026.102376","type":"journal-article","created":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T17:24:06Z","timestamp":1774459446000},"page":"102376","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Multi-AGV collision-free scheduling framework with task allocation in high-density warehouses"],"prefix":"10.1016","volume":"104","author":[{"given":"Zhicheng","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benlian","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuting","family":"Le","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xu","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingli","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinliang","family":"Cong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhicheng","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.swevo.2026.102376_b1","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1108\/IR-04-2021-0077","article-title":"Challenges and opportunities in human robot collaboration context of Industry 4.0-a state of the art review","volume":"49","author":"Inkulu","year":"2022","journal-title":"Ind. Robot.: Int. J. Robot. Res. Appl."},{"issue":"3","key":"10.1016\/j.swevo.2026.102376_b2","doi-asserted-by":"crossref","first-page":"211","DOI":"10.3390\/drones7030211","article-title":"Review of autonomous path planning algorithms for mobile robots","volume":"7","author":"Qin","year":"2023","journal-title":"Drones"},{"issue":"9","key":"10.1016\/j.swevo.2026.102376_b3","doi-asserted-by":"crossref","first-page":"773","DOI":"10.3390\/machines10090773","article-title":"A review of path-planning approaches for multiple mobile robots","volume":"10","author":"Lin","year":"2022","journal-title":"Machines"},{"key":"10.1016\/j.swevo.2026.102376_b4","series-title":"Kiva robotics system: Revolutionizing automation and expanding healthcare applications","author":"Bhowmik","year":"2024"},{"key":"10.1016\/j.swevo.2026.102376_b5","doi-asserted-by":"crossref","DOI":"10.1016\/j.chb.2022.107473","article-title":"Explanations and trust: What happens to trust when a robot partner does something unexpected?","volume":"138","author":"Lyons","year":"2023","journal-title":"Comput. Hum. Behav."},{"issue":"3","key":"10.1016\/j.swevo.2026.102376_b6","article-title":"Application of automated guided vehicles in smart automated warehouse systems: A survey","volume":"134","author":"Zhang","year":"2023","journal-title":"CMES Comput. Model. Eng. Sci."},{"key":"10.1016\/j.swevo.2026.102376_b7","first-page":"1443","article-title":"Structure and intractability of optimal multi-robot path planning on graphs","volume":"vol. 27","author":"Yu","year":"2013"},{"key":"10.1016\/j.swevo.2026.102376_b8","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.robot.2016.02.003","article-title":"Task allocation and collision-free path planning of centralized multi-robots system for industrial plant inspection using heuristic methods","volume":"80","author":"Jose","year":"2016","journal-title":"Robot. Auton. Syst."},{"issue":"19","key":"10.1016\/j.swevo.2026.102376_b9","doi-asserted-by":"crossref","first-page":"5748","DOI":"10.1080\/00207543.2014.910628","article-title":"A tabu search algorithm for simultaneous machine\/AGV scheduling problem","volume":"52","author":"Zheng","year":"2014","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"10.1016\/j.swevo.2026.102376_b10","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/TSM.2017.2758380","article-title":"Hybrid particle swarm optimization combined with genetic operators for flexible job-shop scheduling under uncertain processing time for semiconductor manufacturing","volume":"31","author":"Jamrus","year":"2017","journal-title":"IEEE Trans. Semicond. Manuf."},{"key":"10.1016\/j.swevo.2026.102376_b11","series-title":"2023 International Conference on Pattern Recognition, Machine Vision and Intelligent Algorithms","first-page":"216","article-title":"Research on multi-AGV scheduling for intelligent storage based on improved genetic algorithm","author":"Sun","year":"2023"},{"key":"10.1016\/j.swevo.2026.102376_b12","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2020.106371","article-title":"Multi-AGV scheduling for conflict-free path planning in automated container terminals","volume":"142","author":"Zhong","year":"2020","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.swevo.2026.102376_b13","series-title":"International Conference on Soft Computing and Pattern Recognition","first-page":"657","article-title":"Path planning techniques for mobile robots: A review","author":"Mohanty","year":"2021"},{"key":"10.1016\/j.swevo.2026.102376_b14","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."},{"issue":"4","key":"10.1016\/j.swevo.2026.102376_b15","first-page":"829","article-title":"A global path planning algorithm based on improved RRT","volume":"37","author":"Xu","year":"2022","journal-title":"Control Decis."},{"issue":"10","key":"10.1016\/j.swevo.2026.102376_b16","first-page":"2524","article-title":"Multi-robot formation control in unknown environment based on improved DWA","volume":"37","author":"Chang","year":"2022","journal-title":"Control Decis."},{"key":"10.1016\/j.swevo.2026.102376_b17","article-title":"Two-layer path planning method for mobile robots in complex and dynamic environments","author":"Hu","year":"2025","journal-title":"Control Decis."},{"issue":"2","key":"10.1016\/j.swevo.2026.102376_b18","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10846-022-01803-0","article-title":"Market approaches to the multi-robot task allocation problem: a survey","volume":"107","author":"Quinton","year":"2023","journal-title":"J. Intell. Robot. Syst."},{"key":"10.1016\/j.swevo.2026.102376_b19","doi-asserted-by":"crossref","DOI":"10.1016\/j.robot.2023.104492","article-title":"Optimization techniques for multi-robot task allocation problems: Review on the state-of-the-art","volume":"168","author":"Chakraa","year":"2023","journal-title":"Robot. Auton. Syst."},{"issue":"1","key":"10.1016\/j.swevo.2026.102376_b20","first-page":"21","article-title":"A review of task allocation and motion planning for multi-robot in major equipment manufacturing","volume":"50","author":"Zhang","year":"2024","journal-title":"Acta Automat. Sinica"},{"key":"10.1016\/j.swevo.2026.102376_b21","series-title":"2021 30th IEEE International Conference on Robot & Human Interactive Communication (RO-MAN)","first-page":"1017","article-title":"A mixed-integer linear programming formulation for human multi-robot task allocation","author":"Lippi","year":"2021"},{"issue":"4","key":"10.1016\/j.swevo.2026.102376_b22","doi-asserted-by":"crossref","first-page":"2203","DOI":"10.1109\/TASE.2022.3214567","article-title":"Spatial\u2013temporal load balancing and coordination of multi-robot stations","volume":"20","author":"\u00c5blad","year":"2022","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"1","key":"10.1016\/j.swevo.2026.102376_b23","article-title":"Research on improved genetic simulated annealing algorithm for multi-UAV cooperative task allocation","volume":"2246","author":"Wang","year":"2022","journal-title":"J. Phys.: Conf. Ser."},{"key":"10.1016\/j.swevo.2026.102376_b24","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/s10845-018-1459-y","article-title":"A mechanism for scheduling multi robot intelligent warehouse system face with dynamic demand","volume":"31","author":"Li","year":"2020","journal-title":"J. Intell. Manuf."},{"key":"10.1016\/j.swevo.2026.102376_b25","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.rcim.2015.03.001","article-title":"Concurrent tolerance allocation and scheduling for complex assemblies","volume":"35","author":"Geetha","year":"2015","journal-title":"Robot. Comput.-Integr. Manuf."},{"issue":"3","key":"10.1016\/j.swevo.2026.102376_b26","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1109\/TASE.2015.2438032","article-title":"Distributed algorithms for multirobot task assignment with task deadline constraints","volume":"12","author":"Luo","year":"2015","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"22","key":"10.1016\/j.swevo.2026.102376_b27","doi-asserted-by":"crossref","first-page":"25323","DOI":"10.1109\/JSEN.2021.3057376","article-title":"Deep reinforcement learning for task assignment in spatial crowdsourcing and sensing","volume":"21","author":"Sun","year":"2021","journal-title":"IEEE Sensors J."},{"issue":"3","key":"10.1016\/j.swevo.2026.102376_b28","doi-asserted-by":"crossref","first-page":"4509","DOI":"10.1109\/LRA.2020.3002198","article-title":"Learning scheduling policies for multi-robot coordination with graph attention networks","volume":"5","author":"Wang","year":"2020","journal-title":"IEEE Robot. Autom. Lett."},{"issue":"2","key":"10.1016\/j.swevo.2026.102376_b29","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A formal basis for the heuristic determination of minimum cost paths","volume":"4","author":"Hart","year":"1968","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"10.1016\/j.swevo.2026.102376_b30","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connexion with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"10.1016\/j.swevo.2026.102376_b31","series-title":"Rapidly-exploring random trees: A new tool for path planning","author":"LaValle","year":"1998"},{"issue":"7","key":"10.1016\/j.swevo.2026.102376_b32","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1177\/0278364911406761","article-title":"Sampling-based algorithms for optimal motion planning","volume":"30","author":"Karaman","year":"2011","journal-title":"Int. J. Robot. Res."},{"issue":"1","key":"10.1016\/j.swevo.2026.102376_b33","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1177\/027836498600500106","article-title":"Real-time obstacle avoidance for manipulators and mobile robots","volume":"5","author":"Khatib","year":"1986","journal-title":"Int. J. Robot. Res."},{"issue":"1","key":"10.1016\/j.swevo.2026.102376_b34","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/100.580977","article-title":"The dynamic window approach to collision avoidance","volume":"4","author":"Fox","year":"2002","journal-title":"IEEE Robot. Autom. Mag."},{"key":"10.1016\/j.swevo.2026.102376_b35","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.eswa.2018.08.008","article-title":"Multi-objective multi-robot path planning in continuous environment using an enhanced genetic algorithm","volume":"115","author":"Nazarahari","year":"2019","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.swevo.2026.102376_b36","doi-asserted-by":"crossref","first-page":"33522","DOI":"10.1109\/ACCESS.2021.3061288","article-title":"Improved particle swarm optimization algorithm for AGV path planning","volume":"9","author":"Qiuyun","year":"2021","journal-title":"IEEE Access"},{"key":"10.1016\/j.swevo.2026.102376_b37","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.swevo.2026.102376_b38","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1016\/j.artint.2012.11.006","article-title":"The increasing cost tree search for optimal multi-agent pathfinding","volume":"195","author":"Sharon","year":"2013","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.swevo.2026.102376_b39","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.artint.2014.11.006","article-title":"Conflict-based search for optimal multi-agent pathfinding","volume":"219","author":"Sharon","year":"2015","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.swevo.2026.102376_b40","first-page":"223","article-title":"Icbs: The improved conflict-based search algorithm for multi-agent pathfinding","volume":"vol. 6","author":"Boyarski","year":"2015"},{"issue":"4","key":"10.1016\/j.swevo.2026.102376_b41","doi-asserted-by":"crossref","first-page":"7001","DOI":"10.1109\/LRA.2021.3096476","article-title":"Parallel hierarchical composition conflict-based search for optimal multi-agent pathfinding","volume":"6","author":"Lee","year":"2021","journal-title":"IEEE Robot. Autom. Lett."},{"key":"10.1016\/j.swevo.2026.102376_b42","first-page":"19","article-title":"Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem","volume":"vol. 5","author":"Barer","year":"2014"},{"key":"10.1016\/j.swevo.2026.102376_b43","first-page":"12353","article-title":"Eecbs: A bounded-suboptimal search for multi-agent path finding","volume":"vol. 35","author":"Li","year":"2021"},{"key":"10.1016\/j.swevo.2026.102376_b44","first-page":"11272","article-title":"Lifelong multi-agent path finding in large-scale warehouses","volume":"vol. 35","author":"Li","year":"2021"},{"key":"10.1016\/j.swevo.2026.102376_b45","first-page":"11655","article-title":"Lacam: Search-based algorithm for quick multi-agent pathfinding","volume":"vol. 37","author":"Okumura","year":"2023"},{"key":"10.1016\/j.swevo.2026.102376_b46","doi-asserted-by":"crossref","DOI":"10.1016\/j.artint.2022.103752","article-title":"Priority inheritance with backtracking for iterative multi-agent path finding","volume":"310","author":"Okumura","year":"2022","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.swevo.2026.102376_b47","first-page":"57212","article-title":"Arbitrarily scalable environment generators via neural cellular automata","volume":"36","author":"Zhang","year":"2023","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.swevo.2026.102376_b48","series-title":"Multi-robot coordination and layout design for automated warehousing","author":"Zhang","year":"2023"},{"key":"10.1016\/j.swevo.2026.102376_b49","first-page":"270","article-title":"Feasibility study: Moving non-homogeneous teams in congested video game environments","volume":"vol. 13","author":"Ma","year":"2017"},{"key":"10.1016\/j.swevo.2026.102376_b50","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1016\/j.asoc.2017.12.031","article-title":"A comparative study of improved GA and PSO in solving multiple traveling salesmen problem","volume":"64","author":"Zhou","year":"2018","journal-title":"Appl. Soft Comput."},{"issue":"05","key":"10.1016\/j.swevo.2026.102376_b51","first-page":"1327","article-title":"A multi-robot path planning algorithm based on improved conflict search","volume":"38","author":"Honglin","year":"2023","journal-title":"Control Decis."}],"container-title":["Swarm and Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2210650226000969?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2210650226000969?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T01:29:41Z","timestamp":1776562181000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2210650226000969"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":51,"alternative-id":["S2210650226000969"],"URL":"https:\/\/doi.org\/10.1016\/j.swevo.2026.102376","relation":{},"ISSN":["2210-6502"],"issn-type":[{"value":"2210-6502","type":"print"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Multi-AGV collision-free scheduling framework with task allocation in high-density warehouses","name":"articletitle","label":"Article Title"},{"value":"Swarm and Evolutionary Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.swevo.2026.102376","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":"102376"}}