Physics-guided energy-efficient path selection: a summary of results

Given a spatial road network, an origin, a destination, and trajectory data of vehicles on the network, the Energy-efficient Path Selection (EPS) problem aims to find the most energy-efficient path (i.e., with least energy consumption) between the origin and the destination. With world energy consumption growing rapidly, estimating and reducing the energy consumption of road transportation is becoming critical. The main challenge of this problem is to adopt energy consumption as the cost metric of paths, which is neglected by the related work in shortest path selection problem whose typical metrics are distance and time. Additionally, negative energy consumption caused by the use of regenerative braking on electrified vehicles prevents classical algorithms like Dijkstra's algorithm from functioning correctly. We introduce a Physics-guided Energy Consumption (PEC) model based on a low-order physics model, which estimates energy consumption as a function of the vehicle parameters (e.g., mass and powertrain system efficiency) and use the estimation in the proposed adaptive dynamic programming algorithm for path selection. Our PEC model treats energy consumption as a unique metric that is determined not only by the path and vehicle's motion along the path, but also on properties of the vehicle itself. Experiments show that the PEC model estimates are more similar to real trajectory data than the estimates represented by the mean or histogram of historical data. Also, the path found by the proposed method is more energy-efficient than both the currently used path and the fastest path found by a commercial routing package. As far as we know, this is the first paper to use a physics-guided method to estimate the vehicle energy consumption and perform path selection.

[1]  Martin Leucker,et al.  Efficient Energy-Optimal Routing for Electric Vehicles , 2011, AAAI.

[2]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[3]  Gregory Gutin,et al.  Digraphs - theory, algorithms and applications , 2002 .

[4]  Greg Hamerly,et al.  Alternatives to the k-means algorithm that find better clusterings , 2002, CIKM '02.

[5]  Lionel M. Ni,et al.  Time-Dependent Trajectory Regression on Road Networks via Multi-Task Learning , 2013, AAAI.

[6]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[7]  Shashi Shekhar,et al.  A Critical-Time-Point Approach to All-Departure-Time Lagrangian Shortest Paths , 2015, IEEE Transactions on Knowledge and Data Engineering.

[8]  Yu Zheng,et al.  Travel time estimation of a path using sparse trajectories , 2014, KDD.

[9]  Masashi Sugiyama,et al.  Trajectory Regression on Road Networks , 2011, AAAI.

[10]  Yuan Gao,et al.  Shortest path problem with uncertain arc lengths , 2011, Comput. Math. Appl..

[11]  Martin Leucker,et al.  The Shortest Path Problem Revisited: Optimal Routing for Electric Vehicles , 2010, KI.

[12]  Andrés L. Medaglia,et al.  An exact method for the biobjective shortest path problem for large-scale road networks , 2015, Eur. J. Oper. Res..

[13]  Stefan Funke,et al.  Optimal Route Planning for Electric Vehicles in Large Networks , 2011, AAAI.

[14]  I. Glickstein,et al.  Route Planning , 2017, Encyclopedia of GIS.

[15]  Christian S. Jensen,et al.  Using Incomplete Information for Complete Weight Annotation of Road Networks , 2013, IEEE Transactions on Knowledge and Data Engineering.

[16]  Enhong Chen,et al.  Robust Dynamic Trajectory Regression on Road Networks: A Multi-task Learning Framework , 2014, 2014 IEEE International Conference on Data Mining.

[17]  Qingquan Li,et al.  Shortest Path Finding Problem in Stochastic Time-Dependent Road Networks With Stochastic First-In-First-Out Property , 2013, IEEE Transactions on Intelligent Transportation Systems.

[18]  Sabeur Aridhi,et al.  A MapReduce-based approach for shortest path problem in large-scale networks , 2015, Eng. Appl. Artif. Intell..

[19]  Christian Sommer,et al.  Shortest-path queries in static networks , 2014, ACM Comput. Surv..

[20]  Sankaran Mahadevan,et al.  Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment , 2012, Appl. Soft Comput..

[21]  Andrew V. Goldberg,et al.  PHAST: Hardware-accelerated shortest path trees , 2013, J. Parallel Distributed Comput..

[22]  Rossano Schifanella,et al.  The shortest path to happiness: recommending beautiful, quiet, and happy routes in the city , 2014, HT.

[23]  M. Abou Zeid,et al.  A statistical model of vehicle emissions and fuel consumption , 2002, Proceedings. The IEEE 5th International Conference on Intelligent Transportation Systems.

[24]  Christian S. Jensen,et al.  PACE: a PAth-CEntric paradigm for stochastic path finding , 2017, The VLDB Journal.