SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(van Hoef V) ;pers:(Johansson Karl Henrik)"

Sökning: WFRF:(van Hoef V) > Johansson Karl Henrik

  • Resultat 1-4 av 4
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • van de Hoef, Sebastian, et al. (författare)
  • Coordinating Truck Platooning by Clustering Pairwise Fuel-Optimal Plans
  • 2015
  • Ingår i: IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC. - : IEEE conference proceedings. - 9781467365956 - 9781467365956 - 9781467365956 - 9781467365956 ; , s. 408-415
  • Konferensbidrag (refereegranskat)abstract
    • We consider the fuel-optimal coordination of trucks into platoons. Truck platooning is a promising technology that enables trucks to save significant amounts of fuel by driving close together and thus reducing air drag. We study how fuel-optimal speed profiles for platooning can be computed. A first-order fuel model is considered and pairwise optimal plans are derived. We formulate an optimization problem that combines these pairwise plans into an overall plan for a large number of trucks. The problem resembles a medoids clustering problem. We propose an approximation algorithm similar to the partitioning around medoids algorithm and discuss its convergence. The method is evaluated with Monte Carlo simulations. We demonstrate that the proposed algorithm can compute a plan for thousands of trucks and that significant fuel savings can be achieved.
  •  
2.
  • van de Hoef, Sebastian, et al. (författare)
  • Efficient Dynamic Programming Solution to a Platoon Coordination Merge Problem With Stochastic Travel Times
  • 2017
  • Ingår i: IFAC-PapersOnLine. - : Elsevier. - 2405-8963. ; 50:1, s. 4228-4233
  • Tidskriftsartikel (refereegranskat)abstract
    • 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.
  •  
3.
  • van de Hoef, Sebastian, et al. (författare)
  • Fuel-Efficient En Route Formation of Truck Platoons
  • 2018
  • Ingår i: IEEE transactions on intelligent transportation systems (Print). - : Institute of Electrical and Electronics Engineers (IEEE). - 1524-9050 .- 1558-0016. ; 19:1, s. 102-112
  • Tidskriftsartikel (refereegranskat)abstract
    • The problem of how to coordinate a large fleet of trucks with a given itinerary to enable fuel-efficient platooning is considered. Platooning is a promising technology that enables trucks to save significant amounts of fuel by driving close together and thus reducing air drag. A setting is considered in which each truck in a fleet is provided with a start location, a destination, a departure time, and an arrival deadline from a higher planning level. Fuel-efficient plans should be computed. The plans consist of routes and speed profiles that allow trucks to arrive by their arrival deadlines. Hereby, trucks can meet on common parts of their routes and form platoons, resulting in decreased fuel consumption. We formulate a combinatorial optimization problem that combines plans involving only two vehicles. We show that this problem is difficult to solve for large problem instances. Hence, a heuristic algorithm is proposed. The resulting plans are further optimized using convex optimization techniques. The method is evaluated with Monte Carlo simulations in a realistic setting. We demonstrate that the proposed algorithm can compute plans for thousands of trucks and that significant fuel savings can be achieved.
  •  
4.
  • van de Hoef, Sebastian, et al. (författare)
  • Fuel-optimal centralized coordination of truck platooning based on shortest paths
  • 2015
  • Ingår i: Proceedings of the American Control Conference. - : IEEE. - 9781479986842 ; , s. 3740-3745
  • Konferensbidrag (refereegranskat)abstract
    • Platooning is a way to significantly reduce fuel consumption of trucks. Vehicles that drive at close inter-vehicle distance assisted by automatic controllers experience substantially lower air-drag. In this paper, we deal with the problem of coordinating the formation and the breakup of platoons in a fuel-optimal way. We formulate an optimization problem which accounts for routing, speed-dependent fuel consumption, and platooning decisions. An algorithm to obtain an approximate solution to the problem is presented. It first determines the shortest path for each truck. Then, possible platoon configurations are identified. For a certain platoon configuration the optimal speed profile is the solution to a convex program. The algorithm is illustrated by a realistic example.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-4 av 4
Typ av publikation
tidskriftsartikel (2)
konferensbidrag (2)
Typ av innehåll
refereegranskat (4)
Författare/redaktör
Dimarogonas, Dimos V ... (4)
van de Hoef, Sebasti ... (4)
Johansson, Karl Henr ... (1)
Lärosäte
Kungliga Tekniska Högskolan (4)
Språk
Engelska (4)
Forskningsämne (UKÄ/SCB)
Teknik (4)

År

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy