Page Contributors: Adam Green,
Planner Quality: -
Year Published: 2011
Paper: IPC 2011 Booklet [ Fuentetaja, R. ]
Preceded By: -
CBP performs heuristic search in the state space using several heuristics. On one hand it uses look-ahead states based on relaxed plans to speed-up the search; on the other hand the search is also guided using a numerical heuristic and a selection of actions extracted from a relaxed planning graph. The relaxed planning graph is built taking into account action costs. The search algorithm is a modified Best-First Search (BFS) performing Branch and Bound (B&B) to improve the last solution found.
CBP has not been tested with eviscerator as we could not find source code for the planner, or we couldn’t get the source code to compile. CBP appears to be targeted to solving classical planning problems, so likely does not support any temporal or numeric features in PDDL.
No Source code could be located for CBP