Planning as satisfiability: Parallel plans and algorithms for plan search
We address two aspects of constructing plans efficiently by means of satisfiability testing: efficient encoding of the problem of existence of plans of a given number t of time points in the propositional logic and strategies for finding plans, given these formulae for different values of t. For the first problem we consider three semantics for plans with parallel operator application in order to make the search for plans more efficient. The standard semantics requires that parallel operators...[Show more]
|Collections||ANU Research Publications|
|01_Rintanen_Planning_as_satisfiability:_2006.pdf||1.21 MB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.