| | |
Summary: Logical Circuit Filtering
Dafna Shahaf and Eyal Amir
Computer Science Department
University of Illinois, Urbana-Champaign
Urbana, IL 61801, USA
{dshahaf2,eyal}@uiuc.edu
Abstract
Logical Filtering is the problem of tracking the pos-
sible states of a world (belief state) after a sequence
of actions and observations. It is fundamental to
applications in partially observable dynamic do-
mains. This paper presents the first exact logical
filtering algorithm that is tractable for all determin-
istic domains. Our tractability result is interesting
because it contrasts sharply with intractability re-
sults for structured stochastic domains. The key to
this advance lies in using logical circuits to repre-
sent belief states. We prove that both filtering time
and representation size are linear in the sequence
length and the input size. They are independent of
|
