Sciweavers

771 search results - page 14 / 155
» Markov Decision Processes with Arbitrary Reward Processes
Sort
View
JAIR
2006
157views more  JAIR 2006»
15 years 1 months ago
Decision-Theoretic Planning with non-Markovian Rewards
A decision process in which rewards depend on history rather than merely on the current state is called a decision process with non-Markovian rewards (NMRDP). In decisiontheoretic...
Sylvie Thiébaux, Charles Gretton, John K. S...
119
Voted
GLOBECOM
2008
IEEE
15 years 8 months ago
Foresighted Resource Reciprocation Strategies in P2P Networks
—We consider peer-to-peer (P2P) networks, where multiple peers are interested in sharing content. While sharing resources, autonomous and self-interested peers need to make decis...
Hyunggon Park, Mihaela van der Schaar
ICMAS
2000
15 years 3 months ago
Communication in Multi-Agent Markov Decision Processes
In this paper, we formulate agent's decision process under the framework of Markov decision processes, and in particular, the multi-agent extension to Markov decision process...
Ping Xuan, Victor R. Lesser, Shlomo Zilberstein
ICML
2006
IEEE
16 years 2 months ago
Qualitative reinforcement learning
When the transition probabilities and rewards of a Markov Decision Process are specified exactly, the problem can be solved without any interaction with the environment. When no s...
Arkady Epshteyn, Gerald DeJong
97
Voted
ICRA
2007
IEEE
126views Robotics» more  ICRA 2007»
15 years 8 months ago
A formal framework for robot learning and control under model uncertainty
— While the Partially Observable Markov Decision Process (POMDP) provides a formal framework for the problem of robot control under uncertainty, it typically assumes a known and ...
Robin Jaulmes, Joelle Pineau, Doina Precup