J. Rintanen. Complexity of probabilistic planning under average rewards. In Proceedings of the 17th International Joint Conference on Arti cial Intelligence, pages 503-508. Morgan Kaufmann, San Fransisco, California, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
On the Undecidability of Probabilistic Planning and.. - Madani, Hanks, Condon (2003) (2 citations) (Correct)
....AI literature [24] Their results are based on a restriction placed on solutions, however, in that they limit the analysis to plans that can be expressed in size polynomial in the size of the problem speci cation. As a result, their results parallel the results for nite horizon POMDPs. Rintanen [45] analyzes the complexity of probabilistic planning problems under average reward criteria, and establishes undecidability results for the in nite horizon criteria based on our results. Early work on probabilistic nite automata include [43,41] Our proof techniques build on the techniques ....
J. Rintanen. Complexity of probabilistic planning under average rewards. In Proceedings of the 17th International Joint Conference on Arti cial Intelligence, pages 503-508. Morgan Kaufmann, San Fransisco, California, 2001.
On the Undecidability of Probabilistic Planning and Related.. - Madani, Hanks (2003) (2 citations) (Correct)
....AI literature [16] Their results are based on a restriction placed on solutions, however, in that they limit the analysis to plans that can be expressed in size polynomial in the size of the problem specification. As a result, their results parallel the results for finite horizon POMDPs. Rintanen [29] analyzes the complexity of probabilistic planning problems under average reward criteria, and establishes undecidability results for the infinite horizon criteria based on our results. Early papers on POMDP problem formulations include those by Drake [10] Astrom [3] and Aoki [2] Sondik and ....
J. Rintanen. Complexity of probabilistic planning under average rewards. In Proceedings of International Joint Conference on Artificial Intelligence, 2001. To Appear.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC