اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSupervision Localization of Timed Discrete-Event Systems
481
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study supervisor localization for real-time discrete-event systems (DES) in the Brandin-Wonham framework of timed supervisory control. We view a real-time DES as comprised of asynchronous agents which are coupled through imposed logical and temporal specifications; the essence of supervisor localization is the decomposition of monolithic (global) control action into local control strategies for these individual agents. This study extends our previous work on supervisor localization for untimed DES, in that monolithic timed control action typically includes not only disabling action as in the untimed case, but also ``clock preempting action which enforces prescribed temporal behavior. The latter action is executed by a class of special events, called ``forcible events; accordingly, we localize monolithic preemptive action with respect to these events. We demonstrate the new features of timed supervisor localization with a manufacturing cell case study, and discuss a distributed control implementation.
قيم البحث
اقرأ أيضاً
We study supervisor localization for timed discrete-event systems under partial observation and communication delay in the Brandin-Wonham framework. First, we employ timed relative observability to synthesize a partial-observation monolithic supervis
or; the control actions of this supervisor include not only disabling action of prohibitible events (as that of controllable events in the untimed case) but also clock-preempting action of forcible events. Accordingly we decompose the supervisor into a set of partial-observation local controllers one for each prohibitible event, as well as a set of partial-observation local preemptors one for each forcible event. We prove that these local controllers and preemptors collectively achieve the same controlled behavior as the partial-observation monolithic supervisor does. Moreover, we propose channel models for inter-agent event communication and impose bounded and unbounded delay as temporal specifications. In this formulation, there exist multiple distinct observable event sets; thus we employ timed relative coobservability to synthesize partial-observation decentralized supervisors, and then localize these supervisors into local controllers and preemptors. The above results are illustrated by a timed workcell example.
Recently we studied communication delay in distributed control of untimed discrete-event systems based on supervisor localization. We proposed a property called delay-robustness: the overall system behavior controlled by distributed controllers with
communication delay is logically equivalent to its delay-free counterpart. In this paper we extend our previous work to timed discrete-event systems, in which communication delays are counted by a special clock event {it tick}. First, we propose a timed channel model and define timed delay-robustness; for the latter, a polynomial verification procedure is presented. Next, if the delay-robust property does not hold, we introduce bounded delay-robustness, and present an algorithm to compute the maximal delay bound (measured by number of ticks) for transmitting a channeled event. Finally, we demonstrate delay-robustness on the example of an under-load tap-changing transformer.
Recently we developed supervisor localization, a top-down approach to distributed control of discrete-event systems. Its essence is the allocation of monolithic (global) control action among the local control strategies of individual agents. In this
paper, we extend supervisor localization by considering partial observation; namely not all events are observable. Specifically, we employ the recently proposed concept of relative observability to compute a partial-observation monolithic supervisor, and then design a suitable localization procedure to decompose the supervisor into a set of local controllers. In the resulting local controllers, only observable events can cause state change. Further, to deal with large-scale systems, we combine the partial-observation supervisor localization with an efficient architectural synthesis approach: first compute a heterarchical array of partial-observation decentralized supervisors and coordinators, and then localize each of these supervisors/coordinators into local controllers.
Recently we developed supervisor localization, a top-down approach to distributed control of discrete-event systems (DES) with finite behavior. Its essence is the allocation of monolithic (global) control action among the local control strategies of
individual agents. In this report, we extend supervisor localization to study the distributed control of DES with infinite behavior. Specifically, we first employ Thistle and Wonhams supervisory control theory for DES with infinite behavior to compute a safety supervisor (for safety specifications) and a liveness supervisor (for liveness specifications), and then design a suitable localization procedure to decompose the safety supervisor into a set of safety local controllers, one for each controllable event, and decompose the liveness supervisor into a set of liveness local controllers, two for each controllable event. The localization procedure for decomposing the liveness supervisor is novel; in particular, a local controller is responsible for disabling the corresponding controllable event on only part of the states of the liveness supervisor, and consequently, the derived local controller in general has states number no more than that computed by considering the disablement on all the states. Moreover, we prove that the derived local controllers achieve the same controlled behavior with the safety and liveness supervisors. We finally illustrate the result by a Small Factory example.
Recently we developed supervisor localization, a top-down approach to distributed control of discrete-event systems in the Ramadge-Wonham supervisory control framework. Its essence is the decomposition of monolithic (global) control action into local
control strategies for the individual agents. In this paper, we establish a counterpart supervisor localization theory in the framework of State Tree Structures, known to be efficient for control design of very large systems. In the new framework, we introduce the new concepts of local state tracker, local control function, and state-based local-global control equivalence. As before, we prove that the collective localized control behavior is identical to the monolithic optimal (i.e. maximally permissive) and nonblocking controlled behavior. In addition, we propose a new and more efficient localization algorithm which exploits BDD computation. Finally we demonstrate our localization approach on a model for a complex semiconductor manufacturing system.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
