Sciweavers

262 search results - page 28 / 53
» Bounded-Parameter Partially Observable Markov Decision Proce...
Sort
View
AAAI
2000
15 years 5 months ago
Decision-Theoretic, High-Level Agent Programming in the Situation Calculus
We propose a frameworkfor robot programming which allows the seamless integration of explicit agent programming with decision-theoretic planning. Specifically, the DTGolog model a...
Craig Boutilier, Raymond Reiter, Mikhail Soutchans...
JAIR
2008
130views more  JAIR 2008»
15 years 4 months ago
Online Planning Algorithms for POMDPs
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
Stéphane Ross, Joelle Pineau, Sébast...
ATAL
2007
Springer
15 years 10 months ago
Subjective approximate solutions for decentralized POMDPs
A problem of planning for cooperative teams under uncertainty is a crucial one in multiagent systems. Decentralized partially observable Markov decision processes (DECPOMDPs) prov...
Anton Chechetka, Katia P. Sycara
HICSS
2003
IEEE
123views Biometrics» more  HICSS 2003»
15 years 9 months ago
Issues in Rational Planning in Multi-Agent Settings
We adopt the decision-theoretic principle of expected utility maximization as a paradigm for designing autonomous rational agents operating in multi-agent environments. We use the...
Piotr J. Gmytrasiewicz
CORR
2010
Springer
147views Education» more  CORR 2010»
15 years 4 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...