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
Efficient Dynamic Programming Solution to a Platoon Coordination Merge Problem With Stochastic Travel Times
KTH, School of Electrical Engineering and Computer Science (EECS), 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
2017 (English)In: IFAC-PapersOnLine, ISSN 2405-8963, Vol. 50, no 1, p. 4228-4233Article in journal (Refereed) Published
Abstract [en]

The problem of maximizing the probability of two trucks being coordinated to merge into a platoon on a highway is considered. Truck platooning is a promising technology that allows heavy vehicles to save fuel by driving with small automatically controlled inter-vehicle distances. In order to leverage the full potential of platooning, platoons can be formed dynamically en route by small adjustments to their speeds. However, in heavily used parts of the road network, travel times are subject to random disturbances originating from traffic, weather and other sources. We formulate this problem as a stochastic dynamic programming problem over a finite horizon, for which solutions can be computed using a backwards recursion. By exploiting the characteristics of the problem, we derive bounds on the set of states that have to be explored at every stage, which in turn reduces the complexity of computing the solution. Simulations suggest that the approach is applicable to realistic problem instances.

Place, publisher, year, edition, pages
Elsevier, 2017. Vol. 50, no 1, p. 4228-4233
Keyword [en]
Coordination, Dynamic Programming, Platooning, Transportation, Uncertainty
National Category
Control Engineering
Identifiers
URN: urn:nbn:se:kth:diva-223066DOI: 10.1016/j.ifacol.2017.08.822Scopus ID: 2-s2.0-85031814831OAI: oai:DiVA.org:kth-223066DiVA, id: diva2:1182637
Note

QC 20180214

Available from: 2018-02-14 Created: 2018-02-14 Last updated: 2018-02-14Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

van de Hoef, SebastianJohansson, Karl HenrikDimarogonas, Dimos V.

Search in DiVA

By author/editor
van de Hoef, SebastianJohansson, Karl HenrikDimarogonas, Dimos V.
By organisation
Automatic ControlACCESS Linnaeus CentreAutomatic Control
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 219 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