Cost Partitioning for Multi-agent Planning
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F19%3A00336493" target="_blank" >RIV/68407700:21230/19:00336493 - isvavai.cz</a>
Result on the web
<a href="https://www.scitepress.org/PublicationsDetail.aspx?ID=cz7omPvUXhA=&t=1" target="_blank" >https://www.scitepress.org/PublicationsDetail.aspx?ID=cz7omPvUXhA=&t=1</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.5220/0007256600400049" target="_blank" >10.5220/0007256600400049</a>
Alternative languages
Result language
angličtina
Original language name
Cost Partitioning for Multi-agent Planning
Original language description
Similarly to classical planning, heuristics play a crucial role in Multi-Agent Planning (MAP). Especially, the question of how to compute a distributed heuristic so that the information is shared effectively has been studied widely. This question becomes even more intriguing if we aim to preserve some degree of privacy, or admissibility of the heuristic. The works published so far aimed mostly at providing an ad-hoc distribution protocol for a particular heuristic. In this work, we propose a general framework for distributing heuristic computation based on the technique of cost partitioning. This allows the agents to compute their heuristic values separately and the global heuristic value as an admissible sum. We evaluate the presented techniques in comparison to the baseline of locally computed heuristics and show that the approach based on cost partitioning improves the heuristic quality over the baseline.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 11th International Conference on Agents and Artificial Intelligence
ISBN
978-989-758-350-6
ISSN
2184-433X
e-ISSN
—
Number of pages
10
Pages from-to
40-49
Publisher name
SCITEPRESS – Science and Technology Publications, Lda
Place of publication
Lisboa
Event location
Praha
Event date
Feb 19, 2019
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—