Journal
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS
Volume 40, Issue 4, Pages 1062-1074Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TSMCB.2009.2034015
Keywords
Multi-core machines; parallel computing; partially observable Markov decision processes (POMDP); point-based value iteration
Ask authors/readers for more resources
Recent scaling up of partially observable Markov decision process solvers toward realistic applications is largely due to point-based methods which quickly provide approximate solutions for midsized problems. New multicore machines offer an opportunity to scale up to larger domains. These machines support parallel execution and can speed up existing algorithms considerably. In this paper, we evaluate several ways in which point-based algorithms can be adapted to parallel computing. We overview the challenges and opportunities and present experimental results, providing evidence to the usability of our suggestions.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available