Compliant conditions for polynomial time approximation of operator counts

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

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 proceeding › Conference 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 language	English (US)
Title of host publication	Proceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016
Editors	Jorge A. Baier, Adi Botea
Publisher	AAAI press
Pages	123-124
Number of pages	2
ISBN (Electronic)	9781577357698
State	Published - 2016
Event	9th Annual Symposium on Combinatorial Search, SoCS 2016 - Tarrytown, United States Duration: Jul 6 2016 → Jul 8 2016

Publication series

Name	Proceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016
Volume	2016-January

Other

Other	9th Annual Symposium on Combinatorial Search, SoCS 2016
Country/Territory	United States
City	Tarrytown
Period	7/6/16 → 7/8/16

ASJC Scopus subject areas

Computer Networks and Communications

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 J. A. Baier, & A. Botea (Eds.), Proceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016 (pp. 123-124). (Proceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016; Vol. 2016-January). AAAI press.

Compliant conditions for polynomial time approximation of operator counts. / Chakraborti, Tathagata; Sreedharan, Sarath; Sengupta, Sailik et al.
Proceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016. ed. / Jorge A. Baier; Adi Botea. AAAI press, 2016. p. 123-124 (Proceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016; Vol. 2016-January).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Chakraborti, T, Sreedharan, S, Sengupta, S, Satish Kumar, TK & Kambhampati, S 2016, Compliant conditions for polynomial time approximation of operator counts. in JA Baier & A Botea (eds), Proceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016. Proceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016, vol. 2016-January, AAAI press, pp. 123-124, 9th Annual Symposium on Combinatorial Search, SoCS 2016, Tarrytown, United States, 7/6/16.

@inproceedings{194a87d4a6824499bde7fe0b4c7d8106,

title = "Compliant conditions for polynomial time approximation of operator counts",

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.",

author = "Tathagata Chakraborti and Sarath Sreedharan and Sailik Sengupta and {Satish Kumar}, {T. K.} and Subbarao Kambhampati",

note = "Funding Information: Acknowledgment. This research is supported in part by the ONR grants N00014-13-1-0176, N00014-13-1-0519 and N00014-15-1-2027, and ARO grant W911NF-13-1-0023. Publisher Copyright: Copyright {\textcopyright} 2016, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 9th Annual Symposium on Combinatorial Search, SoCS 2016 ; Conference date: 06-07-2016 Through 08-07-2016",

year = "2016",

language = "English (US)",

series = "Proceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016",

publisher = "AAAI press",

pages = "123--124",

editor = "Baier, {Jorge A.} and Adi Botea",

booktitle = "Proceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016",

}

TY - GEN

T1 - Compliant conditions for polynomial time approximation of operator counts

AU - Chakraborti, Tathagata

AU - Sreedharan, Sarath

AU - Sengupta, Sailik

AU - Satish Kumar, T. K.

AU - Kambhampati, Subbarao

N1 - Funding Information: Acknowledgment. This research is supported in part by the ONR grants N00014-13-1-0176, N00014-13-1-0519 and N00014-15-1-2027, and ARO grant W911NF-13-1-0023. Publisher Copyright: Copyright © 2016, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

PY - 2016

Y1 - 2016

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85048617858&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85048617858&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:85048617858

T3 - Proceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016

SP - 123

EP - 124

BT - Proceedings of the 9th Annual Symposium on Combinatorial Search, SoCS 2016

A2 - Baier, Jorge A.

A2 - Botea, Adi

PB - AAAI press

T2 - 9th Annual Symposium on Combinatorial Search, SoCS 2016

Y2 - 6 July 2016 through 8 July 2016

ER -

Compliant conditions for polynomial time approximation of operator counts

Abstract

Publication series

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this