On Internally Dependent Public Actions in Multiagent Planning

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F15%3A00234413" target="_blank" >RIV/68407700:21230/15:00234413 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/68407700:21730/15:00234413

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

On Internally Dependent Public Actions in Multiagent Planning

Popis výsledku v původním jazyce

Agents planning under STRIPS-related model using separation of facts and actions to private and public can model behavior of other agents as public external pro- jections of their actions. In the most simplistic case, the agent does not require any additional information from the other agents, that is the planning process ignores any dependencies of the projected actions possibly caused by sequences of other agents? private actions. In this work, we formally define several types of in- ternally dependencies of multiagent planning problems and provide an algorithmic approach how to extract the internally dependent actions during multiagent plan- ning. We show how to take an advantage of computed dependencies in multiagent planning. Additionally, we analyze the standard benchmarks used for mutliagent planning and present overview of various sub-types of internal dependencies of public actions in particular planning domains.

Název v anglickém jazyce

On Internally Dependent Public Actions in Multiagent Planning

Popis výsledku anglicky

Agents planning under STRIPS-related model using separation of facts and actions to private and public can model behavior of other agents as public external pro- jections of their actions. In the most simplistic case, the agent does not require any additional information from the other agents, that is the planning process ignores any dependencies of the projected actions possibly caused by sequences of other agents? private actions. In this work, we formally define several types of in- ternally dependencies of multiagent planning problems and provide an algorithmic approach how to extract the internally dependent actions during multiagent plan- ning. We show how to take an advantage of computed dependencies in multiagent planning. Additionally, we analyze the standard benchmarks used for mutliagent planning and present overview of various sub-types of internal dependencies of public actions in particular planning domains.

Druh

O - Ostatní výsledky

CEP obor

JC - Počítačový hardware a software

OECD FORD obor

—

Projekt

<a href="/cs/project/GA13-22125S" target="_blank" >GA13-22125S: Deterministické doménově nezávislé multi-agentní plánování</a><br>

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2015

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ů