POND: The Partially-Observable and Non-Deterministic Planner
نویسنده
چکیده
This paper describes POND, a planner developed to solve problems characterized by partial observability and nondeterminism. POND searches in the space of belief states, guided by a relaxed plan heuristic. Many of the more interesting theoretical issues showcased by POND show up within its relaxed plan heuristics. Namely, the exciting topics are defining distance estimates between belief states, efficiently computing such distance estimates on planning graphs, and sharing planning graphs and relaxed plans between belief
منابع مشابه
Completeness of Online Planners for Partially Observable Deterministic Tasks
Partially observable planning is one of the most general and useful models for dealing with complex problems. In recent years there have been significant progress on the development of planners for deterministic models that offer strong theoretical guarantees over certain subclasses of tasks. These guarantees however are difficult to establish as they often involve reasoning about features that...
متن کاملFlexible and Scalable Partially Observable Planning with Linear Translations
The problem of on-line planning in partially observable settings involves two problems: keeping track of beliefs about the environment and selecting actions for achieving goals. While the two problems are computationally intractable in the worst case, significant progress has been achieved in recent years through the use of suitable reductions. In particular, the state-of-the-art CLG planner is...
متن کاملComputing Contingent Plans via Fully Observable Non-Deterministic Planning
Planning with sensing actions under partial observability is a computationally challenging problem that is fundamental to the realization of AI tasks in areas as diverse as robotics, game playing, and diagnostic problem solving. Recent work on generating plans for partially observable domains has advocated for online planning, claiming that offline plans are often too large to generate. Here we...
متن کاملExecution Monitoring to Improve Plans with Information Gathering
There has been much recent interest in planning problems with deterministic actions but stochastic observations. Examples include Mars rover planning, robot monitoring tasks and the Rocksample domain from the planning competition. However, theoretical results show that in general these problems are as hard as solving partially observable Markov decision problems (POMDPs). We propose an approach...
متن کاملMaintaining Focus: Overcoming Attention Deficit Disorder in Contingent Planning
In our experiments with four well-known systems for solving partially observable planning problems (Contingent-FF, MBP, PKS, and POND), we were greatly surprised to find that they could only solve problems with a small number of contingencies. Apparently they were repeatedly trying to solve many combinations of contingencies at once, thus unnecessarily using up huge amounts of time and space. T...
متن کامل