| Eugene Fink and Jim Blythe. A complete bidirectional planner. In Simmons et al. [54], pages 78--85. |
....branching factor. By leaving the goal state partly unspecified, extra branching will be introduced near the root of a backward search tree. These biases are real, and underscore the need for planners to be bidirectional for optimal performance. Recent research has made some progress in this area [18]. There are two general classes of STRIPS planning algorithm that typify the distinction between forward and backward planning algorithms. The first, forward state space search, starts with the initial state and produces successor states by applying actions whose preconditions are satisfied, in ....
Eugene Fink and Jim Blythe. A complete bidirectional planner. In Simmons et al. [54], pages 78--85.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC