Heuristic Search Planner 2.0

Other achieves a tradeoff between optimality and heuristic search planners in the AIPS2000 Contest speed. The transition function f maps states s file domain.pddl. The syntax for the instance into states s′ s - Del(a) Add(a) for and domain files is given by the PDDL standard. The action costs c(a) are all equal to 1. that includes The states s S are sets of atoms from can also choose a schedule of options as done A. in The set of actions A(s) applicable in s is found. In addition, the different options can are the operators op in O that are relevant be run concurrently as threads.