A planning system must reason about the uncer-tainty of continuous variables in order to accurately project the possible system state over time. A method is devised for directly reasoning about the uncertainty in continuous activity duration and re-source usage for planning problems. By represent-ing random variables as parametric distributions, computing projected system state can be simplified in some cases. Common approximation and novel methods are compared for over-constrained and lightly constrained domains. The system compares a few common approximation methods for an iter-ative repair planner. Results show improvements in robustness over the conventional non-probabilistic representation by reducing the number of constraint violation...
The main focus of our work is the use of classical planning algorithms in service of more complex pr...
Reasoning about uncertainty is an essential component of many real-world plan-ning problems, such as...
In Temporal Planning a typical assumption is that the agent controls the execution time of all event...
A planning system must reason about the uncertainty of continuous variables in order to accurately p...
A planning system must reason about the uncertainty of continuous variables in order to accurately p...
We define the robustness of a sequential plan as the probability that it will execute successfully d...
A critical challenge in temporal planning is robustly dealing with non-determinism introduced by the...
A critical challenge in temporal planning is robustly dealing with non-determinism, e.g., the durati...
When planning in uncertain domains, it can be of great benefit if the planner is aware of the nature...
AbstractWe define the probabilistic planning problem in terms of a probability distribution over ini...
This paper presents a model-based planner called the Probabilistic Sulu Planner or the p-Sulu Plann...
In temporally uncertain domains, taking uncertainty into account while planning leads to problems wi...
This paper presents a model-based planner called the Probabilistic Sulu Planner or the p-Sulu Planne...
A general-purpose computer program for planning the actions of a spacecraft or other complex system ...
The main problem of planning is to find a sequence of ac-tions that an agent must perform to achieve...
The main focus of our work is the use of classical planning algorithms in service of more complex pr...
Reasoning about uncertainty is an essential component of many real-world plan-ning problems, such as...
In Temporal Planning a typical assumption is that the agent controls the execution time of all event...
A planning system must reason about the uncertainty of continuous variables in order to accurately p...
A planning system must reason about the uncertainty of continuous variables in order to accurately p...
We define the robustness of a sequential plan as the probability that it will execute successfully d...
A critical challenge in temporal planning is robustly dealing with non-determinism introduced by the...
A critical challenge in temporal planning is robustly dealing with non-determinism, e.g., the durati...
When planning in uncertain domains, it can be of great benefit if the planner is aware of the nature...
AbstractWe define the probabilistic planning problem in terms of a probability distribution over ini...
This paper presents a model-based planner called the Probabilistic Sulu Planner or the p-Sulu Plann...
In temporally uncertain domains, taking uncertainty into account while planning leads to problems wi...
This paper presents a model-based planner called the Probabilistic Sulu Planner or the p-Sulu Planne...
A general-purpose computer program for planning the actions of a spacecraft or other complex system ...
The main problem of planning is to find a sequence of ac-tions that an agent must perform to achieve...
The main focus of our work is the use of classical planning algorithms in service of more complex pr...
Reasoning about uncertainty is an essential component of many real-world plan-ning problems, such as...
In Temporal Planning a typical assumption is that the agent controls the execution time of all event...