메뉴 건너뛰기




Volumn 16, Issue 1, 2006, Pages 143-170

Approximating the minimal sensor selection for supervisory control

Author keywords

Approximation algorithms; Automata; Computational complexity; Sensor selection; Supervisory control

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; CONTROL EQUIPMENT; INTEGER PROGRAMMING; PROBLEM SOLVING; SENSORS;

EID: 32944458102     PISSN: 09246703     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10626-006-6187-3     Document Type: Conference Paper
Times cited : (23)

References (22)
  • 1
    • 0002019995 scopus 로고    scopus 로고
    • Hardness of approximations
    • D S Hochbaum (ed) Boston, MA: PWS Publishing
    • Arora S, Lund C (1997). Hardness of approximations. In: D S Hochbaum (ed) Algorithms for NP-Hard Problems. Boston, MA: PWS Publishing, pp 46-93.
    • (1997) Algorithms for NP-Hard Problems , pp. 46-93
    • Arora, S.1    Lund, C.2
  • 4
    • 32944461064 scopus 로고
    • Designing observation functions in supervisory control
    • Cho H (1990) Designing observation functions in supervisory control. In Proc. Korean Automatic Control Conference, pp 523-528.
    • (1990) Proc. Korean Automatic Control Conference , pp. 523-528
    • Cho, H.1
  • 6
    • 0030289288 scopus 로고    scopus 로고
    • Minimizing the cardinality of an events set for supervisors of discrete-event dynamical systems
    • Haji-Valizadeh A, Loparo KA (1996). Minimizing the cardinality of an events set for supervisors of discrete-event dynamical systems. IEEE Trans Automat Contr 41(11): 1579-1593.
    • (1996) IEEE Trans Automat Contr , vol.41 , Issue.11 , pp. 1579-1593
    • Haji-Valizadeh, A.1    Loparo, K.A.2
  • 7
    • 0037350942 scopus 로고    scopus 로고
    • Optimal sensor selection for discrete-event systems with partial observation
    • Jiang S, Kumar R, Garcia HE (2003). Optimal sensor selection for discrete-event systems with partial observation. IEEE Trans Automat Contr 48(3):369-381.
    • (2003) IEEE Trans Automat Contr , vol.48 , Issue.3 , pp. 369-381
    • Jiang, S.1    Kumar, R.2    Garcia, H.E.3
  • 9
    • 0242269933 scopus 로고    scopus 로고
    • On the hardness of approximating spanners
    • Kortsarz G (2001). On the hardness of approximating spanners, Algorithmica, special Approx-98 issue, 30(3):432-450.
    • (2001) Algorithmica, Special Approx-98 Issue , vol.30 , Issue.3 , pp. 432-450
    • Kortsarz, G.1
  • 10
    • 0023995784 scopus 로고
    • On observability of discrete-event systems
    • Lin F, Wonham WM (1988). On observability of discrete-event systems. Inf Sci 44:173-198.
    • (1988) Inf Sci , vol.44 , pp. 173-198
    • Lin, F.1    Wonham, W.M.2
  • 12
    • 0023104549 scopus 로고
    • Supervisory control of a class of discrete-event processes
    • Ramadge PJ, Wonham WM (1987). Supervisory control of a class of discrete-event processes. SIAM J Control Optim 25(1):206-230.
    • (1987) SIAM J Control Optim , vol.25 , Issue.1 , pp. 206-230
    • Ramadge, P.J.1    Wonham, W.M.2
  • 13
    • 0024479313 scopus 로고
    • The control of discrete-event systems
    • Ramadge PJ, Wonham WM (1989). The control of discrete-event systems. Proc. IEEE 77(1):81-98.
    • (1989) Proc. IEEE , vol.77 , Issue.1 , pp. 81-98
    • Ramadge, P.J.1    Wonham, W.M.2
  • 14
    • 0001226672 scopus 로고    scopus 로고
    • A parallel repetition theorem
    • Raz R (1998). A parallel repetition theorem. SIAM J Comput 27(3):763-803.
    • (1998) SIAM J Comput , vol.27 , Issue.3 , pp. 763-803
    • Raz, R.1
  • 16
    • 32944479470 scopus 로고    scopus 로고
    • Approximating the minimal-cost sensor-selection for discrete-event systems
    • December. Centrum voor Wiskunde en Informatica (CWI), Amsterdam, the Netherlands
    • Rohloff K, van Schuppen JH (2004, December). Approximating the minimal-cost sensor-selection for discrete-event systems. Technical Report MASR0404, Centrum voor Wiskunde en Informatica (CWI), Amsterdam, the Netherlands.
    • (2004) Technical Report MASR0404
    • Rohloff, K.1    Van Schuppen, J.H.2
  • 17
  • 18
    • 0029342635 scopus 로고
    • The computational complexity of decentralized discrete-event control problems
    • Rudie K, Willems JC (1995) The computational complexity of decentralized discrete-event control problems. IEEE Trans Automat Contr 40(7):1313-1318.
    • (1995) IEEE Trans Automat Contr , vol.40 , Issue.7 , pp. 1313-1318
    • Rudie, K.1    Willems, J.C.2
  • 19
    • 0024774127 scopus 로고
    • On the control of discrete-event dynamical systems
    • Tsitsiklis J (1989). On the control of discrete-event dynamical systems. MCCS Math Control Signals and Syst 2:95-107.
    • (1989) MCCS Math Control Signals and Syst , vol.2 , pp. 95-107
    • Tsitsiklis, J.1
  • 21
    • 0036742786 scopus 로고    scopus 로고
    • NP-completeness of sensor selection problems arising in partially-observed discrete-event systems
    • Yoo T-S, Lafortune S (2002). NP-completeness of sensor selection problems arising in partially-observed discrete-event systems. IEEE Trans Automat Contr 47(9):1495-1499.
    • (2002) IEEE Trans Automat Contr , vol.47 , Issue.9 , pp. 1495-1499
    • Yoo, T.-S.1    Lafortune, S.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.