FASTER DYNAMIC PROGRAMMING FOR MARKOV DECISION PROCESSES
Markov decision processes (MDPs) are a general framework used by Artificial Intelligence (AI) researchers to model decision theoretic planning problems. Solving real world MDPs has been a major and challenging research topic in the AI literature. This paper discusses two main groups of approaches in...
Main Author: | Dai, Peng |
---|---|
Format: | Others |
Published: |
UKnowledge
2007
|
Subjects: | |
Online Access: | http://uknowledge.uky.edu/gradschool_theses/428 http://uknowledge.uky.edu/cgi/viewcontent.cgi?article=1431&context=gradschool_theses |
Similar Items
-
Bidirectional LAO* Algorithm (A Faster Approach to Solve Goal-directed MDPs)
by: Bhuma, Venkata Deepti Kiran
Published: (2004) -
Scaling solutions to Markov Decision Problems
by: Zang, Peng
Published: (2012) -
Finite Memory Policies for Partially Observable Markov Decision Proesses
by: Lusena, Christopher
Published: (2001) -
Markov Karar Süreci İle Modellenen Stokastik ve Çok Amaçlı Üretim/Envanter Problemlerinin Hedef Programlama Yaklaşımı İle Çözülmesi (Solving Stochastic and Multi-Objective Production/Inventory Problems Modeled By MARKOV Decision Process with Goal Programming Approach)
by: Aslı ÖZDEMİR
Published: (2009-07-01) -
Markov probabilistic decision making of self-driving cars in highway with random traffic flow: a simulation study
by: Yang Guan, et al.
Published: (2018-12-01)