Computational complexity of planning and approximate planning in presence of incompleteness

Chitta Baral, Vladik Kreinovich, Raul Trejo

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

15 Scopus citations

Abstract

In the last several years the computational complexity of classical planning and HTN planning have been studied. But in both cases it is assumed that the planner has complete knowledge about the initial state. Recently, there has been proposal to use 'sensing' actions to plan in presence of incompleteness. In this paper we study the complexity of planning in such cases. In our study we use the action description language A proposed in 1993 by M. Gelfond and V. Lifschitz and its extensions. The language A allows planning in the situations with complete information. It is known that, if we consider only plans of feasible (polynomial) length, the planning problem for such situations is NP-complete: even checking whether a given objective is attainable from a given initial state is NP-complete. In this paper, we show that the planning problem in presence of incompleteness is indeed harder: it belongs to the next level of complexity hierarchy (in precise terms, it is Σ 2P- complete). To overcome the complexity of this problem, C. Baral and T. Son have proposed several approximations. We show that under certain conditions, one of these approximations - O-approximation - makes the problem NP-complete (thus indeed reducing its complexity).

Original languageEnglish (US)
Title of host publicationIJCAI International Joint Conference on Artificial Intelligence
Pages948-953
Number of pages6
Volume2
StatePublished - 1999
Externally publishedYes
Event16th International Joint Conference on Artificial Intelligence, IJCAI 1999 - Stockholm, Sweden
Duration: Jul 31 1999Aug 6 1999

Other

Other16th International Joint Conference on Artificial Intelligence, IJCAI 1999
CountrySweden
CityStockholm
Period7/31/998/6/99

ASJC Scopus subject areas

  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Computational complexity of planning and approximate planning in presence of incompleteness'. Together they form a unique fingerprint.

  • Cite this

    Baral, C., Kreinovich, V., & Trejo, R. (1999). Computational complexity of planning and approximate planning in presence of incompleteness. In IJCAI International Joint Conference on Artificial Intelligence (Vol. 2, pp. 948-953)