首页> 外文会议>International Conference on Control, Decision and Information Technologies >Arborescent architecture for decentralized supervisory control of discrete event systems
【24h】

Arborescent architecture for decentralized supervisory control of discrete event systems

机译:离散事件系统的分散监督控制的树状架构

获取原文

摘要

Decentralized control of discrete event systems consists in using local supervisors that observe locally the plant and compute local decisions to enable or disable events; those local decisions are transmitted to fusion modules that combine them to generate global enablement/disablement decisions that are actually applied to the plant. C&P and D&A controls are the two simplest systematic decentralized controls. Inference-based control is the most general systematic decentralized control, which generalizes significantly C&P and D&A controls. In this paper, we first propose a method that realizes a control objective C by an arborescent architecture (or tree). Each leaf of the tree is a decentralized control, and each node n is a disjunction or conjunction of the enabling/disabling decisions of the two children of n. We show that if the control objective C is realizable by inference-based control, then every leaf of the obtained tree is a C&P or D&A control. This means that by combining adequately C&P and D&A controls, we can realize every control objective that is realizable by inference-based control.
机译:离散事件系统的分散控制包括使用本地监督员,该监督员在本地观察工厂并计算本地决策以启用或禁用事件。这些本地决策将传输到融合模块,将它们组合在一起以生成实际应用于工厂的全局启用/禁用决策。 C&P和D&A控件是两个最简单的系统分散控件。基于推理的控制是最通用的系统分散控制,可广泛推广C&P和D&A控制。在本文中,我们首先提出一种通过树状结构(或树)实现控制目标C的方法。树的每个叶子都是分散的控件,每个节点n是n的两个子元素的启用/禁用决策的析取或合取。我们表明,如果控制目标C可通过基于推理的控制实现,则所获得树的每个叶子都是C&P或D&A控件。这意味着通过充分结合C&P和D&A控件,我们可以实现可通过基于推理的控件实现的每个控件目标。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号