Dynamic sensor activation for event diagnosis

Authors:
Weilin Wang;Stéphane Lafortune;Anouck R. Girard;Feng Lin
Affiliations:
Department of Aerospace Engineering, University of Michigan, Ann Arbor, MI;Department of EECS, University of Michigan, Ann Arbor, MI;Department of Aerospace Engineering, University of Michigan, Ann Arbor, MI;Department of ECE, Wayne State University, Detroit, MI
Venue:
ACC'09 Proceedings of the 2009 conference on American Control Conference
Year:
2009

Citing 4
Cited 1

On an Optimization Problem in Sensor Selection

Discrete Event Dynamic Systems
Sensor Minimization Problems with Static or Dynamic Observers for Fault Diagnosis

ACSD '07 Proceedings of the Seventh International Conference on Application of Concurrency to System Design
Active Acquisition of Information for Diagnosis and Supervisory Control of Discrete Event Systems

Discrete Event Dynamic Systems
On the Minimization of Communication in Networked Systems with a Central Station

Discrete Event Dynamic Systems

Optimal sensor activation for diagnosing discrete event systems

Automatica (Journal of IFAC)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of dynamic sensor activation for event diagnosis in partially-observed discrete-event systems. The observing agent is able to activate sensors dynamically during the evolution of the system. The sensor activation policy is the function that describes which sensors are to be activated after an observed string of events. The sensor activation policy must achieve the requirements of the property of diagnosability previously defined for discrete event systems. A policy is said to be minimal if there is no other policy, with strictly less sensor activation, that achieves diagnosability. For the purpose of computing minimal policies, we define language partition methods that lead to efficient computational algorithms. Specifically, we define "window-based" language partitions that lead to scalable algorithms for computing minimal policies. By increasing the size of the window in this class of partitions, one is able to refine the solution space over which minimal solutions are computed.