@INPROCEEDINGS{AFeln17e, 
 AUTHOR= "P. Surynek and A. Felner and R. Stern and E. Boyarski",
 TITLE= "Modifying Optimal {SAT}-Based Approach to Multi-Agent Path-Finding Problem to Suboptimal Variants",
 BOOKTITLE= "Proceedings of the Symposium on Combinatorial Search (SoCS)",
 PAGES= "169--170",
 YEAR= "2017",
 PDF= "https://static.wixstatic.com/ugd/749b4b_f28d63b09e5546479f1f541f19804681.pdf",
 FLAGS= ":2017:,:arielfelner:,:ronistern:,:eliboyarski:,:pavelsurynek:",
 ABSTRACT= 
"In multi-agent path finding (MAPF) the task is to find non-conflicting paths
for multiple agents. Recently, a SAT-based approach was developed to solve
this problem and proved beneficial in many cases when compared to other
search-based solvers. In this paper, we introduce SAT-based unbounded- and
bounded-suboptimal algorithms and compare them to relevant search-based
algorithms."
}

{"_id":"t45spSdYG8xHamTDz","bibbaseid":"surynek-felner-stern-boyarski-modifyingoptimalsatbasedapproachtomultiagentpathfindingproblemtosuboptimalvariants-2017","authorIDs":[],"author_short":["Surynek, P.","Felner, A.","Stern, R.","Boyarski, E."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["P."],"propositions":[],"lastnames":["Surynek"],"suffixes":[]},{"firstnames":["A."],"propositions":[],"lastnames":["Felner"],"suffixes":[]},{"firstnames":["R."],"propositions":[],"lastnames":["Stern"],"suffixes":[]},{"firstnames":["E."],"propositions":[],"lastnames":["Boyarski"],"suffixes":[]}],"title":"Modifying Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem to Suboptimal Variants","booktitle":"Proceedings of the Symposium on Combinatorial Search (SoCS)","pages":"169–170","year":"2017","pdf":"https://static.wixstatic.com/ugd/749b4b_f28d63b09e5546479f1f541f19804681.pdf","flags":":2017:,:arielfelner:,:ronistern:,:eliboyarski:,:pavelsurynek:","abstract":"In multi-agent path finding (MAPF) the task is to find non-conflicting paths for multiple agents. Recently, a SAT-based approach was developed to solve this problem and proved beneficial in many cases when compared to other search-based solvers. In this paper, we introduce SAT-based unbounded- and bounded-suboptimal algorithms and compare them to relevant search-based algorithms.","bibtex":"@INPROCEEDINGS{AFeln17e, \n AUTHOR= \"P. Surynek and A. Felner and R. Stern and E. Boyarski\",\n TITLE= \"Modifying Optimal {SAT}-Based Approach to Multi-Agent Path-Finding Problem to Suboptimal Variants\",\n BOOKTITLE= \"Proceedings of the Symposium on Combinatorial Search (SoCS)\",\n PAGES= \"169--170\",\n YEAR= \"2017\",\n PDF= \"https://static.wixstatic.com/ugd/749b4b_f28d63b09e5546479f1f541f19804681.pdf\",\n FLAGS= \":2017:,:arielfelner:,:ronistern:,:eliboyarski:,:pavelsurynek:\",\n ABSTRACT= \n\"In multi-agent path finding (MAPF) the task is to find non-conflicting paths\nfor multiple agents. Recently, a SAT-based approach was developed to solve\nthis problem and proved beneficial in many cases when compared to other\nsearch-based solvers. In this paper, we introduce SAT-based unbounded- and\nbounded-suboptimal algorithms and compare them to relevant search-based\nalgorithms.\"\n}\n\n","author_short":["Surynek, P.","Felner, A.","Stern, R.","Boyarski, E."],"key":"AFeln17e","id":"AFeln17e","bibbaseid":"surynek-felner-stern-boyarski-modifyingoptimalsatbasedapproachtomultiagentpathfindingproblemtosuboptimalvariants-2017","role":"author","urls":{},"downloads":0,"html":""},"bibtype":"inproceedings","biburl":"http://mapf.info/bib/mapf.bib","creationDate":"2019-05-05T18:02:17.697Z","downloads":0,"keywords":[],"search_terms":["modifying","optimal","sat","based","approach","multi","agent","path","finding","problem","suboptimal","variants","surynek","felner","stern","boyarski"],"title":"Modifying Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem to Suboptimal Variants","year":2017,"dataSources":["oEkRzPPMbrG9LyYPh"]}