{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T00:52:17Z","timestamp":1781916737558,"version":"3.54.5"},"reference-count":29,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001459","name":"Government of Singapore Ministry of Education","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.artint.2026.104586","type":"journal-article","created":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T16:29:49Z","timestamp":1781540989000},"page":"104586","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Robust and effective multi-agent path execution with timing uncertainty"],"prefix":"10.1016","volume":"358","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8939-1639","authenticated-orcid":false,"given":"Yihao","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7404-7595","authenticated-orcid":false,"given":"Xueyan","family":"Tang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0183-3835","authenticated-orcid":false,"given":"Wentong","family":"Cai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jingning","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.artint.2026.104586_bib0001","series-title":"Innovations in Applied Artificial Intelligence","first-page":"208","article-title":"Plan execution in dynamic environments","author":"Fraser","year":"2005"},{"issue":"6","key":"10.1016\/j.artint.2026.104586_bib0002","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1109\/MIS.2017.4531217","article-title":"Overview: a hierarchical framework for plan generation and execution in multirobot systems","volume":"32","author":"Ma","year":"2017","journal-title":"IEEE Intell. Syst."},{"key":"10.1016\/j.artint.2026.104586_bib0003","series-title":"Proceedings of the 17th International Symposium on Combinatorial Search (SoCS)","first-page":"64","article-title":"Multi-agent path execution with uncertainty","author":"Liu","year":"2024"},{"key":"10.1016\/j.artint.2026.104586_bib0004","series-title":"Proceedings of the 12th Annual Symposium on Combinatorial Search (SoCS)","first-page":"151","article-title":"Multi-agent pathfinding: definitions, variants, and benchmarks","author":"Stern","year":"2019"},{"key":"10.1016\/j.artint.2026.104586_bib0005","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1613\/jair.1.11734","article-title":"Robust multi-agent path finding and executing","volume":"67","author":"Atzmon","year":"2020","journal-title":"J. Artif. Intell. Res."},{"key":"10.1016\/j.artint.2026.104586_bib0006","first-page":"923","article-title":"Safe multi-agent pathfinding with time uncertainty","volume":"70","author":"Shahar","year":"2021","journal-title":"J. Artif. Intell. Res."},{"key":"10.1016\/j.artint.2026.104586_bib0007","series-title":"Proceedings of the 27th International Conference on Automated Planning and Scheduling (ICAPS)","first-page":"577","article-title":"Path planning for multiple agents under uncertainty","author":"Wagner","year":"2017"},{"key":"10.1016\/j.artint.2026.104586_bib0008","series-title":"Proceedings of the 30th International Conference on Automated Planning and Scheduling (ICAPS)","first-page":"29","article-title":"Probabilistic robust multi-agent path finding","author":"Atzmon","year":"2020"},{"key":"10.1016\/j.artint.2026.104586_bib0009","series-title":"Proceedings of the 31st AAAI Conference on Artificial Intelligence","first-page":"3605","article-title":"Multi-agent path finding with delay probabilities","author":"Ma","year":"2017"},{"issue":"4","key":"10.1016\/j.artint.2026.104586_bib0010","doi-asserted-by":"crossref","first-page":"2720","DOI":"10.1109\/TRO.2023.3258690","article-title":"Offline time-independent multiagent path planning","volume":"39","author":"Okumura","year":"2023","journal-title":"IEEE Trans. Rob."},{"key":"10.1016\/j.artint.2026.104586_bib0011","series-title":"Proceedings of the 26th International Conference on Automated Planning and Scheduling (ICAPS)","first-page":"477","article-title":"Multi-agent path finding with kinematic constraints","author":"H\u00f6nig","year":"2016"},{"issue":"2","key":"10.1016\/j.artint.2026.104586_bib0012","doi-asserted-by":"crossref","first-page":"1125","DOI":"10.1109\/LRA.2019.2894217","article-title":"Persistent and robust execution of MAPF schedules in warehouses","volume":"4","author":"H\u00f6nig","year":"2019","journal-title":"IEEE Rob. Autom. Lett."},{"key":"10.1016\/j.artint.2026.104586_bib0013","unstructured":"A. Berndt, N.V. Duijkeren, L. Palmieri, T. Keviczky, A feedback scheme to reorder a multi-agent execution schedule by persistently optimizing a switchable action dependency graph, (2020). arXiv preprint arXiv: 2010.05254."},{"key":"10.1016\/j.artint.2026.104586_bib0014","series-title":"Proceedings of the International FLAIRS Conference","article-title":"Deadlock-free online plan repair in multi-robot coordination with disturbances","volume":"34","author":"Coskun","year":"2021"},{"key":"10.1016\/j.artint.2026.104586_bib0015","series-title":"Proceedings of the 16th International Symposium on Combinatorial Search (SoCS)","first-page":"175","article-title":"A fast rescheduling algorithm for real-time multi-robot coordination [extended abstract]","author":"Paul","year":"2023"},{"key":"10.1016\/j.artint.2026.104586_bib0016","series-title":"Proceedings of the 34th International Conference on Automated Planning and Scheduling (ICAPS)","first-page":"201","article-title":"A real-time rescheduling algorithm for multi-robot plan execution","author":"Feng","year":"2024"},{"key":"10.1016\/j.artint.2026.104586_bib0017","series-title":"Proceedings of the 16th International Symposium on Combinatorial Search (SoCS)","first-page":"185","article-title":"Multi-agent pathfinding with predefined paths: to wait, or not to wait, that is the question [extended abstract]","author":"\u0160vancara","year":"2023"},{"key":"10.1016\/j.artint.2026.104586_bib0018","series-title":"Proceedings of the 17th International Symposium on Combinatorial Search (SoCS)","first-page":"37","article-title":"Introducing delays in multi agent path finding","author":"Kottinger","year":"2024"},{"key":"10.1016\/j.artint.2026.104586_bib0019","series-title":"Proceedings of the 38th AAAI Conference on Artificial Intelligence","first-page":"17559","article-title":"Bidirectional temporal plan graph: enabling switchable passing orders for more efficient multi-agent path finding plan execution","author":"Su","year":"2024"},{"key":"10.1016\/j.artint.2026.104586_bib0020","series-title":"Proceedings of the 34th International Conference on Automated Planning and Scheduling (ICAPS)","first-page":"707","article-title":"Planning and execution in multi-agent path finding: models and algorithms","author":"Zhang","year":"2024"},{"key":"10.1016\/j.artint.2026.104586_bib0021","series-title":"Proceedings of the 39th AAAI Conference on Artificial Intelligence","first-page":"23387","article-title":"Concurrent planning and execution in lifelong multi-agent path finding with delay probabilities","author":"Zhang","year":"2025"},{"key":"10.1016\/j.artint.2026.104586_bib0022","series-title":"Proceedings of the 35th AAAI Conference on Artificial Intelligence","first-page":"11299","article-title":"Time-independent planning for multiple moving agents","author":"Okumura","year":"2021"},{"issue":"3","key":"10.1016\/j.artint.2026.104586_bib0023","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/S0377-2217(01)00338-1","article-title":"Job-shop scheduling with blocking and no-wait constraints","volume":"143","author":"Mascis","year":"2002","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.artint.2026.104586_bib0024","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/j.artint.2026.104586_bib0025","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.dam.2018.05.011","article-title":"Selecting and covering colored points","volume":"250","author":"Arkin","year":"2018","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.artint.2026.104586_bib0026","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1002\/net.3230200705","article-title":"Predicting deadlock in store-and-forward networks","volume":"20","author":"Arbib","year":"1990","journal-title":"Networks"},{"issue":"2","key":"10.1016\/j.artint.2026.104586_bib0027","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.artint.2026.104586_bib0028","series-title":"Proceedings of the 35th AAAI Conference on Artificial Intelligence","first-page":"12353","article-title":"EECBS: a bounded-suboptimal search for multi-agent path finding","author":"Li","year":"2021"},{"key":"10.1016\/j.artint.2026.104586_bib0029","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":"Artif. Intell."}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370226001128?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370226001128?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T00:26:37Z","timestamp":1781915197000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370226001128"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":29,"alternative-id":["S0004370226001128"],"URL":"https:\/\/doi.org\/10.1016\/j.artint.2026.104586","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Robust and effective multi-agent path execution with timing uncertainty","name":"articletitle","label":"Article Title"},{"value":"Artificial Intelligence","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.artint.2026.104586","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":"104586"}}