Efficient symbolic search for cost-optimal planning

Experiments with symbolic bidirectional uniform-cost search and symbolic A⁎ search with PDBs show remarkable performance improvements on most IPC benchmark domains. Overall, with the help of our improvements, symbolic bidirectional search outperforms explicit-state search with state-of-the-art heuristics such as LM-cut across many different domains.