Back to Results
First PageMeta Content
Stochastic control / Theoretical computer science / Partially observable Markov decision process / Motion planning / Markov decision process / Algorithm / Symbol / Normal distribution / Statistics / Dynamic programming / Markov processes


IN Proc. Robotics: Science & Systems, 2008 SARSOP: Efficient Point-Based POMDP Planning by Approximating Optimally Reachable Belief Spaces
Add to Reading List

Document Date: 2008-07-11 05:03:32


Open Document

File Size: 679,42 KB

Share Result on Facebook

City

Efficient Point / /

Company

Neural Information Processing Systems / Robotics & Autonomous Systems / MIT Press / POMDP Planning / Intel / John Wiley & Sons / /

Facility

National University of Singapore Singapore / /

IndustryTerm

recent point-based algorithms / inner product / software implementation / Point-based algorithms / value iteration algorithms / final software release / overall algorithm / good approximate solutions / robotic systems / point-based algorithm / approximate solutions / search value iteration / on-line learning technique / approximation algorithms / recent algorithms / /

Organization

Approximating Optimally Reachable Belief Spaces Hanna Kurniawati David Hsu Wee Sun Lee Department of Computer Science / National University of Singapore / MIT / /

Person

Nat / David Hsu Wee Sun Lee / /

Position

original author / representative / point-based pomdp planner / /

ProgrammingLanguage

R / C / /

PublishedMedium

Machine Learning / /

Technology

solution algorithms / point-based algorithms / value iteration algorithms / ONCLUSION Point-based algorithms / overall algorithm / recent point-based algorithms / existing point-based algorithm / point-based algorithm / Machine Learning / simulation / html / developing approximation algorithms / existing point-based algorithms / lower-bound target level L. See Algorithm / Later point-based algorithms / /

URL

http /

SocialTag