By Topic

Sensor Selection for Structural Observability in Discrete Event Systems Modeled by Petri Nets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yu Ru ; Coordinated Science Laboratory, and the Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Urbana, United States of America ; Christoforos N. Hadjicostis

This paper studies optimal sensor selection in discrete event systems modeled by partially observed Petri nets. The goal is to place a minimum number of sensors while maintaining structural observability, i.e., the ability to uniquely determine the system state at any given time step based on sensor information up to that time step, knowledge of the system model, and an arbitrary but known initial state. The problem is important because the majority of existing control schemes for Petri nets rely on complete knowledge of the system state at any given time step. To simplify the problem, we consider two subproblems: the optimal place sensor selection (OPSS) problem and the optimal transition sensor selection (OTSS) problem. The OPSS problem is shown to be computationally hard by establishing that the corresponding decision problem is NP -complete. For this reason, we first reduce the problem to the linear integer programming problem, which can be solved optimally using existing linear integer programming solvers (at least for small problem instances), and then propose two heuristic algorithms to approximate its solution with polynomial complexity. Simulations suggest that the two proposed heuristics run faster and can find reasonably good solutions when compared to optimal methods that are based on linear integer programming solvers. Unlike the OPSS problem, the OTSS problem is solvable with polynomial complexity.

Published in:

IEEE Transactions on Automatic Control  (Volume:55 ,  Issue: 8 )