Authors: Michal Štolba ; Michaela Urbanovská ; Daniel Fišer and Antonín Komenda

Affiliation: Department of Computer Science, Czech Technical University in Prague, Karlovo náměstí 13, 121 35, Prague and Czech Republic

ISBN: 978-989-758-350-6

ISSN: 2184-433X

Keyword(s): Multi-agent Planning, Distributed Search, Distributed Heuristic Computation.

Related Ontology Subjects/Areas/Topics: Agents ; Artificial Intelligence ; Distributed Problem Solving ; Formal Methods ; Informatics in Control, Automation and Robotics ; Intelligent Control Systems and Optimization ; Planning and Scheduling ; Simulation and Modeling ; Symbolic Systems

Abstract: 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.


Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Štolba, M.; Urbanovská, M.; Fišer, D. and Komenda, A. (2019). Cost Partitioning for Multi-agent Planning.In Proceedings of the 11th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-758-350-6, ISSN 2184-433X, pages 40-49. DOI: 10.5220/0007256600400049

author={Michal Štolba. and Michaela Urbanovská. and Daniel Fišer. and Antonín Komenda.},
title={Cost Partitioning for Multi-agent Planning},
booktitle={Proceedings of the 11th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},


JO - Proceedings of the 11th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - Cost Partitioning for Multi-agent Planning
SN - 978-989-758-350-6
AU - Štolba, M.
AU - Urbanovská, M.
AU - Fišer, D.
AU - Komenda, A.
PY - 2019
SP - 40
EP - 49
DO - 10.5220/0007256600400049

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.