Cresswell, S. and Coddington, A.M. (2004) Handling LTL formulas in a plan graph. In: Proceedings of the 23rd Workshop of the UK Planning and Scheduling Special Interest Group, 2004-12-20 - 2004-12-21, Cork, Ireland.
Full text not available in this repository. (Request a copy from the Strathclyde author)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: | 2748 |
| Keywords: | plan graph, artificial intelligence, temporal planning, planning domain definition language, 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: | 08 Apr 2007 |
| Last modified: | 04 Oct 2012 17:01 |
| URI: | http://strathprints.strath.ac.uk/id/eprint/2748 |
Actions (login required)
| View Item |