Evaluating point-based POMDP solvers on multicore machines

Authors:
Guy Shani
Affiliations:
Information Systems Engineering Department, Ben-Gurion University, Beer-Sheva, Israel
Venue:
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on gait analysis
Year:
2010

Citing 13
Cited 1

Computationally feasible bounds for partially observed Markov decision processes

Operations Research
Design and performance modeling of component interconnection patterns for distributed software architectures

Proceedings of the 2nd international workshop on Software and performance
Heuristic search value iteration for POMDPs

UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Software and the Concurrency Revolution

Queue - Multiprocessors
Parallel Software for Training Large Scale Support Vector Machines on Multiprocessor Systems

The Journal of Machine Learning Research
MapReduce: simplified data processing on large clusters

OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Probabilistic planning for robotic exploration

Probabilistic planning for robotic exploration
Perseus: randomized point-based value iteration for POMDPs

Journal of Artificial Intelligence Research
A brief introduction to boosting

IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Forward search value iteration for POMDPs

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Point-based value iteration: an anytime algorithm for POMDPs

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Incremental pruning: a simple, fast, exact method for partially observable Markov decision processes

UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
Prioritizing point-based POMDP solvers

ECML'06 Proceedings of the 17th European conference on Machine Learning

A survey of point-based POMDP solvers

Autonomous Agents and Multi-Agent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.