Sensor Selection for event-detectability in Interpreted Petri Nets using an Ant Colony Optimization algorithm

Author

Aguirre-Salas, L. ; Santoyo-Sanchez, A.

Author_Institution

Centro Univ. de la Costa Sur, Univ. de Guadalajara, Jalisco, Mexico

fYear

2013

fDate

Sept. 30 2013-Oct. 4 2013

Firstpage

63

Lastpage

68

Abstract

This paper addresses the minimal cost sensor selection problem for event-detectability in Interpreted Petri Nets (IPN) models of Discrete Event Systems (DES). The computational complexity of this problem is reduced using an Ant Colony Optimization (ACO) algorithm. The proposed algorithm takes advantage of a structural characterization of the event-detectability property and can be tested in a polynomial time. The presented ACO algorithm is quite simple and helps to reduce the design effort of a DES.

Keywords

Petri nets; ant colony optimisation; signal detection; ant colony optimization algorithm; computational complexity; discrete event systems; event detectability; interpreted Petri net; minimal cost sensor selection problem; polynomial time; Ant Colony Algorithms; Discrete Event Systems; Event-Detectability; Interpreted Petri Nets; Sensor selection;

fLanguage

English

Publisher

ieee

Conference_Titel

Electrical Engineering, Computing Science and Automatic Control (CCE), 2013 10th International Conference on

Conference_Location

Mexico City

Print_ISBN

978-1-4799-1460-9

Type

conf

DOI

10.1109/ICEEE.2013.6676089

Filename

6676089