On the Completeness of Approximation Based Reasoning and Planning in Action Theories with Incomplete Information

In this paper, we study the completeness of the 0-approximation for action theories with incomplete information. We propose a sufficient condition for which an action theory under the 0-approximation semantics is complete with respect to the possible world semantics. We then introduce the notion of decisive sets of fluents, based on which an action theory can be modified into another action theory such that the modified action theory under the 0-approximation is complete with respect to the original theory. We present a polynomial time algorithm for computing decisive sets for action theories and use it in the development of a sound and complete conformant planner. Finally, we compare our planner with other state-of-the-art conformant planners.

[1]  Tran Cao Son,et al.  Conformant Planning for Domains with Constraints-A New Approach , 2005, AAAI.

[2]  Daniel Bryce,et al.  State Agnostic Planning Graphs and the Application to Belief-Space Planning , 2005, AAAI.

[3]  Robert P. Goldman,et al.  Expressive Planning and Explicit Knowledge , 1996, AIPS.

[4]  Michael Thielscher.  Reasoning about Actions with CHRs and Finite Domain Constraints , 2002, ICLP.

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

[6]  Oren Etzioni,et al.  Planning with Execution and Incomplete Information , 1996 .

[7]  Gregg Collins,et al.  Planning for Contingencies: A Decision-based Approach , 1996, J. Artif. Intell. Res..

[8]  Tran Cao Son,et al.  Formalizing sensing actions A transition function based approach , 2001, Artif. Intell..

[9]  Oren Etzioni,et al.  An Approach to Planning with Incomplete Information , 1992, KR.

[10]  Mark A. Peot,et al.  Conditional nonlinear planning , 1992 .

[11]  Hector J. Levesque,et al.  What Is Planning in the Presence of Sensing? , 1996, AAAI/IAAI, Vol. 2.

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

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

[14]  Tran Cao Son,et al.  Regression with Respect to Sensing Actions and Partial States , 2004, AAAI.

[15]  Patrik Haslum,et al.  Planning with Reduced Operator Sets , 2000, AIPS.

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

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

[18]  Michael Thielscher.  Programming of Reasoning and Planning Agents with FLUX , 2002, KR 2002.

[19]  Bernhard Nebel,et al.  Ignoring Irrelevant Facts and Operators in Plan Generation , 1997, ECP.

[20]  Hector J. Levesque,et al.  Knowledge, action, and the frame problem , 2003, Artif. Intell..

[21]  Robert C. Moore.  A Formal Theory of Knowledge and Action , 1984 .

[22]  Michael Gelfond,et al.  Representing Actions in Extended Logic Programming , 1992, JICSLP.

[23]  Robert P. Goldman,et al.  Representing Uncertainty in Simple Planners , 1994, KR.

[24]  Fahiem Bacchus,et al.  A Knowledge-Based Approach to Planning with Incomplete Information and Sensing , 2002, AIPS.

[25]  Robert C. Moore,et al.  Formal Theories of the Commonsense World , 1985 .

[26]  David E. Smith,et al.  Extending Graphplan to handle uncertainty and sensing actions , 1998, AAAI 1998.

[27]  Keith Golden,et al.  Representing Sensing Actions: The Middle Ground Revisited , 1996, KR.

[28]  Tran Cao Son,et al.  Approximation of action theories and its application to conformant planning , 2005, Artif. Intell..

[29]  Tran Cao Son,et al.  Planning with Sensing Actions and Incomplete Information Using Logic Programming , 2004, LPNMR.