Cover Combinatorial Filters and their Minimization Problem

02/15/2020
by   Yulin Zhang, et al.
0

A recent research theme has been the development of automatic methods to minimize robots' resource footprints. In particular, the class of combinatorial filters (discrete variants of widely-used probabilistic estimators) has been studied and methods developed for automatically reducing their space requirements. This paper extends existing combinatorial filters by introducing a natural generalization that we dub cover combinatorial filters. In addressing the new—but still NP-complete—problem of minimization of cover filters, this paper shows that three of the concepts previously believed to be true about combinatorial filters (and actually conjectured, claimed, or assumed to be) are in fact false. For instance, minimization does not induce an equivalence relation. We give an exact algorithm for the cover filter minimization problem. Unlike prior work (based on graph coloring) we consider a type of clique-cover problem, involving a new conditional constraint, from which we can find more general relations. In addition to solving the more general problem, the algorithm we present also corrects flaws present in all prior filter reduction methods. The algorithm also forms a promising basis for practical future development as it involves a reduction to SAT.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/15/2020

Cover Combinatorial Filters and their Minimization Problem (Extended Version)

Recent research has examined algorithms to minimize robots' resource foo...
research
11/06/2020

Accelerating combinatorial filter reduction through constraints

Reduction of combinatorial filters involves compressing state representa...
research
09/10/2022

A general class of combinatorial filters that can be minimized efficiently

State minimization of combinatorial filters is a fundamental problem tha...
research
09/13/2023

A fixed-parameter tractable algorithm for combinatorial filter reduction

What is the minimal information that a robot must retain to achieve its ...
research
04/01/2022

Nondeterminism subject to output commitment in combinatorial filters

We study a class of filters – discrete finite-state transition systems e...
research
07/15/2021

On nondeterminism in combinatorial filters

The problem of combinatorial filter reduction arises from questions of r...
research
12/01/2010

Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function

We present a combinatorial characterization of the Bethe entropy functio...

Please sign up or login with your details

Forgot password? Click here to reset