Schmıdt, Klaus Werner

Profile Picture
Profile URL
https://hdl.handle.net/20.500.12416/9294
Name Variants
Schmidt, Klaus W.
Schmidt, Klaus
Schmidt, Klaus Werner
Schmidt, K.W.
Schmidt, K.
Schmidt, Klaus Werner
Schmidt, Klaus Werner
Schmidt, Klaus Werner
Job Title
Doç. Dr.
Email Address
Main Affiliation
06.08. Mekatronik Mühendisliği
06. Mühendislik Fakültesi
01. Çankaya Üniversitesi
06.08. Mekatronik Mühendisliği
Mekatronik Mühendisliği
06. Mühendislik Fakültesi
01. Çankaya Üniversitesi
Status
Former Staff
Website
ORCID ID
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID

Sustainable Development Goals

NO POVERTY1
NO POVERTY
0
Research Products
ZERO HUNGER2
ZERO HUNGER
0
Research Products
GOOD HEALTH AND WELL-BEING3
GOOD HEALTH AND WELL-BEING
2
Research Products
QUALITY EDUCATION4
QUALITY EDUCATION
0
Research Products
GENDER EQUALITY5
GENDER EQUALITY
0
Research Products
CLEAN WATER AND SANITATION6
CLEAN WATER AND SANITATION
0
Research Products
AFFORDABLE AND CLEAN ENERGY7
AFFORDABLE AND CLEAN ENERGY
0
Research Products
DECENT WORK AND ECONOMIC GROWTH8
DECENT WORK AND ECONOMIC GROWTH
0
Research Products
INDUSTRY, INNOVATION AND INFRASTRUCTURE9
INDUSTRY, INNOVATION AND INFRASTRUCTURE
7
Research Products
REDUCED INEQUALITIES10
REDUCED INEQUALITIES
0
Research Products
SUSTAINABLE CITIES AND COMMUNITIES11
SUSTAINABLE CITIES AND COMMUNITIES
2
Research Products
RESPONSIBLE CONSUMPTION AND PRODUCTION12
RESPONSIBLE CONSUMPTION AND PRODUCTION
0
Research Products
CLIMATE ACTION13
CLIMATE ACTION
0
Research Products
LIFE BELOW WATER14
LIFE BELOW WATER
0
Research Products
LIFE ON LAND15
LIFE ON LAND
0
Research Products
PEACE, JUSTICE AND STRONG INSTITUTIONS16
PEACE, JUSTICE AND STRONG INSTITUTIONS
0
Research Products
PARTNERSHIPS FOR THE GOALS17
PARTNERSHIPS FOR THE GOALS
0
Research Products
This researcher does not have a Scopus ID.
This researcher does not have a WoS ID.
Scholarly Output

73

Articles

27

Views / Downloads

7882/711

Supervised MSc Theses

0

Supervised PhD Theses

0

WoS Citation Count

407

Scopus Citation Count

626

Patents

0

Projects

0

WoS Citations per Publication

5.58

Scopus Citations per Publication

8.58

Open Access Source

17

Supervised Theses

0

JournalCount
IFAC Proceedings Volumes (IFAC-PapersOnline)5
2017 25th Signal Processing And Communications Applications Conference (SIU)4
IEEE Transactions on Automatic Control3
2017 25th Signal Processing and Communications Applications Conference, SIU 2017 -- 25th Signal Processing and Communications Applications Conference, SIU 2017 -- 15 May 2017 through 18 May 2017 -- Antalya -- 1287033
2012 20th Signal Processing and Communications Applications Conference, SIU 2012, Proceedings -- 2012 20th Signal Processing and Communications Applications Conference, SIU 2012 -- 18 April 2012 through 20 April 2012 -- Fethiye, Mugla -- 907863
Current Page: 1 / 10

Scopus Quartile Distribution

Competency Cloud

GCRIS Competency Cloud

Filters

2010 - 2019682020 - 20235
Reset filters

Settings

Scholarly Output Search Results

