Verifying plans for multiple agents.

Matthew J. Katz, Jeffrey S. Rosenschein

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

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.

Original languageEnglish GB
Pages (from-to)39-56
Number of pages18
JournalJournal of Experimental & Theoretical Artificial Intelligence
Volume5
Issue number1
DOIs
StatePublished - 1993

Keywords

  • Directed acrylic graphs
  • Distributed planning
  • Planning for multiple agents

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'Verifying plans for multiple agents.'. Together they form a unique fingerprint.

Cite this