334 search results - page 10 / 67 » How to Dynamically Merge Markov Decision Processes |
FGR
2006
IEEE
15 years 3 months ago
2006
IEEE
We present a novel tracking algorithm that uses dynamic programming to determine the path of target objects and that is able to track an arbitrary number of different objects. The...
AAAI
2006
14 years 11 months 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...
VTC
2008
IEEE
15 years 4 months ago
2008
IEEE
—This paper studies the admission control and resource allocation in a cell-based wireless system that supports singlemedia and multirate services. Utilizing the idea of adaptive...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. This paper presents a novel technique for counterexample generation in probabilistic model checking of Markov chains and Markov Decision Processes. (Finite) paths in coun...
IROS
2009
IEEE
15 years 4 months ago
2009
IEEE
— Partially Observable Markov Decision Processes (POMDPs) provide a rich mathematical model to handle realworld sequential decision processes but require a known model to be solv...