Sciweavers

332 search results - page 55 / 67
» Ranking policies in discrete Markov decision processes
Sort
View
ICML
2003
IEEE
14 years 8 months ago
Planning in the Presence of Cost Functions Controlled by an Adversary
We investigate methods for planning in a Markov Decision Process where the cost function is chosen by an adversary after we fix our policy. As a running example, we consider a rob...
H. Brendan McMahan, Geoffrey J. Gordon, Avrim Blum
FSR
2003
Springer
94views Robotics» more  FSR 2003»
14 years 1 months ago
Planning under Uncertainty for Reliable Health Care Robotics
We describe a mobile robot system, designed to assist residents of an retirement facility. This system is being developed to respond to an aging population and a predicted shortage...
Nicholas Roy, Geoffrey J. Gordon, Sebastian Thrun
EENERGY
2010
13 years 12 months ago
Optimal sleep patterns for serving delay-tolerant jobs
Sleeping is an important method to reduce energy consumption in many information and communication systems. In this paper we focus on a typical server under dynamic load, where en...
Ioannis Kamitsos, Lachlan L. H. Andrew, Hongseok K...
AAAI
2010
13 years 9 months ago
Symbolic Dynamic Programming for First-order POMDPs
Partially-observable Markov decision processes (POMDPs) provide a powerful model for sequential decision-making problems with partially-observed state and are known to have (appro...
Scott Sanner, Kristian Kersting
JAIR
2006
101views more  JAIR 2006»
13 years 8 months ago
Resource Allocation Among Agents with MDP-Induced Preferences
Allocating scarce resources among agents to maximize global utility is, in general, computationally challenging. We focus on problems where resources enable agents to execute acti...
Dmitri A. Dolgov, Edmund H. Durfee