Sciweavers

350 search results - page 5 / 70
» Complexity of Planning with Partial Observability
Sort
View
79
Voted
LPAR
2010
Springer
14 years 8 months ago
The Complexity of Partial-Observation Parity Games
We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both p...
Krishnendu Chatterjee, Laurent Doyen
91
Voted
IJCAI
2001
14 years 11 months ago
Complexity of Probabilistic Planning under Average Rewards
A general and expressive model of sequential decision making under uncertainty is provided by the Markov decision processes (MDPs) framework. Complex applications with very large ...
Jussi Rintanen
IJCAI
2007
14 years 11 months ago
Inferring Complex Agent Motions from Partial Trajectory Observations
Finnegan Southey, Wesley Loh, Dana F. Wilkinson
AIPS
2008
14 years 11 months ago
Multiagent Planning Under Uncertainty with Stochastic Communication Delays
We consider the problem of cooperative multiagent planning under uncertainty, formalized as a decentralized partially observable Markov decision process (Dec-POMDP). Unfortunately...
Matthijs T. J. Spaan, Frans A. Oliehoek, Nikos A. ...
AAAI
1994
14 years 10 months ago
Acting Optimally in Partially Observable Stochastic Domains
In this paper, we describe the partially observable Markov decision process pomdp approach to nding optimal or near-optimal control strategies for partially observable stochastic ...
Anthony R. Cassandra, Leslie Pack Kaelbling, Micha...