Literature Database Entry

heinovski2018platoon

Julian Heinovski and Falko Dressler, "Platoon Formation: Optimized Car to Platoon Assignment Strategies and Protocols," Proceedings of 10th IEEE Vehicular Networking Conference (VNC 2018), Taipei, Taiwan, December 2018.

Abstract

We study the problem of platoon formation, trying to optimize traveling time and fuel consumption based on car-to-platoon assignments. The general concept of platooning, i.e., cars traveling in form of a road train with minimized safety gaps, has been studied in depth and we see first field trials on the road. Currently, most research focuses on improved reliability of the necessary communication protocols to achieve perfect string stability with guaranteed safety measures. One aspect, however, remained quite unexplored: the problem of assigning cars to platoons. Based on the capabilities of individual cars (e.g., max. acceleration or speed) and preferences of the driver (e.g., min/max. traveling speed, preference on travel time vs. fuel consumption), the assignment decision will be different. We formulate an optimization problem and develop a set of protocols (centralized and distributed) to support platoon formation. In an extensive series of simulation experiments, we show that our protocols not just help forming platoons, but also take care of the individual requirements of cars and drivers.

Quick access

Original Version DOI (at publishers web site)
Authors' Version PDF (PDF on this web site)
BibTeX BibTeX

Contact

Julian Heinovski
Falko Dressler

BibTeX reference

@inproceedings{heinovski2018platoon,
    author = {Heinovski, Julian and Dressler, Falko},
    doi = {10.1109/VNC.2018.8628396},
    title = {{Platoon Formation: Optimized Car to Platoon Assignment Strategies and Protocols}},
    publisher = {IEEE},
    issn = {2157-9865},
    isbn = {978-1-5386-9428-2},
    address = {Taipei, Taiwan},
    booktitle = {10th IEEE Vehicular Networking Conference (VNC 2018)},
    month = {12},
    year = {2018},
   }
   
   

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: 2025-05-22