Long, D. and Fox, M. (2003) Exploiting a graphplan framework in temporal planning. In: Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS), 2003-06-09 - 2003-06-13.
Download (69kB) | Preview
Graphplan (Blum and Furst 1995) has proved a popular and successful basis for a succession of extensions. An extension to handle temporal planning is a natural one to consider, because of the seductively time-like structure of the layers in the plan graph. TGP (Smith and Weld 1999) and TPSys (Garrido, Onaindía, and Barber 2001; Garrido, Fox, and Long 2002) are both examples of temporal planners that have exploited the Graphplan foundation. However, both of these systems (including both versions of TPSys) exploit the graph to represent a uniform flow of time. In this paper we describe an alternative approach, in which the graph is used to represent the purely logical structuring of the plan, with temporal constraints being managed separately (although not independently). The approach uses a linear constraint solver to ensure that temporal durations are correctly respected. The resulting planner offers an interesting alternative to the other approaches, offering an important extension in expressive power.
|Item type:||Conference or Workshop Item (Paper)|
|Keywords:||Electronic computers. Computer science|
|Subjects:||Science > Mathematics > Electronic computers. Computer science|
|Department:||Faculty of Science > Computer and Information Sciences|
|Depositing user:||Strathprints Administrator|
|Date Deposited:||26 Oct 2006|
|Last modified:||22 Feb 2017 04:45|