Concise Finite-Domain Representations for Factored MA-PDDL Planning Tasks

Daniel Fišer, Antonín Komenda

Abstract

Planning tasks for the distributed multi-agent planning in deterministic environments are described in highly expressive, but lifted, languages, similar to classical planning. On the one hand, these languages allow for the compact representation of exponentially large planning problems. On the other hand, the solvers using such languages need efficient grounding methods to translate the high-level description to a low-level representation using facts or atomic values. Although there exist ad-hoc implementations of the grounding for the multi-agent planning, there is no general scheme usable by all multi-agent planners. In this work, we propose such a scheme combining centralized processes of the grounding and the inference of mutex groups. Both processes are needed for the translation of planning tasks from the Multi-agent Planning Description Language (MA-PDDL) to the finite domain representation. We experimentally show a space reduction of the multi-agent finite domain representation in contrast to the binary representation on the common benchmark set.

References

Download


Paper Citation


in Harvard Style

Fišer D. and Komenda A. (2018). Concise Finite-Domain Representations for Factored MA-PDDL Planning Tasks.In Proceedings of the 10th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-758-275-2, pages 306-313. DOI: 10.5220/0006539503060313


in Bibtex Style

@conference{icaart18,
author={Daniel Fišer and Antonín Komenda},
title={Concise Finite-Domain Representations for Factored MA-PDDL Planning Tasks},
booktitle={Proceedings of the 10th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2018},
pages={306-313},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006539503060313},
isbn={978-989-758-275-2},
}


in EndNote Style

TY - CONF

JO - Proceedings of the 10th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - Concise Finite-Domain Representations for Factored MA-PDDL Planning Tasks
SN - 978-989-758-275-2
AU - Fišer D.
AU - Komenda A.
PY - 2018
SP - 306
EP - 313
DO - 10.5220/0006539503060313