Compliant Conditions for Polynomial Time Approximation of Operator Counts
Artificial Intelligence
2016-07-06 v2
Abstract
In this paper, we develop a computationally simpler version of the operator count heuristic for a particular class of domains. The contribution of this abstract is threefold, we (1) propose an efficient closed form approximation to the operator count heuristic using the Lagrangian dual; (2) leverage compressed sensing techniques to obtain an integer approximation for operator counts in polynomial time; and (3) discuss the relationship of the proposed formulation to existing heuristics and investigate properties of domains where such approaches appear to be useful.
Cite
@article{arxiv.1605.07989,
title = {Compliant Conditions for Polynomial Time Approximation of Operator Counts},
author = {Tathagata Chakraborti and Sarath Sreedharan and Sailik Sengupta and T. K. Satish Kumar and Subbarao Kambhampati},
journal= {arXiv preprint arXiv:1605.07989},
year = {2016}
}
Comments
Published at the International Symposium on Combinatorial Search (SoCS), 2016