Heuristically guided constraint satisfaction for AI planning
Standard Planning Domain Definition Language (PDDL) planning problem definitions may be reformulated and solved using alternative techniques. One such paradigm, Constraint Programming (CP), has successfully been used in various planner architectures in recent years. The efficacy of a given constrain...
| Main Author: | |
|---|---|
| Published: |
University of Strathclyde
2015
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.687049 |