A general class of combinatorial filters that can be minimized efficiently
State minimization of combinatorial filters is a fundamental problem that arises, for example,
in building cheap, resource-efficient robots. But exact minimization is known to be NP-hard …
in building cheap, resource-efficient robots. But exact minimization is known to be NP-hard …
Improper filter reduction
Combinatorial filters have been the subject of increasing interest from the robotics
community in recent years. This paper considers automatic reduction of combinatorial filters …
community in recent years. This paper considers automatic reduction of combinatorial filters …
Nondeterminism subject to output commitment in combinatorial filters
We study a class of filters—discrete finite-state transition systems employed as incremental
stream transducers—that have application to robotics: eg, to model combinatorial estimators …
stream transducers—that have application to robotics: eg, to model combinatorial estimators …