Approximating Minimal Communicated Event Sets for Decentralized Supervisory Control

نویسندگان

  • Kurt R. Rohloff
  • Jan H. van Schuppen
چکیده

This paper discusses the problem of selecting the minimal set of events to be communicated between decentralized supervisory controllers in order for the behavior of a controller system to match a given specification. This optimization problem is known to be computationally difficult, so this paper discusses the problem of approximating this set of communicated events. It is shown how the communication minimization problem is related to a centralized supervisory control minimal sensor selection problem and a special type of directed graph st-cut problem. Polynomial time algorithms to approximate solutions to these problems most likely do not exist (using worst-case analysis), but several effective heuristic approximation methods are shown for these problems that work well for average cases. Copyright c 2005 IFAC

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reliable decentralized supervisory control of fuzzy discrete event systems

Decentralized supervisory control has been introduced to deal with a class of fuzzy discrete event systems (DES) in which state transitions are uncertain. In this paper, we develop the work on fuzzy DES to consider the reliable decentralized supervisor problem with possible failures of some local supervisors. By presenting a new definition of co-observable language, the reliable decentralized s...

متن کامل

Decentralized Supervisory Control of Discrete - Event

This paper formulates a problem of communication channels in decentralized control. A necessary and suucient condition is obtained for the existence of such a channel and is illustrated with an example of communication protocols. The existence of minimal communication channels is also investigated.

متن کامل

Decentralized Supervisory Control Using Dynamic Default Control

The conventional decentralized supervisory control architectures for discrete event systems assume that default control of controllable events is static. In this paper, we propose a new decentralized supervisory control architecture using dynamic default control of controllable events. We present necessary and sufficient conditions for the existence of a decentralized supervisor in the proposed...

متن کامل

Decentralized supervisory control of continuous timed discrete event systems

In this paper, we presented the decentralized supervisory control problem of discrete event system with continuous-time variable. By presenting the definition of coobservability for the timed specification, a necessary and sufficient condition for the existence of decentralized supervisors is obtained. Finally, a numerical example is

متن کامل

Approximating the Minimal-Cost Sensor-Selection for Discrete-Event Systems

This paper discusses the approximation of solutions to several NP-complete optimization problems related to the supervisory control of discrete-event systems. Approximation calculations for the minimal-cost sensor-selection problem in a partial observation, centralized control setting is first discussed. It is shown that approximate solutions to this problem cannot always be calculated with a g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005