{"id":"https://openalex.org/W3197571367","doi":"https://doi.org/10.1609/socs.v12i1.18567","title":"DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies","display_name":"DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies","publication_year":2021,"publication_date":"2021-07-21","ids":{"openalex":"https://openalex.org/W3197571367","doi":"https://doi.org/10.1609/socs.v12i1.18567","mag":"3197571367"},"language":"en","primary_location":{"id":"doi:10.1609/socs.v12i1.18567","is_oa":true,"landing_page_url":"https://doi.org/10.1609/socs.v12i1.18567","pdf_url":"https://ojs.aaai.org/index.php/SOCS/article/download/18567/18356","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":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"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"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://ojs.aaai.org/index.php/SOCS/article/download/18567/18356","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052278994","display_name":"Martin \u010capek","orcid":"https://orcid.org/0000-0002-5705-8196"},"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":false,"raw_author_name":"Martin \u010capek","raw_affiliation_strings":["Czech Technical University in Prague, Faculty of Information Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Czech Technical University in Prague, Faculty of Information Technology","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"last","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":false,"raw_author_name":"Pavel Surynek","raw_affiliation_strings":["Czech Technical University in Prague, Faculty of Information Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Czech Technical University in Prague, Faculty of Information Technology","institution_ids":["https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I44504214"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10732971,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"12","issue":"1","first_page":"153","last_page":"155"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9986000061035156,"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.9986000061035156,"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/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.9948999881744385,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9926000237464905,"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/dpll-algorithm","display_name":"DPLL algorithm","score":0.8389177918434143},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.7284737825393677},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.7013314366340637},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6989380121231079},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6522565484046936},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.5710502862930298},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.5686928033828735},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5617741346359253},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5601187348365784},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5205593705177307},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.5027942657470703},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.4880715608596802},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.4448530375957489},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4207169711589813},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4158777892589569},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2642463743686676},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.26057112216949463},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13432246446609497},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12153717875480652},{"id":"https://openalex.org/keywords/phase-locked-loop","display_name":"Phase-locked loop","score":0.06641814112663269}],"concepts":[{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.8389177918434143},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.7284737825393677},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7013314366340637},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6989380121231079},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6522565484046936},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.5710502862930298},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.5686928033828735},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5617741346359253},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5601187348365784},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5205593705177307},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.5027942657470703},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.4880715608596802},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.4448530375957489},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4207169711589813},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4158777892589569},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2642463743686676},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.26057112216949463},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13432246446609497},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12153717875480652},{"id":"https://openalex.org/C12707504","wikidata":"https://www.wikidata.org/wiki/Q52637","display_name":"Phase-locked loop","level":3,"score":0.06641814112663269},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C134652429","wikidata":"https://www.wikidata.org/wiki/Q1052698","display_name":"Jitter","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1609/socs.v12i1.18567","is_oa":true,"landing_page_url":"https://doi.org/10.1609/socs.v12i1.18567","pdf_url":"https://ojs.aaai.org/index.php/SOCS/article/download/18567/18356","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":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"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:arXiv.org:2111.06494","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2111.06494","pdf_url":"https://arxiv.org/pdf/2111.06494","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2111.06494","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2111.06494","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"},{"id":"mag:3197571367","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/corr/corr2111.html#abs-2111-06494","pdf_url":null,"source":{"id":"https://openalex.org/S4306417685","display_name":"Annual Symposium on Combinatorial Search","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Annual Symposium on Combinatorial Search","raw_type":null}],"best_oa_location":{"id":"doi:10.1609/socs.v12i1.18567","is_oa":true,"landing_page_url":"https://doi.org/10.1609/socs.v12i1.18567","pdf_url":"https://ojs.aaai.org/index.php/SOCS/article/download/18567/18356","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":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"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":[{"display_name":"Peace, Justice and strong institutions","score":0.7799999713897705,"id":"https://metadata.un.org/sdg/16"}],"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":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3197571367.pdf","grobid_xml":"https://content.openalex.org/works/W3197571367.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W126122642","https://openalex.org/W146776796","https://openalex.org/W1973396716","https://openalex.org/W1989407213","https://openalex.org/W2022846948","https://openalex.org/W2135939055","https://openalex.org/W2153839473","https://openalex.org/W2415170901","https://openalex.org/W2575733488","https://openalex.org/W2964975113","https://openalex.org/W2964997665","https://openalex.org/W3037524112","https://openalex.org/W6629245573","https://openalex.org/W6680234699","https://openalex.org/W6735635832","https://openalex.org/W6748059401","https://openalex.org/W6758754608","https://openalex.org/W6762652492"],"related_works":["https://openalex.org/W3213720897","https://openalex.org/W2991499952","https://openalex.org/W2964975113","https://openalex.org/W1986846537","https://openalex.org/W2025799810","https://openalex.org/W1635223198","https://openalex.org/W1514095116","https://openalex.org/W2159265808","https://openalex.org/W2019049230","https://openalex.org/W2545908656","https://openalex.org/W2149676416","https://openalex.org/W3124986484","https://openalex.org/W2785704151","https://openalex.org/W3093617082","https://openalex.org/W3152377371","https://openalex.org/W2272860309","https://openalex.org/W2158995961","https://openalex.org/W1988302213","https://openalex.org/W2095904973","https://openalex.org/W1728966390"],"abstract_inverted_index":{"The":[0,18],"task":[1,50],"in":[2,71,80],"multi-agent":[3],"path":[4],"finding":[5],"(MAPF)":[6],"is":[7,21,51,97],"to":[8,24,39,52,93,124,130],"find":[9],"non-conflicting":[10],"paths":[11],"connecting":[12],"agents'":[13],"start":[14],"and":[15,28,116,129],"goal":[16],"positions.":[17],"MAPF":[19,38,67,95],"problem":[20],"often":[22],"compiled":[23],"Boolean":[25,62,127],"satisfiability":[26],"(SAT)":[27],"solved":[29],"by":[30],"existing":[31],"SAT":[32,40,43,102,114],"solvers.":[33],"Contemporary":[34],"compilation":[35,76,111],"approaches":[36],"of":[37,56,60,64,85,88],"regard":[41],"the":[42,65,82,94,101,113,117,126],"solver":[44,115],"as":[45],"an":[46,54],"external":[47],"tool":[48],"whose":[49],"return":[53],"assignment":[55],"all":[57],"decision":[58,89],"variables":[59,90],"a":[61,74],"model":[63,128],"input":[66],"instance.":[68],"We":[69],"present":[70],"this":[72],"paper":[73],"novel":[75],"scheme":[77,105],"called":[78],"DPLL(MAPF)":[79],"which":[81],"consistency":[83,118],"checking":[84,119],"partial":[86],"assignments":[87],"with":[91],"respect":[92],"rules":[96],"integrated":[98],"directly":[99],"into":[100],"solver.":[103],"This":[104],"allows":[106],"for":[107,132],"far":[108],"more":[109],"automated":[110],"where":[112],"procedure":[120],"work":[121],"together":[122],"simultaneously":[123],"create":[125],"search":[131],"its":[133],"satisfying":[134],"assignment.":[135]},"counts_by_year":[],"updated_date":"2026-07-01T08:55:40.977307","created_date":"2025-10-10T00:00:00"}