Width and Complexity of Belief Tracking in Non-Deterministic Conformant and Contingent Planning
نویسندگان
چکیده
It has been shown recently that the complexity of belief tracking in deterministic conformant and contingent planning is exponential in a width parameter that is often bounded and small. In this work, we introduce a new width notion that applies to non-deterministic conformant and contingent problems as well. We also develop a belief tracking algorithm for non-deterministic problems that is exponential in the problem width, analyze the width of non-deterministic benchmarks, compare the new notion to the previous one over deterministic problems, and present experimental results.
منابع مشابه
Belief Tracking for Planning with Sensing: Width, Complexity and Approximations
We consider the problem of belief tracking in a planning setting where states are valuations over a set of variables that are partially observable, and beliefs stand for the sets of states that are possible. While the problem is intractable in the worst case, it has been recently shown that in deterministic conformant and contingent problems, belief tracking is exponential in a width parameter ...
متن کاملA Translation-Based Approach to Contingent Planning
The problem of planning in the presence of sensing has been addressed in recent years as a nondeterministic search problem in belief space. In this work, we use ideas advanced recently for compiling conformant problems into classical ones for introducing a different approach where contingent problems P are mapped into non-deterministic problems X(P ) in state space. We also identify a contingen...
متن کاملA New Approach to Contingent Planning Using A Disjunctive Representation in AND/OR forward Search with Novel Pruning Techniques
This paper introduces a highly competitive contingent planner, that uses the novel idea of encoding belief states as disjunctive normal form formulae proposed by To, Pontelli, and Son for conformant planning, for the search for solutions in the belief space. In the previous work for conformant planning, a complete transition function for computing successor belief states under the representatio...
متن کاملPlanning Graph Heuristics for Incomplete and Non-Deterministic Domains
This doctoral work centers on developing domain-independent heuristics for planning problems characterized by state incompleteness and action non-determinism. The key means by which the heuristics are computed is through planning graph analysis. The approach has been used to construct conformant and contingent plans in two different search techniques. The initial focus of the research was inves...
متن کاملPlanning in Belief Space with a Labelled Uncertainty Graph
Planning in belief space with a Labelled Uncertainty Graph, LUG, is an approach that uses a very compact planning graph to guide search in the space of belief states to construct conformant and contingent plans. A conformant plan is a plan that transitions (without sensing) all possible initial states through possibly non-deterministic actions to a goal state. A contingent plan adds the ability...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012