On nondeterminism in combinatorial filters

  title={On nondeterminism in combinatorial filters},
  author={Yulin Zhang and Dylan A. Shell},
The problem of combinatorial filter reduction arises from questions of resource optimization in robots; it is one specific way in which automation can help to achieve minimalism, to build better, simpler robots. This paper contributes a new definition of filter minimization that is broader than its antecedents, allowing filters (input, output, or both) to be nondeterministic. This changes the problem considerably. Nondeterministic filters are able to re-use states to obtain, essentially, more… 

Figures from this paper

Nondeterminism subject to output commitment in combinatorial filters
This paper argues for a new constrained type of nondeterminism that preserves input–output behavior for circumstances when, as for robots, causation forbids ‘rewinding’ of the world.


Accelerating combinatorial filter reduction through constraints
Empirical results show that constraints in conjunctive normal form capture the problem most effectively, leading to a method that outperforms the others and introduces just-in-time generation of such constraints, which yields improvements in efficiency and has the potential to minimize large filters.
Minimal NFA Problems are Hard
This work studies the complexity of decision problems for finite automata and presents many fundamental decision problems which are computationally intractable even when the input is a DFA or a NFA with limited nondeterminism.
Cover Combinatorial Filters and their Minimization Problem
This paper shows that three of the concepts previously believed to be true about combinatorial filters are in fact false, and gives an exact algorithm for the cover filter minimization problem, which involves a reduction to SAT.
Integer linear programming formulations of the filter partitioning minimization problem
The results show that the proposed ILP technique performs better in computing exact solutions as the filter sizes grow, and that the ILP approach obtains higher-quality feasible solutions, in contexts where time limitations prohibit the computation of exact solutions.
Concise Planning and Filtering: Hardness and Algorithms
Hardness results are presented showing that both filtering and planning are NP-hard to perform in an optimally concise way, and that the related decision problems areNP-complete.
Word problems requiring exponential time(Preliminary Report)
A number of similar decidable word problems from automata theory and logic whose inherent computational complexity can be precisely characterized in terms of time or space requirements on deterministic or nondeterministic Turing machines are considered.
Set-labelled filters and sensor transformations
The paper substantially expands the expressiveness of combinatorial filters so that, where they were previously limited to quite simple sensors, the richer filters are able to reasonably model a much broader variety of real devices.
On Information Invariants in Robotics
Combinatorial Filters
Filtering methods are presented that reconstruct the set of possible paths at three levels of resolution and an inexpensive, low-energy, easily deployable architecture was created which implements the beam model and validates the methods of the article with experiments.