Symbolic Planning Clause Samples

Symbolic Planning. 20 2.4.1 Binary Decision Diagrams 20 2.5 Planning as Heuristic Search 21 2.5.1 A* Search 23 2.5.2 Heuristic Classification 24 2.5.3 Abstraction Heuristics 25 2.5.4 Limitations 26 2.6 Pattern Databases 28 2.6.1 Heuristic Details 28 2.6.2 Memory-based Heuristic 29 2.6.3 Using Multiple PDBs 31
Symbolic Planning. ‌ Most state-based planners use methods that operate on explicit states, where each assignment of different values to the variable in the planning task is a different state. Representation can be beneficial for certain problems, but it has shown to be prone to scaling issues when working in domains that have many predicates, leading to a state-space explosion. This is due to the exponential growth of the state-space depending on the number of variables. Symbolic planning differs from this by representing a state as a Boolean function, leading to applying operators on sets of states, instead of one by one changes. The first big advantage of such an approach is that it is searching for a solution that uses less memory, as states are compressed based on their logical representation which now grows linearly, instead of exponentially.