Online Learning for Energy Efficient Navigation using Contextual Information
dc.contributor.author | YUNATCI, YONCA | |
dc.contributor.author | BATIKAN UNAL, AHMET | |
dc.contributor.department | Chalmers tekniska högskola / Institutionen för data och informationsteknik | sv |
dc.contributor.examiner | Haghir Chehreghani, Morteza | |
dc.contributor.supervisor | Åkerblom, Niklas | |
dc.date.accessioned | 2020-07-08T10:26:16Z | |
dc.date.available | 2020-07-08T10:26:16Z | |
dc.date.issued | 2020 | sv |
dc.date.submitted | 2020 | |
dc.description.abstract | Accurately predicting the energy consumption of road segments is an important topic in electric vehicles that might alleviate the range concerns if it is addressed properly. We employ a contextual combinatorial multi-armed bandit framework to learn the unknown parameters of an energy consumption model which is necessary for energy-efficient navigation. Four different agents: Thompson Sampling, Disjoint LinUCB, Hybrid LinUCB, and greedy algorithms are implemented to observe their performance. All experiments are conducted on the output of a Luxembourg SUMO traffic simulation. The main finding of this research is that contextual information such as speed and acceleration data contributes to better learning of parameters. Although the contextual combinatorial algorithms seem promising for addressing the energy-efficient shortest path problem, none of the agents achieve zero regret consistently which indicates that further improvements are necessary to obtain the desired results. | sv |
dc.identifier.coursecode | DATX05 | sv |
dc.identifier.uri | https://hdl.handle.net/20.500.12380/301396 | |
dc.language.iso | eng | sv |
dc.setspec.uppsok | Technology | |
dc.subject | Contextual combinatorial multi-armed bandit | sv |
dc.subject | online learning | sv |
dc.subject | electric vehicles | sv |
dc.subject | energy consumption prediction | sv |
dc.subject | computer science | sv |
dc.title | Online Learning for Energy Efficient Navigation using Contextual Information | sv |
dc.type.degree | Examensarbete för masterexamen | sv |
dc.type.uppsok | H |