Closing the Learning-Planning Loop with Predictive State Representations

Details Closing the Learning-Planning Loop with Predictive State Representations Closing the Learning-Planning Loop with Predictive State Representations

2009-12-12

arxiv.org/abs/0912.2385v1

Computer Science

Learning

Scientific paper

A central problem in artificial intelligence is that of planning to maximize future reward under uncertainty in a partially observable environment. In this paper we propose and demonstrate a novel algorithm which accurately learns a model of such an environment directly from sequences of action-observation pairs. We then close the loop from observations to actions by planning in the learned model and recovering a policy which is near-optimal in the original environment. Specifically, we present an efficient and statistically consistent spectral algorithm for learning the parameters of a Predictive State Representation (PSR). We demonstrate the algorithm by learning a model of a simulated high-dimensional, vision-based mobile robot planning task, and then perform approximate point-based planning in the learned PSR. Analysis of our results shows that the algorithm learns a state space which efficiently captures the essential features of the environment. This representation allows accurate prediction with a small number of parameters, and enables successful and efficient planning.

Affiliated with

Also associated with

No associations

Rating

Closing the Learning-Planning Loop with Predictive State Representations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Closing the Learning-Planning Loop with Predictive State Representations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Closing the Learning-Planning Loop with Predictive State Representations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-532907