Strathprints Home | Open Access | Browse | Search | User area | Copyright | Help | Library Home | SUPrimo

Compilation of LTL goal formulas into PDDL

Cresswell, S. and Coddington, A.M. (2004) Compilation of LTL goal formulas into PDDL. In: European Conference on Artificial Intelligence (ECAI 2004), 2004-08-22 - 2004-08-27, Valencia, Spain.

[img]
Preview
PDF (strathprints001953.pdf)
Download (72Kb) | Preview

    Abstract

    Temporally extended goals are used in planning to express safety and maintenance conditions. Linear temporal logic is the language often used to express temporally extended goals. We present a method for compiling LTL goal formulas into Planning Domain Definition Language (PDDL), which is handled by many AI planners. The compilation process first constructs a finite state machine representing all reachable progressions of the goal formula, then modifies the planning domain and problem definition so that the state of the FSM is tracked.

    Item type: Conference or Workshop Item (Paper)
    ID code: 1953
    Keywords: planning domain definition language (PDDL), planning systems, linear temporal logic, artificial intelligence, Electronic computers. Computer science
    Subjects: Science > Mathematics > Electronic computers. Computer science
    Department: Faculty of Science > Computer and Information Sciences
    Related URLs:
      Depositing user: Strathprints Administrator
      Date Deposited: 06 Nov 2006
      Last modified: 20 Jul 2013 21:53
      URI: http://strathprints.strath.ac.uk/id/eprint/1953

      Actions (login required)

      View Item

      Fulltext Downloads: