Approximating the minimal sensor selection for supervisory control

DOI10.1007/S10626-006-6187-3MaRDI QIDQ853685zbMATH OpenOpenAlexFDO

Authors Kurt R. Rohloff, Samir Khuller, Guy Kortsarz

Publication date 17 November 2006

Published in Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10626-006-6187-3

zbMATH Keywords

Approximation algorithmsAutomataComputational complexitySensor selectionSupervisory control

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Approximation algorithms (68W25) Transformations (93B17) Synthesis problems (93B50)

Recommendations

• On an optimization problem in sensor selection
• Online minimization of sensor activation for supervisory control
• Sensor selection for Kalman filtering of linear dynamical systems: complexity, limitations and greedy algorithms
• Algorithms for joint sensor and control nodes selection in dynamic networks
• An outer-approximation approach for information-maximizing sensor selection

Cites work

• A Parallel Repetition Theorem
• Approximating the minimal sensor selection for supervisory control
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• scientific article; zbMATH DE number 1383199 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 1839431 (Why is no real title available?)
• Minimizing the cardinality of an events set for supervisors of discrete-event dynamical systems
• NP-completeness of sensor selection problems arising in partially observed discrete-event systems
• On observability of discrete-event systems
• On the control of discrete-event dynamical systems
• On the hardness of approximating spanners
• Optimal sensor selection for discrete-event systems with partial observation
• Supervisory Control of a Class of Discrete Event Processes
• The computational complexity of decentralized discrete-event control problems

Cited in

(16)

• Computation of controllable and coobservable sublanguages in decentralized supervisory control via communication
• Refined parameterizations for computing colored cuts in edge-colored graphs
• A diagnoser algorithm for anomaly detection in DEDS under partial and unreliable observations: characterization and inclusion in sensor configuration optimization
• Online minimization of sensor activation for supervisory control
• Simultaneous Optimal Control and Discrete Stochastic Sensor Selection
• Privacy preserving minimal observability for composite transactional services
• Minimization of Dynamic Sensor Activation in Discrete Event Systems for the Purpose of Control
• Maximally permissive liveness-enforcing supervisor with lowest implementation cost for flexible manufacturing systems
• Minimal sensor activation and minimal communication in discrete-event systems
• Sensor selection cost optimisation for tracking structurally cyclic systems: a P-order solution
• Approximate Supermodularity of Kalman Filter Sensor Selection
• On the computation of natural observers in discrete-event systems
• Improved approximation algorithms for label cover problems
• A short proof and experimental study of the approximation algorithm for label s-t cut
• Approximating the minimal sensor selection for supervisory control
• Supervisory control of discrete event systems with distinguishers

Describes a project that uses

Uses Software

• UMDES

This page was built for publication: Approximating the minimal sensor selection for supervisory control

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