Admissible Heuristic with multi-Landmarks Counting
Landmarks for a planning task are sub-goals that are necessarily made true at some time steps for any success plan. It is showed that the heuristic search with landmarks guiding has gained great success in 2008 IPC. Present landmark-counting heuristics are competitive until the complete causal landmarks have been extracted. Here, we propose an multi-path dependent heuristic which restricts the fact landmarks to be achieved from the * current state during the search with considering the repeatedly appearance of action landmarks. Our cost-sharing heuristic is proved theoretically admissible and empirically efficient.
AI planning heuristic search landmarks landmark cost multi-path dependence
LI Li LI WeiSheng.
College of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing, China
国际会议
重庆
英文
861-864
2011-08-20（万方平台首次上网日期，不代表论文的发表时间）