FUZZY RESOURCE CONSTRAINTS GRAPHPLAN

摘要：

Graphplan Blum & Furst has proved a popular and successful basis for a succession of extensions. In this paper,we explore the extent to which its representation can be used for planning with soft resource constraints. We present a new algorithm called Fuzzy Resource Constraints Graphplan (FRCGP). In the process of graph expansion, according to the satisfaction degree that the user requires, our algorithm cut the branches low in request directly, which will speed up the graph expansion and solution extraction. It can solve not only the problems that graphplan does, but also the problems with fuzzy resource constraints. These soft resource constraints are defined through fuzzy intervals. This representation allows us a flexible representation and handling of resource information.Its able to represent the preferences of the user when he relaxes a resource constraint. It has more expressive ability than before.

关键词： Soft resource constraint Fuzzy interval Satisfaction degree Preference

作者: WEN-XIANG GU FANG WANG JIA-YUE REN GANG HOU

作者单位: School of Computer, Northeast Normal University, Changchun 130117, Jilin, China

会议类型: 国际会议

会议名称: 2006 International Conference on Machine Learning and Cybernetics(IEEE第五届机器学习与控制论坛)

会议地点: 大连

会议语种:英文

页码: 494-498

在线出版日期: 2006-08-13（万方平台首次上网日期，不代表论文的发表时间）