By Topic

A novel causal graph based heuristic for solving planning problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Wen-Xiang Gu ; Department of Computer Science, School of Computer, Northeast Normal University, Changchun 130117, China ; Jin-Li Li ; Ming-Hao Yin ; Jun-Shu Wang
more authors

At present, heuristic planning is a focus in intelligence planning area. Two of the best known heuristic planners are HSP and FF. However, they are both based on the delete-relaxation, and some vital information of the planning task may be lost. Fast downward is a domain-independent heuristic planner, which is based on the causal graph heuristic. Because of translating a problem to a multi-valued planning task, and exploiting the underlying causal structure, fast downward can yield better performance compared with the state of the art heuristic planners in many domains, but it needs the state variables to be independent, which is always not satisfied. Based on the causal graph heuristic, this paper proposes a novel causal graph mixed heuristic with two proportion coefficients, which is the combination of the additive heuristic and max heuristic. Experiments have proved that the search time and plan length can be reduced under the heuristic method, and we can make a tradeoff between them.

Published in:

2008 International Conference on Machine Learning and Cybernetics  (Volume:4 )

Date of Conference:

12-15 July 2008