A Dynamic Epistemic Framework for Conformant Planning

In this paper, we introduce a lightweight dynamic epistemic logical framework for automated planning under initial uncertainty. We reduce plan verification and conformant planning to model checking problems of our logic. We show that the model checking problem of the iteration-free fragment is PSPACE-complete. By using two non-standard (but equivalent) semantics, we give novel model checking algorithms to the full language and the iteration-free language.

[1]  Guillaume Aucher,et al.  DEL-sequents for regression and epistemic planning , 2012, J. Appl. Non Class. Logics.

[2]  Patrik Haslum,et al.  Some Results on the Complexity of Planning with Incomplete Information , 1999, ECP.

[3]  Blai Bonet,et al.  Planning with Incomplete Information as Heuristic Search in Belief Space , 2000, AIPS.

[4]  Barteld Kooi,et al.  Dynamic Epistemic Logic , 2013 .

[5]  Blai Bonet,et al.  Width and Complexity of Belief Tracking in Non-Deterministic Conformant and Contingent Planning , 2012, AAAI.

[6]  Christer Bäckström,et al.  All PSPACE-Complete Planning Problems Are Equal but Some Are More Equal than Others , 2011, SOCS.

[7]  Ronen I. Brafman,et al.  Conformant planning via heuristic forward search: A new approach , 2004, Artif. Intell..

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

[9]  Martin Lange,et al.  Model checking propositional dynamic logic with all extras , 2006, J. Appl. Log..

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

[11]  Yanjing Wang,et al.  Not All Those Who Wander Are Lost: Dynamic Epistemic Reasoning in Navigation , 2012, Advances in Modal Logic.

[12]  Hector Geffner,et al.  Compiling Uncertainty Away in Conformant Planning Problems with Bounded Width , 2009, J. Artif. Intell. Res..

[13]  Blai Bonet,et al.  Conformant plans and beyond: Principles and complexity , 2010, Artif. Intell..

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

[15]  Piergiorgio Bertoli,et al.  Conformant planning via symbolic model checking and heuristic search , 2004, Artif. Intell..

[16]  Jérôme Lang,et al.  Knowledge-Based Programs as Plans - The Complexity of Plan Verification , 2012, ECAI.

[17]  Piergiorgio Bertoli,et al.  Strong planning under partial observability , 2006, Artif. Intell..

[18]  Daniel Bryce,et al.  Planning Graph Heuristics for Belief Space Search , 2006, J. Artif. Intell. Res..

[19]  Philippe Schnoebelen,et al.  The Complexity of Temporal Logic Model Checking , 2002, Advances in Modal Logic.

[20]  David E. Smith,et al.  Conformant Graphplan , 1998, AAAI/IAAI.

[21]  Enrico Pontelli,et al.  A New Approach to Conformant Planning Using CNF* , 2010, ICAPS.

[22]  Ramaswamy Ramanujam,et al.  Distributed Processes and the Logic of Knowledge , 1985, Logic of Programs.

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

[24]  Yanjing Wang,et al.  On axiomatizations of public announcement logic , 2013, Synthese.

[25]  Lawrence S. Moss,et al.  Logics for Epistemic Programs , 2004, Synthese.

[26]  Tao Jiang,et al.  A Note on the Space Complexity of Some Decision Problems for Finite Automata , 1991, Inf. Process. Lett..

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

[28]  Éva Tardos,et al.  Algorithm design , 2005 .

[29]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[30]  Ronald Fagin,et al.  Knowledge-based programs , 1995, PODC '95.

[31]  Albert R. Meyer,et al.  Word problems requiring exponential time(Preliminary Report) , 1973, STOC.

[32]  Hector Geffner,et al.  Compiling Uncertainty Away: Solving Conformant Planning Problems using a Classical Planner (Sometimes) , 2006, AAAI.

[33]  Jelle Gerbrandy,et al.  Dynamic epistemic logic , 1998 .

[34]  Thomas Bolander,et al.  Don't Plan for the Unexpected: Planning Based on Plausibility Models , 2015 .

[35]  Marco Roveri,et al.  Conformant Planning via Symbolic Model Checking , 2000, J. Artif. Intell. Res..