Knowledge-Based Programs as Plans: Succinctness and the Complexity of Plan Existence

Knowledge-based programs (KBPs) are high-level protocols describing the course of action an agent should perform as a function of its knowledge. The use of KBPs for expressing action policies in AI planning has been surprisingly overlooked. Given that to each KBP corresponds an equivalent plan and vice versa, KBPs are typically more succinct than standard plans, but imply more on-line computation time. Here we make this argument formal, and prove that there exists an exponential succinctness gap between knowledge-based programs and standard plans. Then we address the complexity of plan existence. Some results trivially follow from results already known from the literature on planning under incomplete knowledge, but many were unknown so far.

[1]  Fahiem Bacchus,et al.  Extending the Knowledge-Based Approach to Planning with Incomplete Information and Sensing , 2004, ICAPS.

[2]  Andreas Herzig,et al.  Action representation and partially observable planning using epistemic logic , 2003, IJCAI.

[3]  Vladik Kreinovich,et al.  Computational Complexity of Planning and Approximate Planning in Presence of Incompleteness , 1999, IJCAI.

[4]  Gerhard Lakemeyer,et al.  Foundations for Knowledge-Based Programs using ES , 2006, KR.

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

[6]  Ronen I. Brafman,et al.  On the Knowledge Requirements of Tasks , 1998, Artif. Intell..

[7]  Rajdeep Niyogi,et al.  An Epistemic Logic for Planning with Trials , 2009, LORI.

[8]  Ray Reiter,et al.  On knowledge-based programming with sensing in the situation calculus , 2001, ACM Trans. Comput. Log..

[9]  Jérôme Lang,et al.  From knowledge-based programs to graded belief-based programs, part II: off-line reasoning , 2005, IJCAI 2005.

[10]  Christer Bäckström,et al.  Limits for compact representations of plans , 2011, ICAPS 2011.

[11]  Blai Bonet,et al.  Automatic Derivation of Finite-State Machines for Behavior Control , 2010, AAAI.

[12]  Joseph Y. Halpern,et al.  Characterizing Solution Concepts in Games Using Knowledge-Based Programs , 2006, IJCAI.

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

[14]  Jérôme Lang,et al.  From Knowledge-based Programs to Graded Belief-based Programs, Part I: On-line Reasoning* , 2004, Synthese.

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

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

[17]  Jussi Rintanen,et al.  Complexity of Planning with Partial Observability , 2004, ICAPS.

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