Skip navigation
Skip navigation

Policy-Gradient Algorithms for Partially Observable Markov Decision Processes

Aberdeen, Douglas


Partially observable Markov decision processes are interesting because of their ability to model most conceivable real-world learning problems, for example, robot navigation, driving a car, speech recognition, stock trading, and playing games. The downside of this generality is that exact algorithms are computationally intractable. Such computational complexity motivates approximate approaches. One such class of algorithms are the so-called policy-gradient methods from reinforcement learning....[Show more]

CollectionsOpen Access Theses
Date published: 2003-04
Type: Thesis (PhD)


File Description SizeFormat Image
02whole.pdf1.67 MBAdobe PDFThumbnail
01front.pdf70.37 kBAdobe PDFThumbnail

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator