Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Computing Feasible Vehicle Platooning Opportunities for Transport Assignments
KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0003-3248-0187
KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-9940-5929
KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-7309-8086
2016 (English)In: IFAC PAPERSONLINE, 2016, Vol. 49, no 3, 43-48 p.Conference paper, Published paper (Refereed)
Abstract [en]

Vehicle platooning facilitates the partial automation of vehicles and can significantly reduce fuel consumption. Mobile mummification infrastructure makes it possible to dynamically coordinate the formation of platoons en route. We consider a centralized system that provides trucks with routes and speed profiles allowing them to dynamically form platoons during their journeys. For this to work, all possible pairs of vehicles that can platoon based on their location, destination, and other constraints have to be identified. The presented approach scales well to large vehicle fleets and realistic road networks by extracting features from the transport assignments of the vehicles and rules out a majority of possible pairs based on these features only. Merely a small number of remaining pairs are considered in depth by a complete and computationally expensive algorithm. This algorithm conclusively decides if platooning is possible for a pair based on the complete data associated with the two vehicles. We derive appropriate features for the problem and demonstrate the effectiveness of the approach in a simulation example.

Place, publisher, year, edition, pages
2016. Vol. 49, no 3, 43-48 p.
Keyword [en]
Transportation, Agents, Platooning, Spatial Networks
National Category
Control Engineering
Identifiers
URN: urn:nbn:se:kth:diva-192981DOI: 10.1016/j.ifacol.2016.07.008ISI: 000381502600008Scopus ID: 2-s2.0-84991108810OAI: oai:DiVA.org:kth-192981DiVA: diva2:974459
Conference
14th IFAC Symposium on Control in Transportation Systems (CTS), MAY 18-20, 2016, Istanbul, TURKEY
Note

QC 20160926

Available from: 2016-09-26 Created: 2016-09-23 Last updated: 2016-09-26Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
van de Hoef, SebastianJohansson, Karl H.Dimarogonas, Dimos V.
By organisation
Automatic ControlACCESS Linnaeus Centre
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 21 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf