Skip navigation
Skip navigation

Reducing accidental complexity in planning problems

Request a Copy

link to publisher version

Haslum, Patrik

Description

Although even propositional STRIPS planning is a hard problem in general, many instances of the problem, including many of those commonly used as benchmarks, are easy. In spite of this, they are often hard to solve for domain-independent planners, because

CollectionsANU Research Publications
Date published: 2007
Type: Conference paper
URI: http://hdl.handle.net/1885/30289
Source: Proceedings of the International Joint Conference on Artificial Intelligence

Download

File Description SizeFormat Image
01_Haslum_Reducing_accidental_complexity_2007.pdf25.91 kBAdobe PDF    Request a copy
02_Haslum_Reducing_accidental_complexity_2007.pdf233.08 kBAdobe PDF    Request a copy
03_Haslum_Reducing_accidental_complexity_2007.pdf233.08 kBAdobe PDF    Request a copy
04_Haslum_Reducing_accidental_complexity_2007.pdf312.46 kBAdobe PDF    Request a copy
Show full item record


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator