93 citations · 101 across the 2 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2013★ 8 cited
My Brain is Full: When More Memory Helps
Christopher Lusena, Tong Li, Shelia Sittinger +2
We consider the problem of finding good finite-horizon policies for POMDPs under the expected reward metric. The policies considered are {em free finite-memory policies with limite…
cs.AI2011★ 93 cited
Nonapproximability Results for Partially Observable Markov Decision Processes
J. Goldsmith, C. Lusena, M. Mundhenk
We show that for several variations of partially observable Markov decision processes, polynomial-time algorithms for finding control policies are unlikely to or simply don't have…