{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T23:05:01Z","timestamp":1784243101371,"version":"3.55.0"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032250285","type":"print"},{"value":"9783032250292","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-25029-2_15","type":"book-chapter","created":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T22:11:21Z","timestamp":1784239881000},"page":"347-368","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Holistic Architecture for\u00a0Monitoring and\u00a0Optimization of\u00a0Robust Multi-agent Path Finding Plan Execution"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7380-8495","authenticated-orcid":false,"given":"David","family":"Zahr\u00e1dka","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-8535-8439","authenticated-orcid":false,"given":"Denisa","family":"Mu\u017e\u00edkov\u00e1","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8809-3587","authenticated-orcid":false,"given":"David","family":"Woller","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0997-5889","authenticated-orcid":false,"given":"Miroslav","family":"Kulich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6275-6773","authenticated-orcid":false,"given":"Ji\u0159\u00ed","family":"\u0160vancara","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6717-8175","authenticated-orcid":false,"given":"Roman","family":"Bart\u00e1k","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,1]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","unstructured":"Atzmon, D., Stern, R., Felner, A., Wagner, G., Bart\u00e1k, R., Zhou, N.F.: Robust multi-agent path finding and executing. J. Artif. Intell. Res. 67, 549\u2013579 (2020). https:\/\/doi.org\/10.1613\/jair.1.11734, https:\/\/jair.org\/index.php\/jair\/article\/view\/11734","DOI":"10.1613\/jair.1.11734"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Barer, M., Sharon, G., Stern, R., Felner, A.: Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem. In: Seventh Annual Symposium on Combinatorial Search (2014)","DOI":"10.3233\/978-1-61499-419-0-961"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Bart\u00e1k, R., Zhou, N.F., Stern, R., Boyarski, E., Surynek, P.: Modeling and solving the multi-agent pathfinding problem in Picat. In: IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI), pp. 959\u2013966 (2017)","DOI":"10.1109\/ICTAI.2017.00147"},{"key":"15_CR4","unstructured":"Berndt, A., Duijkeren, N.V., Palmieri, L., Keviczky, T.: A feedback scheme to reorder a multi-agent execution schedule by persistently optimizing a switchable action dependency graph. CoRR arXiv:2010.05254v1 (2020)"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"1356","DOI":"10.1109\/TRO.2023.3344051","volume":"40","author":"A Berndt","year":"2024","unstructured":"Berndt, A., Duijkeren, N.V., Palmieri, L., Kleiner, A., Keviczky, T.: Receding horizon re-ordering of multi-agent execution schedules. IEEE Trans. Rob. 40, 1356\u20131372 (2024). https:\/\/doi.org\/10.1109\/TRO.2023.3344051","journal-title":"IEEE Trans. Rob."},{"key":"15_CR6","doi-asserted-by":"publisher","unstructured":"Chen, Z., Harabor, D.D., Li, J., Stuckey, P.J.: Symmetry breaking for k-robust multi-agent path finding. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, pp. 12267\u201312274 (2021). https:\/\/doi.org\/10.1609\/aaai.v35i14.17456, https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/view\/17456","DOI":"10.1609\/aaai.v35i14.17456"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1613\/jair.2502","volume":"31","author":"K Dresner","year":"2008","unstructured":"Dresner, K., Stone, P.: A multiagent approach to autonomous intersection management. J. Artif. Intell. Res. (JAIR) 31, 591\u2013656 (2008)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Erdem, E., Kisa, D.G., Oztok, U., Sch\u00fcller, P.: A general formal framework for pathfinding problems with multiple agents. In: Twenty-Seventh AAAI Conference on Artificial Intelligence (2013)","DOI":"10.1609\/aaai.v27i1.8592"},{"key":"15_CR9","doi-asserted-by":"publisher","unstructured":"Feng, Y., Paul, A., Chen, Z., Li, J.: A real-time rescheduling algorithm for multi-robot plan execution. In: Proceedings of the International Conference on Automated Planning and Scheduling, vol. 34, pp. 201\u2013209 (2024). https:\/\/doi.org\/10.1609\/ICAPS.V34I1.31477, https:\/\/ojs.aaai.org\/index.php\/ICAPS\/article\/view\/31477","DOI":"10.1609\/ICAPS.V34I1.31477"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1007\/S10514-017-9673-6","volume":"42","author":"J Gregoire","year":"2017","unstructured":"Gregoire, J., \u010c\u00e1p, M., Frazzoli, E.: Locally-optimal multi-robot navigation under delaying disturbances using homotopy constraints. Auton. Robot. 42, 895\u2013907 (2017). https:\/\/doi.org\/10.1007\/S10514-017-9673-6","journal-title":"Auton. Robot."},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"1125","DOI":"10.1109\/LRA.2019.2894217","volume":"4","author":"W H\u00f6nig","year":"2019","unstructured":"H\u00f6nig, W., Kiesel, S., Tinka, A., Durham, J.W., Ayanian, N.: Persistent and robust execution of MAPF schedules in warehouses. IEEE Robot. Autom. Lett. 4, 1125\u20131131 (2019). https:\/\/doi.org\/10.1109\/LRA.2019.2894217","journal-title":"IEEE Robot. Autom. Lett."},{"key":"15_CR12","doi-asserted-by":"publisher","unstructured":"H\u00f6nig, W., Kumar, T.K., Cohen, L., Ma, H., Xu, H., Ayanian, N., Koenig, S.: Multi-agent path finding with kinematic constraints. In: Proceedings of the International Conference on Automated Planning and Scheduling, vol. 26, pp. 477\u2013485 (2016). https:\/\/doi.org\/10.1609\/ICAPS.V26I1.13796, https:\/\/ojs.aaai.org\/index.php\/ICAPS\/article\/view\/13796","DOI":"10.1609\/ICAPS.V26I1.13796"},{"key":"15_CR13","doi-asserted-by":"publisher","unstructured":"Kottinger, J., Geft, T., Almagor, S., Salzman, O., Lahijanian, M.: Introducing delays in multi-agent path finding. In: The International Symposium on Combinatorial Search (2024). https:\/\/doi.org\/10.1609\/socs.v17i1.31540","DOI":"10.1609\/socs.v17i1.31540"},{"key":"15_CR14","doi-asserted-by":"publisher","unstructured":"Lehoux-Lebacque, V., Silander, T., Loiodice, C., Lee, S., Wang, A., Michel, S.: Multi-agent path finding with real robot dynamics and interdependent tasks for automated warehouses. In: ECAI 2024, pp. 4393\u20134401. IOS Press (2024). https:\/\/doi.org\/10.3233\/FAIA241017, https:\/\/ebooks.iospress.nl\/doi\/10.3233\/FAIA241017","DOI":"10.3233\/FAIA241017"},{"key":"15_CR15","doi-asserted-by":"publisher","unstructured":"Li, J., Chen, Z., Harabor, D., Stuckey, P.J., Koenig, S.: Anytime multi-agent path finding via large neighborhood search. In: Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, pp. 4127\u20134135. International Joint Conferences on Artificial Intelligence Organization, Montreal, Canada (2021). https:\/\/doi.org\/10.24963\/ijcai.2021\/568","DOI":"10.24963\/ijcai.2021\/568"},{"key":"15_CR16","doi-asserted-by":"publisher","unstructured":"Li, J., Harabor, D., Stuckey, P.J., Ma, H., Koenig, S.: Symmetry-breaking constraints for grid-based multi-agent path finding. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, no. 01, pp. 6087\u20136095 (2019). https:\/\/doi.org\/10.1609\/aaai.v33i01.33016087","DOI":"10.1609\/aaai.v33i01.33016087"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Li, J., Ruml, W., Koenig, S.: EECBS: a bounded-suboptimal search for multi-agent path finding. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 14, pp. 12353\u201312362 (2021)","DOI":"10.1609\/aaai.v35i14.17466"},{"key":"15_CR18","doi-asserted-by":"publisher","unstructured":"Ma, H., Kumar, T.K., Koenig, S.: Multi-agent path finding with delay probabilities. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 31, pp. 3605\u20133612 (2017). https:\/\/doi.org\/10.1609\/AAAI.V31I1.11035, https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/view\/11035","DOI":"10.1609\/AAAI.V31I1.11035"},{"key":"15_CR19","unstructured":"Morris, R., Pasareanu, C., Luckow, K., Malik, W., Ma, H., Kumar, T., Koenig, S.: Planning, scheduling and monitoring for airport surface operations. In: The Workshops of the Thirtieth AAAI Conference on Artificial Intelligence, pp. 608\u2013614 (2016)"},{"key":"15_CR20","doi-asserted-by":"publisher","unstructured":"Okumura, K.: Improving LaCAM for scalable eventually optimal multi-agent pathfinding. In: Elkind, E. (ed.) Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI-23, pp. 243\u2013251. International Joint Conferences on Artificial Intelligence Organization (2023). https:\/\/doi.org\/10.24963\/ijcai.2023\/28","DOI":"10.24963\/ijcai.2023\/28"},{"key":"15_CR21","doi-asserted-by":"publisher","unstructured":"Phillips, M., Likhachev, M.: SIPP: safe interval path planning for dynamic environments. In: 2011 IEEE International Conference on Robotics and Automation, pp. 5628\u20135635 (2011). https:\/\/doi.org\/10.1109\/ICRA.2011.5980306","DOI":"10.1109\/ICRA.2011.5980306"},{"key":"15_CR22","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, N.R.: Conflict-based search for optimal multi-agent pathfinding. Artif. Intell. 219, 40\u201366 (2015)","journal-title":"Artif. Intell."},{"key":"15_CR23","doi-asserted-by":"publisher","unstructured":"Silver, D.: Cooperative pathfinding. In: Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, vol. 1, no. 1, pp. 117\u2013122 (2005). https:\/\/doi.org\/10.1609\/aiide.v1i1.18726","DOI":"10.1609\/aiide.v1i1.18726"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Stern, R., et al.: Multi-agent pathfinding: definitions, variants, and benchmarks. In: Proceedings of the International Symposium on Combinatorial Search, vol.\u00a010, pp. 151\u2013158 (2019)","DOI":"10.1609\/socs.v10i1.18510"},{"key":"15_CR25","doi-asserted-by":"publisher","unstructured":"Su, Y., Veerapaneni, R., Li, J.: Bidirectional temporal plan graph: enabling switchable passing orders for more efficient multi-agent path finding plan execution. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 38, pp. 17559\u201317566 (2024). https:\/\/doi.org\/10.1609\/AAAI.V38I16.29706, https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/view\/29706","DOI":"10.1609\/AAAI.V38I16.29706"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Surynek, P.: An optimization variant of multi-robot path planning is intractable. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 24, pp. 1261\u20131263 (2010)","DOI":"10.1609\/aaai.v24i1.7767"},{"key":"15_CR27","doi-asserted-by":"publisher","unstructured":"Surynek, P.: Bounded sub-optimal multi-robot path planning using satisfiability modulo theory (SMT) approach. In: 2020 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 11631\u201311637. IEEE, Las Vegas, NV, USA (2020). https:\/\/doi.org\/10.1109\/IROS45743.2020.9341047","DOI":"10.1109\/IROS45743.2020.9341047"},{"key":"15_CR28","doi-asserted-by":"publisher","unstructured":"Wagner, A., Veerapaneni, R., Likhachev, M.: Minimizing coordination in multi-agent path finding with dynamic execution. In: Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, vol. 18, pp. 61\u201369 (2022). https:\/\/doi.org\/10.1609\/AIIDE.V18I1.21948, https:\/\/ojs.aaai.org\/index.php\/AIIDE\/article\/view\/21948","DOI":"10.1609\/AIIDE.V18I1.21948"},{"key":"15_CR29","doi-asserted-by":"publisher","unstructured":"Wang, J., Olson, E.: AprilTag 2: efficient and robust fiducial detection. In: 2016 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 4193\u20134198 (2016). https:\/\/doi.org\/10.1109\/IROS.2016.7759617, https:\/\/ieeexplore.ieee.org\/abstract\/document\/7759617","DOI":"10.1109\/IROS.2016.7759617"},{"key":"15_CR30","doi-asserted-by":"crossref","unstructured":"Wu, Y., Veerapaneni, R., Li, J., Likhachev, M.: From space-time to space-order: directly planning a temporal planning graph by redefining CBS. arXiv:2404.15137 (2024)","DOI":"10.1609\/socs.v17i1.31587"},{"key":"15_CR31","unstructured":"Wurman, P.R., D\u2019Andrea, R., Mountz, M., Mountz, M.: Coordinating hundreds of cooperative, autonomous vehicles in warehouses. AI Mag. 29, 9\u201320 (2008)"},{"key":"15_CR32","doi-asserted-by":"crossref","unstructured":"Yu, J., LaValle, S.M.: Optimal multirobot path planning on graphs: complete algorithms and effective heuristics. IEEE Trans. Robot. 99, 1\u201315 (2016)","DOI":"10.1109\/LRA.2015.2503143"},{"key":"15_CR33","unstructured":"Zahr\u00e1dka, D., Kubi\u0161ta, D., Kulich, M.: Solving robust execution of multi-agent pathfinding plans as a scheduling problem. In: Planning and Robotics, ICAPS 2023 Workshop (2023)"},{"key":"15_CR34","doi-asserted-by":"publisher","unstructured":"Zahr\u00e1dka, D., Mu\u017e\u00edkov\u00e1, D., Kulich, M., \u0160vancara, J., Bart\u00e1k, R.: Towards holistic approach to robust execution of MAPF plans. In: Proceedings of the 17th International Conference on Agents and Artificial Intelligence, vol.\u00a01, pp. 624\u2013631. SCITEPRESS - Science and Technology Publications, Porto, Portugal (2025). https:\/\/doi.org\/10.5220\/0013319700003890, https:\/\/www.scitepress.org\/DigitalLibrary\/Link.aspx?doi=10.5220\/0013319700003890","DOI":"10.5220\/0013319700003890"}],"container-title":["Lecture Notes in Computer Science","Agents and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-25029-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T22:11:23Z","timestamp":1784239883000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25029-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032250285","9783032250292"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25029-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"1 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICAART","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Agents and Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 February 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 February 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icaart2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icaart.scitevents.org\/?y=2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}