Back to Results
First PageMeta Content
Stochastic control / Control theory / Partially observable Markov decision process / Markov decision process / Automated planning and scheduling / Reinforcement learning / Monte Carlo POMDP / Statistics / Dynamic programming / Markov processes


Point-based value iteration: An anytime algorithm for POMDPs Joelle Pineau, Geoff Gordon and Sebastian Thrun Carnegie Mellon University Robotics Institute 5000 Forbes Avenue Pittsburgh, PA 15213
Add to Reading List

Document Date: 2003-06-04 12:29:32


Open Document

File Size: 292,64 KB

Share Result on Facebook

Company

Value Iteration / Baxter / /

Country

Jordan / /

/

Facility

Stanford University / The Hong-Kong University of Science / Sebastian Thrun Carnegie Mellon University Robotics Institute / /

IndustryTerm

trouble computing useful policies / heuristic algorithm / iteration algorithm / earlier algorithms / iteration algorithms / policy search techniques / overall algorithms / improved grid-based approximation algorithm / e-optimal grid-based algorithm / breadth-first search / recent value function solution / policy search method / approximate solutions / policy search methods / iteration solution / /

Organization

Sebastian Thrun Carnegie Mellon University Robotics Institute / Stanford University / Hong-Kong University of Science and Technology / /

Person

Markov / Geoff Gordon / Roy / Van Nostrand Reinhold / Sebastian Thrun Carnegie / Joelle Pineau / /

Position

representative / forward / controller / /

Product

Hallway / Maze33 / Hallway2 / /

ProgrammingLanguage

D / T / /

PublishedMedium

Journal of Artificial Intelligence Research / /

SportsLeague

Stanford University / /

Technology

laser / overall algorithms / POMDP algorithms / iteration algorithm / http / grid-based algorithm / Simulation / iteration algorithms / improved grid-based approximation algorithm / consider using stochastic simulation to generate new points / /

URL

www.cs.brown.edu/research/ai/pomdp/code/index.html / /

SocialTag