Algorithms for Partially Observable Markov Decision Processes

Algorithms for Partially Observable Markov Decision Processes (2001)

Cached

Download Links

[www2.cs.ust.hk]

by Weihong Zhang

Venue:	HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY
Citations:	6 - 1 self

BibTeX

@TECHREPORT{Zhang01algorithmsfor,
    author = {Weihong Zhang},
    title = {Algorithms for Partially Observable Markov Decision Processes},
    institution = {HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY},
    year = {2001}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Partially Observable Markov Decision Process (POMDP) is a general sequential decision-making model where the effects of actions are...

Citations

1964	Dynamic Programming - Bellman - 1957
1555	STRIPS: A new approach to the application of theorem proving to problem solving - Fikes, Nilsson - 1971
1517	Data Network - Bertsekas, Gallager - 1992
1135	Learning from delayed rewards - Watkins - 1989
1060	Learning to predict by the methods of temporal differences - Sutton - 1988
629	Planning and acting in partially observable stochastic domains - Kaelbling, Littman, et al. - 1998
498	Markov Decision Processes - Puterman - 1994
472	Learning to act using real-time dynamic programming - Barto, Bradtke, et al. - 1995
427	Integrated architectures for learning, planning, and reacting based on approximating integrated architectures for learning, planning, and reacting based on approximating dynamic programming - Sutton - 1990
381	UCPOP: A sound, complete, partial order planner for ADL - Penberthy, Weld - 1992
362	Real-time heuristic search - Korf - 1990
358	Systematic nonlinear planning - McAllester, Rosenblitt - 1991
355	Probabilistic logic - Nilsson - 1986
342	Decision-Theoretic Planning: Structural Assumptions and Computational Leverage - Boutilier, Dean, et al. - 1999
275	Prioritized sweeping: Reinforcement learning with less data and less time - Moore, Atkeson - 1993
250	Improving elevator performance using reinforcement learning - Crites, Barto - 1996
235	An algorithm for probabilistic planning - Kushmerick, Hanks, et al. - 1995
235	The optimal control of partially observable Markov processes over a finite horizon - Smallwood, Sondik - 1973
224	On-line Q-learning using connectionist systems - Rummery, Niranjan - 1994
219	Temporal Credit Assignment in Reinforcement Learning - Sutton - 1984
212	Reinforcement learning with hierarchies of machines - Parr, Russell - 1998
202	Learning policies for partially observable environments: Scaling up - Littman, Cassandra, et al.
186	On the convergence of stochastic iterative dynamic programming algorithms - Jaakkola, Jordan, et al. - 1994
174	Planning with Incomplete Information as Heuristic Search in Belief Space - Bonet, Geffner - 2000
165	Survey of partially observable markov decision processes: Theory, models, and algorithms - Monahan - 1982
150	Planning under time constraints in stochastic domains - DEAN, KAELBLING, et al.
137	Reinforcement learning algorithm for partially observable Markov decision problems - Jaakkola, Singh, et al. - 1994
131	Macro operators: A weak method for learning - Korf - 1985
126	The complexity of stochastic games - Condon - 1992
125	Planning with deadlines in stochastic domains - Dean, Kaelbling, et al. - 1993
120	Stochastic dynamic programming with factored representations - Boutilier, Dearden, et al.
115	Finite State Markovian Decision Processes - Derman - 1970
115	Learning without state-estimation in partially observable markovian decision processes - Singh, Jaakkola, et al. - 1994
114	Approximating optimal policies for partially observable stochastic domains - Parr, Russell - 1995
112	Hierarchical solution of markov decision processes using macro-actions - Hauskrecht, Meuleau, et al. - 1998
111	Exact and approximate algorithms for partially observable Markov decision processes - Cassandra - 1998
106	Optimization Theory for Large Systems - Lasdon - 1970
105	Value-function approximations for partially observable markov decision processes - Hauskrecht - 2000
103	Decomposition techniques for planning in stochastic domains - Dean, Lin - 1995
101	Anytime synthetic projection: Maximizing the probability of goal satisfaction - Drummond, Bresina
99	Optimal control of Markov decision processes with incomplete state estimation - Astrom - 1965
98	Finding structure in reinforcement learning - Thrun, Schwartz - 1995
97	R.: Model minimization in markov decision processes - Dean, Givan - 1997
97	Approximate planning in large POMDPs via reusable trajectories - Kearns, Mansour, et al. - 2000
94	Computing optimal policies for partially observable decision processes using compact representations - Boutilier, Poole - 1996
88	Utility models for goal-directed decisiontheoretic planners - Haddawy, Hanks - 1998
88	Xavier: A robot navigation architecture based on partially observable markov decision process models - Koenig, Simmons - 1998
85	Efficient learning and planning within the dyna framework - Peng, Williams - 1993
80	Decision theory in expert systems and artificial intelligence - Horvitz, Breese, et al. - 1988
76	Computationally feasible bounds for partially observed Markov decision processes - Lovejoy - 1991