Integrating Actions Preconditions Difficulty within the Relaxed Plan Heuristic Measure
نویسندگان
چکیده
Most of the heuristic search based planning systems perform guided search evaluating states to compute a heuristic measure. Although recent planners are quite efficient, the time spent in computing the heuristic measure is still an issue that the community has to address. In this work we present an extension to the heuristic of the relaxed plan introduced by the FF Planner. We propose to integrate in the heuristic measure the actions preconditions difficulty, which is computed during the relaxed plan extraction phase. Results show that the number of evaluated states and the time to compute plans are decreased using this integrated heuristic.
منابع مشابه
Improving relaxed-plan-based heuristics via simulated execution of relaxed-plans
Relaxed plans, in the ignoring action’s delete list relaxation mode, have been used as a good approximation of the goaldistances of search states. Recently, many researchers tried to improve relaxed plan based (RPB) heuristics by taking information from action’s delete lists and got promising results. However, it is still a crucial point to keep the improved heuristics with low computational co...
متن کاملA Lookahead Strategy for Heuristic Search Planning
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information from the relaxed plan and for dealing with helpful actions, by considering the high quality of the relaxed plans in numerous domains. For each evaluated state, we employ actions from these plans in order to find the begin...
متن کاملGeneralizing the Relaxed Planning Heuristic to Non-linear Tasks
The relaxed planning heuristic is a prominent state-to-goal estimator function for domain-independent forward-chaining heuristic search and local search planning. It enriches the state-space traversal of almost all currently available suboptimal state-of-the-art planning systems. While current domain description languages allow general arithmetic expressions in precondition and effect lists, th...
متن کاملUsing Interaction to Compute Better Probability Estimates in Plan Graphs
Plan graphs are commonly used in planning to help compute heuristic “distance” estimates between states and goals. A few authors have also attempted to use plan graphs in probabilistic planning to compute estimates of the probability that propositions can be achieved and actions can be performed. This is done by propagating probability information forward through the plan graph from the initial...
متن کاملPlanning in Incomplete Domains
Engineering complete planning domain descriptions is often very costly because of human-error or lack of domain knowledge. While many have studied knowledge acquisition, relatively few have studied the synthesis of plans when the domain model is incomplete (i.e., actions have incomplete preconditions or effects). Prior work has evaluated the correctness of plans synthesized by disregarding such...
متن کامل