Computational complexity of planning with temporal goals

Chitta Baral, Vladik Kreinovich, Raúl A. Trejo

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

14 Scopus citations

Abstract

In the last decade, there has been several studies on the computational complexity of planning. These studies normally assume that the goal of planning is to make a certain fluent true after the sequence of actions. In many real-life planning problems, the goal is represented in a much more complicated temporal form: e.g., in addition to having a desired fluent true at the end, we may want to keep certain fluents true at all times. In this paper, we study the complexity of planning for such temporal goals. We show that for goals expressible in Linear Temporal Logic, planning has the same complexity as for non-temporal goals: it is NP-complete; and for goals expressible in a more general Branching Temporal Logic, planning is PSPACE-complete.

Original languageEnglish (US)
Title of host publicationIJCAI International Joint Conference on Artificial Intelligence
Pages509-514
Number of pages6
StatePublished - 2001
Event17th International Joint Conference on Artificial Intelligence, IJCAI 2001 - Seattle, WA, United States
Duration: Aug 4 2001Aug 10 2001

Other

Other17th International Joint Conference on Artificial Intelligence, IJCAI 2001
CountryUnited States
CitySeattle, WA
Period8/4/018/10/01

ASJC Scopus subject areas

  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Computational complexity of planning with temporal goals'. Together they form a unique fingerprint.

  • Cite this

    Baral, C., Kreinovich, V., & Trejo, R. A. (2001). Computational complexity of planning with temporal goals. In IJCAI International Joint Conference on Artificial Intelligence (pp. 509-514)