Comparing Stochastic Planning to the Acquisition of Increasingly Permissive Plans

Abstract

Difficult problems confront learning and planning efforts for real–world domains. These domains are inherently complex and can only be represented by approximate models subject to error. Furthermore, actions taken in the world are subject to control errors and sensor readings are only approximate. Several techniques have been developed to address these problems including reactive planning and stochastic and decision–theoretic approaches. In this paper, we introduce and compare a new technique called permissive planning with stochastic planning methods. Permissive planning uses an approximate domain theory to project future states. It is designed to improve the projection process for real–world domains by tuning plan schemata to tolerate deviations between the model and reality while maintain the accuracy of projection. Empirical comparisons of stochastic and permissive planning are performed with an implemented robotic system for achieving part orientations.

Cite

Text

Bennett and DeJong. "Comparing Stochastic Planning to the Acquisition of Increasingly Permissive Plans." International Conference on Machine Learning, 1991. doi:10.1016/B978-1-55860-200-7.50119-7

Markdown

[Bennett and DeJong. "Comparing Stochastic Planning to the Acquisition of Increasingly Permissive Plans." International Conference on Machine Learning, 1991.](https://mlanthology.org/icml/1991/bennett1991icml-comparing/) doi:10.1016/B978-1-55860-200-7.50119-7

BibTeX

@inproceedings{bennett1991icml-comparing,
  title     = {{Comparing Stochastic Planning to the Acquisition of Increasingly Permissive Plans}},
  author    = {Bennett, Scott W. and DeJong, Gerald},
  booktitle = {International Conference on Machine Learning},
  year      = {1991},
  pages     = {586-590},
  doi       = {10.1016/B978-1-55860-200-7.50119-7},
  url       = {https://mlanthology.org/icml/1991/bennett1991icml-comparing/}
}