From Dynamic Programming to Planning

  • Neng-Fa ZhouEmail author
  • Håkan Kjellerstrand
  • Jonathan Fruhman
Part of the SpringerBriefs in Intelligent Systems book series (BRIEFSINSY)


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.

Copyright information

© The Author(s) 2015

Authors and Affiliations

  • Neng-Fa Zhou
    • 1
    Email author
  • Håkan Kjellerstrand
    • 2
  • Jonathan Fruhman
    • 3
  1. 1.Department of Computer and Information ScienceBrooklyn CollegeBrooklynUSA
  2. 2.hakank.orgMalmöSweden
  3. 3.Independent ResearcherNew YorkUSA

Personalised recommendations