PDDL2.1 supports modelling of complex temporal planning domains in which solutions must exploit concurrency. Few existing temporal planners can solve problems that require concurrency and those that do typically pay a performance price to deploy reasoning machinery that is not always required. In this paper we show how to improve the performance of forward-search planners that attempt to solve the full temporal planning problem, both by narrowing the use of the concurrency machinery to situations that demand it and also by improving the power of inference to prune redundant branches of the search space for common patterns of interaction in temporal domains that do require concurrency. Results illustrate the effectiveness of our ideas in improving the efﬁciency of a temporal planner that can solve problems with required concurrency, both in domains that exploit this ability and in those that do not.
|Title of host publication
|Proceedings of the Nineteenth International Conference on Automated Planning and Scheduling (ICAPS 09).
|1 - 8
|Number of pages
|Published - 1 Sept 2009
|Nineteenth International Conference on Automated Planning and Scheduling (ICAPS 09). -
Duration: 1 Jan 2009 → …
|Nineteenth International Conference on Automated Planning and Scheduling (ICAPS 09).
|1/01/2009 → …