A fixed-parameter tractable algorithm for combinatorial filter reduction
Abstract: What is the minimal information that a robot must retain to achieve its task? To design economical robots, the literature dealing with reduction of combinatorial filters approaches this problem algorithmically. As lossless state compression is NP-hard, prior work has examined, along with minimization algorithms, a variety of special cases in which specific properties enable efficient solution. Complementing those findings, this paper refines the present understanding from the perspective of parameterized complexity. We give a fixed-parameter tractable algorithm for the general reduction problem by exploiting a transformation into clique covering. The transformation introduces new constraints that arise from sequential dependencies encoded within the input filter -- some of these constraints can be repaired, others are treated through enumeration. Through this approach, we identify parameters affecting filter reduction that are based upon inter-constraint couplings (expressed as a notion of their height and width), which add to the structural parameters present in the unconstrained problem of minimal clique covering. Compared with existing work, we precisely identify and quantitatively characterize those features that contribute to the problem's hardness: given a problem instance, the combinatorial core may be a fraction of the instance's full size, with a small subset of constraints needing to be considered, and even those may have directly identifiable couplings that collapse degrees of freedom in the enumeration.
- Jonathan H. Connell. Minimalist Mobile Robotics. A Colony-Style Architecture for an Artificial Creature, volume 5 of Perspectives in AI. Academic Press, Inc., 1990.
- Ken Goldberg. Minimalism in Robot Manipulation, April 1996. https://goldberg.berkeley.edu/minimalism/, Accessed 2023–09–02.
- Matthew T. Mason. Kicking the Sensing Habit. AI Magazine, 14(1):58–59, 1993.
- Rolf Niedermeier. Invitation to fixed-parameter algorithms. Oxford University Press, 2006.
- Concise planning and filtering: Hardness and algorithms. IEEE Transactions on Automation Science and Engineering, 14(4):1666–1681, 2017.
- Integer linear programming formulations of the filter partitioning minimization problem. Journal of Combinatorial Optimization, 40(2):431–453, 2020.
- Equivalence notions for state-space minimization of combinatorial filters. IEEE Transactions on Robotics, 37(6):2117–2136, 2021.
- Set-labelled filters and sensor transformations. In Robotics: Science and Systems, Ann Arbor, Michigan, 2016.
- Combinatorial Filter Reduction: Special Cases, Approximation, and Fixed-Parameter Tractability. Journal of Computer and System Sciences, 85:74–92, May 2017.
- Improper Filter Reduction. Journal of Algorithms and Computation, 50(1):69–99, June 2018.
- Combinatorial filters: Sensor beams, obstacles, and possible paths. ACM Transactions on Sensor Networks, 10(3):1–32, 2014.
- Ahammed Ullah. Computing clique cover with structural parameterization. arXiv preprint arXiv:2208.12438, 2022.
- Accelerating combinatorial filter reduction through constraints. In Proceedings of IEEE International Conference on Robotics and Automation, pages 9703–9709, 2021.
- Cover combinatorial filters and their minimization problem. In Algorithmic Foundations of Robotics XIV, pages 90–106. Springer, 2021.
- A general class of combinatorial filters that can be minimized efficiently. In Proceedings of IEEE International Conference on Robotics and Automation, pages 1645–1651, 2023.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.