中国科学院机构知识库网格系统: Algorithm research of flexible graphplan based on heuristic (EI CONFERENCE)

中国科学院机构知识库网格

Chinese Academy of Sciences Institutional Repositories Grid

Algorithm research of flexible graphplan based on heuristic (EI CONFERENCE)

文献类型：会议论文


作者	Xu S.; Wang X.; Wang X.; Wang X.; Sun Y.; Sun Y.; Li Y.; Li Y.; Li Y.; Li Y.
出版日期	2008
会议名称	9th International Conference for Young Computer Scientists, ICYCS 2008, November 18, 2008 - November 21, 2008
会议地点	Zhang Jia Jie, Hunan, China
关键词	Classic Graphplan has too much restriction on capturing the full subtlety of many real problems. Flexible Graphplan is defined which supports the soft constraints often found in reality. Heuristic concept is introduced to the process of plan extraction in flexible graphplan in order to improve the efficiency of plan extraction and the quality of plan. A novel algorithm using the new heuristic function which is applied by improved sum mutex heuristic to deal with planning problems is proposed. Sum mutex heuristic which is in common use as heuristic function takes into account only static propositional mutexes and ignores the mutexes of actions. The performance of the new algorithm on many benchmark problems is remarkably robust. It can solve many planning problems which can't be solved by the heuristic state space search planning system using sum mutex heuristic. 2008 IEEE.
页码	48-53
收录类别	EI
源URL	[http://ir.ciomp.ac.cn/handle/181722/33406]
专题	长春光学精密机械与物理研究所_中科院长春光机所知识产出_会议论文
推荐引用方式 GB/T 7714	Xu S.,Wang X.,Wang X.,et al. Algorithm research of flexible graphplan based on heuristic (EI CONFERENCE)[C]. 见:9th International Conference for Young Computer Scientists, ICYCS 2008, November 18, 2008 - November 21, 2008. Zhang Jia Jie, Hunan, China.

入库方式： OAI收割

来源：长春光学精密机械与物理研究所

浏览0

下载0

收藏0

其他版本

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。