Efficient Open World Reasoning for Planning

We consider the problem of reasoning and planning with incomplete knowledge and deterministic actions. We introduce a knowledge representation scheme called PSIPLAN that can effectively represent incompleteness of an agent's knowledge while allowing for sound, complete and tractable entailment in domains where the set of all objects is either unknown or infinite. We present a procedure for state update resulting from taking an action in PSIPLAN that is correct, complete and has only polynomial complexity. State update is performed without considering the set of all possible worlds corresponding to the knowledge state. As a result, planning with PSIPLAN is done without direct manipulation of possible worlds. PSIPLAN representation underlies the PSIPOP planning algorithm that handles quantified goals with or without exceptions that no other domain independent planner has been shown to achieve. PSIPLAN has been implemented in Common Lisp and used in an application on planning in a collaborative interface.

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

[2]  Subbarao Kambhampati,et al.  Efficiently Executing Information Gathering Plans , 1998 .

[3]  Keith Golden,et al.  Planning and knowledge representation for softbots , 1997 .

[4]  Oren Etzioni,et al.  Omnipotence Without Omniscience: Efficient Sensor Management for Planning , 1994, AAAI.

[5]  Tamara Babaian,et al.  PSIPLAN: Open World Planning with y-Forms , 2000, AIPS.

[6]  Oren Etzioni,et al.  Sound and Efficient Closed-World Reasoning for Planning , 1997, Artif. Intell..

[7]  Amedeo Cesta,et al.  Recent Advances in AI Planning , 1997, Lecture Notes in Computer Science.

[8]  Raymond Reiter,et al.  Open World Planning in the Situation Calculus , 2000, AAAI/IAAI.

[9]  Marianne Winslett,et al.  Reasoning about Action Using a Possible Models Approach , 1988, AAAI.

[10]  Tamara Babaian,et al.  Graphplan Based Conformant Planning with Limited Quantification , 2005 .

[11]  Michael R. Genesereth,et al.  Logical foundations of artificial intelligence , 1987 .

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

[13]  Wolfgang Faber,et al.  A logic programming approach to knowledge-state planning: Semantics and complexity , 2004, TOCL.

[14]  Hudson Turner,et al.  Polynomial-Length Planning Spans the Polynomial Hierarchy , 2002, JELIA.

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

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

[17]  Tran Cao Son,et al.  Approximate Reasoning about Actions in Presence of Sensing and Incomplete Information , 1997, ILPS.

[18]  Alon Y. Halevy,et al.  Obtaining Complete Answers from Incomplete Databases , 1996, VLDB.

[19]  Danny De Schreye,et al.  Answer Set Planning , 1999 .

[20]  Michael Thielscher,et al.  Under Consideration for Publication in Theory and Practice of Logic Programming Flux: a Logic Programming Method for Reasoning Agents , 2003 .

[21]  Wolfgang Faber,et al.  Planning under Incomplete Knowledge , 2000, Computational Logic.

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

[23]  Maria Gini,et al.  An empirical study of sensing and defaulting in planning , 1992 .

[24]  Sam Steel,et al.  Integrating Planning, Execution and Monitoring , 1988, AAAI.

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

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

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

[28]  David A. McAllester,et al.  Systematic Nonlinear Planning , 1991, AAAI.

[29]  Hector J. Levesque,et al.  GOLOG: A Logic Programming Language for Dynamic Domains , 1997, J. Log. Program..

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

[31]  Eyal Amir,et al.  First-Order Logical Filtering , 2005, IJCAI.

[32]  Hector J. Levesque,et al.  The Frame Problem and Knowledge-Producing Actions , 1993, AAAI.

[33]  Marco Roveri,et al.  Recent Advances in AI Planning , 1999, Lecture Notes in Computer Science.

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

[35]  Hector J. Levesque,et al.  Tractable Reasoning with Incomplete First-Order Knowledge in Dynamic Systems with Context-Dependent Actions , 2005, IJCAI.

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

[37]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.