Psiplan: Planning with -forms over Partially Closed Worlds
نویسنده
چکیده
We have developed a new partial order planner called PSIPLAN for open world planning, where the agent does not have complete information about the world and must take actions both to acquire knowledge and to change the world. Incompleteness of the agent's knowledge means that it cannot use the Closed World Assumption (CWA) in the representation of the state and must rely on a diierent method for representing large quantities of negative information. We drop the closed world assumption, and add a class of universally quantiied propositions. This latter class of propositions, which we call-forms, distinguishes this research. The most comprehensive of all practical solutions to the problem of planning in open worlds is the PUCCINI planner Gol98]. It uses what are called Locally Closed Worlds or LCWs EGW97] to represent parts of the world of which the agent has complete knowledge. For example, LCW(P S(x) ^ In(x; =tex)) states that the agent knows all x's that are postscript les in directory =tex. But there are drawbacks. The LCW logic is incomplete and, in some cases, discards information due to limits on its expressive power. Moreover, any planner that uses it is necessarily incomplete, even if the planner does no sensing. We use-forms to represent parts of the world of which the agent has complete knowledge. Given a domain of objects,-forms represent sets of ground clauses obtained by instantiating a clause of negated literals, called its main part. For example 1 = f:P (x; y) j :(x = A) ^ :(x = B; y = C)g represents ground clauses obtained by all possible instantiations of :P (x; y) except those in which x = A or x = B; y = C. The logical interpretation of a-form is a universally quantiied proposition. For example , 1 above is equivalent to the formula 8x; y : :P (x; y) _ (x = A) _ (x = B; y = C). Given this logical interpretation, we deene entailment between-forms in a usual way. We have developed inference methods between-forms, which are sound and complete and have polynomial complexity in the number of propositions, the maximum size of any clause in a-form, and the maximum number of variables used in a-form. Contrary to the LCW representation, the state representation which uses-forms never needs to discard information after an action is performed. Moreover, our partial order planner that uses-forms is complete when it does …
منابع مشابه
PSIPLAN: Open World Planning with ψ-forms
We present a new partial order planner called PSIPLAN, which builds on SNLP. We drop the closed world assumption, add sensing actions, add a class of propositions about the agent’s knowledge, and add a class of universally quantified propositions. This latter class of propositions, which we call ψ-forms, distinguishes this research. ψ-forms represent partially closed worlds, such as “Block A is...
متن کاملPSIPLAN: Open World Planning with y-Forms
We present a new, partial order planner called PSIPLAN, which builds on SNLP. We drop the closed world assumption, add sensing actions, "~ld a class of propositions about the agent’s knowledge, and add a class of universally quantified propositions. This latter class of propositions, which we call C-forms, distinguishes this research. ~,-forms represent partially closed worlds, such as "’Block ...
متن کاملKnowledge Representation and Open World Planning Using -forms Abstract Knowledge Representation and Open World Planning Using -forms
This thesis considers the problem of reasoning and planning in open worlds, where the agent does not have complete information about the world and must act to acquire knowledge and to change the world. We designed a language PSIPLAN to represent and reason about the agent's knowledge. PSIPLAN uses a class of universally quantiied propositions, which we call-forms, that are used to represent par...
متن کامل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 stat...
متن کاملPSIPOP: Planning with Sensing over Partially Closed Worlds
We present a new partial order planner called PSIPOP, which builds on SNLP. We drop the closed world assumption, add sensing actions, add a class of propositions about the agent’s knowledge, and add a class of universally quantified propositions. This latter class of propositions, which we call C-forms, distinguishes this research. C-forms represent partially closed worlds, such as "Block A is ...
متن کامل