Approximating the minimal sensor selection for supervisory control

Samir Khuller; Guy Kortsarz; Kurt R. Rohloff

doi:10.1016/S1474-6670(17)30727-9

Approximating the minimal sensor selection for supervisory control

Samir Khuller, Guy Kortsarz, Kurt R. Rohloff

Research output: Contribution to journal › Conference article › peer-review

Abstract

This paper discusses the problem of selecting a set of sensors of minimum cardinality that can be used for the synthesis of a supervisory controller.We show 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 cut 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.

Original language	English
Pages (from-to)	87-92
Number of pages	6
Journal	IFAC-PapersOnLine
Volume	37
Issue number	18
DOIs	https://doi.org/10.1016/S1474-6670(17)30727-9
State	Published - 2004
Externally published	Yes
Event	7th International Workshop on Discrete Event Systems, WODES 2004 - Reims, France Duration: 22 Sep 2004 → 24 Sep 2004

Bibliographical note

Publisher Copyright:
© 2004 IFAC.

Keywords

Approximation algorithms
Computer-aided control system design
Discrete-event systems. supervisory control graph theory
Observers

Access to Document

10.1016/S1474-6670(17)30727-9

Cite this

@article{fcac29a7bfed45478386c131db6fb199,

title = "Approximating the minimal sensor selection for supervisory control",

abstract = "This paper discusses the problem of selecting a set of sensors of minimum cardinality that can be used for the synthesis of a supervisory controller.We show 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 cut 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.",

keywords = "Approximation algorithms, Computer-aided control system design, Discrete-event systems. supervisory control graph theory, Observers",

author = "Samir Khuller and Guy Kortsarz and Rohloff, {Kurt R.}",

note = "Publisher Copyright: {\textcopyright} 2004 IFAC.; 7th International Workshop on Discrete Event Systems, WODES 2004 ; Conference date: 22-09-2004 Through 24-09-2004",

year = "2004",

doi = "10.1016/S1474-6670(17)30727-9",

language = "אנגלית",

volume = "37",

pages = "87--92",

journal = "IFAC-PapersOnLine",

issn = "1474-6670",

publisher = "IFAC Secretariat",

number = "18",

}

TY - JOUR

T1 - Approximating the minimal sensor selection for supervisory control

AU - Khuller, Samir

AU - Kortsarz, Guy

AU - Rohloff, Kurt R.

PY - 2004

Y1 - 2004

N2 - This paper discusses the problem of selecting a set of sensors of minimum cardinality that can be used for the synthesis of a supervisory controller.We show 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 cut 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.

AB - This paper discusses the problem of selecting a set of sensors of minimum cardinality that can be used for the synthesis of a supervisory controller.We show 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 cut 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.

KW - Approximation algorithms

KW - Computer-aided control system design

KW - Discrete-event systems. supervisory control graph theory

KW - Observers

UR - http://www.scopus.com/inward/record.url?scp=85064566985&partnerID=8YFLogxK

U2 - 10.1016/S1474-6670(17)30727-9

DO - 10.1016/S1474-6670(17)30727-9

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:85064566985

SN - 1474-6670

VL - 37

SP - 87

EP - 92

JO - IFAC-PapersOnLine

JF - IFAC-PapersOnLine

IS - 18

T2 - 7th International Workshop on Discrete Event Systems, WODES 2004

Y2 - 22 September 2004 through 24 September 2004

ER -

Approximating the minimal sensor selection for supervisory control

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this