Hence, the following is an admissible additive heuristic (Felner et al., 2004), where h * i (s) denote the optimal completion costs in the projected search graph π i (G).
the completion cost of a state bounds the sum of the completion costs in each projection.