文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > 工程科技 > 电子/电路 > Diagnosis of complex systems using ant colony decision Petri nets
侵权投诉

Diagnosis of complex systems using ant colony decision Petri nets

Diagnosis of Complex Systems Using Ant Colony Decision Petri Nets

Calin Ciufudean, Adrian Graur, Constantin Filote, Cornel Turcu, and Valentin Popa “ tefan cel Mare” University of Suceava, 9 University str., RO-720225, Romania

, , , ,

Abstract

Failure diagnosis in large and complex systems is a critical task. A discrete event system (DES) approach to the problem of failure diagnosis is presented in this paper. A classic solution to solve DES’s diagnosis is a stochastic Petri nets. Unfortunately, the solution of a stochastic Petri net is severely restricted by the size of its underlying Markov chain. On the other hand, it has been shown that foraging behavior of ant colonies can give rise to the shortest path, which will reduce the state explosion of stochastic Petri net. Therefore, a new model of stochastic Petri net, based on foraging behavior of real ant colonies is introduced in this paper. This model can contribute to the diagnosis, the performance analysis and design of supervisory control systems.

Key words. Stochastic Petri nets, discrete-event systems, Ant Colony Optimization algorithm.

1. Introduction

Diagnosis is a crucial and challenging task in the automatic control of complex systems, e.g., in flexible manufacturing systems. In this paper a discrete event system (DES) approach to the problem of diagnosis of complex system is presented. The property of diagnosability is introduced in the context of the failure diagnosis problem, e.g., in the context of the availability of the DES. We propose a systematic procedure for diagnosis implemented with a new class of stochastic Petri nets (GSPN’s) ,i.e., ant colony decision Petri Nets (ADPN. The acceptance of such high-level formalism is due to their ability to represent complex systems in a compact and convenient way, while still describing an underlying continuous-time Markov chain (CTMC) [1]. This method suffers from the well-known state explosion problem: a GSPN can determine an underlying CTMC with a large number of states. This problem severely limits the size of models for which an exact analysis can reasonably be attempted. Stochastic Petri nets (SPN) were developed by associating transitions/places with exponentially distributed random time delays [2]. Generalized SPN

[3] allowed the inclusion of immediate transition and inhibitor arcs. These formalisms are all based on results obtained from the underlying Markov chain for such systems models. In [4] Sampath et al. proposed a diagnosis approach for discrete event systems. They introduced the notion of diagnosability and gave a necessary and sufficient condition to test it. Ant Colony Optimisation (ACO) is a recently developed approach that takes inspiration from the behavior of real ant colonies to solve NP - hard optimisation problems. The ACO meta-heuristic was first introduced by Dorigo [5], and was defined by Dorigo, Di Caro and Gambardella [6]. It has been successfully applied to various hard combinatorial optimization problems. In this paper we present the first application of ACO to Petri nets formalism, in order to simplify the models achieved with GSPN for solving the diagnosis of complex systems. In section 2 we briefly introduce the Ant Colony Optimization algorithm. Then we describe the structure of our diagnoser in section 3. In section 4 we present the experimental results implemented on an FMS. Finally, we summarize our findings and conclude with some discussion.

2. Ant Colony Optimization Algorithms

A Bayesian network (BN) is a directed acyclic graph where nodes represent random variables and edges represent conditional dependencies (e.g., probability distributions) between random variables [7]. Although the distributions in a BN can be discrete or continuous, we shall consider discrete ones. Search algorithms have been studied extensively in combinatorial optimization. Researches have applied various search strategies, for example, the best first search [5], linear programming, stochastic local search, genetic algorithms [7], etc. Ant algorithms were inspired by the foraging behavior of real ant colonies, i.e., how ants can find the shortest path between food sources and nest. Ants deposit on the ground a chemical substance called pheromone while walking. This forms pheromone trails through which ants can find the way and, also provides indirect communication among ants. It has been shown

第1页

你可能喜欢

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email