Please use this identifier to cite or link to this item:
|Title:||Incremental deterministic planning||Authors:||Andrei, Ş.
|Issue Date:||2007||Citation:||Andrei, Ş.,Chin, W.-N.,Rinard, M. (2007). Incremental deterministic planning. Proceedings of the 8th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2006 : 93-100. ScholarBank@NUS Repository. https://doi.org/10.1109/SYNASC.2006.47||Abstract:||We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner deterministically to its goal. In comparison with existing planners, our approach eliminates backtracking and supports efficient incremental planners that add additional subformulas without the need to recompute solutions for previously provided subformulas. Our experimental results show that our approach is competitive with existing state-of-the-art planners that formulate the planning problem as a satisfiability problem, then solve the satisfiability problem using specialized off-the-shelf satisfiability solvers such as zChaff. © 2006 IEEE.||Source Title:||Proceedings of the 8th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2006||URI:||http://scholarbank.nus.edu.sg/handle/10635/40160||ISBN:||076952740X||DOI:||10.1109/SYNASC.2006.47|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 15, 2019
checked on May 11, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.