Where to Decide? Centralized vs. Distributed Vehicle Assignment for Platoon Formation

Platooning is a promising cooperative driving application for future intelligent transportation systems. In order to assign vehicles to platoons, some algorithm for platoon formation is required. Such vehicle-to-platoon assignments have to be computed on-demand, e.g., when vehicles join or leave the...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org
Main Authors: Heinovski, Julian, Dressler, Falko
Format: Paper
Language:English
Published: Ithaca Cornell University Library, arXiv.org 24.10.2024
Subjects:
Algorithms
Computation
Driving
Integer programming
Intelligent transportation systems
Mixed integer
Operations research
Optimization
Platooning
Similarity
Solvers
Synchronism
Traffic speed
Vehicles
ISSN:2331-8422
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Platooning is a promising cooperative driving application for future intelligent transportation systems. In order to assign vehicles to platoons, some algorithm for platoon formation is required. Such vehicle-to-platoon assignments have to be computed on-demand, e.g., when vehicles join or leave the freeways. In order to get best results from platooning, individual properties of involved vehicles have to be considered during the assignment computation. In this paper, we explore the computation of vehicle-to-platoon assignments as an optimization problem based on similarity between vehicles. We define the similarity and, vice versa, the deviation among vehicles based on the desired driving speed of vehicles and their position on the road. We create three approaches to solve this assignment problem: centralized solver, centralized greedy, and distributed greedy, using a Mixed Integer Programming (MIP) solver and greedy heuristics, respectively. Conceptually, the approaches differ in both knowledge about vehicles as well as methodology. We perform a large-scale simulation study using PlaFoSim to compare all approaches. While the distributed greedy approach seems to have disadvantages due to the limited local knowledge, it performs as good as the centralized solver approach across most metrics. Both outperform the centralized greedy approach, which suffers from synchronization and greedy selection effects. The centralized solver approach however assumes global knowledge and requires a complex MIP solver to compute vehicle-to-platoon assignments. Overall, the distributed greedy approach achieves close to optimal results but requires the least assumptions and complexity. Therefore, we consider the distributed greedy approach the best approach among all presented approaches.
AbstractList Platooning is a promising cooperative driving application for future intelligent transportation systems. In order to assign vehicles to platoons, some algorithm for platoon formation is required. Such vehicle-to-platoon assignments have to be computed on-demand, e.g., when vehicles join or leave the freeways. In order to get best results from platooning, individual properties of involved vehicles have to be considered during the assignment computation. In this paper, we explore the computation of vehicle-to-platoon assignments as an optimization problem based on similarity between vehicles. We define the similarity and, vice versa, the deviation among vehicles based on the desired driving speed of vehicles and their position on the road. We create three approaches to solve this assignment problem: centralized solver, centralized greedy, and distributed greedy, using a Mixed Integer Programming (MIP) solver and greedy heuristics, respectively. Conceptually, the approaches differ in both knowledge about vehicles as well as methodology. We perform a large-scale simulation study using PlaFoSim to compare all approaches. While the distributed greedy approach seems to have disadvantages due to the limited local knowledge, it performs as good as the centralized solver approach across most metrics. Both outperform the centralized greedy approach, which suffers from synchronization and greedy selection effects. The centralized solver approach however assumes global knowledge and requires a complex MIP solver to compute vehicle-to-platoon assignments. Overall, the distributed greedy approach achieves close to optimal results but requires the least assumptions and complexity. Therefore, we consider the distributed greedy approach the best approach among all presented approaches.
Author Heinovski, Julian
Dressler, Falko
Author_xml – sequence: 1
  givenname: Julian
  surname: Heinovski
  fullname: Heinovski, Julian
– sequence: 2
  givenname: Falko
  surname: Dressler
  fullname: Dressler, Falko
BookMark eNotjU1LAzEYhIMoWGt_gLeA56352GzenqS0VoWCHqoeSzb7rk3ZJppki_jrXdHLDPMwzFyQUx88EnLF2bQEpdiNiV_uOBVyAGymgJ2QkZCSF1AKcU4mKe0ZY6LSQik5Ii9vO4xIc6BLtK7BW7pAn6Pp3Dc29JimdOlSjq7u85Bfcedsh3Seknv3h6FJ2xDpc2dyCJ6uQjyY7IK_JGet6RJO_n1MNqu7zeKhWD_dPy7m68IowQuu1UxgA6Y21a-C1S3YSjYooTJG1TNutEWtQbSlYjU0gG1rpJWMlyW3ckyu_2Y_YvjsMeXtPvTRD49bARpkBbLk8gfDWFSP
ContentType Paper
Copyright 2024. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: 2024. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID 8FE
8FG
ABJCF
ABUWG
AFKRA
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
HCIFZ
L6V
M7S
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
DOI 10.48550/arxiv.2310.09580
DatabaseName ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Collection
ProQuest Central (Alumni Edition)
ProQuest Central UK/Ireland
ProQuest Central Essentials
ProQuest Central
Technology Collection
ProQuest One Community College
ProQuest Central Korea
SciTech Premium Collection
ProQuest Engineering Collection
Engineering Database
ProQuest One Academic
ProQuest One Academic (New)
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
DatabaseTitle Publicly Available Content Database
Engineering Database
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Central Essentials
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest One Academic UKI Edition
ProQuest Central Korea
Materials Science & Engineering Collection
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
Engineering Collection
DatabaseTitleList Publicly Available Content Database
Database_xml – sequence: 1
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Physics
EISSN 2331-8422
Genre Working Paper/Pre-Print
GroupedDBID 8FE
8FG
ABJCF
ABUWG
AFKRA
ALMA_UNASSIGNED_HOLDINGS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
FRJ
HCIFZ
L6V
M7S
M~E
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
ID FETCH-LOGICAL-a521-17592ed8aba6d8ab8c7f8c63de386aa5b91a7ce7782f450b8d8effa3c301441c3
IEDL.DBID BENPR
IngestDate Mon Jun 30 09:24:56 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a521-17592ed8aba6d8ab8c7f8c63de386aa5b91a7ce7782f450b8d8effa3c301441c3
Notes SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
content type line 50
OpenAccessLink https://www.proquest.com/docview/2878368341?pq-origsite=%requestingapplication%
PQID 2878368341
PQPubID 2050157
ParticipantIDs proquest_journals_2878368341
PublicationCentury 2000
PublicationDate 20241024
PublicationDateYYYYMMDD 2024-10-24
PublicationDate_xml – month: 10
  year: 2024
  text: 20241024
  day: 24
