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...
Uloženo v:
| Vydáno v: | arXiv.org |
|---|---|
| Hlavní autoři: | , |
| Médium: | Paper |
| Jazyk: | angličtina |
| Vydáno: |
Ithaca
Cornell University Library, arXiv.org
24.10.2024
|
| Témata: | |
| ISSN: | 2331-8422 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| 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 ProQuest Materials Science & Engineering ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Essentials ProQuest Central Technology collection ProQuest One Community College ProQuest Central SciTech Premium Collection ProQuest Engineering Collection ProQuest Engineering Database (NC LIVE) ProQuest Central Premium ProQuest One Academic (New) ProQuest Publicly Available Content 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: ProQuest Publicly Available Content 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 | M7S |
| 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.8868171 |
| 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/eLvHCXMwpV3PS8MwFA66KXjyN_6YIwev2WrTNdlpoNtQ0FF0jnkaafKqBVlnO4f41_uSdXoQvHgphEIIecn3vrx8eY-Qc6PjUHgiYejrWyzgImBKJQkDGYdwoZChOjXh6FYMBnI8bkdlwK0oZZUrTHRAbTJtY-RNZPaShxJBtzN7Y7ZqlL1dLUtorJOqzZJw4aR7D98xFj8UyJj58jLTpe5qqvwjXTQsqWkguZDeLwh2fqW__d8R7ZBqpGaQ75I1mO6RTafn1MU-eUSQzYHOM9oFnRro0DKMm36CoYuiQbs2Y64tdoXtEbzY5UPRVumzkwdQ5LI0esUTeTal_dUDxwMy7PeGV9esrKDAFLplhtSg7YORKlah_UotEqlDboDLUKlW3EZraBDIEpKg5cXSSEgSxfXynKX5IalMsykcEWqwA09xabzYt49b0cJSBdiZQGurgB-T2mqSJuUuKCY_M3Ty9-9TsuUjWbA-wQ9qpDLP3-GMbOjFPC3yOqle9gbRfd0ZF1vRzV309AW9QrCl |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT8JAEJ4gaPTkOz5Q96DHQu2WdnswHEQCAQmJSLg1292tNjEUW8THf_I_OluoHky8cfDStGkyaXdm5_t2dmYH4FyKwHFNNzQQ62uGTV3b4DwMDcUCR11yZKhZNuGw6_Z6bDTy-gX4zGthdFpl7hMzRy1joWPkVWT2jDoMnW598mzorlF6dzVvoTE3i456f8UlW3rVbqB-LyyreTO4bhmLrgIGR6gyEC49S0nGA-7oKxNuyIRDpaLM4bwWePiFQrmInKFdMwMmmQpDTsV87SEoil2BEt5aXpYpePcd0rEcFwk6ne-dZieFVXnyFs0qmkNVkMsw85fHz2CsufnPBmALSn0-Uck2FNR4B9aybFWR7sI9QkiiyDQmDSUiqepkEaSOPpQks7RCGvo8YN3KC5-H6lFPDoKWGD1kyQ8EmTrpP_FpHI9JMy_f3IPBMn5kH4rjeKwOgEgUYHLKpBlYunQX7ZdxG4W5aMvcpodQznXiL-Z46v8o5Ojv12ew3hrcdv1uu9c5hg0LaZFGP8suQ3GavKgTWBWzaZQmp5k9EfCXrL4vw4cK-w |
| 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 |