{"id":"https://openalex.org/W2965068353","doi":"https://doi.org/10.1609/socs.v10i1.18471","title":"Probabilistic Robust Multi-Agent Path Finding","display_name":"Probabilistic Robust Multi-Agent Path Finding","alternate_titles":[],"publication_year":2021,"publication_date":"2021-09-01","ids":{"openalex":"https://openalex.org/W2965068353","doi":"https://doi.org/10.1609/socs.v10i1.18471","mag":"2965068353"},"language":"en","primary_location":{"id":"doi:10.1609/socs.v10i1.18471","doi":"https://doi.org/10.1609/socs.v10i1.18471","is_oa":true,"landing_page_url":"https://doi.org/10.1609/socs.v10i1.18471","pdf_url":"https://ojs.aaai.org/index.php/SOCS/article/download/18471/18262","source":{"id":"https://openalex.org/S4387284494","display_name":"Proceedings of the International Symposium on Combinatorial Search","issn_l":"2832-9163","issn":["2832-9163","2832-9171"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":["jufo-1"],"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Symposium on Combinatorial Search","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W2965068353"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://ojs.aaai.org/index.php/SOCS/article/download/18471/18262","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025220652","display_name":"Dor Atzmon","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Dor Atzmon","raw_affiliation_strings":["Ben-Gurion University of the Negev"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011195666","display_name":"Ariel Felner","orcid":"https://orcid.org/0000-0003-0065-2757","observed_orcids":["https://orcid.org/0000-0003-0065-2757"]},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Ariel Felner","raw_affiliation_strings":["Ben-Gurion University of the Negev"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085970582","display_name":"Roni Stern","orcid":"https://orcid.org/0000-0003-0043-8179","observed_orcids":["https://orcid.org/0000-0003-0043-8179"]},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Roni Stern","raw_affiliation_strings":["Ben-Gurion University of the Negev"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev","institution_ids":["https://openalex.org/I124227911"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I124227911"],"apc_list":null,"apc_paid":null,"fwci":0.2941,"has_fulltext":true,"cited_by_count":7,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.33450646,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":98},"biblio":{"volume":"10","issue":"1","first_page":"162","last_page":"163"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11500","display_name":"Evacuation and Crowd Dynamics","score":0.0,"subfield":{"id":"https://openalex.org/subfields/3311","display_name":"Safety Research"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multi-agent-pathfinding","display_name":"multi-agent path finding","score":0.9929999709129333},{"id":"https://openalex.org/keywords/collision-avoidance","display_name":"collision avoidance","score":0.8360000252723694},{"id":"https://openalex.org/keywords/probabilistic-robustness","display_name":"probabilistic robustness","score":0.7480000257492065},{"id":"https://openalex.org/keywords/conflict-based-search","display_name":"conflict-based search","score":0.7639999985694885},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"greedy algorithm","score":0.746999979019165},{"id":"https://openalex.org/keywords/combinatorial-search","display_name":"combinatorial search","score":0.6420000195503235}],"concepts":[{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.7053184509277344},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6570380926132202},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6470110416412354},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6360100507736206},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6010802984237671},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5904513001441956},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5873549580574036},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5170803070068359},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3254619240760803},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.30237460136413574},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2916908860206604},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1952109932899475},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.13243815302848816},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1609/socs.v10i1.18471","doi":"https://doi.org/10.1609/socs.v10i1.18471","is_oa":true,"landing_page_url":"https://doi.org/10.1609/socs.v10i1.18471","pdf_url":"https://ojs.aaai.org/index.php/SOCS/article/download/18471/18262","source":{"id":"https://openalex.org/S4387284494","display_name":"Proceedings of the International Symposium on Combinatorial Search","issn_l":"2832-9163","issn":["2832-9163","2832-9171"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":["jufo-1"],"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Symposium on Combinatorial Search","raw_type":"journal-article"},{"id":"pmh:oai:ojs.aaai.org:article/6642","doi":null,"is_oa":true,"landing_page_url":"https://ojs.aaai.org/index.php/ICAPS/article/view/6642","pdf_url":null,"source":{"id":"https://openalex.org/S4306400155","display_name":"AAAI Publications (The Association for the Advancement of Artificial Intelligence (AAAI))","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801652627","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/I2801652627"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the International Conference on Automated Planning and Scheduling; Vol. 30 (2020): Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling; 29-37","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1609/socs.v10i1.18471","doi":"https://doi.org/10.1609/socs.v10i1.18471","is_oa":true,"landing_page_url":"https://doi.org/10.1609/socs.v10i1.18471","pdf_url":"https://ojs.aaai.org/index.php/SOCS/article/download/18471/18262","source":{"id":"https://openalex.org/S4387284494","display_name":"Proceedings of the International Symposium on Combinatorial Search","issn_l":"2832-9163","issn":["2832-9163","2832-9171"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":["jufo-1"],"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Symposium on Combinatorial Search","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G5118135302","display_name":"CPS: Small: Novel Algorithmic Techniques for Drone Flight Planning on a Large Scale","funder_award_id":"1837779","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G542566607","display_name":"NSF-BSF:RI:Small:Collaborative Research:Next-Generation Multi-Agent Path Finding Algorithms","funder_award_id":"1817189","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6861119503","display_name":"S&AS: FND: Long-Term Planning and Robust Plan Execution for Multi-Robot Systems","funder_award_id":"1724392","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8670862917","display_name":"Development of a Modular, Scalable, and Extensible Model-Based Systems Engineering Advanced Manufacturing Curriculum","funder_award_id":"1935712","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8929783401","display_name":"NSF-BSF:RI:Small:Collaborative Research:Next-Generation Multi-Agent Path Finding Algorithms","funder_award_id":"1815660","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8978827964","display_name":"RI: Medium: Collaborative Research: Experience-Based Planning: A Framework for Lifelong Planning","funder_award_id":"1409987","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2965068353.pdf","grobid_xml":"https://content.openalex.org/works/W2965068353.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W126122642","https://openalex.org/W1588299616","https://openalex.org/W1973396716","https://openalex.org/W1989407213","https://openalex.org/W2123030512","https://openalex.org/W2135125135","https://openalex.org/W2191404279","https://openalex.org/W2584529157","https://openalex.org/W2728614645","https://openalex.org/W2730530972","https://openalex.org/W2757968903","https://openalex.org/W2808601890","https://openalex.org/W2809708768","https://openalex.org/W2949992533","https://openalex.org/W2965682046","https://openalex.org/W2966875457","https://openalex.org/W4293253503","https://openalex.org/W4312258073","https://openalex.org/W6740625665"],"related_works":["https://openalex.org/W2728614645","https://openalex.org/W3197146207","https://openalex.org/W4312745847","https://openalex.org/W4399157086","https://openalex.org/W7137851601","https://openalex.org/W3011643348","https://openalex.org/W2584529157","https://openalex.org/W4382866708","https://openalex.org/W3183452418","https://openalex.org/W4399261728"],"abstract_inverted_index":{"In":[0],"a":[1,11,15,61,81,95,120,125],"multi-agent":[2],"path-finding":[3],"(MAPF)":[4],"problem,":[5],"the":[6,44,85,130,149,153],"task":[7,57],"is":[8,58,64,92,109,145],"to":[9,23,37,59,67,148],"find":[10,60],"plan":[12,62,82,108],"for":[13,79],"moving":[14],"set":[16],"of":[17,43,152],"agents":[18],"from":[19],"their":[20,24],"initial":[21],"locations":[22],"goals":[25],"without":[26],"collisions.":[27],"Following":[28],"this":[29],"plan,":[30],"however,":[31],"may":[32,52,73],"not":[33],"be":[34,53],"possible":[35],"due":[36],"unexpected":[38,71],"events":[39],"that":[40,47,63,87,103,137,144],"delay":[41],"some":[42],"agents.":[45],"Guaranteeing":[46],"collisions":[48,89],"will":[49,90],"never":[50],"occur":[51,91],"impossible.":[54],"An":[55],"important":[56],"very":[65],"likely":[66],"succeed,":[68],"even":[69],"though":[70],"delays":[72],"occur.":[74],"We":[75,101],"propose":[76,124],"an":[77,105,115],"algorithm":[78,127],"finding":[80,104,114],"in":[83],"which":[84],"probability":[86],"no":[88],"at":[93],"least":[94],"given":[96],"parameter":[97],"p":[98],"(p-robust":[99],"plan).":[100],"show":[102,136],"optimal":[106,116,150],"p-robust":[107,140],"significantly":[110],"more":[111],"difficult":[112],"than":[113],"standard":[117],"plan.":[118],"As":[119],"practical":[121],"solution,":[122],"we":[123],"greedy":[126],"based":[128],"on":[129],"Conflict-Based":[131],"Search":[132],"framework.":[133],"Our":[134],"experiments":[135],"it":[138],"finds":[139],"plans":[141],"with":[142],"cost":[143,151],"relatively":[146],"close":[147],"standard,":[154],"non-robust":[155],"plans.":[156]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2965068353","counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2019-08-13T00:00:00"}
