Literature Database Entry

bock2023design

Arno Bock, "Design and Comparative Analysis of a Continuously-Reassigning Platoon Formation Algorithm," Bachelor Thesis, School of Electrical Engineering and Computer Science (EECS), TU Berlin (TUB), December 2023. (Advisor: Julian Heinovski; Referees: Falko Dressler and Thomas Sikora)

Abstract

A large amount of existing distributed platoon formation strategies focuses on a single platoon assignment decision. In low-density traffic the finality of a single assignment decision imposes a potential great disadvantage as the amount of available platooning candidates is restricted to a few. Algorithms which do consider this limitation and explicitly allow platoon reassignments could subsequently result in a more optimal platoon formation for all individuals. These Continuously-Reassigning strategies are however rare and as a result not well studied. We propose such an reassigning algorithm, which targets potential disadvantages of frequent reassignings and tries to minimize their impact, and conduct a study investigating differences for both assignment frequencies. In a comparative analysis we could observe dif- ferent implications for both assignment frequencies, with Continuously-Reassigning algorithm achieving far superior results in regards to the optimization objective, but Single-Assignment strategies resulted in a overall more fluent traffic flow. Our results indicate that potential downsides of reassigning algorithms need to be considered during the design process to facilitate both more optimal assignments and sufficient traffic flow.

Quick access

BibTeX BibTeX

Contact

Arno Bock

BibTeX reference

@phdthesis{bock2023design,
    author = {Bock, Arno},
    title = {{Design and Comparative Analysis of a Continuously-Reassigning Platoon Formation Algorithm}},
    advisor = {Heinovski, Julian},
    institution = {School of Electrical Engineering and Computer Science (EECS)},
    location = {Berlin, Germany},
    month = {12},
    referee = {Dressler, Falko and Sikora, Thomas},
    school = {TU Berlin (TUB)},
    type = {Bachelor Thesis},
    year = {2023},
   }
   
   

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-04-29