A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Efficient Dynamic Programming Solution to a Platoon Coordination Merge Problem With Stochastic Travel Times
[article]
2017
arXiv
pre-print
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
arXiv:1705.04222v1
fatcat:u5svjew6wzbmnjkgio2uz5soci