A Novel Technique for Avoiding Plateaus of Greedy Best-First Search in Satisficing Planning

Greedy best-first search (GBFS) is a popular and effective algorithm in satisficing planning and is incorporated into high-performance planners. GBFS in planning decides its search direction with automatically generated heuristic functions. However, if the heuristic functions evaluate nodes inaccurately, GBFS may be misled into a valueless search direction, thus resulting in performance degradation. This paper presents a simple but effective algorithm considering a diversity of search directions to avoid the errors of heuristic information. Experimental results in solving a variety of planning problems show that our approach is successful.

Authors

• Tatsuya Imai Tokyo Institue of Technology
• Akihiro Kishimoto IBM Research - Tokyo

Keywords

No keywords are indexed for this paper.