Sciweavers

771 search results - page 151 / 155
» Markov Decision Processes with Arbitrary Reward Processes
Sort
View
ICDCS
2010
IEEE
15 years 3 months ago
Stochastic Steepest-Descent Optimization of Multiple-Objective Mobile Sensor Coverage
—We propose a steepest descent method to compute optimal control parameters for balancing between multiple performance objectives in stateless stochastic scheduling, wherein the ...
Chris Y. T. Ma, David K. Y. Yau, Nung Kwan Yip, Na...
CODES
2009
IEEE
15 years 2 months ago
An MDP-based application oriented optimal policy for wireless sensor networks
Technological advancements due to Moore’s law have led to the proliferation of complex wireless sensor network (WSN) domains. One commonality across all WSN domains is the need ...
Arslan Munir, Ann Gordon-Ross
NIPS
1998
15 years 29 days ago
Risk Sensitive Reinforcement Learning
In this paper, we consider Markov Decision Processes (MDPs) with error states. Error states are those states entering which is undesirable or dangerous. We define the risk with re...
Ralph Neuneier, Oliver Mihatsch
NIPS
1996
15 years 28 days ago
Multidimensional Triangulation and Interpolation for Reinforcement Learning
Dynamic Programming, Q-learning and other discrete Markov Decision Process solvers can be applied to continuous d-dimensional state-spaces by quantizing the state space into an arr...
Scott Davies
CORR
2008
Springer
122views Education» more  CORR 2008»
14 years 11 months ago
Strategy Improvement for Concurrent Safety Games
We consider concurrent games played on graphs. At every round of the game, each player simultaneously and independently selects a move; the moves jointly determine the transition ...
Krishnendu Chatterjee, Luca de Alfaro, Thomas A. H...