[Back]


Talks and Poster Presentations (with Proceedings-Entry):

M. Kronegger, A. Pfandler, R. Pichler:
"Parameterized Complexity of Optimal Planning: A Detailed Map";
Talk: Twenty-third International Conference on Artificial Intelligence (IJCAI-13), Peking, China; 08-03-2013 - 08-09-2013; in: "Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence", F. Rossi (ed.); AAAI Press, (2013), ISBN: 978-1-57735-633-2; 954 - 961.



English abstract:
The goal of this paper is a systematic parameterized complexity analysis of different variants of propositional STRIPS planning. We identify several natural problem parameters and study all possible combinations of 9 parameters in 6 different settings. These settings arise, for instance, from the distinction if negative effects of actions are allowed or not. We provide a complete picture by establishing for each case either paraNP-hardness (i.e., the parameter combination does not help) or W[t]-completeness with t ∈ {1,2} (i.e., fixed-parameter intractability), or FPT (i.e., fixed-parameter tractability).


Related Projects:
Project Head Reinhard Pichler:
Effiziente, parametrisierte Algorithmen in Künstlicher Intelligenz und logischem Schließen


Created from the Publication Database of the Vienna University of Technology.