Expand description
Minimal SAS+ planning tasks, labeled transition systems, and the
Abstraction trait for abstraction heuristics.
SAS+ (Simplified Action Structures, extended; Bäckström & Nebel 1995) describes planning tasks with finite-domain state variables, operators with preconditions and effects, and partial goals.
Tasks may also use Fast Downward’s two extensions of SAS+: conditional effects and axioms (derived variables).
Tasks come from Fast Downward’s translator via fdr::SasFile (the
output.sas format, feature fdr), from your own grounder, or from
random for tests (feature random).
Modules§
- fdr
- Reader and writer for Fast Downward’s translator output format
(
output.sas, file version 3). - random
- Tiny deterministic random task generator for property tests across the workspace (no external RNG dependency).
Structs§
- Axiom
- A rule
conditions → headthat sets the derived variablehead.var. - Causal
Graph - The causal graph of a task: an arc
u → vmeans that changingvmay depend onu, or thatuandvchange together. - Effect
- An effect
factthat fires when allconditionshold in the state the operator is applied in. Unconditional effects have no conditions. - Fact
- A variable/value assignment
var = value. - Labeled
Transition System - An explicit labeled transition system. Self-loops are kept: they matter for synchronized products (merge-and-shrink), and are ignored where they are irrelevant (distances, saturated costs).
- Operator
- Projection
- Projection of a task onto a subset of variables (a “pattern”); the abstraction underlying pattern databases.
- State
- A complete assignment:
state.0[var]is the value ofvar. - Task
- Transition
- Variable
Enums§
Traits§
- Abstraction
- Something that maps concrete states onto an abstract transition system whose labels are operator ids. Goal distances in the abstract system are admissible estimates for the concrete task.