An Analysis of Learning to Plan as a Search Problem

摘要: Abstract C omposer is one of a growing number techniques for learning to plan. Like other approaches, it embodies simplifications overcome the complexities learning. These introduce tradeoffs between efficiency and effectiveness. In this paper we relate our general framework plan [Gratch92a]. This discussion illustrates how such may be used analyze particular approach, highlighting system's strengths weaknesses.