Complexity Results in Epistemic Planning

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.

[1]  Lawrence S. Moss,et al.  The Logic of Public Announcements and Common Knowledge and Private Suspicions , 1998, TARK.

[2]  Thomas Bolander,et al.  Undecidability in Epistemic Planning , 2013, IJCAI.

[3]  Quan Yu,et al.  Multi-Agent Epistemic Explanatory Diagnosis via Reasoning about Actions , 2013, IJCAI.

[4]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

[5]  J. Benthem.  One is a Lonely Number: on the logic of communication , 2003 .

[6]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[7]  Thomas Bolander,et al.  Epistemic and Doxastic Planning , 2014 .

[8]  Lawrence S. Moss,et al.  The Undecidability of Iterated Modal Relativization , 2005, Stud Logica.

[9]  Paolo Traverso,et al.  Automated planning - theory and practice , 2004 .

[10]  R. Lathe.  Phd by thesis , 1988, Nature.

[11]  S. Griffis.  EDITOR , 1997, Journal of Navigation.

[12]  Bastien Maubert,et al.  Logical foundations of games with imperfect information : uniform strategies. (Fondations logiques des jeux à information imparfaite : stratégies uniformes) , 2014 .

[13]  Tomasz Sadzik,et al.  Exploring the Iterated Update Universe , 2005 .

[14]  Thomas Bolander,et al.  Epistemic planning for single- and multi-agent systems , 2011, J. Appl. Non Class. Logics.

[15]  Tom Bylander,et al.  The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..

[16]  Andreas Witzel,et al.  DEL Planning and Some Tractable Cases , 2011, LORI.

[17]  Bernhard Nebel,et al.  The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..

[18]  John Geanakoplos,et al.  Common Knowledge , 1992, TARK.

[19]  Paolo Traverso,et al.  Automated Planning: Theory & Practice , 2004 .

[20]  François Schwarzentruber,et al.  On the Complexity of Dynamic Epistemic Logic , 2013, TARK.

[21]  Thomas Bolander,et al.  Conditional Epistemic Planning , 2012, JELIA.

[22]  Sophie Pinchinat,et al.  Automata Techniques for Epistemic Protocol Synthesis , 2014, SR.

[23]  Iris van Rooij,et al.  Parameterized Complexity Results for a Model of Theory of Mind Based on Dynamic Epistemic Logic , 2016, TARK.