226 search results - page 1 / 46 » Heuristic Search Planning with BDDs |
KI
2008
Springer
13 years 4 months ago
2008
Springer
Abstract. This paper investigates symbolic heuristic search with BDDs for solving domain-independent action planning problems cost-optimally. By distributimpact of operators that t...
PUK
2000
13 years 6 months ago
2000
Abstract. In this paper we study traditional and enhanced BDDbased exploration procedures capable of handling large planning problems. On the one hand, reachability analysis and mo...
AI
2008
Springer
13 years 4 months ago
2008
Springer
ICCAD
2001
IEEE
14 years 1 months ago
2001
IEEE
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
AAAI
2008
13 years 7 months ago
2008
This paper investigates the impact of symbolic search for solving domain-independent action planning problems with binary decision diagrams (BDDs). Polynomial upper and exponential...