Computer Science – Artificial Intelligence
Scientific paper
2012-03-15
Computer Science
Artificial Intelligence
Appears in Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence (UAI2010)
Scientific paper
Despite the intractability of generic optimal partially observable Markov decision process planning, there exist important problems that have highly structured models. Previous researchers have used this insight to construct more efficient algorithms for factored domains, and for domains with topological structure in the flat state dynamics model. In our work, motivated by findings from the education community relevant to automated tutoring, we consider problems that exhibit a form of topological structure in the factored dynamics model. Our Reachable Anytime Planner for Imprecisely-sensed Domains (RAPID) leverages this structure to efficiently compute a good initial envelope of reachable states under the optimal MDP policy in time linear in the number of state variables. RAPID performs partially-observable planning over the limited envelope of states, and slowly expands the state space considered as time allows. RAPID performs well on a large tutoring-inspired problem simulation with 122 state variables, corresponding to a flat state space of over 10^30 states.
Brunskill Emma
Russell Stuart
No associations
LandOfFree
RAPID: A Reachable Anytime Planner for Imprecisely-sensed Domains 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 RAPID: A Reachable Anytime Planner for Imprecisely-sensed Domains, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and RAPID: A Reachable Anytime Planner for Imprecisely-sensed Domains will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-32449