# Set-labelled filters and sensor transformations

@inproceedings{Saberifar2016SetlabelledFA, title={Set-labelled filters and sensor transformations}, author={Fatemeh Zahra Saberifar and Shervin Ghasemlou and Jason M. O’Kane and Dylan A. Shell}, booktitle={Robotics: Science and Systems}, year={2016} }

For a given robot and a given task, this paper addresses questions about which modifications may be made to the robot’s suite of sensors without impacting the robot’s behavior in completing its task. Though this is an important design-time question, few principled methods exist for providing a definitive answer in general. Utilizing and extending the language of combinatorial filters, this paper aims to fill that lacuna by introducing theoretical tools for reasoning about sensors and…

## Figures and Tables from this paper

## 14 Citations

Abstractions for computing all robotic sensors that suffice to solve a planning problem

- Computer Science2020 IEEE International Conference on Robotics and Automation (ICRA)
- 2020

The algorithm aids in helping understand what attributes sensors must possess and what information they must provide in order to ensure a robot can achieve its goals despite non-determinism.

Toward a language-theoretic foundation for planning and filtering

- Computer ScienceInt. J. Robotics Res.
- 2019

A new formal structure is introduced that generalizes and consolidates a variety of well-known structures including many forms of plans, planning problems, and filters, into a single data structure called a procrustean graph, and gives these graph structures semantics in terms of ideas based in formal language theory.

Beyond the Planning Potpourri: Reasoning About Label Transformations on Procrustean Graphs

- Computer ScienceWAFR
- 2016

A new formal structure is introduced that generalizes and consolidates a variety of well known structures including many forms of plans, planning problems, and filters, into a single data structure called a procrustean graph.

On the Design of Minimal Robots That Can Solve Planning Problems

- MathematicsIEEE Transactions on Automation Science and Engineering
- 2021

This article examines the selection of a robot’s actuation and sensing hardware to minimize the cost of that design while ensuring that the robot is capable of carrying out a plan to complete a task and delineates some circumstances in which one can do better and achieve genuine optima with practical algorithms.

Delineating boundaries of feasibility between robot designs

- Computer Science2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
- 2018

A decision tree learning method to efficiently construct a compact implicit representation of the boundary to allow the designer to use prior knowledge to constrain the search, then use the tool to probe the boundary subject to those constraints, gaining insight into the information necessary for a robot to ensure task achievement.

Accelerating the Construction of Boundaries of Feasibility in Three Classes of Robot Design Problems

- Computer Science2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
- 2019

Three different scenarios are proposed, expressed as constraints on the p-graph and on the label maps, under which the learning algorithm to identify the destructiveness boundary can converge quickly to high accuracy results for problems at larger scales than the prior, general-purpose algorithm.

Nondeterminism subject to output commitment in combinatorial filters

- Computer ScienceArXiv
- 2022

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.

On the Relationship Between Bisimulation and Combinatorial Filter Reduction

- Computer Science2018 IEEE International Conference on Robotics and Automation (ICRA)
- 2018

It is shown that every filter minimization problem can be solved by computing a quotient of the input filter with some relation, but that for some filters, the bisimilarity relation is not the correct relation for this purpose.

Accelerating combinatorial filter reduction through constraints

- Computer Science2021 IEEE International Conference on Robotics and Automation (ICRA)
- 2021

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.

Cover Combinatorial Filters and their Minimization Problem

- Computer ScienceWAFR
- 2021

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.

## References

SHOWING 1-10 OF 22 REFERENCES

Sensor interpretation and task-directed planning using perceptual equivalence classes

- Computer ScienceProceedings. 1991 IEEE International Conference on Robotics and Automation
- 1991

The focus is on general techniques for coping with uncertainty, specifically, to sense the state of the task, adapt to changes, and reason to select actions to gain information and achieve the goal.

Automatic reduction of combinatorial filters

- Computer Science2013 IEEE International Conference on Robotics and Automation
- 2013

This work considers the problem of filtering whilst maintaining as little information as possible to perform a given task, and shows that solving this problem optimally is NP-hard, and that the related decision problem isNP-complete.

Comparison of constrained geometric approximation strategies for planar information states

- Computer Science2012 IEEE International Conference on Robotics and Automation
- 2012

A collection of algorithms that enable mobile robots with extreme limitations in both sensing and computation to maintain simple but provably mean-ingful representations of the incomplete information available to them are presented.

Distance-Optimal Navigation in an Unknown Environment Without Sensing Distances

- Computer ScienceIEEE Transactions on Robotics
- 2007

Due to the limited sensor given to the robot, globally optimal navigation is impossible; however, the approach achieves locally optimal navigation, which is the best that is theoretically possible under this robot model.

Sensing and Filtering: A Fresh Perspective Based on Preimages and Information Spaces

- Computer ScienceFound. Trends Robotics
- 2012

The notion of a virtual sensor is explained, which provides a mathematical way to model numerous sensors while abstracting away their particular physical implementation and introduces a novel family of filters that aggregate information from multiple sensor readings.

An exploration of sensorless manipulation

- Computer ScienceIEEE J. Robotics Autom.
- 1988

An automatic planner is described that constructs a tilting program, using a simple model of the mechanics of sliding, and it is observed that sensorless motion strategies perform conditional actions using mechanical decisions in place of environmental inquiries.

Symbolic finite state transducers: algorithms and applications

- Computer SciencePOPL '12
- 2012

The algorithms give rise to a complete decidable algebra of symbolic transducers, which can synthesize string pre-images in excess of 8,000 bytes in roughly a minute, and are found to significantly outperform previous techniques in succinctness and speed of analysis.

Planning algorithms

- Computer Science
- 2006

This coherent and comprehensive book unifies material from several sources, including robotics, control theory, artificial intelligence, and algorithms, into planning under differential constraints that arise when automating the motions of virtually any mechanical system.

Orienting deformable polygonal parts without sensors

- Engineering2012 IEEE/RSJ International Conference on Intelligent Robots and Systems
- 2012

An algorithm is presented that, when provided a geometric description of the part and a deformation model, generates a plan to orient the part up to symmetry from any initial orientation, and exploits deformation of the object under certain configurations to help resolve ambiguity.

Estimating uncertain spatial relationships in robotics

- MathematicsProceedings. 1987 IEEE International Conference on Robotics and Automation
- 1987

A representation for spatial information, called the stochastic map, and associated procedures for building it, reading information from it, and revising it incrementally as new information is obtained, providing a general solution to the problem of estimating uncertain relative spatial relationships.