Please use this identifier to cite or link to this item:
|Title:||Translating PDDL into CSP# - The PAT Approach|
|Source:||Li, Y., Sun, J., Dong, J.S., Liu, Y., Sun, J. (2012). Translating PDDL into CSP# - The PAT Approach. Proceedings - 2012 IEEE 17th International Conference on Engineering of Complex Computer Systems, ICECCS 2012 : 240-249. ScholarBank@NUS Repository. https://doi.org/10.1109/ICECCS.2012.41|
|Abstract:||Model checking provides a way to automatically verify hardware and software systems, whereas the goal of planning is to produce a sequence of actions that leads from the initial state to the desired goal state. Recently research indicates that there is a strong connection between model checking and planning problem solving. In this paper, we investigate the feasibility of using a newly developed model checking framework, Process Analysis Toolkit (PAT), to serve as a planning solution provider for upper layer applications. We first carried out a number of experiments on different planning tools in order to compare their performance and capabilities. Our experimental results showed that the performance of the PAT model checker is comparable to that of state-of-art planners for certain categories of problems. We further propose a set of translation rules for mapping from a commonly used planning notation - PDDL into the CSP# modeling language of PAT. Finally, we provide evaluations on the translated models against other approaches in the planning domain to demonstrate the effectiveness of using the PAT model checker for planning. © 2012 C.E.S.A.M.E.S.|
|Source Title:||Proceedings - 2012 IEEE 17th International Conference on Engineering of Complex Computer Systems, ICECCS 2012|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 14, 2017
WEB OF SCIENCETM
checked on Nov 20, 2017
checked on Dec 17, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.