@INPROCEEDINGS{AFeln17b, 
 AUTHOR= "P. Surynek and J. Svancara and A. Felner and E. Boyarski",
 TITLE= "Variants of Independence Detection in {SAT}-Based Optimal Multi-Agent Path Finding",
 BOOKTITLE= "Proceedings of the International Conference on Agents and Artificial Intelligence (ICAART)",
 PAGES= "116--136",
 YEAR= "2017",
 PDF= "https://docs.wixstatic.com/ugd/749b4b_8045b531d493420e9bcf415b8e9d7037.pdf",
 FLAGS= ":2017:,:arielfelner:,:eliboyarski:,:pavelsurynek:",
 ABSTRACT= 
"In multi-agent path finding (MAPF) on graphs, the task is to find paths for
distinguishable agents so that each agent reaches its unique goal vertex from
the given start while collisions between agents are forbidden. A cumulative
objective function is often minimized in MAPF. The main contribution of this
paper consists in integrating independence detection technique (ID) into a
compilation-based MAPF solver that translates MAPF instances into
propositional satisfiability (SAT). The independence detection technique in
search-based solvers tries to decompose a given MAPF instance into instances
consisting of small groups of agents with no interaction across groups. After
the decomposition phase, small instances are solved independently and the
solution of the original instance is combined from individual solutions to
small instances. The presented experimental evaluation indicates significant
reduction of the size of instances translated to the target SAT formalism and
positive impact on the overall performance of the solver."
}

{"_id":"HLvxyjRygDegaMqw8","bibbaseid":"surynek-svancara-felner-boyarski-variantsofindependencedetectioninsatbasedoptimalmultiagentpathfinding-2017","authorIDs":[],"author_short":["Surynek, P.","Svancara, J.","Felner, A.","Boyarski, E."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["P."],"propositions":[],"lastnames":["Surynek"],"suffixes":[]},{"firstnames":["J."],"propositions":[],"lastnames":["Svancara"],"suffixes":[]},{"firstnames":["A."],"propositions":[],"lastnames":["Felner"],"suffixes":[]},{"firstnames":["E."],"propositions":[],"lastnames":["Boyarski"],"suffixes":[]}],"title":"Variants of Independence Detection in SAT-Based Optimal Multi-Agent Path Finding","booktitle":"Proceedings of the International Conference on Agents and Artificial Intelligence (ICAART)","pages":"116–136","year":"2017","pdf":"https://docs.wixstatic.com/ugd/749b4b_8045b531d493420e9bcf415b8e9d7037.pdf","flags":":2017:,:arielfelner:,:eliboyarski:,:pavelsurynek:","abstract":"In multi-agent path finding (MAPF) on graphs, the task is to find paths for distinguishable agents so that each agent reaches its unique goal vertex from the given start while collisions between agents are forbidden. A cumulative objective function is often minimized in MAPF. The main contribution of this paper consists in integrating independence detection technique (ID) into a compilation-based MAPF solver that translates MAPF instances into propositional satisfiability (SAT). The independence detection technique in search-based solvers tries to decompose a given MAPF instance into instances consisting of small groups of agents with no interaction across groups. After the decomposition phase, small instances are solved independently and the solution of the original instance is combined from individual solutions to small instances. The presented experimental evaluation indicates significant reduction of the size of instances translated to the target SAT formalism and positive impact on the overall performance of the solver.","bibtex":"@INPROCEEDINGS{AFeln17b, \n AUTHOR= \"P. Surynek and J. Svancara and A. Felner and E. Boyarski\",\n TITLE= \"Variants of Independence Detection in {SAT}-Based Optimal Multi-Agent Path Finding\",\n BOOKTITLE= \"Proceedings of the International Conference on Agents and Artificial Intelligence (ICAART)\",\n PAGES= \"116--136\",\n YEAR= \"2017\",\n PDF= \"https://docs.wixstatic.com/ugd/749b4b_8045b531d493420e9bcf415b8e9d7037.pdf\",\n FLAGS= \":2017:,:arielfelner:,:eliboyarski:,:pavelsurynek:\",\n ABSTRACT= \n\"In multi-agent path finding (MAPF) on graphs, the task is to find paths for\ndistinguishable agents so that each agent reaches its unique goal vertex from\nthe given start while collisions between agents are forbidden. A cumulative\nobjective function is often minimized in MAPF. The main contribution of this\npaper consists in integrating independence detection technique (ID) into a\ncompilation-based MAPF solver that translates MAPF instances into\npropositional satisfiability (SAT). The independence detection technique in\nsearch-based solvers tries to decompose a given MAPF instance into instances\nconsisting of small groups of agents with no interaction across groups. After\nthe decomposition phase, small instances are solved independently and the\nsolution of the original instance is combined from individual solutions to\nsmall instances. The presented experimental evaluation indicates significant\nreduction of the size of instances translated to the target SAT formalism and\npositive impact on the overall performance of the solver.\"\n}\n\n","author_short":["Surynek, P.","Svancara, J.","Felner, A.","Boyarski, E."],"key":"AFeln17b","id":"AFeln17b","bibbaseid":"surynek-svancara-felner-boyarski-variantsofindependencedetectioninsatbasedoptimalmultiagentpathfinding-2017","role":"author","urls":{},"downloads":0,"html":""},"bibtype":"inproceedings","biburl":"http://mapf.info/bib/mapf.bib","creationDate":"2019-05-05T18:02:17.695Z","downloads":0,"keywords":[],"search_terms":["variants","independence","detection","sat","based","optimal","multi","agent","path","finding","surynek","svancara","felner","boyarski"],"title":"Variants of Independence Detection in SAT-Based Optimal Multi-Agent Path Finding","year":2017,"dataSources":["oEkRzPPMbrG9LyYPh"]}