This HTML5 document contains 40 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n16http://linked.opendata.cz/resource/domain/vavai/projekt/
n12http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n18http://linked.opendata.cz/ontology/domain/vavai/
n7http://linked.opendata.cz/resource/domain/vavai/zamer/
n5http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F67985556%3A_____%2F10%3A00346161%21RIV11-GA0-67985556/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n10http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n13http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n8http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F67985556%3A_____%2F10%3A00346161%21RIV11-GA0-67985556
rdf:type
skos:Concept n18:Vysledek
dcterms:description
In this note we focus attention on identifying optimal policies and on elimination suboptimal policies minimizing optimality criteria in discrete-time Markov decision processes with finite state space and compact action set. We present unified approach to value iteration algorithms that enables to generate lower and upper bounds on optimal values, as well as on the current policy. Using the modified value iterations it is possible to eliminate suboptimal actions and to identify an optimal policy or nearly optimal policies in a finite number of steps without knowing precise values of the performance function. In this note we focus attention on identifying optimal policies and on elimination suboptimal policies minimizing optimality criteria in discrete-time Markov decision processes with finite state space and compact action set. We present unified approach to value iteration algorithms that enables to generate lower and upper bounds on optimal values, as well as on the current policy. Using the modified value iterations it is possible to eliminate suboptimal actions and to identify an optimal policy or nearly optimal policies in a finite number of steps without knowing precise values of the performance function.
dcterms:title
Identification of Optimal Policies in Markov Decision Processes Identification of Optimal Policies in Markov Decision Processes
skos:prefLabel
Identification of Optimal Policies in Markov Decision Processes Identification of Optimal Policies in Markov Decision Processes
skos:notation
RIV/67985556:_____/10:00346161!RIV11-GA0-67985556
n3:aktivita
n13:Z n13:P
n3:aktivity
P(GA402/07/1113), P(GA402/08/0107), Z(AV0Z10750506)
n3:cisloPeriodika
3
n3:dodaniDat
n8:2011
n3:domaciTvurceVysledku
n12:6105955
n3:druhVysledku
n17:J
n3:duvernostUdaju
n11:S
n3:entitaPredkladatele
n5:predkladatel
n3:idSjednocenehoVysledku
262715
n3:idVysledku
RIV/67985556:_____/10:00346161
n3:jazykVysledku
n4:eng
n3:klicovaSlova
finite state Markov decision processes; discounted and average costs; elimination of suboptimal policies
n3:klicoveSlovo
n10:finite%20state%20Markov%20decision%20processes n10:discounted%20and%20average%20costs n10:elimination%20of%20suboptimal%20policies
n3:kodStatuVydavatele
CZ - Česká republika
n3:kontrolniKodProRIV
[9E552BEEDBAB]
n3:nazevZdroje
Kybernetika
n3:obor
n15:BB
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:projekt
n16:GA402%2F08%2F0107 n16:GA402%2F07%2F1113
n3:rokUplatneniVysledku
n8:2010
n3:svazekPeriodika
46 2010
n3:tvurceVysledku
Sladký, Karel
n3:wos
000280425000019
n3:zamer
n7:AV0Z10750506
s:issn
0023-5954
s:numberOfPages
13