سال انتشار: ۱۳۸۴

محل انتشار: یازدهمین کنفرانس سالانه انجمن کامپیوتر ایران

تعداد صفحات: ۵

نویسنده(ها):

Emad Soroush – B.S Student Sharif University of Technology Computer Engineering Dep.
Seyyed Ali Akramifar – Ph.D. Student Sharif University of Technology Computer Engineering Dep
G.Reza Ghassem-Sani – Assistant Professor Sharif University of Technology Computer Engineering Dep

چکیده:

This paper proposes a new variation of the Fast Forward (FF) planning. This new variation, which we called H-FF, was applied to the FF policies that are used to reach to a relaxed plan. Specifically, FF uses the NOOP first policy, but new policy of H-FF, named HSP policy, uses the hsp_value attribute in order to make a relax plan. FF and H-FF were tested on three domains (i.e., Mprime, Mystery, and Blocksworld-4ops). The experiments were based on the heuristic estimation, planning times and the number of actions in the final plan (i.e. the plan size). Results show that H-FF often finds a superior solution with respect to the planning times and the solution length criteria, but with high values in the heuristic estimation. The results are highlighted in Mprime and Mystery domains. The more efficient answer of H-FF in time and step shows that HSPpolicy is a more informative heuristic than NOOP first policy. So the FF assumption that the better answer in relaxed plan, leads to a better plan in the real problem is not the case.