LiU Electronic Press
Full-text not available in DiVA
Author:
Kvarnström, Jonas (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab) (Linköping University, The Institute of Technology) (APD)
Title:
Planning for Loosely Coupled Agents using Partial Order Forward-Chaining
Department:
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab
Linköping University, The Institute of Technology
Publication type:
Conference paper (Other academic)
Language:
English
In:
The Swedish AI Society Workshop 2010, SAIS 2010
Editor:
Roland Bol
Conference:
26th annual workshop of the Swedish Artificial Intelligence Society (SAIS 2010), 20-21 May 2010, Uppsala, Sweden
Publisher: Linköping University Electronic Press, Linköpings universitet
Series:
Linköping Electronic Conference Proceedings, ISSN 1650-3686 (print), 1650-3740 (online); 48
Pages:
45-54
Year of publ.:
2010
URI:
urn:nbn:se:liu:diva-59882
Permanent link:
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-59882
Subject category:
Computer Science
SVEP category:
Computer science
Abstract(en) :

Partially ordered plan structures are highly suitable for centralized multi-agent planning, where plans should be minimally constrained in terms of precedence between actions performed by different agents. In many cases, however, any given agent will perform its own actions in strict sequence. We take advantage of this fact to develop a hybrid of temporal partial order planning and forward-chaining planning. A sequence of actions is constructed for each agent and linked to other agents' actions by a partially ordered precedence relation as required. When agents are not too tightly coupled, this structure enables the generation of partial but strong information about the state at the end of each agent's action sequence. Such state information can be effectively exploited during search. A prototype planner within this framework has been implemented, using precondition control formulas to guide the search process.

Available from:
2010-09-29
Created:
2010-09-29
Last updated:
2013-08-29
Statistics:
50 hits