HSP

(Heuristic Search Planner) [Bonet Geffner1999] is based on heuristic search. The planner uses a variation of hill-climbing with random restarts to solve planning problems. The heuristic is based on using the Graphplan algorithm to solve a relaxed form of the planning problem. In this study, we used version 1.1, which is an algorithmic refinement of the version entered into the AIPS98 competition, and version 2.0.