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

DOI10.1016/J.JCSS.2016.11.007zbMATH Open1356.68089OpenAlexW2551987979MaRDI QIDQ730503FDOQ730503

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

approximationautomatafixed-parameter tractabilityreductioncombinatorial 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Planning Algorithms
• Title not available (Why is that?)
• A still better performance guarantee for approximate graph coloring
• Orienting polygonal parts without sensors
• On the topology of discrete planning with uncertainty
• Cyber Detectives: Determining When Robots or People Misbehave

Cited In (2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q730503)