Browsing by Author "Schmidt, Ece G."

Now showing 1 - 6 of 6

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.
Citation - WoS: 33
Citation - Scopus: 41
Lane Change Scheduling for Autonomous Vehicles
(Elsevier Science Bv, 2016) Atagoziyev, Maksat; Schmidt, Klaus W.; Schmidt, Ece G.; 271229
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.
Optimal Message Scheduling for the Static Segment of Flexray
(IEEE, 2010) Schmidt, Klaus Werner; Schmidt, Ece G.; 271229
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.
Citation - WoS: 0
Citation - Scopus: 24
Optimal Message Scheduling for the Static Segment of Flexray
(Ieee, 2010) Schmidt, Klaus; 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.
Schedulability Analysis and Message Schedule Computation for the Dynamic Segment of Flexray
(IEEE, 2010) Schmidt, Klaus Werner; Schmidt, Ece G.; 271229
In this paper, we perform the schedulability analysis and schedule computation for sporadic real-time messages in the dynamic segment of the FlexRay protocol. We first formulate a linear integer programming problem that allows to determine if a given message schedule is feasible, i.e., the worst-case delay of each message is smaller than its deadline. Then, we develop a heuristic algorithm that enables the efficient computation of feasible schedules. Our results are illustrated by an experimental setup with three FlexRay nodes.
Citation - WoS: 0
Citation - Scopus: 14
Schedulability Analysis and Message Schedule Computation for the Dynamic Segment of Flexray
(Ieee, 2010) Schmidt, Klaus; Schmidt, Ece G.
In this paper, we perform the schedulability analysis and schedule computation for sporadic real-time messages in the dynamic segment of the FlexRay protocol. We first formulate a linear integer programming problem that allows to determine if a given message schedule is feasible, i.e., the worst-case delay of each message is smaller than its deadline. Then, we develop a heuristic algorithm that enables the efficient computation of feasible schedules. Our results are illustrated by an experimental setup with three FlexRay nodes.