AAAI Publications, Twenty-Fourth International Joint Conference on Artificial Intelligence

Font Size: 
Complexity Results in Epistemic Planning
Thomas Bolander, Martin Holm Jensen, Francois Schwarzentruber

Last modified: 2015-06-25

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.

Full Text: PDF