Improving the Performance of the Fast Downward Planning System

Please enable javascript in your browser.

Sadraei, Reza | 2009

489 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 39663 (19)
University: Sharif University of Technology
Department: Computer Engineering
Advisor(s): Ghasem Sani, Golamreza
Abstract:
The so-called “Fast Downward” is a successful heuristic planner. This planner extracts informative data structures during planning. A number of efforts have been made to detect some constraints for guiding search toward the goal, in the hope to speed up the planning process. These constraints usually result in a number of sub-goals and determining their proper ordering. These sub-goals are called landmarks, which must be true at some point in every valid solution plan. Landmarks can be used to decompose a given planning task into several smaller sub-tasks. In this dissertation a new method is proposed to extracts landmark and recognizes their ordering based on fast downward basic data structures. This methodology is completely domainindependent and planner-independent. Experimental data shows that the approach yields to a significant performance improvement in original fast downward while the quality of generated plans is preserved
Keywords:
Planning ; Heuristic Planning ; Fast Downward Planner

No TOC