Efficient Dynamic Programming Solution to a Platoon Coordination Merge Problem With Stochastic Travel Times

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 leverag...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IFAC-PapersOnLine Jg. 50; H. 1; S. 4228
Hauptverfasser: van de Hoef, Sebastian, Johansson, Karl Henrik, Dimarogonas, Dimos V.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: 01.01.2017
Schlagworte:
Coordination
Dynamic Programming
Platooning
Transportation
Uncertainty
ISSN:2405-8971, 2405-8963, 2405-8963
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:2405-8971
2405-8963
2405-8963
DOI:10.1016/j.ifacol.2017.08.822