Sciweavers

6957 search results - page 38 / 1392
» Planning before plans
Sort
View
AAAI
1994
13 years 9 months ago
Cost-Effective Sensing during Plan Execution
Between sensing the world after every action (as in a reactive plan) and not sensing at all (as in an openloop plan), lies a continuum of strategies for sensing during plan execut...
Eric A. Hansen
AAAI
1994
13 years 9 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
1994
13 years 9 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
AIPS
1994
13 years 9 months ago
Generating Parallel Execution Plans with a Partial-order Planner
Manyreal-world planning problems require generating plans that maximizethe parallelism inherent in a problem. There are a numberof partial-order planners that generate such plans;...
Craig A. Knoblock
IJCAI
1989
13 years 9 months ago
Solving Time-Dependent Planning Problems
A planning problem is time-dependent, if the time spent planning affects the utility of the system's performance. In [Dean and Boddy, 1988], we define a framework for constru...
Mark S. Boddy, Thomas Dean