Complexity Results in Epistemic Planning

Thomas Bolander, Martin Holm Jensen, Francois Schwarzentruber

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

65 Downloads (Pure)

Abstract

Epistemic planning is a very expressive framework that extends automated planning by the incorporation of dynamic epistemic logic (DEL). We provide complexity results on the plan existence problem for multi-agent planning tasks, focusing on purely epistemic actions with propositional preconditions. We show that moving from epistemic preconditions to propositional preconditions makes it decidable, more precisely in EXPSPACE. The plan existence problem is PSPACE-complete when the underlying graphs are trees and NP-complete when they are chains (including singletons). We also show PSPACE-hardness of the plan verification problem, which strengthens previous results on the complexity of DEL model checking.
Original languageEnglish
Title of host publicationProceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015)
EditorsQiang Yang, Michael Wooldridge
PublisherAAAI Press
Publication date2015
Pages2791-2797
ISBN (Print)978-1-57735-738-4
Publication statusPublished - 2015
Event24th International Joint Conference on Artificial Intelligence - Buenos Aires, Argentina
Duration: 25 Jul 201531 Jul 2015
Conference number: 24
http://ijcai-15.org/

Conference

Conference24th International Joint Conference on Artificial Intelligence
Number24
CountryArgentina
CityBuenos Aires
Period25/07/201531/07/2015
Internet address

Cite this

Bolander, T., Jensen, M. H., & Schwarzentruber, F. (2015). Complexity Results in Epistemic Planning. In Q. Yang, & M. Wooldridge (Eds.), Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015) (pp. 2791-2797). AAAI Press.