mlsanityData to 14 Oct 2026

Online Learning of Energy Consumption for Navigation of Electric Vehicles

arXiv 2111.02314 ↗First posted 3 Nov 2021cs.LG stat.MLcited by 7

Not on the map. Why?

Abstract (arXiv)

Energy efficient navigation constitutes an important challenge in electric vehicles, due to their limited battery capacity. We employ a Bayesian approach to model the energy consumption at road segments for efficient navigation. In order to learn the model parameters, we develop an online learning framework and investigate several exploration strategies such as Thompson Sampling and Upper Confidence Bound. We then extend our online learning framework to the multi-agent setting, where multiple vehicles adaptively navigate and learn the parameters of the energy model. We analyze Thompson Sampling and establish rigorous regret bounds on its performance in the single-agent and multi-agent settings, through an analysis of the algorithm under batched feedback. Finally, we demonstrate the performance of our methods via experiments on several real-world city road networks.

Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 18 of its 59 references that are in the map. First posted on arXiv 3 Nov 2021.

Builds on

18 of 59 references.

References · 18

  1. 2017A Tutorial on Thompson Samplingcited by 433
  2. 2013Learning to Optimize Via Posterior Samplingcited by 256
  3. 2013(More) Efficient Reinforcement Learning via Posterior Samplingcited by 233
  4. 2013Online Learning under Delayed Feedbackcited by 141
  5. 2016Why is Posterior Sampling Better than Optimism for Reinforcement Learning?cited by 117
  6. 2019Batched Multi-armed Bandits Problemcited by 98
  7. 2018Thompson Sampling for Combinatorial Semi-Banditscited by 78
  8. 2020Sequential Batch Learning in Finite-Action Linear Contextual Banditscited by 63
  9. 2013Thompson Sampling for Complex Bandit Problemscited by 43
  10. 2014Efficient Learning in Large-Scale Combinatorial Semi-Banditscited by 36
  11. 2020Dynamic Batch Learning in High-Dimensional Sparse Linear Contextual Banditscited by 28
  12. 2013Prior-free and prior-dependent regret bounds for Thompson Samplingcited by 25
6 more
  1. 2016On Bayesian index policies for sequential resource allocationcited by 18
  2. 2021Online Learning of Network Bottlenecks via Minimax Pathscited by 9
  3. 2017Efficient Online Learning for Optimizing Value of Information: Theory and Application to Interactive Troubleshootingcited by 8
  4. 2020An Online Learning Framework for Energy-Efficient Navigation of Electric Vehiclescited by 8
  5. 2013Modeling Human Decision-making in Generalized Gaussian Multi-armed Banditscited by 7
  6. 2013Stochastic Online Shortest Path Routing: The Value of Feedbackcited by 6

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 3; 2024: 2; 2025: 1.

7 papers.