Computing Plan-Length Bounds Using Lengths of Longest Paths
Artificial Intelligence
2021-03-02 v2
Abstract
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 of this problem is NEXP-Hard, we show that our method can be used to compute practically useful upper-bounds on lengths of plans. We show that the computed upper-bounds are significantly (in many cases, orders of magnitude) better than bounds produced by previous bounding techniques and that they can be used to improve the SAT-based planning.
Cite
@article{arxiv.2006.01011,
title = {Computing Plan-Length Bounds Using Lengths of Longest Paths},
author = {Mohammad Abdulaziz and Dominik Berger},
journal= {arXiv preprint arXiv:2006.01011},
year = {2021}
}