This dissertation develops conditions for the existence of forecast horizons in non-homogeneous Markov Decision Processes (MDP's). Forecast horizons provide a useful means for finding the optimal first decision in non-homogeneous MDP's, where the functional equation approaches generally used for homogeneous MDP's are not applicable. In discounted problems, forecast horizons are shown to exist as a result of the diminishing present value of future rewards. In undiscounted MDP's the diminishing influence of the first decision on the probability of reaching future states is shown to act analogously to discounting and hence provides the basis for existence of forecast horizons in these problems. The theoretical forecast horizon results are then...
We review a class of online planning algorithms for deterministic and stochastic optimal control pro...
We consider a discrete time Markov Decision Process with infinite horizon. The criterion to be maxim...
Canonical models of Markov decision processes (MDPs) usually consider geometric discounting based on...
This dissertation develops conditions for the existence of forecast horizons in non-homogeneous Mark...
A decision process in which rewards depend on history rather than merely on the cur-rent state is ca...
Infinite-horizon non-stationary Markov decision processes provide a general framework to model many ...
A decision process in which rewards depend on history rather than merely on the cur-rent state is ca...
This paper examines a number of solution methods for decision processes with non-Markovian rewards (...
We investigate the use Markov Decision Processes a.s a means of representing worlds in which action...
A Markov decision process (MDP) relies on the notions of state, describing the current situation of ...
A short tutorial introduction is given to Markov decision processes (MDP), including the latest acti...
Many real world problems with time-varying characteristic and unbounded horizon can be modeled as an...
We consider problems that involve the sequential selection of decisions in order to minimize expecte...
What are the functionals of the reward that can be computed and optimized exactly in Markov Decision...
summary:This paper is related to Markov Decision Processes. The optimal control problem is to minimi...
We review a class of online planning algorithms for deterministic and stochastic optimal control pro...
We consider a discrete time Markov Decision Process with infinite horizon. The criterion to be maxim...
Canonical models of Markov decision processes (MDPs) usually consider geometric discounting based on...
This dissertation develops conditions for the existence of forecast horizons in non-homogeneous Mark...
A decision process in which rewards depend on history rather than merely on the cur-rent state is ca...
Infinite-horizon non-stationary Markov decision processes provide a general framework to model many ...
A decision process in which rewards depend on history rather than merely on the cur-rent state is ca...
This paper examines a number of solution methods for decision processes with non-Markovian rewards (...
We investigate the use Markov Decision Processes a.s a means of representing worlds in which action...
A Markov decision process (MDP) relies on the notions of state, describing the current situation of ...
A short tutorial introduction is given to Markov decision processes (MDP), including the latest acti...
Many real world problems with time-varying characteristic and unbounded horizon can be modeled as an...
We consider problems that involve the sequential selection of decisions in order to minimize expecte...
What are the functionals of the reward that can be computed and optimized exactly in Markov Decision...
summary:This paper is related to Markov Decision Processes. The optimal control problem is to minimi...
We review a class of online planning algorithms for deterministic and stochastic optimal control pro...
We consider a discrete time Markov Decision Process with infinite horizon. The criterion to be maxim...
Canonical models of Markov decision processes (MDPs) usually consider geometric discounting based on...