Enhancing planning heuristic with landmarks

	Enhancing planning heuristic with landmarks
其他题名	论文其他题名
	Zhao J.; Liu D.; Yang Y.
	2011
发表期刊	Journal of Computers
ISSN	1796203X
卷号	6 期号:12 页码:2590-2595
摘要	Recently, landmarks count heuristic can increase the number of problem instances solved and improve the quality of the solutions in satisfying non-optimal planning. In order to make landmarks count heuristic optimal, we give the solution to the overestimate of landmarks count heuristic. We extend landmarks count heuristic without action cost assignments, and prove that the extension of heuristic is admissible. Our empirical evaluation shows that the extension of heuristic is admissible and can be competed with the state-of-the-art of heuristic. 2011 ACADEMY PUBLISHER.
收录类别	EI
文献类型	期刊论文
条目标识符	http://ir.ciomp.ac.cn/handle/181722/24421
专题	中科院长春光机所知识产出
推荐引用方式 GB/T 7714	Zhao J.,Liu D.,Yang Y.. Enhancing planning heuristic with landmarks[J]. Journal of Computers,2011,6(12):2590-2595.
APA	Zhao J.,Liu D.,&Yang Y..(2011).Enhancing planning heuristic with landmarks.Journal of Computers,6(12),2590-2595.
MLA	Zhao J.,et al."Enhancing planning heuristic with landmarks".Journal of Computers 6.12(2011):2590-2595.