Mekatronik Mühendisliği Bölümü Yayın Koleksiyonu
Permanent URI for this collectionhttps://hdl.handle.net/20.500.12416/255
Browse
5 results
Search Results
Article Citation - WoS: 8Citation - Scopus: 8Reconfigurability of Behavioural Specifications for Manufacturing Systems(Taylor & Francis Ltd, 2017) Schmidt, Klaus WernerReconfigurable manufacturing systems (RMS) support flexibility in the product variety and the configuration of the manufacturing system itself in order to enable quick adjustments to new products and production requirements. As a consequence, an essential feature of RMS is their ability to rapidly modify the control strategy during run-time. In this paper, the particular problem of changing the specified operation of a RMS, whose logical behaviour is modelled as a finite state automaton, is addressed. The notion of reconfigurability of specifications (RoS) is introduced and it is shown that the stated reconfiguration problem can be formulated as a controlled language convergence problem. In addition, algorithms for the verification of RoS and the construction of a reconfiguration supervisor are proposed. The supervisor is realised in a modular way which facilitates the extension by new configurations. Finally, it is shown that a supremal nonblocking and controllable strict subautomaton of the plant automaton that fulfils RoS exists in case RoS is violated for the plant automaton itself and an algorithm for the computation of this strict subautomaton is presented. The developed concepts and results are illustrated by a manufacturing cell example.Article Citation - WoS: 9Citation - Scopus: 10Computation of Supervisors for Reconfigurable Machine Tools(Springer, 2015) Schmidt, Klaus WernerThe rapid reconfiguration of manufacturing systems is an important issue in today's manufacturing technology in order to adjust the production to varying product demands and types. In this paper, we study the control of reconfigurable machine tools (RMTs) with the aim of fast reconfiguration and an easy controller implementation. We first formulate a particular reconfiguration problem for RMTs in a discrete event system setting, and then provide a necessary and sufficient condition for its solution. Moreover, we propose a polynomial-time algorithm for the construction of a reconfiguration supervisor as the composition of one modular supervisor for each separate RMT configuration. Each modular supervisor operates in three modes. In the first mode, it tracks the plant state if its corresponding configuration is inactive. In the second mode, it performs a configuration change if its corresponding configuration becomes active and in the third mode, it follows the specified behavior of its corresponding configuration if the configuration is active. An important property of the proposed reconfiguration supervisor is that it performs reconfigurations in a bounded number of event occurrences. In addition, the modular realization of our reconfiguration supervisor enables controller modifications such as adding or removing configurations during run-time. All results presented in the paper are illustrated by an RMT example.Article Citation - WoS: 17Citation - Scopus: 20State Attraction Under Language Specification for the Reconfiguration of Discrete Event Systems(Ieee-inst Electrical Electronics Engineers inc, 2015) Nooruldeen, Anas; Schmidt, Klaus WernerIn this note, we study a particular setting for the reconfiguration of discrete event systems (DES) that is applicable to the control of reconfigurable manufacturing systems (RMS). We consider DES that can operate in different configurations and we are interested in the realization of configuration changes. Different from previous work, we intend to reach a set of plant states where a new configuration can be started in a bounded number of transitions and at the same time fulfill a behavioral specification before starting the new configuration. To this end, we introduce the concept of weak attraction under language specification (WALS) and derive necessary and sufficient conditions for its verification. Using WALS, we propose a polynomial-time algorithm for computing a supervisor that performs the described configuration changes. We demonstrate the applicability of our method using a workcell of an RMS.Article Citation - WoS: 5Citation - Scopus: 5Optimal Supervisory Control of Discrete Event Systems: Cyclicity and Interleaving of Tasks(Siam Publications, 2015) Schmidt, Klaus WernerA substantial number of tasks in production systems are executed in a repetitive, cyclic fashion. Specifically, production systems run different production cycles of different products as well as different instances of the same production cycle. In this paper, we consider the optimal control and interleaving of such production cycles in a supervisory control framework for discrete event systems (DESs). That is, different from other approaches, our work is based on a behavioral specification of each production cycle. First, we adapt an optimal control approach for DESs, in order to optimize the operation of individual production cycles. Second, we employ the interleaving composition to design a supervisor that enables the simultaneous execution of different production cycles. Combining both results, we can further determine the maximum number of production cycles that can be executed simultaneously on a given production system.Article Citation - WoS: 54Citation - Scopus: 74Maximally Permissive Hierarchical Control of Decentralized Discrete Event Systems(Ieee-inst Electrical Electronics Engineers inc, 2011) Schmidt, Klaus; Breindl, ChristianThe subject of this paper is the synthesis of natural projections that serve as nonblocking and maximally permissive abstractions for the hierarchical and decentralized control of large-scale discrete event systems. To this end, existing concepts for nonblocking abstractions such as natural observers and marked string accepting (msa)-observers are extended by local control consistency (LCC) as a novel sufficient condition for maximal permissiveness. Furthermore, it is shown that, similar to the natural observer condition and the msa-observer condition, also LCC can be formulated in terms of a quasi-congruence. Based on existing algorithms in the literature, this allows to algorithmically compute natural projections that are either natural observers or msa-observers and that additionally fulfill LCC. The obtained results are illustrated by the synthesis of nonblocking and maximally permissive supervisors for a manufacturing system.