Search Results for author:
Found 11 papers, 0 papers with code
Strategic Hub-Based Platoon Coordination under Uncertain Travel Times
We show that the platoon coordination game is a potential game when the travel times are either deterministic or stochastic, and the vehicles decide on their waiting times at the beginning of their journeys.
Multi-Fleet Platoon Matching: A Game-Theoretic Approach
At a Nash equilibrium, vehicles with the same departure time are matched to form a platoon.
Real-Time Cross-Fleet Pareto-Improving Truck Platoon Coordination
The profit of each fleet incorporates platooning rewards and costs for waiting at hubs.
Game Theoretic Models for Profit-Sharing in Multi-fleet Platoons
Profit-sharing is needed within platoons in order for competing transportation companies to collaborate in forming platoons.
Truck Platoon Formation at Hubs: An Optimal Release Time Rule
The vehicles wait at the hub, and a platoon coordinator, at each time-step, decides whether to release the vehicles from the hub in the form of a platoon or wait for more vehicles to arrive.
Event-Triggered Distributed Model Predictive Control for Platoon Coordination at Hubs in a Transport System
This paper considers the problem of hub-based platoon coordination for a large-scale transport system, where trucks have individual utility functions to optimize.
A Pricing Rule for Third-Party Platoon Coordination Service Provider
To evaluate the effect of the pricing on the platooning system, we perform a simulation over the Swedish road network.
Approximate Dynamic Programming for Platoon Coordination under Hours-of-Service Regulations
In our problem, trucks have fixed routes in a transportation network and can wait at hubs along their routes to form platoons with others while fulfilling the driving and rest time constraints.
Large-Scale Multi-Fleet Platoon Coordination: A Dynamic Programming Approach
This paper presents a distributed framework for addressing multi-fleet platoon coordination in large transportation networks, where each truck has a fixed route and aims to maximize its own fleet's platooning profit by scheduling its waiting times at hubs.
Swarm Bug Algorithms for Path Generation in Unknown Environments
For SwarmBug2, we show that the algorithm underperforms in terms of worst-case travel time compared to SwarmBug1.
Hub-Based Platoon Formation: Optimal Release Policies and Approximate Solutions
We first show that the optimal release policy in the decentralized case, where the hubs do not exchange information, is to release all trucks at the hub when the number of trucks exceeds a threshold computed by dynamic programming.
