Bilgilendirme: Kurulum ve veri kapsamındaki çalışmalar devam etmektedir. Göstereceğiniz anlayış için teşekkür ederiz.

Mekatronik Mühendisliği Bölümü

Permanent URI for this communityhttps://hdl.handle.net/20.500.12416/20

Browse

Browsing Mekatronik Mühendisliği Bölümü by browse.metadata.publisher "IFAC Secretariat"

Filter results by typing the first few letters
Now showing 1 - 5 of 5
  • Thumbnail Image
    Conference Object
    Citation - Scopus: 5
    Abstraction-Based Supervisory Control for Recon-Gurable Manufacturing Systems
    (IFAC Secretariat, 2013) Khalid, H.M.; Kirik, M.S.; Schmidt, K.W.
    Reconfiguration control for discrete event systems (DES) is concerned with the realization of different system configurations by modification of the supervisory control loop. In this paper, we study the reconfiguration supervisor design for reconfigurable manufacturing systems (RMS) that comprise multiple components. We construct a modular supervisor for each configuration and system component in order to realize each active configuration and to quickly change between configurations. Different from the existing literature that is focused on monolithic design, our method is abstraction-based, and, hence applicable to large-scale DES. © 2013 IFAC.
  • Thumbnail Image
    Conference Object
    Citation - Scopus: 12
    Applied Supervisory Control for a Flexible Manufacturing System
    (IFAC Secretariat, 2010) Moor, T.; Schmidt, K.; Perk, S.
    This paper presents a case study in the design and implementation of a discrete event system (DES) of real-world complexity. Our DES plant is a flexible manufacturing system (FMS) laboratory model that consists of 29 interacting components and is controlled via 107 digital signals. Regarding controller design, we apply a hierarchical and decentralised synthesis method from earlier work in order to achieve nonblocking and safe closed-loop behaviour. Regarding implementation, we discuss how digital signals translate to discrete events from a practical point of view, including timing issues. The paper demonstrates how both, design and implementation, are supported by the open-source software tool libFAUDES.
  • Thumbnail Image
    Conference Object
    Citation - Scopus: 8
    Computation of Fault-Tolerant Supervisors for Discrete Event Systems
    (IFAC Secretariat, 2013) Sülek, A.N.; Schmidt, K.W.
    Fault-tolerance addresses the problem of operating a system even in case of faults. In this paper, we study fault-tolerance in the supervisory control framework for discrete event systems (DES). We consider DES, where certain events might no longer be possible in case a fault happens. In this setting, we first identify necessary and suficient conditions for the existence of a supervisor that realizes a given behavioral specification both in the non-faulty and in the faulty case. We further show that it is possible to determine a supremal fault-tolerant sublanguage in case the existence condition is violated. Finally, we propose an algorithm for the computation of this sublanguage and prove its correctness. Different from existing work, our fault-tolerant supervisor allows fault occurrences and system repairs at any time. The concepts and results developed in this paper are illustrated by a manufacturing system example. © 2013 IFAC.
  • Thumbnail Image
    Conference Object
    Computation of Projections for the Abstraction-Based Diagnosability Verification
    (IFAC Secretariat, 2010) Schmidt, K.
    The verification of language-diagnosability (LD) for discrete event systems (DES) generally requires the explicit evaluation of the overall system model which is infeasible for practical systems. In order to circumvent this problem, our previous work proposes the abstraction-based LD verification using natural projections that fulfill the loop-preserving observer (LPO) property. In this paper, we develop algorithms for the verification and computation of such natural projections. We first present a polynomial-time algorithm that allows to test if a given natural projection is a loop-preserving observer. Then, we show that, in case the LPO property is violated, finding a minimal extension of the projection alphabet such that the LPO condition holds is NP-hard. Finally, we adapt a polynomial-time heuristic algorithm by Feng and Wonham for the efficient computation of loop-preserving observers.
  • Thumbnail Image
    Conference Object
    Citation - Scopus: 2
    An Experimental Study of the Flexray Dynamic Segment
    (IFAC Secretariat, 2010) Schmidt, K.; Schmidt, E.G.; Demirci, A.; Yürüklü, E.; Karakaya, U.
    It is expected that the time-triggered FlexRay bus will replace the event-triggered Controller Area Network (CAN) for the high-speed in-vehicle communication in future automobiles. To this end, FlexRay provides a static segment for the transmission of periodic messages and a dynamic segment that is suitable for exchanging event-based (sporadic) messages. In this paper, we experimentally evaluate the operation of the FlexRay dynamic segment. In particular, we study how the maximum and average message delays are affected if the length of the dynamic segment, the message payload, the utilization of the dynamic segment and the priority assignment changes. Our experiments are carried out on a FlexRay network with 6 nodes. © 2010 IFAC.