Sciweavers

337 search results - page 32 / 68
» An Anytime Algorithm for Decision Making under Uncertainty
Sort
View
AAAI
2010
13 years 10 months ago
Compressing POMDPs Using Locality Preserving Non-Negative Matrix Factorization
Partially Observable Markov Decision Processes (POMDPs) are a well-established and rigorous framework for sequential decision-making under uncertainty. POMDPs are well-known to be...
Georgios Theocharous, Sridhar Mahadevan
ICRA
2010
IEEE
111views Robotics» more  ICRA 2010»
13 years 7 months ago
Multi-tasking SLAM
— The problem of simultaneous localization and mapping (SLAM) is one of the most studied in the robotics literature. Most existing approaches, however, focus on scenarios where l...
Arthur Guez, Joelle Pineau
FLAIRS
2009
13 years 6 months ago
Dynamic Programming Approximations for Partially Observable Stochastic Games
Partially observable stochastic games (POSGs) provide a rich mathematical framework for planning under uncertainty by a group of agents. However, this modeling advantage comes wit...
Akshat Kumar, Shlomo Zilberstein
HOTOS
1999
IEEE
14 years 1 months ago
The Case for Better Throughput Estimation
A Web proxy must accurately predict network performance between itself and its servers and clients in order to make good distillation decisions. In this paper, we show that the cu...
Brian Noble, Li Li, Atul Prakash
ATAL
2010
Springer
13 years 10 months ago
Risk-sensitive planning in partially observable environments
Partially Observable Markov Decision Process (POMDP) is a popular framework for planning under uncertainty in partially observable domains. Yet, the POMDP model is riskneutral in ...
Janusz Marecki, Pradeep Varakantham