Partial order plan generation with the linear connection method
Bertram Fronhöfer · 1997
In [Bib86] a logical approach to plan generation---the Linear Connection Method (lcm)---was presented. Working without Frame Axioms it proposed to overcome the traditional drawbacks of logic in this field. Recent work on efficient backward proof search for the Linear Connection Method resulted in the proof procedure lip which we present here. It has a great resemblance to a certain partial order planning algorithm (pop). This relationship is analysed with the outcome that both algorithms have nearly identical branching in action (and fact) selection steps. However, pop performs a global detection of threats and conflicts, whose resolution may entail additional branching of the search space. On the other hand, lip has the advantage that it allows to prevent such conflicts.