Date of Original Version
Abstract or Description
The prodigy system is based on bidirectional planning, which is a combination of goal-directed reasoning with simulated execution. Researchers have implemented a series of planners that utilize this search strategy, and demonstrated that it is an efficient technique, a fair match for other successful planners; however, they have provided few formal results on the common principles underlying the developed algorithms.
We formalize bidirectional planning, elucidate some techniques for improving its efficiency, and show how different strategies for controlling search complexity give rise to different versions of prodigy. In particular, we demonstrate that prodigy is incomplete and discuss advantages and drawbacks of its incompleteness. We then develop a complete bidirectional planner and compare it experimentally with prodigy. We show that it is almost as fast as prodigy and solves a wider range of problems.