Linkability: examining causal link commitments in partial-order planning

Abstract

Recently, several researchers have demonstrated domains where partially-ordered planners outperform totally-ordered planners. In (Barrett & Weld 1994), Barrett and Weld build a series of artificial domains exploring the concepts of trivial and laborious serializability, in which a partially-ordered planner, snlp, consistently outperforms two totally-ordered planners. In this paper, we demonstrate that totally-ordered planners sometimes have an advantage over partiallyordered planners. We describe a series of domains in which prodigy4.0 consistently outperforms snlp, and introduce the concept of linkability to characterize the class of domains for which this happens. Linkability highlights the fact that partially-ordered planners commit to causal links in much the same way that totally-ordered planners commit to step ordering. Introduction Recently, several researchers have advocated the view that partially-ordered planners are generally more efficient than totally-ordered planners ...