From Dynamic Programming to Planning
- 409 Downloads
Planning can be treated as dynamic programming, for which tabling has been shown to be effective. Picat provides a module, named planner, which is based on tabling, but provides a level of abstraction that hides tabling from users. This chapter focuses on depth-unbounded search predicates in the planner module , and demonstrates several application examples.