Sciweavers

122 search results - page 1 / 25
» An Algorithm for Probabilistic Least-Commitment Planning
Sort
View
AAAI
1994
13 years 7 months ago
An Algorithm for Probabilistic Least-Commitment Planning
We de ne the probabilistic planning problem in terms of a probability distribution over initial world states, a boolean combination of goal propositions, a probability threshold, ...
Nicholas Kushmerick, Steve Hanks, Daniel S. Weld
AIPS
1996
13 years 7 months ago
Least-Commitment Action Selection
The principle of least commitment was embraced early in planning research. Hierarchical task networks (HTNs)reason about high-level tasks without committing to specific low-level ...
Marc Friedman, Daniel S. Weld
AI
2011
Springer
13 years 19 days ago
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
Daniel Bryce, William Cushing, Subbarao Kambhampat...
AIPS
2008
13 years 8 months ago
A New Probabilistic Plan Recognition Algorithm Based on String Rewriting
This document formalizes and discusses the implementation of a new, more efficient probabilistic plan recognition algorithm called Yet Another Probabilistic Plan Recognizer, (Yapp...
Christopher W. Geib, John Maraist, Robert P. Goldm...
AIPS
1994
13 years 7 months ago
Probabilistic Planning with Information Gathering and Contingent Execution
MostAI representations and algorithms for plan generation havenot included the concept of informationproducingactions (also called diagnostics, or tests, in the decision making li...
Denise Draper, Steve Hanks, Daniel S. Weld