Mekatronik Mühendisliği Bölümü Yayın Koleksiyonu

Permanent URI for this collectionhttps://hdl.handle.net/20.500.12416/255

Browse

Filters

2012 - 2019152020 - 20232

Settings

Author: search.filters.author.Schmidt, Klaus WernerPublication Index: search.filters.publicationIndex.WoS

Search Results

Now showing 1 - 10 of 17
  • Conference Object
    Controller Design for Cacc With Time-Varying Communication Delays
    (Ieee, 2023) Soysal, Gokhan; Schmidt, Klaus Werner; Bingol, Hilal
    Cooperative Adaptive Cruise Control (CACC) aims at the safe and comfortable travel of vehicles at short distances in the form of platoons. Hereby, it is generally desired to attenuate disturbances along vehicles in a platoon, which is captured by different string stability conditions. In this paper, we focus on L-infinity string stability. This condition ensures reducing the magnitude of the acceleration signal along the platoon, which helps to avoid actuator saturation and increases driving comfort. Since the performance of CACC is adversely affected by time-varying communication and actuator delays, we develop the first controller design method for L-infinity-string stability, combining the Lyapunov-Krasovskii method and our custom bisection algorithm. Simulation experiments demonstrate the effectiveness of our method.
  • Article
    Citation - WoS: 4
    Citation - Scopus: 4
    String Stability Under Actuator Saturation on Straight Level Roads: Sufficient Conditions and Optimal Trajectory Generation
    (Ieee-inst Electrical Electronics Engineers inc, 2022) Bingol, Hilal; Schmidt, Klaus Werner
    The heterogeneity of vehicles is an important factor when realizing cooperative adaptive cruise control (CACC) in practice. Specifically, it has to be considered that platoons generally consist of vehicles with both different dynamic properties and actuator limits on the engine and braking force, which is expected to have a negative impact on important properties such as string stability. Accordingly, the subject of this paper is the preservation of string stability for CACC in heterogeneous vehicle strings with potential actuator saturation. To this end, the paper formulates a velocity-dependent force bound that enables the derivation of sufficient conditions for preserving string stability during velocity changes of heterogeneous platoons. These conditions are then used for the analytical computation of trajectories for time-optimal velocity changes. The formal results of the paper are supported by an illustrative simulation study.
  • Conference Object
    Citation - WoS: 5
    Citation - Scopus: 6
    Fault-Tolerant Control of Discrete-Event Systems With Lower-Bound Specifications
    (Elsevier, 2015) Moor, Thomas; Schmidt, Klaus Werner
    Fault-tolerant control addresses the control of dynamical systems such that they remain functional after the occurrence of a fault. To allow the controller to compensate for a fault, the system must exhibit certain redundancies. Alternatively, one may relax performance requirements for the closed loop behaviour after the occurrence of a fault. To achieve fault tolerance for a hierarchical control architecture, a combination of both options appears to be advisable: on each individual level of the hierarchy, the controller may compensate the fault as far as possible, and then pass on responsibility to the next upper level. This approach, when further elaborated for discrete-event systems represented by formal languages, turns out to impose a hard lower-bound inclusion specification on the closed-loop behaviour. The present paper discusses the corresponding synthesis problem and presents a solution. (C) 2015, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
  • Article
    Citation - WoS: 8
    Citation - Scopus: 8
    Reconfigurability of Behavioural Specifications for Manufacturing Systems
    (Taylor & Francis Ltd, 2017) Schmidt, Klaus Werner
    Reconfigurable 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.
  • Conference Object
    The Controllability Prefix for Supervisory Control Under Partial Observation With an Application To Fault-Tolerant Control
    (Elsevier, 2017) Moor, Thomas; Schmidt, Klaus Werner
    The controllability prefix is known as a useful concept for the discussion and solution of synthesis problems in supervisory control of cp-languages, i.e., formal languages of infinite-length words. There, the controllability prefix is defined as the set of all finite-length prefixes that can be controlled to satisfy prescribed liveness and safety properties. In this paper, we discuss a variation of the controllability prefix to address supervisory control under partial observation for regular *-languages, i.e., formal languages of finite-length words. We derive algebraic properties that are useful for a quantitative analysis on how an upper-bound language-inclusion specification affects achievable lower-bound specifications. Our study is motivated by the synthesis of fault-tolerant supervisory controllers, where the possible occurrence of a fault may restrict the achievable pre-fault behaviour so severe, that a relaxation of the upper-bound specification becomes a practical option. As our study shows, such a relaxation can be systematically constructed in terms of the controllability prefix. (C) 2017, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
  • Article
    Citation - WoS: 10
    Citation - Scopus: 10
    An Integrated Scheduling and Control Model for Multi-Mode Projects
    (Springer, 2013) Hazir, Oncu; Schmidt, Klaus Werner
    In today's highly competitive uncertain project environments, it is of crucial importance to develop analytical models and algorithms to schedule and control project activities so that the deviations from the project objectives are minimized. This paper addresses the integrated scheduling and control in multi-mode project environments. We propose an optimization model that models the dynamic behavior of projects and integrates optimal control into a practically relevant project scheduling problem. From the scheduling perspective, we address the discrete time/cost trade-off problem, whereas an optimal control formulation is used to capture the effect of project control. Moreover, we develop a solution algorithm for two particular instances of the optimal project control. This algorithm combines a tabu search strategy and nonlinear programming. It is applied to a large scale test bed and its efficiency is tested by means of computational experiments. To the best of our knowledge, this research is the first application of optimal control theory to multi-mode project networks. The models and algorithms developed in this research are targeted as a support tool for project managers in both scheduling and deciding on the timing and quantity of control activities.
  • Article
    Citation - WoS: 15
    Citation - Scopus: 17
    Distributed Real-Time Protocols for Industrial Control Systems: Framework and Examples
    (Ieee Computer Soc, 2012) Schmidt, Klaus Werner; Schmidt, Ece Guran
    The automation of today's large-scale industrial systems relies on the operation of distributed controller devices that perform local computations and exchange information via communication networks. The subject of this paper is the development of a family of shared-medium industrial communication protocols that support the transmission of real-time (RT) and nonreal-time (nRT) data among distributed controller devices. Different from existing protocols, we suggest to incorporate information that is available from the control application in the protocol definition. As a result, our protocols dynamically change the bandwidth allocation on the shared medium according to the instantaneous communication requirements while ensuring hard RT guarantees. Following the recent developments in industrial automation, our protocols can be realized as software layers on top of low-cost conventional Ethernet.
  • Article
    Citation - WoS: 9
    Citation - Scopus: 9
    Efficient Abstractions for the Supervisory Control of Modular Discrete Event Systems
    (Ieee-inst Electrical Electronics Engineers inc, 2012) Schmidt, Klaus Werner; Ribeiro Cury, Jose Eduardo; Cury, José Eduardo Ribeiro
    The topic of this technical note is the nonblocking and maximally permissive abstraction-based supervisory control for modular discrete event systems (DES). It is shown, that an efficient abstraction technique, that was developed for the nonconflict verification of modular DES, is also suitable for the nonblocking supervisory control. Moreover, it is proved that this abstraction technique can be extended by the condition of local control consistency, in order to achieve maximally permissive supervision. Different from existing approaches, the presented abstraction does not require to preserve the shared events among the system components in the respective abstraction alphabets, and hence leads to potentially smaller system abstractions. The obtained results are illustrated by a flexible manufacturing system example.
  • Article
    Citation - WoS: 16
    Citation - Scopus: 18
    Verification of Modular Diagnosability With Local Specifications for Discrete-Event Systems
    (Ieee-inst Electrical Electronics Engineers inc, 2013) Schmidt, Klaus Werner
    In this paper, we study the diagnosability verification for modular discrete-event systems (DESs), i.e., DESs that are composed of multiple components. We focus on a particular modular architecture, where each fault in the system must be uniquely identified by the modular component where it occurs and solely based on event observations of that component. Hence, all diagnostic computations for faults to be detected in this architecture can be performed locally on the respective modular component, and the obtained diagnosis information is only relevant for that component. We define the condition of modular language diagnosability with local specifications (MDLS) in order to capture that each fault can indeed be detected in this modular architecture. Then, we show that MDLS can be formulated as a specific language-diagnosability problem. As the main contribution of this paper, we develop an incremental abstraction-based approach for the verification of MDLS, which is based on projections that fulfill the loop-preserving observer condition. In particular, our approach efficiently avoids the construction of a global system model, which is infeasible for systems of realistic size. Furthermore, we do not rely on the assumption of a live global plant, which is prevalent in previous diagnosability methods for modular DESs. We illustrate our approach and its computational savings by a manufacturing system example.
  • Article
    Citation - WoS: 20
    Citation - Scopus: 20
    Robust Priority Assignments for Extending Existing Controller Area Network Applications
    (Ieee-inst Electrical Electronics Engineers inc, 2014) Schmidt, Klaus Werner
    The usage of the controller area network (CAN) as an in-vehicle communication bus requires finding feasible and robust priority orders such that each message transmitted on the bus meets its specified deadline and tolerates potential transmission errors. Although such priority orders can be determined by available algorithms whenever they exist, it is always assumed that a CAN priority order is computed from scratch. In practical applications, it is frequently necessary to extend an existing message set by new messages. In this case, a feasible priority order that retains the standardized IDs of the existing messages and assigns suitable priorities to the new messages needs to be found. This paper proposes an algorithm for the computation of robust priority orders that solves the stated problem of extending existing message sets. First, bounds for the priorities of new messages are determined and then the most robust priority order that keeps the IDs of the existing messages is computed. The obtained algorithms are proved to yield correct results and are illustrated by detailed scheduling examples.