loading
Documents

Research.Publish.Connect.

Paper

Authors: Daniel Fišer and Antonín Komenda

Affiliation: Czech Technical University, Czech Republic

ISBN: 978-989-758-275-2

Keyword(s): Multi-Agent Planning, Finite-Domain Representation, State Invariants, Mutex Groups.

Related Ontology Subjects/Areas/Topics: Agents ; Artificial Intelligence ; Artificial Intelligence and Decision Support Systems ; Distributed and Mobile Software Systems ; Enterprise Information Systems ; Formal Methods ; Informatics in Control, Automation and Robotics ; Intelligent Control Systems and Optimization ; Knowledge Engineering and Ontology Development ; Knowledge-Based Systems ; Multi-Agent Systems ; Planning and Scheduling ; Simulation and Modeling ; Software Engineering ; Symbolic Systems

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 repr esentation in contrast to the binary representation on the common benchmark set. (More)

PDF ImageFull Text

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

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

@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},
}

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

Login or register to post comments.

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