Combinatorial filter reduction: special cases, approximation, and fixed-parameter tractability

DOI10.1016/j.jcss.2016.11.007zbMath1356.68089OpenAlexW2551987979MaRDI QIDQ730503

Mohammadreza Razzazi, Fatemeh Zahra Saberifar, Ali Mohades, Jason M. O'Kane

Publication date: 28 December 2016

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2016.11.007

zbMATH Keywords

automataapproximationreductionfixed-parameter tractabilitycombinatorial filters

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Artificial intelligence for robotics (68T40)

Related Items (2)

Cover Combinatorial Filters and Their Minimization Problem ⋮ Integer linear programming formulations of the filter partitioning minimization problem

Cites Work

• Orienting polygonal parts without sensors
• A still better performance guarantee for approximate graph coloring
• Cyber Detectives: Determining When Robots or People Misbehave
• Planning Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Combinatorial filter reduction: special cases, approximation, and fixed-parameter tractability