登入選單
返回Google圖書搜尋
出版Hebrew University of Jerusalem. Leibniz Center for Research in Computer Science. Institute of Mathematics and Computer Science, 1988
URLhttp://books.google.com.hk/books?id=WpPRGwAACAAJ&hl=&source=gbs_api
註釋The work described in this paper is in the first category, planning for multiple agents. Taking the STRIPS representation of actions [4], and directed acyclic graphs (DAGs) as plan representations particularly well-suited to parallel execution, we formally analyze the following three issues: 1) 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 actions will be performed)? 2) How can DAG plans be generated? 3) What is an efficient algorithm to be used by a supervisor directing the execution of a DAG plan by multiple agents?"