计算机科学
計算機科學
계산궤과학
COMPUTER SCIENCE
2001年
7期
69-73
,共5页
AI Planning and Scheduling,Graphplan
AI Planning and Scheduling,Graphplan
AI Planning and Scheduling,Graphplan
AI Plannig and Scheduling are a classical problem of Artificial Intelligene. It is a highlight of AI for it' s significance in many application domains. Recenctly,dramatic advances have been made in this field. In this paper,we introduce our study on Graphplan which is one of the best methods and it's descendent technologys. First,we will analyse Graphplan's algorithm and it's key for success, then briefly introduce it's descendants,at the end of the paper,we suggest areas for future research.
AI Plannig and Scheduling are a classical problem of Artificial Intelligene. It is a highlight of AI for it' s significance in many application domains. Recenctly,dramatic advances have been made in this field. In this paper,we introduce our study on Graphplan which is one of the best methods and it's descendent technologys. First,we will analyse Graphplan's algorithm and it's key for success, then briefly introduce it's descendants,at the end of the paper,we suggest areas for future research.
AI Plannig and Scheduling are a classical problem of Artificial Intelligene. It is a highlight of AI for it' s significance in many application domains. Recenctly,dramatic advances have been made in this field. In this paper,we introduce our study on Graphplan which is one of the best methods and it's descendent technologys. First,we will analyse Graphplan's algorithm and it's key for success, then briefly introduce it's descendants,at the end of the paper,we suggest areas for future research.
