Genetic algorithm methods for solving the best stationary policy of finite Markov decision processes
This paper describes a heuristic approach to solving the optimal stationary policy of the standard finite Markov decision processes (MDP). For a MDP problem, there is a so-called policy-improvement algorithm, which can be used to determine optimal policies. It starts at an arbitrary policy f/sub 0/...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Schreiben Sie den ersten Kommentar!