• Journal of Korea Society of Digital Industry and Information Management
• /
• v.13 no.2
• /
• pp.27-34
• /
• 2017

Highly informative admissible heuristics can help to conduct more efficient search for optimal solutions. However, in general, more informative ones of heuristics from planning problems requires lots of computational effort. To address this problem, we propose an Delete Relaxation based Action Costs-based Planning Graph(ACPG) and Action Costs-based Heuristics for solving optimal planning problems more efficiently. The ACPG is an extended one to be applied to can find action costs between subgoal & goal conditions from the Relaxed Planning Graph(RPG) which is a common means to get heuristics for solving the planning problems, Action Costs-based Heuristics utilizing ACPG can find action costs difference between subgoal & goal conditions in an effective way, and then consider them to estimate the goal distance. In this paper, we present the heuristics algorithm to compute Action Costs-based Heuristics, and then explain experimental analysis to investigate the efficiency and the accuracy of the Action Costs-based Heuristics.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.17 no.3
• /
• pp.27-37
• /
• 2021

Highly informative heuristics in AI planning can help to a more efficient search a solutions. However, in general, to obtain informative heuristics from planning problem specifications requires a lot of computational effort. To address this problem, we propose a Partial Planning Graph(PPG) and Mixed Heuristics for solving planning problems more efficiently. The PPG is an improved graph to be applied to can find a partial heuristic value for each goal condition from the relaxed planning graph which is a means to get heuristics to solve planning problems. Mixed Heuristics using PPG requires size of each graph is relatively small and less computational effort as a partial plan generated for each goal condition compared to the existing planning graph. Mixed Heuristics using PPG can find partial interactions for each goal conditions in an effective way, then consider them in order to estimate the goal state heuristics. Therefore Mixed Heuristics can not only find interactions for each goal conditions more less computational effort, but also have high accuracy of heuristics than the existing max and additive heuristics. In this paper, we present the PPG and the algorithm for computing Mixed Heuristics, and then explain analysis to accuracy and the efficiency of the Mixed Heuristics.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.9
• /
• pp.6290-6296
• /
• 2015

More informative ones of heuristics can help to conduct search more efficiently to obtain solution plan. However, in general, to derive highly informative heuristics from problem specifications requires lots of computational effort. To address this problem, we propose an State-Action based Planning Graph(SAPG) and Action-based heuristics for solving planning problems more efficiently. The SAPG is an extended one to be applied to can find interactions between subgoal & goal conditions from the relaxed planning graph which is a common means to get heuristics for solving the planning problems, Action-based heuristics utilizing SAPG graphs can find interactions between subgoal & goal conditions in an effective way, and then consider them to estimate the goal distance. Therefore Action-based heuristics have more information than the existing max and additive heuristics, also requires less computational effort than the existing overlap heuristics. In this pager. we present the algorithm to compute Action-based heuristics, and then explain empirical analysis to investigate the accuracy and the efficiency of the Action-based heuristics.