A temporally expressive planner based on answer set programming with constraints: preliminary design
Authors: 
Forrest Sheng Bao, Sandeep Chintabathina, A. Ricardo Morales, Nelson Rushton, Richard Watson, Yuanlin ZhangAuthors Info & Claims
January 2011
Pages 398 - 414
Abstract
Recently, a new language ACC was proposed to integrate answer set programming (ASP) and constraint logic programming (CLP). In this paper, we show that ACC can be employed to build a temporally expressive planner for PDDL2.1. Compared with the existing planners, the new approach put less restrictions on the planning problems and is easy to extend with new features like PDDL axioms, thanks to the expressive power of ACC. More interestingly, it can also leverage the inference engine for ACC which has the potential to exploit the best reasoning mechanisms developed in the ASP, SAT and CP communities.
References
[1]
Ghallab, M., Laruelle, H.: Representation and control in IxTeT, a temporal planner. In: Proceedings of the 2nd International Conference on Artificial Intelligence Planning Systems (AIPS), pp. 61-67 (1994)
[2]
Tate, A.: Representing plans as a set of constraints. In: Proceedings of the 3rd International Conference on Artificial Intelligence Planning Systems (AIPS), pp. 221-228 (1996)
[3]
Ai-Chang, M., Bresina, J., Farrell, K., Hsu, J., Jnsson, A., Kanefsky, B., Mc-Curdy, M., Morris, P., Rajan, K., Vera, A., Yglesias, J., Charest, L., Maldague, P.: MAPGEN: Mixed-intiative activity planning for the mars exploratory rover mission. IEEE Intelligent Systems 19(1), 8-12 (2004)
[4]
Penberthy, J.S., Weld, D.S.: Temporal planning with continuous change. In: Proceedings of the 12th National Conference on Artificial Intelligence (AAAI), vol. 2, pp. 1010-1015 (1994)
[5]
Fox, M., Long, D.: PDDL2.1: An extension to PDDL for expressing temporal planning domains. Journal of Artificial Intelligence Research (JAIR) 20, 61-124 (2003)
[6]
Chen, Y., Wah, B., Hsu, C.-W.: Temporal planning using subgoal partitioning and resolution in sgplan. Journal of Artificial Intelligence Research (JAIR) 26, 323-369 (2006)
[7]
Vidal, V., Geffner, H.: Branching and pruning: an optimal temporal POCL planner based on constraint programming. Artificial Intelligence 170(3), 298-335 (2006)
[8]
Cushing, W., Kambhampati, S., Weld, M., Weld, D.: When is temporal planning really temporal? In: Proceedings of the 20th International Joint Conference on Artifical Intelligence (IJCAI), pp. 1852-1859 (2007)
[9]
Coles, A., Fox, M., Long, D., Smith, A.: Planning with problems requiring temporal coordination. In: Proceedings of the 23rd National Conference on Artificial Intelligence (AAAI), vol. 2, pp. 892-897 (2008)
[10]
Huang, R., Chen, Y., Zhang, W.: An optimal temporally expressive planner: Initial results and application to P2P network optimization. In: Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS), pp. 178-185 (2009)
[11]
Hu, Y.: Temporally-expressive planning as constraint satisfaction problems. In: Proceedings of 17th International Conference on Automated Planning and Scheduling (ICAPS), pp. 192-199 (2007)
[12]
Thiébaux, S., Hoffmann, J., Nebel, B.: In defense of PDDL axioms. Artificial Intelligence 168(1), 38-69 (2005)
[13]
Mellarkod, V.S., Gelfond, M., Zhang, Y.: Integrating answer set programming and constraint logic programming. Annals of Mathematics and Artificial Intelligence 53(1-4), 251-287 (2008)
[14]
Lee, J., Lifschitz, V.: Describing additive fluents in action language C+. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI), pp. 1079-1084 (2003)
[15]
Baral, C.: Knowledge representation, reasoning and declarative problem solving. Cambridge University Press, Cambridge (2003)
[16]
Dovier, A., Formisano, A., Pontelli, E.: Multivalued action languages with constraints in CLP(FD). In: Dahl, V., Niemelä, I. (eds.) ICLP 2007. LNCS, vol. 4670, pp. 255-270. Springer, Heidelberg (2007).
Recommendations
Temporally expressive planning based on answer set programming with constraints
AAAI'12: Proceedings of the Twenty-Sixth AAAI Conference on Artificial IntelligenceRecently, a new language AC(C) was proposed to integrate answer set programming (ASP) and constraint logic programming (CLP). In this paper, we show that temporally expressive planning problems in PDDL2.1 can be translated into AC(C) and solved using AC(...
Evaluating epistemic negation in answer set programming
Epistemic negation not along with default negation plays a key role in knowledge representation and nonmonotonic reasoning. However, the existing epistemic approaches such as those by Gelfond 13,15,14, Truszczynski 33 and Kahl et al. 18 behave not ...
From answer set logic programming to circumscription via logic of GK
We first embed Pearce's equilibrium logic and Ferraris's propositional general logic programs in Lin and Shoham's logic of GK, a nonmonotonic modal logic that has been shown to include as special cases both Reiter's default logic in the propositional ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 01 January 2011
Qualifiers
- Chapter
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 20 Jan 2025