Sciweavers

280 search results - page 15 / 56
» Planning for Markov Decision Processes with Sparse Stochasti...
Sort
View
AAAI
2010
14 years 11 months ago
Relational Partially Observable MDPs
Relational Markov Decision Processes (MDP) are a useraction for stochastic planning problems since one can develop abstract solutions for them that are independent of domain size ...
Chenggang Wang, Roni Khardon
ICRA
2010
IEEE
163views Robotics» more  ICRA 2010»
14 years 8 months ago
Exploiting domain knowledge in planning for uncertain robot systems modeled as POMDPs
Abstract— We propose a planning algorithm that allows usersupplied domain knowledge to be exploited in the synthesis of information feedback policies for systems modeled as parti...
Salvatore Candido, James C. Davidson, Seth Hutchin...
DATE
2007
IEEE
133views Hardware» more  DATE 2007»
15 years 4 months ago
Stochastic modeling and optimization for robust power management in a partially observable system
As the hardware and software complexity grows, it is unlikely for the power management hardware/software to have a full observation of the entire system status. In this paper, we ...
Qinru Qiu, Ying Tan, Qing Wu
AIPS
2003
14 years 11 months ago
A Framework for Planning in Continuous-time Stochastic Domains
We propose a framework for policy generation in continuoustime stochastic domains with concurrent actions and events of uncertain duration. We make no assumptions regarding the co...
Håkan L. S. Younes, David J. Musliner, Reid ...
IJCAI
2003
14 years 11 months ago
A Planning Algorithm for Predictive State Representations
We address the problem of optimally controlling stochastic environments that are partially observable. The standard method for tackling such problems is to define and solve a Part...
Masoumeh T. Izadi, Doina Precup