Using Distance Heuristics
Conjunctive FSS planners need to recompute the heuristic as the init state changes
- UNPOP [McDermott], HSP [Bonet & Geffner], FF [Hoffman]
- GRT [Refanidis & Vlahavas] elaborates the goal state and computes heuristic in the reverse direction
Conjunctive BSS planners can get by with a single computation of the heuristic
- HSP-R [Bonet & Geffner], AltAlt [Long & Kambhampati &..]
Conjunctive PS planners can use distance heuristics and mutex information to rank partial plans and flaw resolution choices
- IxTET [Ghallab et. al.]; AltAlt-UC [Long & Kambhampati]
Disjunctive planners can use distance heuristics as the basis for variable and value ordering heuristics
- GP-HSP [Kambhampati & Nigenda], GP-CSP [Do & Kambhampati]