{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:45:58Z","timestamp":1742913958949,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030661953"},{"type":"electronic","value":"9783030661960"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-66196-0_14","type":"book-chapter","created":{"date-parts":[[2021,1,14]],"date-time":"2021-01-14T04:22:38Z","timestamp":1610598158000},"page":"302-321","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Towards Smart Behavior of Agents in Evacuation Planning Based on Local Cooperative Path Finding"],"prefix":"10.1007","author":[{"given":"R\u00f3bert","family":"Selvek","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7200-0542","authenticated-orcid":false,"given":"Pavel","family":"Surynek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,14]]},"reference":[{"key":"14_CR1","unstructured":"Arbib, C., Muccini, H., Moghaddam, M.T.: Applying a network flow model to quick and safe evacuation of people from a building: a real case. In: Proceedings of the GEOSAFE Workshop on Robust Solutions for Fire Fighting, RSFF 2018, L\u2019Aquila, Italy, 19\u201320 July 2018, pp. 50\u201361 (2018)"},{"issue":"1","key":"14_CR2","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1002\/net.20196","volume":"51","author":"A Bompadre","year":"2008","unstructured":"Bompadre, A., Orlin, J.B.: A simple method for improving the primal simplex method for the multicommodity flow problem. Networks 51(1), 63\u201377 (2008)","journal-title":"Networks"},{"issue":"1","key":"14_CR3","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s10107-016-0991-9","volume":"157","author":"V Cacchiani","year":"2016","unstructured":"Cacchiani, V., J\u00fcnger, M., Liers, F., Lodi, A., Schmidt, D.R.: Single-commodity robust network design with finite and hose demand sets. Math. Program. 157(1), 297\u2013342 (2016)","journal-title":"Math. Program."},{"issue":"1","key":"14_CR4","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/BF02993491","volume":"18","author":"LG Chalmet","year":"1982","unstructured":"Chalmet, L.G., Francis, R.L., Saunders, P.B.: Network models for building evacuation. Fire Technol. 18(1), 90\u2013113 (1982)","journal-title":"Fire Technol."},{"key":"14_CR5","unstructured":"Craven, P.V.: The python arcade library, March 2019. http:\/\/arcade.academy"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Felner, A., et al.: Adding heuristics to conflict-based search for multi-agent path finding. In: Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, ICAPS 2018, Delft, The Netherlands, 24\u201329 June 2018, pp. 83\u201387 (2018)","DOI":"10.1609\/icaps.v28i1.13883"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"217","DOI":"10.2498\/cit.1000873","volume":"17","author":"C Foudil","year":"2009","unstructured":"Foudil, C., Djedi, N., Sanza, C., Duthen, Y.: Path finding and collision avoidance in crowd simulation. CIT 17, 217\u2013228 (2009)","journal-title":"CIT"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Ghallab, M., Nau, D.S., Traverso, P.: Automated Planning and Acting. Cambridge University Press (2016). http:\/\/www.cambridge.org\/de\/academic\/subjects\/computer-science\/artificial-intelligence-and-natural-language-processing\/automated-planning-and-acting?format=HB","DOI":"10.1017\/CBO9781139583923"},{"issue":"4","key":"14_CR9","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"AV Goldberg","year":"1988","unstructured":"Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM 35(4), 921\u2013940 (1988). https:\/\/doi.org\/10.1145\/48014.61051","journal-title":"J. ACM"},{"key":"14_CR10","unstructured":"Hagberg, A.A., Schult, D.A., Swart, P.J.: Exploring network structure, dynamics, and function using networkx. In: Proceedings of the 7th Python in Science Conference, pp. 11\u201315 (2008)"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-319-15702-3_23","volume-title":"Intelligent Information and Database Systems","author":"M Hudziak","year":"2015","unstructured":"Hudziak, M., Pozniak-Koszalka, I., Koszalka, L., Kasprzak, A.: Comparison of algorithms for multi-agent pathfinding in crowded environment. In: Nguyen, N.T., Trawi\u0144ski, B., Kosala, R. (eds.) ACIIDS 2015. LNCS (LNAI), vol. 9011, pp. 229\u2013238. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-15702-3_23"},{"key":"14_CR12","unstructured":"Korf, R.E., Taylor, L.A.: Finding optimal solutions to the twenty-four puzzle. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, AAAI 1996, IAAI 1996, Portland, Oregon, USA, 4\u20138 August 1996, vol. 2, pp. 1202\u20131207 (1996)"},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1016\/j.ejor.2018.01.050","volume":"269","author":"HA Kurdi","year":"2018","unstructured":"Kurdi, H.A., Al-Megren, S., Althunyan, R., Almulifi, A.: Effect of exit placement on evacuation plans. Eur. J. Oper. Res. 269(2), 749\u2013759 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Liu, C., li Mao, Z., min Fu, Z.: Emergency evacuation model and algorithm in the building with several exits. Procedia Eng. 135, 12\u201318 (2016). 2015 International Conference on Performance-based Fire and Fire Protection Engineering (ICPFFPE 2015)","DOI":"10.1016\/j.proeng.2016.01.072"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Liu, Z., Wu, B., Lin, H.: Coordinated robot-assisted human crowd evacuation. In: 57th IEEE Conference on Decision and Control, CDC 2018, Miami, FL, USA, 17\u201319 December 2018, pp. 4481\u20134486 (2018)","DOI":"10.1109\/CDC.2018.8619480"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-26626-8_1","volume-title":"Combinatorial Optimization and Applications","author":"G Mishra","year":"2015","unstructured":"Mishra, G., Mazumdar, S., Pal, A.: Improved algorithms for the evacuation route planning problem. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, D.-Z. (eds.) COCOA 2015. LNCS, vol. 9486, pp. 3\u201319. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26626-8_1"},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.endm.2012.10.009","volume":"39","author":"J S\u00e1nchez-Oro","year":"2012","unstructured":"S\u00e1nchez-Oro, J., Duarte, A.: An experimental comparison of variable neighborhood search variants for the minimization of the vertex-cut in layout problems. Electron. Not. Discrete Math. 39, 59\u201366 (2012)","journal-title":"Electron. Not. Discrete Math."},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Selvek, R., Surynek, P.: Engineering smart behavior in evacuation planning using local cooperative path finding algorithms and agent-based simulations. In: Proceedings of the 11th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management, IC3K 2019, Volume 2: KEOD, Vienna, Austria, 17\u201319 September 2019, pp. 137\u2013143 (2019)","DOI":"10.5220\/0008071501370143"},{"key":"14_CR19","unstructured":"Sharma, S.: AVATARSIM: a multi-agent system for emergency evacuation simulation. In: 17th International Conference on Software Engineering and Data Engineering (SEDE-2008), 30 June\u20132 July 2008, Omni Los Angeles Hotel at California Plaza, Los Angeles, California, USA, Proceedings. pp. 163\u2013167 (2008)"},{"issue":"12","key":"14_CR20","doi-asserted-by":"publisher","first-page":"2253","DOI":"10.1080\/13658816.2012.719624","volume":"26","author":"S Shekhar","year":"2012","unstructured":"Shekhar, S., et al.: Experiences with evacuation route planning algorithms. Int. J. Geogr. Inf. Sci. 26(12), 2253\u20132265 (2012)","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Silver, D.: Cooperative pathfinding. In: Young, R.M., Laird, J.E. (eds.) Proceedings of the First Artificial Intelligence and Interactive Digital Entertainment Conference, 1\u20135 June 2005, Marina del Rey, California, USA, pp. 117\u2013122. AAAI Press (2005)","DOI":"10.1609\/aiide.v1i1.18726"},{"key":"14_CR22","unstructured":"Silver, D.: Cooperative pathfinding. In: AI Game Programming Wisdom, vol. 3 (2006)"},{"key":"14_CR23","unstructured":"Surynek, P.: Reduced time-expansion graphs and goal decomposition for solving cooperative path finding sub-optimally. In: IJCAI, pp. 1916\u20131922 (2015)"},{"issue":"2","key":"14_CR24","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1111\/coin.12002","volume":"30","author":"P Surynek","year":"2014","unstructured":"Surynek, P.: Solving abstract cooperative path-finding in densely populated environments. Comput. Intell. 30(2), 402\u2013450 (2014)","journal-title":"Comput. Intell."},{"key":"14_CR25","first-page":"55","volume":"42","author":"K Wang","year":"2011","unstructured":"Wang, K., Botea, A.: MAPP: a scalable multi-agent path planning algorithm with tractability and completeness guarantees. JAIR 42, 55\u201390 (2011)","journal-title":"JAIR"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Yu, J., LaValle, S.M.: Multi-agent path planning and network flow. In: Algorithmic Foundations of Robotics X - Proceedings of the Tenth Workshop on the Algorithmic Foundations of Robotics, WAFR 2012, pp. 157\u2013173 (2012)","DOI":"10.1007\/978-3-642-36279-8_10"},{"key":"14_CR27","unstructured":"Yu, J., LaValle, S.M.: Optimal multi-robot path planning on graphs: structure and computational complexity. CoRR abs\/1507.03289 (2015). http:\/\/arxiv.org\/abs\/1507.03289"}],"container-title":["Communications in Computer and Information Science","Knowledge Discovery, Knowledge Engineering and Knowledge Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-66196-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,11]],"date-time":"2022-12-11T14:14:00Z","timestamp":1670768040000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-66196-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030661953","9783030661960"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-66196-0_14","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IC3K","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Knowledge Discovery, Knowledge Engineering, and Knowledge Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ic3k2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic3k.org\/?y=2019","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"PRIMORIS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"220","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}