TALplanner: an empirical investigation of a temporal logic-based forward chaining planner
Authors:
- J. KvarnstromJKJ. Kvarnstrom
- 20 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 47-54
Abstract
We present a new forward chaining planner, TALplanner, based on ideas developed by Bacchus (1998) and Kabanza (1997), where domain-dependent search control knowledge represented as temporal formulas is used to effectively control forward chaining. Instead of using a linear modal tense logic as with Bacchus and Kabanza, we use TAL, a narrative-based linear temporal logic used for reasoning about action and change in incompletely specified dynamic environments. Two versions of TALplanner are considered, TALplan/modal which is based on the use of emulated modal formulas and a progression algorithm, and TALplan/non-modal which uses neither modal formulas nor a progression algorithm. For both versions of TALplanner and for all tested domains, TALplanner is shown to be considerably faster and requires less memory. The TAL versions also permit the representation of durative actions with internal state.Keywords
This publication has 7 references indexed in Scilit:
- Tackling the qualification problem using fluent dependency constraints: preliminary report2002
- Using temporal logics to express search control knowledge for planningArtificial Intelligence, 2000
- Reasoning about concurrent interactionJournal of Logic and Computation, 1999
- Planning for temporally extended goalsAnnals of Mathematics and Artificial Intelligence, 1998
- Planning control rules for reactive agentsArtificial Intelligence, 1997
- Extending planning graphs to an ADL subset1997
- The benefits of relaxing punctuality1991