Compliant conditions for polynomial time approximation of operator counts

Tathagata Chakraborti, Sarath Sreedharan, Sailik Sengupta, T. K. Satish Kumar, Subbarao Kambhampati

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this brief abstract, we develop a computationally simpler version of the operator count heuristic for a particular class of domains. The contribution of this abstract is thus threefold, we (1) propose an efficient closed form approximation to the operator count heuristic; (2) leverage compressed sensing techniques to obtain an integer approximation in polynomial time; and (3) discuss the relationship of the proposed formulation to existing heuristics and investigate properties of domains where such approaches are useful.

Original languageEnglish (US)
Title of host publicationProceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016
PublisherAAAI press
Pages123-124
Number of pages2
Volume2016-January
ISBN (Electronic)9781577357698
StatePublished - Jan 1 2016
Event9th Annual Symposium on Combinatorial Search, SoCS 2016 - Tarrytown, United States
Duration: Jul 6 2016Jul 8 2016

Other

Other9th Annual Symposium on Combinatorial Search, SoCS 2016
CountryUnited States
CityTarrytown
Period7/6/167/8/16

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Compliant conditions for polynomial time approximation of operator counts'. Together they form a unique fingerprint.

  • Cite this

    Chakraborti, T., Sreedharan, S., Sengupta, S., Satish Kumar, T. K., & Kambhampati, S. (2016). Compliant conditions for polynomial time approximation of operator counts. In Proceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016 (Vol. 2016-January, pp. 123-124). AAAI press.