{"id":"https://openalex.org/W2964975113","doi":"https://doi.org/10.24963/ijcai.2019/164","title":"Unifying Search-based and Compilation-based Approaches to Multi-agent Path Finding through Satisfiability Modulo Theories","display_name":"Unifying Search-based and Compilation-based Approaches to Multi-agent Path Finding through Satisfiability Modulo Theories","publication_year":2019,"publication_date":"2019-07-28","ids":{"openalex":"https://openalex.org/W2964975113","doi":"https://doi.org/10.24963/ijcai.2019/164","mag":"2964975113"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2019/164","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2019/164","pdf_url":"https://www.ijcai.org/proceedings/2019/0164.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.ijcai.org/proceedings/2019/0164.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031732925","display_name":"Pavel Surynek","orcid":"https://orcid.org/0000-0001-7200-0542"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Pavel Surynek","raw_affiliation_strings":["FIT, Czech Technical University in Prague, Th\u00e1kurova 9, 160 00 Praha 6, Czechia"],"affiliations":[{"raw_affiliation_string":"FIT, Czech Technical University in Prague, Th\u00e1kurova 9, 160 00 Praha 6, Czechia","institution_ids":["https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5031732925"],"corresponding_institution_ids":["https://openalex.org/I44504214"],"apc_list":null,"apc_paid":null,"fwci":4.3931,"has_fulltext":false,"cited_by_count":57,"citation_normalized_percentile":{"value":0.95622429,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1177","last_page":"1183"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9969000220298767,"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"}},{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9962999820709229,"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/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.9075188040733337},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.718887448310852},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6866834163665771},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.6394155025482178},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5703123807907104},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5644637942314148},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5375281572341919},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5059277415275574},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.44338929653167725},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4388892352581024},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.4218725562095642},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4009140431880951},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26149609684944153},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23235997557640076},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.20945894718170166},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12049949169158936}],"concepts":[{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.9075188040733337},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.718887448310852},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6866834163665771},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.6394155025482178},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5703123807907104},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5644637942314148},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5375281572341919},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5059277415275574},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.44338929653167725},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4388892352581024},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.4218725562095642},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4009140431880951},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26149609684944153},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23235997557640076},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.20945894718170166},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12049949169158936},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.24963/ijcai.2019/164","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2019/164","pdf_url":"https://www.ijcai.org/proceedings/2019/0164.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2019/164","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2019/164","pdf_url":"https://www.ijcai.org/proceedings/2019/0164.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.4099999964237213,"display_name":"Reduced inequalities"}],"awards":[{"id":"https://openalex.org/G5101553464","display_name":null,"funder_award_id":"19-17966S","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"}],"funders":[{"id":"https://openalex.org/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2964975113.pdf","grobid_xml":"https://content.openalex.org/works/W2964975113.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W78552530","https://openalex.org/W93645818","https://openalex.org/W629520538","https://openalex.org/W964554611","https://openalex.org/W1551562380","https://openalex.org/W1553665348","https://openalex.org/W1588299616","https://openalex.org/W1973396716","https://openalex.org/W1986164452","https://openalex.org/W1989407213","https://openalex.org/W2015135969","https://openalex.org/W2021486492","https://openalex.org/W2048036606","https://openalex.org/W2135125135","https://openalex.org/W2135939055","https://openalex.org/W2137514195","https://openalex.org/W2149951504","https://openalex.org/W2164322797","https://openalex.org/W2167979940","https://openalex.org/W2241553860","https://openalex.org/W2486979985","https://openalex.org/W2575733488","https://openalex.org/W2604459184","https://openalex.org/W2739829010","https://openalex.org/W2809708768","https://openalex.org/W2905054495","https://openalex.org/W2914296650","https://openalex.org/W4206807714"],"related_works":["https://openalex.org/W2322595442","https://openalex.org/W3124056051","https://openalex.org/W2095156144","https://openalex.org/W3176904788","https://openalex.org/W2963892318","https://openalex.org/W2792070629","https://openalex.org/W2030218034","https://openalex.org/W2578463151","https://openalex.org/W21597398","https://openalex.org/W2806052477"],"abstract_inverted_index":{"We":[0,38,118],"unify":[1],"search-based":[2],"and":[3,125],"compilation-based":[4],"approaches":[5],"to":[6,21,28],"multi-agent":[7],"path":[8],"finding":[9],"(MAPF)":[10],"through":[11],"satisfiability":[12],"modulo":[13],"theories":[14],"(SMT).":[15],"The":[16],"task":[17],"in":[18,24,52],"MAPF":[19,50,68],"is":[20],"navigate":[22],"agents":[23],"an":[25],"undirected":[26],"graph":[27],"given":[29],"goal":[30],"vertices":[31],"so":[32],"that":[33],"they":[34],"do":[35],"not":[36,107],"collide.":[37],"rephrase":[39],"Conflict-Based":[40],"Search":[41],"(CBS),":[42],"one":[43],"of":[44,55,76],"the":[45,53,71,79,82,86,93,110,115],"state-of-the-art":[46],"algorithms":[47],"for":[48],"optimal":[49,67],"solving,":[51],"terms":[54],"SMT.":[56],"This":[57],"idea":[58],"combines":[59],"SAT-based":[60,66],"solving":[61],"known":[62],"from":[63],"MDD-SAT,":[64],"a":[65,89,97],"solver,":[69],"at":[70,78,109],"low-level":[72],"with":[73,96,122],"conflict":[74],"elimination":[75],"CBS":[77,84],"high-level.":[80],"Where":[81],"standard":[83],"branches":[85],"search":[87],"after":[88],"conflict,":[90],"we":[91],"refine":[92],"propositional":[94,116],"model":[95],"disjunctive":[98],"constraint.":[99],"Our":[100],"novel":[101],"algorithm":[102],"called":[103],"SMT-CBS":[104,121],"hence":[105],"does":[106],"branch":[108],"high-level":[111],"but":[112],"incrementally":[113],"extends":[114],"model.":[117],"experimentally":[119],"compare":[120],"CBS,":[123],"ICBS,":[124],"MDD-SAT.":[126]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":19},{"year":2020,"cited_by_count":13},{"year":2019,"cited_by_count":3}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}