liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Admissible Heuristics for Automated Planning
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab. Linköping University, The Institute of Technology.
2006 (English)Doctoral thesis, monograph (Other academic)
Abstract [en]

The problem of domain-independent automated planning has been a topic of research in Artificial Intelligence since the very beginnings of the field. Due to the desire not to rely on vast quantities of problem specific knowledge, the most widely adopted approach to automated planning is search. The topic of this thesis is the development of methods for achieving effective search control for domain-independent optimal planning through the construction of admissible heuristics. The particular planning problem considered is the so called “classical” AI planning problem, which makes several restricting assumptions. Optimality with respect to two measures of plan cost are considered: in planning with additive cost, the cost of a plan is the sum of the costs of the actions that make up the plan, which are assumed independent, while in planning with time, the cost of a plan is the total execution time – makespan – of the plan. The makespan optimization objective can not, in general, be formulated as a sum of independent action costs and therefore necessitates a problem model slightly different from the classical one. A further small extension to the classical model is made with the introduction of two forms of capacitated resources. Heuristics are developed mainly for regression planning, but based on principles general enough that heuristics for other planning search spaces can be derived on the same basis. The thesis describes a collection of methods, including the hm, additive hm and improved pattern database heuristics, and the relaxed search and boosting techniques for improving heuristics through limited search, and presents two extended experimental analyses of the developed methods, one comparing heuristics for planning with additive cost and the other concerning the relaxed search technique in the context of planning with time, aimed at discovering the characteristics of problem domains that determine the relative effectiveness of the compared methods. Results indicate that some plausible such characteristics have been found, but are not entirely conclusive.

Place, publisher, year, edition, pages
Institutionen för datavetenskap , 2006. , 164 p.
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1004
Keyword [en]
AI planning, optimal planning, temporal planning, heuristic search
National Category
Computer Science
URN: urn:nbn:se:liu:diva-6042ISBN: 91-85497-28-2 (print)OAI: diva2:21613
Public defence
2006-03-15, Visionen, Hus B, Campus Valla, Linköpings universitet, Linköping, 13:15 (English)
Available from: 2006-03-13 Created: 2006-03-13 Last updated: 2009-03-02

Open Access in DiVA

errata(114 kB)75 downloads
File information
File name ERRATA01.pdfFile size 114 kBChecksum MD5
Type errataMimetype application/pdf
fulltext(1473 kB)1671 downloads
File information
File name FULLTEXT01.pdfFile size 1473 kBChecksum MD5
Type fulltextMimetype application/pdf

Other links

Link to Licentiate Thesis

Search in DiVA

By author/editor
Haslum, Patrik
By organisation
KPLAB - Knowledge Processing LabThe Institute of Technology
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 1671 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 8672 hits
CiteExportLink to record
Permanent link

Direct link