Computing Plan-Length Bounds Using Lengths of Longest Paths

Mohammad Abdulaziz, Dominik Berger

We devise a method to exactly compute the length of the longest simple path in factored state spaces, like state spaces encountered in classical planning. Although the complexity o…