Approximating the Minimal Sensor Selection for Supervisory Control

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.

[1]  W. M. Wonham,et al.  The control of discrete event systems , 1989 .

[2]  Samir Khuller,et al.  Approximating the minimal sensor selection for supervisory control , 2004 .

[3]  Kurt Rohloff,et al.  APPROXIMATING MINIMAL COMMUNICATED EVENT SETS FOR DECENTRALIZED SUPERVISORY CONTROL , 2005 .

[4]  Guy Kortsarz.  On the Hardness of Approximating Spanners , 2001, Algorithmica.

[5]  J. Willems,et al.  The computational complexity of decentralized discrete-event control problems , 1995, IEEE Trans. Autom. Control..

[6]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

[7]  Stéphane Lafortune,et al.  NP-completeness of sensor selection problems arising in partially observed discrete-event systems , 2002, IEEE Trans. Autom. Control..

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  K. Rohloff,et al.  Computations on distributed discrete -event systems , 2004 .

[10]  K. Loparo,et al.  Minimizing the cardinality of an events set for supervisors of discrete-event dynamical systems , 1996, IEEE Trans. Autom. Control..

[11]  Hangju Cho.  Designing Observation Functions in Supervisory Control , 1990 .

[12]  Shengbing Jiang,et al.  Optimal sensor selection for discrete-event systems with partial observation , 2003, IEEE Trans. Autom. Control..

[13]  J. H. vanSchuppen,et al.  Approximating the minimal-cost sensor-selection for discrete-event systems , 2004 .

[14]  Carsten Lund,et al.  Hardness of approximations , 1996 .

[15]  Walter Murray Wonham,et al.  On observability of discrete-event systems , 1988, Inf. Sci..

[16]  Vijay K. Garg,et al.  Optimal Sensor and Actuator Choices for Discrete Event Systems , 1994 .

[17]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[18]  P. Ramadge,et al.  Supervisory control of a class of discrete event processes , 1987 .

[19]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[20]  John N. Tsitsiklis,et al.  On the control of discrete-event dynamical systems , 1987, 26th IEEE Conference on Decision and Control.

[21]  Ran Raz,et al.  A parallel repetition theorem , 1995, STOC '95.

[22]  Christos G. Cassandras,et al.  Introduction to Discrete Event Systems , 1999, The Kluwer International Series on Discrete Event Dynamic Systems.