Higher-Dimensional Potential Heuristics: Lower Bound Criterion and Connection to Correlation Complexity

Simon Dold, Malte Helmert

Abstract: Correlation complexity is a measure of a planning task indicating how hard it is. The introducing work, provides sufficient criteria to detect a correlation complexity of 2 on a planning task. It also introduced an example of a planning task with correlation complexity 3. In our work, we introduce a criterion to detect an arbitrary correlation complexity and extend the mentioned example to show with the new criterion that planning tasks with arbitrary correlation complexity exist.