Normal view MARC view ISBD view

Algorithms for partially observable markov decision processes

By: Chmelik, Martin.
Material type: materialTypeLabelBookPublisher: IST Austria 2016
Contents:
Biographical Sketch
Acknowledgments
Abstract
1 Introduction
2 Preliminaries
3 POMDPs with limit-average objectives and probabilistic semantics
4 What is decidable about POMDPs with w-regualr objectives
5 Optimal cost almost-sure reachability in POMDPs
6 A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs
7 Optimal cost indefinite-horizon reachability in goal decentralized POMDPs
8 Results related to verification
9 Conclusion
Bibliography
List(s) this item appears in: IST Austria Thesis 2018
Tags from this library: No tags from this library for this title. Log in to add tags.
    average rating: 0.0 (0 votes)
Item type Current location Call number Status Date due Barcode Item holds
Book Book Library
Available AT-ISTA#001156
Total holds: 0

Thesis

Biographical Sketch

Acknowledgments

Abstract

1 Introduction

2 Preliminaries

3 POMDPs with limit-average objectives and probabilistic semantics

4 What is decidable about POMDPs with w-regualr objectives

5 Optimal cost almost-sure reachability in POMDPs

6 A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs

7 Optimal cost indefinite-horizon reachability in goal decentralized POMDPs

8 Results related to verification

9 Conclusion

Bibliography

There are no comments for this item.

Log in to your account to post a comment.

Powered by Koha

//