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

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F18%3A00319895" target="_blank" >RIV/68407700:21230/18:00319895 - isvavai.cz</a>

Result on the web

<a href="http://www.scitepress.org/PublicationsDetail.aspx?ID=TYJcwasHfjc%3D" target="_blank" >http://www.scitepress.org/PublicationsDetail.aspx?ID=TYJcwasHfjc%3D</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.5220/0006539503060313" target="_blank" >10.5220/0006539503060313</a>

Result language

angličtina

Original language name

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

Original language description

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.

Czech name

—

Czech description

—

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)

Project

<a href="/en/project/GJ15-20433Y" target="_blank" >GJ15-20433Y: Heuristic Search for Multiagent and Factored Planning</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2018

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Proceedings of the 10th International Conference on Agents and Artificial Intelligence

ISBN

978-989-758-275-2

ISSN

—

e-ISSN

—

Number of pages

8

Pages from-to

306-313

Publisher name

SciTePress

Place of publication

Madeira

Event location

Funchal, Medeira, Portugal

Event date

Jan 16, 2018

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—