A polynomial-time algorithm for constructing k-maintainable policies

Chitta Baral, Thomas Eiter

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

Abstract

In this paper we present a polynomial time algorithm for constructing k-maintainable policies (Nakamura Baral, & Bjareland 2000). Our algorithm, in polynomial time, constructs a k-maintainable control policy, if one exists, or tells that no such policy is possible. Our algorithm is based on SAT Solving, and employs a suitable formulation of the existence of k-maintainable control in a fragment of SAT which is tractable. We then give a logic programming implementation of our algorithm and use it to give a standard procedural algorithm. We then present several complexity results about constructing k-maintainable controls, under different assumptions such as k = 1, and compact representation.

Original languageEnglish (US)
Title of host publicationProceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004
EditorsS. Zilberstein, J. Koehler, S. Koenig
Pages111-120
Number of pages10
StatePublished - Dec 1 2004
EventProceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004 - Whistler, BC, Canada
Duration: Jun 3 2004Jun 7 2004

Publication series

NameProceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004

Other

OtherProceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004
CountryCanada
CityWhistler, BC
Period6/3/046/7/04

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'A polynomial-time algorithm for constructing k-maintainable policies'. Together they form a unique fingerprint.

Cite this