Literature Database Entry

schlegel2022design


Timo Schlegel, "Design of a V2V-based Cooperative Re-Ordering Maneuver for Platoons on Freeways," Bachelor Thesis, School of Electrical Engineering and Computer Science (EECS), TU Berlin (TUB), February 2022. (Advisor: Julian Heinovski; Referees: Falko Dressler and Thomas Sikora)


Abstract

Driving in a platoon can have a positive impact on the comfort and safety of auto-mobility. In order to get the most benefits, the ordering of the platooning cars has to be considered. When cars are not in an optimal ordering, the cars have to re-order. This thesis shows the design of an algorithm which performs a synchronized re-ordering maneuver that can work on a conventional highway, which is also used by other vehicles. It includes the planning of the maneuver succession and finally the execution. The platooning vehicles communicate via Vehicle-to-Vehicle Communication (V2V) to coordinate their movements. After modelling the algorithm in form of a Finite State Machine (FSM), I implemented it in a traffic simulation software to examine its feasibility. The algorithm was tested and in real-world simulations including unreliable communication interfering traffic. Among other things, it outperformed a simpler algorithm regarding the time spent on the overtaking lane. It emerged, that the proposed algorithm is especially suitable for platoons with at least 5 cars in it.

Quick access

BibTeX BibTeX

Contact

Timo Schlegel

BibTeX reference

@phdthesis{schlegel2022design,
    author = {Schlegel, Timo},
    title = {{Design of a V2V-based Cooperative Re-Ordering Maneuver for Platoons on Freeways}},
    advisor = {Heinovski, Julian},
    institution = {School of Electrical Engineering and Computer Science (EECS)},
    location = {Berlin, Germany},
    month = {2},
    referee = {Dressler, Falko and Sikora, Thomas},
    school = {TU Berlin (TUB)},
    type = {Bachelor Thesis},
    year = {2022},
   }
   
   

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.

This page was automatically generated using BibDB and bib2web.

Last modified: 2024-11-12