Sciweavers

771 search results - page 41 / 155
» Markov Decision Processes with Arbitrary Reward Processes
Sort
View
AIPS
2008
15 years 4 months ago
Criticality Metrics for Distributed Plan and Schedule Management
We address the problem of coordinating the plans and schedules for a team of agents in an uncertain and dynamic environment. Bounded rationality, bounded communication, subjectivi...
Rajiv T. Maheswaran, Pedro A. Szekely
NN
2010
Springer
187views Neural Networks» more  NN 2010»
14 years 8 months ago
Efficient exploration through active learning for value function approximation in reinforcement learning
Appropriately designing sampling policies is highly important for obtaining better control policies in reinforcement learning. In this paper, we first show that the least-squares ...
Takayuki Akiyama, Hirotaka Hachiya, Masashi Sugiya...
CORR
2008
Springer
103views Education» more  CORR 2008»
15 years 1 months ago
Quickest Change Detection of a Markov Process Across a Sensor Array
Recent attention in quickest change detection in the multi-sensor setting has been on the case where the densities of the observations change at the same instant at all the sensor...
Vasanthan Raghavan, Venugopal V. Veeravalli
AAAI
2006
15 years 3 months ago
Decision Making in Uncertain Real-World Domains Using DT-Golog
DTGolog, a decision-theoretic agent programming language based on the situation calculus, was proposed to ease some of the computational difficulties associated with Markov Decisi...
Mikhail Soutchanski, Huy Pham, John Mylopoulos
CORR
2010
Springer
147views Education» more  CORR 2010»
15 years 2 months ago
High-Rate Quantization for the Neyman-Pearson Detection of Hidden Markov Processes
This paper investigates the decentralized detection of Hidden Markov Processes using the NeymanPearson test. We consider a network formed by a large number of distributed sensors....
Joffrey Villard, Pascal Bianchi, Eric Moulines, Pa...