Restricted Value Iteration: Theory and Algorithms

Details Restricted Value Iteration: Theory and Algorithms Restricted Value Iteration: Theory and Algorithms

2011-06-30

arxiv.org/abs/1107.0042v1

Journal Of Artificial Intelligence Research, Volume 23, pages 123-165, 2005

Computer Science

Artificial Intelligence

Scientific paper

10.1613/jair.1379

Value iteration is a popular algorithm for finding near optimal policies for POMDPs. It is inefficient due to the need to account for the entire belief space, which necessitates the solution of large numbers of linear programs. In this paper, we study value iteration restricted to belief subsets. We show that, together with properly chosen belief subsets, restricted value iteration yields near-optimal policies and we give a condition for determining whether a given belief subset would bring about savings in space and time. We also apply restricted value iteration to two interesting classes of POMDPs, namely informative POMDPs and near-discernible POMDPs.

Affiliated with

Also associated with

No associations

Rating

Restricted Value Iteration: Theory and Algorithms 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 Restricted Value Iteration: Theory and Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Restricted Value Iteration: Theory and Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-480003