Pattison, D. and Long, D. (2010) Extracting plans from plans. In: Proceedings of the 28th Workshop of the UK Special Interest Group on Planning and Scheduling. UNSPECIFIED, 149 - 156.
paper.pdf - Final Published Version
Download (117kB) | Preview
Propositional plans of all forms often display a certain level of concurrency which can be exploited by scheduling the plan. This reveals the earliest times at which each action can be applied whilst still achieving the goal and shortening the plan duration. However, the output of this scheduling process is simply a set of timestamped actions, losing implicit information present in the original plan such as the causal links between actions and states. In this paper we present PIMP (Plans Inside Multi-threaded Plans), a domain-independent algorithm which can schedule a plan whilst retaining the knowledge inherent in a traditional plan. We exploit this using the concept of threads to detect individual, concurrent and interleaved plans and discuss the benefits of these thread-scheduled plans and their possible applications.
|Item type:||Book Section|
|Keywords:||propositional plans, plans inside multi-threaded plans, plan scheduling, Electronic computers. Computer science, Computer Science Applications|
|Subjects:||Science > Mathematics > Electronic computers. Computer science|
|Department:||Faculty of Science > Computer and Information Sciences|
|Depositing user:||Pure Administrator|
|Date Deposited:||09 Oct 2014 13:02|
|Last modified:||02 Apr 2017 09:29|