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

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

11

SUSTAINABLE CITIES AND COMMUNITIES
SUSTAINABLE CITIES AND COMMUNITIES Logo

2

Research Products

3

GOOD HEALTH AND WELL-BEING
GOOD HEALTH AND WELL-BEING Logo

2

Research Products

9

INDUSTRY, INNOVATION AND INFRASTRUCTURE
INDUSTRY, INNOVATION AND INFRASTRUCTURE Logo

7

Research Products

6

CLEAN WATER AND SANITATION
CLEAN WATER AND SANITATION Logo

0

Research Products

14

LIFE BELOW WATER
LIFE BELOW WATER Logo

0

Research Products

12

RESPONSIBLE CONSUMPTION AND PRODUCTION
RESPONSIBLE CONSUMPTION AND PRODUCTION Logo

0

Research Products

8

DECENT WORK AND ECONOMIC GROWTH
DECENT WORK AND ECONOMIC GROWTH Logo

0

Research Products

1

NO POVERTY
NO POVERTY Logo

0

Research Products

4

QUALITY EDUCATION
QUALITY EDUCATION Logo

0

Research Products

5

GENDER EQUALITY
GENDER EQUALITY Logo

0

Research Products

10

REDUCED INEQUALITIES
REDUCED INEQUALITIES Logo

0

Research Products

16

PEACE, JUSTICE AND STRONG INSTITUTIONS
PEACE, JUSTICE AND STRONG INSTITUTIONS Logo

0

Research Products

15

LIFE ON LAND
LIFE ON LAND Logo

0

Research Products

7

AFFORDABLE AND CLEAN ENERGY
AFFORDABLE AND CLEAN ENERGY Logo

0

Research Products

13

CLIMATE ACTION
CLIMATE ACTION Logo

0

Research Products

17

PARTNERSHIPS FOR THE GOALS
PARTNERSHIPS FOR THE GOALS Logo

0

Research Products

2

ZERO HUNGER
ZERO HUNGER Logo

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

WoS h-index

12

Scopus h-index

14

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
    Conference Object
    Hierarchical Multitasking Control of Discrete Event Systems: Computation of Projections and Maximal Permissiveness
    (IFAC Secretariat, 2010) Cury, J.E.R.; Schmidt, K.; De Queiroz, M.H.
    This paper extends previous results on the hierarchical and decentralized control of multitasking discrete event systems (MTDES). Colored observers, a generalization of the observer property, together with local control consistency, allow to derive sufficient conditions for synthesizing modular and hierarchical control that are both strongly nonblocking (SNB) and maximally permissive. A polynomial procedure to verify if a projection fulfills the above properties is proposed and in the case they fail for a given projection an algorithm is proposed to find an extension of the set of events to be projected, in order to fulfill the sufficient conditions for SNB and maximally permissive hierarchical control.
  • Thumbnail Image
    Article
    Citation - WoS: 17
    Citation - Scopus: 23
    Voronoi Boundary Visibility for Efficient Path Planning
    (Ieee-inst Electrical Electronics Engineers inc, 2020) Al-Dahhan, Mohammed Rabeea Hashim; Schmidt, Klaus Werner
    The subject of this paper is the computation of paths for mobile robots that navigate from a start position to a goal position in environments with static obstacles. Specifically, we focus on paths that are represented by straight lines. Such paths can for example directly be followed by omni-directional robots or can be used as an initial solution for path smoothing. In this context, the most common performance metrics are the path length, the obstacle clearance and the computation time. In this paper, we develop a new path planning algorithm that addresses all the stated performance metrics. Our method first determines all possible connections between the start position and goal position along the edges of the generalized Voronoi diagram (GVD) of a given obstacle map. The shortest connections are then refined using a balanced method for creating shortcuts along existing waypoints and introducing new waypoints in order to cut corners. As an important feature, our method reduces the number of required waypoints by iteratively adding new waypoints and then removing unnecessary waypoints along solution paths. Moreover, our method takes into account multiple start-goal connections, since the shortest start-goal connection along the edges of the GVD might not lead to the shortest solution path. A comprehensive computational evaluation for a large number of maps with different properties shows that the proposed method outperforms sampling-based algorithms such as Probabilistic Roadmaps (PRM) and exact methods such as Visibility Graphs (VG) by computing close-to-optimal solution paths with a specified minimum obstacle clearance in less time.
  • 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: 1
    Fuzzy Hybrid Systems Modeling With Application in Decision Making and Control
    (2012) Boutalis, Y.; Moor, T.; Schmidt, K.
    Hybrid Systems are systems containing both discrete event and continuous variable components. Many recent contributions address crisp situations, where ambiguity or subjectivity in the measured data is absent. In this paper, we propose Fuzzy Hybrid Systems to account for inaccurate measurements and uncertain dynamics. We present a strategy to determine the most appropriate control actions in a sampled data setting. The proposed approach is based on three basic steps that are performed in each sampling period. First, the current discrete fuzzy state of the system is determined by a sensor evaluation. Next, the future discrete fuzzy state is predicted for the possible control actions and the best action, in respect to desired continuous states, is selected. Finally, the decision is cross-evaluated by a limited horizon prediction of the continuous system variables. The proposed method is explained and demonstrated for a variation of the a well-known two-tank scenario. © 2012 IEEE.
  • 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
    Article
    Lane Change Scheduling for Autonomous Vehicles
    (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.
  • Thumbnail Image
    Book Part
    A fast and optimal static segment scheduling method for FlexRay v3.0
    (IEEE, 2017) Çakmak, Cumhur; Schmidt, Ece Güran; Schmidt, Klaus Werner
    We propose a novel and fast frame scheduling method for the Static Segment (SS) of the new in-vehicle network standard FlexRay v3.0 in this paper. The proposed methods assigns frames to the SS using the minimum number of time slots based on an Integer Linear Programming formulation. Different. from the existing method in the literature, the proposed method computes optimal frame schedules within miliseconds.
  • Thumbnail Image
    Article
    Optimal Message Scheduling for the Static Segment of Flexray
    (IEEE, 2010) Schmidt, Klaus Werner; Schmidt, Ece G.
    In this paper, we study the scheduling of periodic messages in the static segment of the FlexRay protocol. Our approach is based on two performance metrics. Similar to previous work, we seek to allocate a minimum number of frame IDs (FIDs) in the static segment. In addition, different from existing work, we want to minimize the message jitter, i.e., the deviation of the message transmission from the required periodicity. To this end, we first derive analytical expressions that quantify the FID allocation and the jitter, and then formulate a linear integer programming problem whose solution is the desired message schedule. An example illustrates our schedule optimization.
  • Thumbnail Image
    Conference Object
    Citation - WoS: 1
    Citation - Scopus: 1
    A Fast and Optimal Static Segment Scheduling Method for Flexray V3.0
    (Institute of Electrical and Electronics Engineers Inc., 2017) Cakmak, C.; Schmidt, E.G.; Schmidt, K.W.
    We propose a novel and fast frame scheduling method for the Static Segment (SS) of the new in-vehicle network standard FlexRay v3.0 in this paper. The proposed methods assigns frames to the SS using the minimum number of time slots based on an Integer Linear Programming formulation. Different from the existing method in the literature, the proposed method computes optimal frame schedules within miliseconds. © 2017 IEEE.