Solving average cost Markov decision processes by means of a two-phase time aggregation algorithm (Q300040): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C40 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C39 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6597117 / rank
 
Normal rank
Property / zbMATH Keywords
 
dynamic programming
Property / zbMATH Keywords: dynamic programming / rank
 
Normal rank
Property / zbMATH Keywords
 
Markov decision processes
Property / zbMATH Keywords: Markov decision processes / rank
 
Normal rank
Property / zbMATH Keywords
 
embedding
Property / zbMATH Keywords: embedding / rank
 
Normal rank
Property / zbMATH Keywords
 
time aggregation
Property / zbMATH Keywords: time aggregation / rank
 
Normal rank
Property / zbMATH Keywords
 
stochastic optimal control
Property / zbMATH Keywords: stochastic optimal control / rank
 
Normal rank

Revision as of 21:42, 27 June 2023

scientific article
Language Label Description Also known as
English
Solving average cost Markov decision processes by means of a two-phase time aggregation algorithm
scientific article

    Statements

    Solving average cost Markov decision processes by means of a two-phase time aggregation algorithm (English)
    0 references
    0 references
    0 references
    23 June 2016
    0 references
    dynamic programming
    0 references
    Markov decision processes
    0 references
    embedding
    0 references
    time aggregation
    0 references
    stochastic optimal control
    0 references

    Identifiers