Skip navigation
Skip navigation

Heuristics for Planning with SAT

Rintanen, Jussi


Generic SAT solvers have been very successful in solving hard combinatorial problems in various application areas, including AI planning. There is potential for improved performance by making the SAT solving process more application-specific. In this paper we propose a variable selection strategy for AI planning. The strategy is based on generic principles about properties of plans, and its performance with standard planning benchmarks often substantially improves on generic variable selection...[Show more]

CollectionsANU Research Publications
Date published: 2010
Type: Conference paper
Source: Cost-Optimal Factored Planning: Promises and Pitfalls
DOI: 10.1007/978-3-642-15396-9_34


File Description SizeFormat Image
01_Rintanen_Heuristics_for_Planning_with_2010.pdf237.89 kBAdobe PDF    Request a copy

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