43 search results - page 8 / 9 » Belief Selection in Point-Based Planning Algorithms for POMD... |
AAAI
2006
15 years 15 days ago
2006
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
IJCAI
2003
15 years 14 days ago
2003
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...
ATAL
2010
Springer
15 years 7 days ago
2010
Springer
An important drawback to the popular Belief, Desire, and Intentions (BDI) paradigm is that such systems include no element of learning from experience. In particular, the so-calle...
112
click to vote
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
Software maintenance is responsible for as much as two thirds of the cost of any software, and is consequently an important research area. In this paper we focus on the change pro...
88
Voted
PERCOM
2007
ACM
15 years 10 months ago
2007
ACM
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...