Sciweavers

771 search results - page 137 / 155
» Markov Decision Processes with Arbitrary Reward Processes
Sort
View
AAAI
2006
15 years 1 months ago
Incremental Least Squares Policy Iteration for POMDPs
We present a new algorithm, called incremental least squares policy iteration (ILSPI), for finding the infinite-horizon stationary policy for partially observable Markov decision ...
Hui Li, Xuejun Liao, Lawrence Carin
IJCAI
2003
15 years 1 months ago
Generalizing Plans to New Environments in Relational MDPs
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
Carlos Guestrin, Daphne Koller, Chris Gearhart, Ne...
SODA
2004
ACM
94views Algorithms» more  SODA 2004»
15 years 1 months ago
Quantitative stochastic parity games
We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play resul...
Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A...
NIPS
2003
15 years 1 months ago
Distributed Optimization in Adaptive Networks
We develop a protocol for optimizing dynamic behavior of a network of simple electronic components, such as a sensor network, an ad hoc network of mobile devices, or a network of ...
Ciamac Cyrus Moallemi, Benjamin Van Roy
NIPS
2003
15 years 1 months ago
A Nonlinear Predictive State Representation
Predictive state representations (PSRs) use predictions of a set of tests to represent the state of controlled dynamical systems. One reason why this representation is exciting as...
Matthew R. Rudary, Satinder P. Singh