Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
This problem is adapted from codechef.com.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2015 The Author(s)
About this chapter
Cite this chapter
Zhou, NF., Kjellerstrand, H., Fruhman, J. (2015). From Dynamic Programming to Planning. In: Constraint Solving and Planning with Picat. SpringerBriefs in Intelligent Systems. Springer, Cham. https://doi.org/10.1007/978-3-319-25883-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-25883-6_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-25881-2
Online ISBN: 978-3-319-25883-6
eBook Packages: Computer ScienceComputer Science (R0)