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

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

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

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GJ15-20433Y" target="_blank" >GJ15-20433Y: Heuristické prohledávání pro multiagentní a faktorové plánování</a><br>

Návaznosti

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

Rok uplatnění

2018

Kód důvěrnosti údajů

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

Název statě ve sborníku

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

ISBN

978-989-758-275-2

ISSN

—

e-ISSN

—

Počet stran výsledku

8

Strana od-do

306-313

Název nakladatele

SciTePress

Místo vydání

Madeira

Místo konání akce

Funchal, Medeira, Portugal

Datum konání akce

16. 1. 2018

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—