PublicationDecade 2020
PublicationPlace Ithaca
PublicationPlace_xml – name: Ithaca
PublicationTitle arXiv.org
PublicationYear 2024
Publisher Cornell University Library, arXiv.org
Publisher_xml – name: Cornell University Library, arXiv.org
SSID ssj0002672553
Score 1.8869228
SecondaryResourceType preprint
Snippet Platooning is a promising cooperative driving application for future intelligent transportation systems. In order to assign vehicles to platoons, some...
SourceID proquest
SourceType Aggregation Database
SubjectTerms Algorithms
Computation
Driving
Integer programming
Intelligent transportation systems
Mixed integer
Operations research
Optimization
Platooning
Similarity
Solvers
Synchronism
Traffic speed
Vehicles
Title Where to Decide? Centralized vs. Distributed Vehicle Assignment for Platoon Formation
URI https://www.proquest.com/docview/2878368341
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpZ1LS8NAEMcXbRU8-cZHLXvwmrYmm-zmVNC2KGgJWks9lX1MNCBJTWoRP72zaaoHwYuXkCWXsJP857ezszOEnANDqBYsdEL0jQ4DtIVkAvBOSoXawFXZDGZ8y4dDMZmEURVwK6q0ypUmlkJtMm1j5G0ke-EFAkW3O3tzbNcou7tatdBYJ3VbqYzVSP2yP4zuv6MsbsCRmb3ldmZZvKst849k0bJY00K8EJ1fIlx6lsH2f99ph9QjOYN8l6xBukc2y4xOXeyTR5TZHOg8oz3QiYEurQK5yScYuihatGdr5tp2Vzgew4v9gChaK3kuEwQo0iyNXnFNnqV0sDrieEBGg_7o6tqpeig4Eh2zg3AQumCEVDKwV6F5LHTgGfBEIKWvwgvJNXDkhJj5HSWMgDiWnl6utLR3SGpplsIRoQKY4aAMgD1-64NSvs81R0ILQXUgPCaN1SRNq_-gmP7M0Mnfj0_Jlou4YL2CyxqkNs_f4Yxs6MU8KfJmZdamzcx8wFF0cxc9fQEST7GK
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT8JAEJ4oaPTkOz5Q96DHAva124PhIBIJSDigwRPZ3Q7axFBsER__yf_obKF6MPHmwUvTpkmT7Tc737ezMzsAJ-iSqBZuYAXEjZaLhIV0BdKdlIp8A1dZM5jbNu90RL8fdBfgI6-FMWmVuU_MHHUYaxMjr5CyF44vyOnWxk-W6RpldlfzFhozs2jh2wst2dLzZp3wPbXtxmXv4sqadxWwJFGVRXQZ2BgKqaRvrkLzodC-E6IjfCk9FZxJrpETcw5dr6pEKHA4lI6erT20Q59dhKJLti4KUOw2r7t3X0Ed2-ck0Z3Z7ml2VlhFJq_RtGxUVJnUjKj-8PkZkTXW_tkvWKehyzEmG7CAo01YzvJVdboFN0QiCbJJzOqooxBrbB6mjt4xZNO0zOrmRGDTzIueb_HBTA9GthjdZ-kPjLQ66z7KSRyPWCMv4NyG3l8MZAcKo3iEu8AEuiFHFSKa4mIPlfI8rjnpzwBVFYM9KOWYDOazPB18A7L_--tjWLnqXbcH7WandQCrNgkjw3-2W4LCJHnGQ1jS00mUJkdzi2Iw-GMAPwEzkAyu
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Where+to+Decide%3F+Centralized+vs.+Distributed+Vehicle+Assignment+for+Platoon+Formation&rft.jtitle=arXiv.org&rft.au=Heinovski%2C+Julian&rft.au=Dressler%2C+Falko&rft.date=2024-10-24&rft.pub=Cornell+University+Library%2C+arXiv.org&rft.eissn=2331-8422&rft_id=info:doi/10.48550%2Farxiv.2310.09580