@INPROCEEDINGS{PSury14b,
 AUTHOR= "M. Ivanova and P. Surynek",
 TITLE= "Adversarial Cooperative Path-Finding: Complexity and Algorithms",
 BOOKTITLE= "Proceedings of the International Conference on Tools with Artificial Intelligence (ICTAI)",
 PAGES= "75--82",
 YEAR= "2014",
 PDF= "http://surynek.com/publications/files/Ivanova-Surynek_ACPF_ICTAI-2014.pdf",
 FLAGS= ":2014:,:pavelsurynek:,:marikaivanova:",
 ABSTRACT= 
"The paper addresses a problem of adversarial co-operative path-finding (ACPF)
which extends the well-studied problem of cooperative path-finding (CPF) with
adversaries. In addition to cooperative path-finding where non-colliding paths
for multiple agents connecting their initial positions and destinations are
searched, consideration of agents controlled by the adversary is included in
ACPF. This work is focused on both theoretical properties and practical
solving techniques of the considered problem. We study computational
complexity of the problem where we show that it is PSPACE-hard and belongs to
the EXPTIME complexity class. Possible methods suitable for practical solving
of the problem are introduced and thoroughly evaluated. Suggested solving
approaches include greedy algorithms, minimax methods, Monte Carlo Tree
Search, and adaptation of an algorithm for the cooperative version of the
problem. Solving methods for ACPF were compared in a tournament in which all
the pairs of suggested strategies were compared. Surprisingly frequent
success rate of greedy methods and rather weaker results of Monte Carlo Tree
Search were indicated by the conducted experimental evaluation."
}

{"_id":"kD4YACRoGaF547MnN","bibbaseid":"ivanova-surynek-adversarialcooperativepathfindingcomplexityandalgorithms-2014","authorIDs":[],"author_short":["Ivanova, M.","Surynek, P."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["M."],"propositions":[],"lastnames":["Ivanova"],"suffixes":[]},{"firstnames":["P."],"propositions":[],"lastnames":["Surynek"],"suffixes":[]}],"title":"Adversarial Cooperative Path-Finding: Complexity and Algorithms","booktitle":"Proceedings of the International Conference on Tools with Artificial Intelligence (ICTAI)","pages":"75–82","year":"2014","pdf":"http://surynek.com/publications/files/Ivanova-Surynek_ACPF_ICTAI-2014.pdf","flags":":2014:,:pavelsurynek:,:marikaivanova:","abstract":"The paper addresses a problem of adversarial co-operative path-finding (ACPF) which extends the well-studied problem of cooperative path-finding (CPF) with adversaries. In addition to cooperative path-finding where non-colliding paths for multiple agents connecting their initial positions and destinations are searched, consideration of agents controlled by the adversary is included in ACPF. This work is focused on both theoretical properties and practical solving techniques of the considered problem. We study computational complexity of the problem where we show that it is PSPACE-hard and belongs to the EXPTIME complexity class. Possible methods suitable for practical solving of the problem are introduced and thoroughly evaluated. Suggested solving approaches include greedy algorithms, minimax methods, Monte Carlo Tree Search, and adaptation of an algorithm for the cooperative version of the problem. Solving methods for ACPF were compared in a tournament in which all the pairs of suggested strategies were compared. Surprisingly frequent success rate of greedy methods and rather weaker results of Monte Carlo Tree Search were indicated by the conducted experimental evaluation.","bibtex":"@INPROCEEDINGS{PSury14b,\n AUTHOR= \"M. Ivanova and P. Surynek\",\n TITLE= \"Adversarial Cooperative Path-Finding: Complexity and Algorithms\",\n BOOKTITLE= \"Proceedings of the International Conference on Tools with Artificial Intelligence (ICTAI)\",\n PAGES= \"75--82\",\n YEAR= \"2014\",\n PDF= \"http://surynek.com/publications/files/Ivanova-Surynek_ACPF_ICTAI-2014.pdf\",\n FLAGS= \":2014:,:pavelsurynek:,:marikaivanova:\",\n ABSTRACT= \n\"The paper addresses a problem of adversarial co-operative path-finding (ACPF)\nwhich extends the well-studied problem of cooperative path-finding (CPF) with\nadversaries. In addition to cooperative path-finding where non-colliding paths\nfor multiple agents connecting their initial positions and destinations are\nsearched, consideration of agents controlled by the adversary is included in\nACPF. This work is focused on both theoretical properties and practical\nsolving techniques of the considered problem. We study computational\ncomplexity of the problem where we show that it is PSPACE-hard and belongs to\nthe EXPTIME complexity class. Possible methods suitable for practical solving\nof the problem are introduced and thoroughly evaluated. Suggested solving\napproaches include greedy algorithms, minimax methods, Monte Carlo Tree\nSearch, and adaptation of an algorithm for the cooperative version of the\nproblem. Solving methods for ACPF were compared in a tournament in which all\nthe pairs of suggested strategies were compared. Surprisingly frequent\nsuccess rate of greedy methods and rather weaker results of Monte Carlo Tree\nSearch were indicated by the conducted experimental evaluation.\"\n}\n\n","author_short":["Ivanova, M.","Surynek, P."],"key":"PSury14b","id":"PSury14b","bibbaseid":"ivanova-surynek-adversarialcooperativepathfindingcomplexityandalgorithms-2014","role":"author","urls":{},"downloads":0,"html":""},"bibtype":"inproceedings","biburl":"http://mapf.info/bib/mapf.bib","creationDate":"2019-05-05T18:02:17.735Z","downloads":0,"keywords":[],"search_terms":["adversarial","cooperative","path","finding","complexity","algorithms","ivanova","surynek"],"title":"Adversarial Cooperative Path-Finding: Complexity and Algorithms","year":2014,"dataSources":["oEkRzPPMbrG9LyYPh"]}