On nondeterminism in combinatorial filters

07/15/2021
by   Yulin Zhang, et al.
0

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 'behavior' per vertex. We show that the gap in size can be significant (larger than polynomial), suggesting such cases will generally be more challenging than deterministic problems. Indeed, this is supported by the core computational complexity result established in this paper: producing nondeterministic minimizers is PSPACE-hard. The hardness separation for minimization which exists between deterministic filter and deterministic automata, thus, does not hold for the nondeterministic case.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
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
11/06/2020

Accelerating combinatorial filter reduction through constraints

Reduction of combinatorial filters involves compressing state representa...
research
02/15/2020

Cover Combinatorial Filters and their Minimization Problem

A recent research theme has been the development of automatic methods to...
research
02/15/2020

Cover Combinatorial Filters and their Minimization Problem (Extended Version)

Recent research has examined algorithms to minimize robots' resource foo...
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
08/08/2018

Input/Output Stochastic Automata with Urgency: Confluence and weak determinism

In a previous work, we introduced an input/output variant of stochastic ...

Please sign up or login with your details

Forgot password? Click here to reset