@INPROCEEDINGS{dmap2016stolba2,
author = {Michal {\v{S}}tolba and Anton{\'{\i}}n Komenda},
title = {Computing Multi-Agent Heuristics Additively},
abstract = {Similarly to classical planning, heuristics play a crucial role in most multi-agent and privacy-preserving multi-agent planning systems. It has been shown that distributed heuristics may crucially improve the search guidance, but are costly in terms of communication and computation time and are often a source of privacy concerns. One solution is to compute a heuristic additively, in the sense that each agent can compute its part of the heuristic independently and obtain a complete heuristic estimate by summing up the individual parts. In this preliminary paper, we propose a technique based on cost-partitioning allowing us to use any heuristic in such a way.},
url = {https://icaps16.icaps-conference.org/proceedings/dmap16.pdf#page=92}
}

{"_id":"Dniu5fdtFMLFxdWTu","bibbaseid":"tolba-komenda-computingmultiagentheuristicsadditively","downloads":0,"creationDate":"2016-05-19T13:26:44.123Z","title":"Computing Multi-Agent Heuristics Additively","author_short":["Štolba, M.","Komenda, A."],"year":null,"bibtype":"inproceedings","biburl":"icaps16.icaps-conference.org/dmap16.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Michal"],"propositions":[],"lastnames":["Štolba"],"suffixes":[]},{"firstnames":["Antonín"],"propositions":[],"lastnames":["Komenda"],"suffixes":[]}],"title":"Computing Multi-Agent Heuristics Additively","abstract":"Similarly to classical planning, heuristics play a crucial role in most multi-agent and privacy-preserving multi-agent planning systems. It has been shown that distributed heuristics may crucially improve the search guidance, but are costly in terms of communication and computation time and are often a source of privacy concerns. One solution is to compute a heuristic additively, in the sense that each agent can compute its part of the heuristic independently and obtain a complete heuristic estimate by summing up the individual parts. In this preliminary paper, we propose a technique based on cost-partitioning allowing us to use any heuristic in such a way.","url":"https://icaps16.icaps-conference.org/proceedings/dmap16.pdf#page=92","bibtex":"@INPROCEEDINGS{dmap2016stolba2,\nauthor = {Michal {\\v{S}}tolba and Anton{\\'{\\i}}n Komenda},\ntitle = {Computing Multi-Agent Heuristics Additively},\nabstract = {Similarly to classical planning, heuristics play a crucial role in most multi-agent and privacy-preserving multi-agent planning systems. It has been shown that distributed heuristics may crucially improve the search guidance, but are costly in terms of communication and computation time and are often a source of privacy concerns. One solution is to compute a heuristic additively, in the sense that each agent can compute its part of the heuristic independently and obtain a complete heuristic estimate by summing up the individual parts. In this preliminary paper, we propose a technique based on cost-partitioning allowing us to use any heuristic in such a way.},\nurl = {https://icaps16.icaps-conference.org/proceedings/dmap16.pdf#page=92}\n}\n\n","author_short":["Štolba, M.","Komenda, A."],"key":"dmap2016stolba2","id":"dmap2016stolba2","bibbaseid":"tolba-komenda-computingmultiagentheuristicsadditively","role":"author","urls":{"Paper":"https://icaps16.icaps-conference.org/proceedings/dmap16.pdf#page=92"},"metadata":{"authorlinks":{}}},"search_terms":["computing","multi","agent","heuristics","additively","štolba","komenda"],"keywords":[],"authorIDs":[],"dataSources":["YTEH97APBj4BGmm5u","oF6o5YwZvH6DhpPhw"]}