656 search results - page 105 / 132 » Complexity of finite-horizon Markov decision process problem... |
134
Voted
AAAI
2007
15 years 4 months ago
2007
In designing Markov Decision Processes (MDP), one must define the world, its dynamics, a set of actions, and a reward function. MDPs are often applied in situations where there i...
ATAL
2008
Springer
15 years 3 months ago
2008
Springer
The goal of Reinforcement learning (RL) is to maximize reward (minimize cost) in a Markov decision process (MDP) without knowing the underlying model a priori. RL algorithms tend ...
113
click to vote
IJCAI
2003
15 years 3 months ago
2003
An agent with limited consumable execution resources needs policies that attempt to achieve good performance while respecting these limitations. Otherwise, an agent (such as a pla...
108
click to vote
IJCAI
2003
15 years 3 months ago
2003
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....
NIPS
2003
15 years 3 months ago
2003
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 ...