Computing Multi-Agent Heuristics Additively. Štolba, M. and Komenda, A. In
Computing Multi-Agent Heuristics Additively [link]Paper  abstract   bibtex   
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.
@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 = {http://icaps16.icaps-conference.org/proceedings/dmap16.pdf#page=92}
}
Downloads: 0