Abstract
AbstractWe establish a novel relation between delete-free planning, an important task for the AI planning community also known as relaxed planning, and logic programming. We show that given a planning problem, all subsets of actions that could be ordered to produce relaxed plans for the problem can be bijectively captured with stable models of a logic program describing the corresponding relaxed planning problem. We also consider the supported model semantics of logic programs, and introduce one causal and one diagnostic encoding of the relaxed planning problem as logic programs, both capturing relaxed plans with their supported models. Our experimental results show that these new encodings can provide major performance gain when computing optimal relaxed plans, with our diagnostic encoding outperforming state-of-the-art approaches to relaxed planning regardless of the given time limit when measured on a wide collection of STRIPS planning benchmarks.
Publisher
Cambridge University Press (CUP)
Subject
Artificial Intelligence,Computational Theory and Mathematics,Hardware and Architecture,Theoretical Computer Science,Software
Reference32 articles.
1. Haslum, P. , Slaney, J. K. and Thiébaux, S. 2012. Minimal landmarks for optimal delete-free planning. In Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, ICAPS 2012. AAAI Press, 353–357.
2. Robinson, N. , McIlraith, S. A. and Toman, D. 2014. Cost-based query optimization via AI planning. In Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, July 27–31, 2014, Québec City, Québec, Canada. AAAI Press, 2344–2351.
3. Progress in clasp Series 3
4. Landmarks, Critical Paths and Abstractions: What's the Difference Anyway?
5. Rankooh, M. F. and Rintanen, J. 2022b. Efficient encoding of cost optimal delete-free planning as SAT. In Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Virtual Event, February 22 – March 1, 2022. AAAI Press, 9910–9917.