Approximating the Minimal Sensor Selection for Supervisory Control

Authors:
Kurt R. Rohloff;Samir Khuller;Guy Kortsarz
Affiliations:
BBN Technologies, Cambridge, USA 02138;Department of Computer Science, University of Maryland, College Park, USA 20742;Computer Science Department, Business and Science Building, Rutgers University, Camden, USA
Venue:
Discrete Event Dynamic Systems
Year:
2006

Citing 0
Cited 3

On the Computation of Natural Observers in Discrete-Event Systems

Discrete Event Dynamic Systems
A diagnoser algorithm for anomaly detection in DEDS under partial and unreliable observations: characterization and inclusion in sensor configuration optimization

Discrete Event Dynamic Systems
Maximally permissive liveness-enforcing supervisor with lowest implementation cost for flexible manufacturing systems

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses the problem of selecting a set of sensors of minimum cost that can be used for the synthesis of a supervisory controller. It is shown how this sensor selection problem is related to a type of directed graph st-cut problem that has not been previously discussed in the literature. Approximation algorithms to solve the sensor selection problem can be used to solve the graph cutting problem and vice-versa. Polynomial time algorithms to find good approximate solutions to either problem most likely do not exist (under certain complexity assumptions), but a time efficient approximation algorithm is shown that solves a special case of these problems. It is also shown how to convert the sensor selection problem into an integer programming problem.