Now showing 1 - 10 of 73
  • Thumbnail Image
    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.
  • Thumbnail Image
    Article
    Citation - WoS: 12
    Citation - Scopus: 17
    Abstraction-Based Verification of Codiagnosability for Discrete Event Systems
    (Pergamon-elsevier Science Ltd, 2010) Schmidt, K.
    In this paper, we investigate the verification of codiagnosability for discrete event systems (DES). That is, it is desired to ascertain if the occurrence of system faults can be detected based on the information of multiple local sites that partially observe the overall DES. As an improvement of existing codiagnosability tests that resort to the original DES with a potentially computationally infeasible state space, we propose a method that employs an abstracted system model on a smaller state space for the codiagnosability verification. Furthermore, we show that this abstraction can be computed without explicitly evaluating the state space of the original model in the practical case where the DES is composed of multiple subsystems. (c) 2010 Elsevier Ltd. All rights reserved.
  • Thumbnail Image
    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.
  • 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.
  • Thumbnail Image
    Article
    Citation - WoS: 2
    Citation - Scopus: 6
    Controller Area Network With Priority Queues and Fifo Queues: Improved Schedulability Analysis and Message Set Extension
    (inderscience Enterprises Ltd, 2016) Schmidt, Klaus Werner; Alkan, Burak; Schmidt, Ece Guran; Karani, Duygu Culum; Karakaya, Utku
    Controller area network (CAN) enables communication of electronic control units (ECUs) via messages using priority-based arbitration, which requires the implementation of priority queues (PQs) in the ECU device driver. Nevertheless, it is possible that not all ECUs on a CAN support PQs but use FIFO queues (FQs) instead. In this case, the classical CAN scheduling model with PQs is not suitable for the computation of message worst-case responsetimes (WCRTs) that are essential for verifying the correct vehicle operation. This paper considers an existing scheduling model for CAN with both PQs and FQs. First, an improved algorithm for speeding up the WCRT computation is proposed. Second, the practical case where an existing CAN message set is extended by new messages is addressed. An original algorithm for assigning priorities to new messages while keeping the priority order of existing messages is developed. Both algorithms are evaluated by computational experiments.
  • Thumbnail Image
    Conference Object
    Citation - WoS: 35
    Citation - Scopus: 42
    Lane Change Scheduling for Autonomous Vehicles
    (Elsevier Science Bv, 2016) Atagoziyev, Maksat; Schmidt, Klaus W.; Schmidt, Ece G.
    The subject of this paper is the coordination of lane changes of autonomous vehicles on a two-lane road segment before reaching a given critical position. We first develop an algorithm that performs a lane change of a single vehicle in the shortest possible time. This algorithm is then applied iteratively in order to handle all lane changes required on the considered road segment while guaranteeing traffic safety. Various example scenarios illustrate the functionality of our algorithm. (C) 2016, IFAC (International Federation of Antomatic Control) Hosting by Elsevier Ltd. All rights reserved.
  • Thumbnail Image
    Article
    Outputs Bounds for Linear Systems with Repeated Input Signals: Existence, Computation and Application to Vehicle Platooning
    (Tubitak Scientific & Technological Research Council Turkey, 2018) Schmidt, Klaus Werner; Saglam, Harun Bugra
    This paper investigates the effect of repeated time-limited input signals on the output excursion of stable, linear time-invariant systems. It is first shown that the maximum norm of the output signal remains bounded if the repeated input signals are separated by a nonzero dwell time. Then a novel method for computing a tight bound on the output signal norm is proposed. The setting of the paper is motivated by a vehicle platooning application, where vehicles repeatedly open/close gaps in order to perform lane changes. The developed method analyzes driving safety by computing a bound on the spacing error between vehicles when performing repeated open/close gap maneuvers.
  • Thumbnail Image
    Conference Object
    The Implementation of Dynamic Distributed Real Time Industrial Communication Protocol (D 2rip)
    (2012) Gözcü, A.K.; Turan, U.; Schmidt, E.G.; Schmidt, K.W.
    Ethernet is a popular technology for industrial networking thanks to its low cost and high bandwidth. The current proposals to achieve real-time communication over Ethernet do not consider the determinism of the control applications resulting in inefficient use of bandwidth resources. We proposed a protocol stack architecture that works with standard Ethernet to address this problem. This paper describes the implementation of this architecture over Real-time Linux operating system and the first experiments to verify the operation. The implementation and performance of IEEE 1588 protocol which provides the required synchronization is also presented. © 2012 IEEE.
  • Thumbnail Image
    Conference Object
    Citation - WoS: 2
    Citation - Scopus: 4
    Offset Assignment on Controller Area Network: Improved Algorithms and Computational Evaluation
    (Ieee, 2017) Batur, Ahmet; Schmidt, Klaus Werner; Schmidt, Ece Guran
    The basic requirement for the design of the Controller Area Network (CAN) for in-vehicle communication is to guarantee that the worst-case response time (WCRT) of each message is smaller than their specified deadline. In addition, it is desired to achieve small WCRTs that leave sufficient slack to the message deadline. In order to address the specified objectives, the idea of offset scheduling has been introduced. In this setting, messages on CAN are released with offsets in order to avoid message bursts that lead to undesirably large response times. In order to use offset scheduling efficiently, it is required to assign a suitable offset to each message. To this end, a load distribution (LD) algorithm is proposed in the existing literature. The main contribution of this paper is the development of new algorithms for offset assignment on CAN. Evaluating different example scenarios, the paper shows that the proposed algorithms outperform the existing LD algorithm in most of the cases.
  • Thumbnail Image
    Conference Object
    Computation of Reduced Diagnosers for the Fault Diagnosis of Discrete Event Systems
    (2014) Kart, Bora Eser; Schmidt, Klaus
    Many complex systems in different areas such as manufacturing, telecommunications or transportation can be modeled as discrete event systems (DES). In this paper, we consider the fault diagnosis for DES which is concerned with detecting fault occurrences in a DES within a bounded number of event occurrences by a diagnoser automaton. Hereby, such diagnoser is able to observe a subset of the system events and the maximum required number of event occurrences until a fault detection is denoted as the worst case detection delay (WCDD). The main contribution of the paper is an approach for reducing the number of required observations for fault diagnosis without increasing the WCDD. As a result, it is possible to determine a diagnoser with a small size which is essential in practical applications. We first develop an algorithm for computing the WCDD and then adapt an approach for the reduction of the observable event set in order to obtain a reduced diagnoser. The application of our method to a communication system example demonstrates its practicability.