An Algorithm for Probabilistic Least-Commitment Planning

  title={An Algorithm for Probabilistic Least-Commitment Planning},
  author={Nicholas Kushmerick and Steve Hanks and Daniel S. Weld},
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, and actions whose e ects depend on the execution-time state of the world and on random chance. Adopting a probabilistic model complicates the de nition of plan success: instead of demanding a plan that provably achieves the goal, we seek plans whose probability of success exceeds the threshold. This paper describes a… CONTINUE READING
Highly Influential
This paper has highly influenced 12 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 121 citations. REVIEW CITATIONS


Publications citing this paper.

121 Citations

Citations per Year
Semantic Scholar estimates that this publication has 121 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 17 references

Modeling a Dynamic and Uncertain World II: Action Representation and Plan Evaluation

  • S. Hanks
  • Technical report, Univ. ofWashington, Dept. of…
  • 1993
2 Excerpts

Optimal probabilistic and decisiontheoretic planning using markovian decision theory

  • S. Koenig
  • UCB/CSD 92/685, Berkeley.
  • 1992
2 Excerpts

Similar Papers

Loading similar papers…