TY - JOUR
T1 - Verifying plans for multiple agents.
AU - Katz, Matthew J.
AU - Rosenschein, Jeffrey S.
N1 - DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.
PY - 1993
Y1 - 1993
N2 - Research in distributed artificial intelligence planning has historically focused on two distinct classes of problems. One paradigm has been that of ‘planning for multiple agents’, which considers issues inherent in centrally directed multi-agent execution. The second paradigm has been ‘distributed planning’, where multiple agents more autonomously participate in coordinating and deciding upon their own actions. The work described in this paper is in the first category, planning for multiple agents. Taking the STRIPS representation of actions, and directed acrylic graphs (DAGs) as plan representations particularly well suited to parallel execution, it formally analyses the following question: how can a DAG plan be verified (i.e. how can we be sure such a plan will be correct, given our uncertainty about exactly when unconstrained parallel actions will be performed)? A method is presented for verifying the correctness of plans for multiple agents, represented as DAGs. The technique allows for the efficient analysis of a plan, despite its many potential execution histories.
AB - Research in distributed artificial intelligence planning has historically focused on two distinct classes of problems. One paradigm has been that of ‘planning for multiple agents’, which considers issues inherent in centrally directed multi-agent execution. The second paradigm has been ‘distributed planning’, where multiple agents more autonomously participate in coordinating and deciding upon their own actions. The work described in this paper is in the first category, planning for multiple agents. Taking the STRIPS representation of actions, and directed acrylic graphs (DAGs) as plan representations particularly well suited to parallel execution, it formally analyses the following question: how can a DAG plan be verified (i.e. how can we be sure such a plan will be correct, given our uncertainty about exactly when unconstrained parallel actions will be performed)? A method is presented for verifying the correctness of plans for multiple agents, represented as DAGs. The technique allows for the efficient analysis of a plan, despite its many potential execution histories.
KW - Directed acrylic graphs
KW - Distributed planning
KW - Planning for multiple agents
UR - http://www.scopus.com/inward/record.url?scp=21144482866&partnerID=8YFLogxK
U2 - 10.1080/09528139308953757
DO - 10.1080/09528139308953757
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
VL - 5
SP - 39
EP - 56
JO - Journal of Experimental and Theoretical Artificial Intelligence
JF - Journal of Experimental and Theoretical Artificial Intelligence
SN - 0952-813X
IS - 1
ER -