Resolution completeness is the property that the planner is guaranteed to find a path if the resolution of an underlying grid is fine enough.
Probabilistic completeness is the property that as more "work" is performed, the probability that the planner fails to find a path, if one exists, asymptotically approaches zero.