375 citations · 999 across the 17 of their papers we have counts for
Showing 2011 · cs.AIShow all
3 papers · 2 filters
cs.AI2011★ 375 cited
Anytime Point-Based Approximations for Large POMDPs
J. Pineau, G. Gordon, S. Thrun
The Partially Observable Markov Decision Process has long been recognized as a rich framework for real-world planning and control problems, especially in robotics. However exact so…
cs.AI2011★ 255 cited
Finding Approximate POMDP solutions Through Belief Compression
N. Roy, G. Gordon, S. Thrun
Standard value function approaches to finding policies for Partially Observable Markov Decision Processes (POMDPs) are generally considered to be intractable for large models. The…
cs.AI2011★ 5 cited
A Maximal Tractable Class of Soft Constraints
D. Cohen, M. Cooper, P. Jeavons +1
Many researchers in artificial intelligence are beginning to explore the use of soft constraints to express a set of (possibly conflicting) problem requirements. A soft constraint…