Lane-Level Map Matching using Hidden Markov Models
dc.contributor.author | Korsberg, Ellen | |
dc.contributor.author | Nordén, Eliza | |
dc.contributor.department | Chalmers tekniska högskola / Institutionen för mekanik och maritima vetenskaper | sv |
dc.contributor.department | Chalmers University of Technology / Department of Mechanics and Maritime Sciences | en |
dc.date.accessioned | 2019-07-05T11:53:50Z | |
dc.date.available | 2019-07-05T11:53:50Z | |
dc.date.issued | 2019 | |
dc.description.abstract | Map matching is the procedure of matching vehicle location and sensor data to a digital map. New high-definition maps, designed for autonomous vehicles, open up for the possibility of matching to lanes rather than roads. Inferring the lane-level positions of vehicles will be useful for updating and building probe-sourced maps, and thereby arguably essential for autonomous driving. This thesis seeks to solve the lane-level map matching problem using a Hidden Markov Model. The Viterbi algorithm is used to decode it. The model is tested on a data set yielded through the Volvo Drive Me project and collected by commercial vehicle sensors, including a GPS receiver, an inertial navigation system and a forward-looking camera. For the sake of simplicity, the RADAR and LiDAR sensors are excluded. Among the sensor data used, lane changes and the type of road lane markings as detected by the vehicle proves to be particularly important. Two metrics for evaluating model performance are proposed. The first metric is the recall, i.e. the fraction of correct matches. However, the lanes to which the observations are matched vary widely in length. Therefore, we introduce the path length error (PLE) as a complementary metric. As the name indicates, it considers the length of the incorrect routes. A naive matcher, that simply matches GPS coordinates to the closest lane, is used for benchmarking. Attaining 95% median recall and 3% median PLE, we conclude that our model is high-performing and robust to errors. For comparison, the naive matcher scores 77% median recall and 26% median PLE. Our model is however shown to struggle without reliable vision detections. It would therefore be meaningful to investigate the inclusion of additional vehicle sensors. | |
dc.identifier.uri | https://hdl.handle.net/20.500.12380/256993 | |
dc.language.iso | eng | |
dc.relation.ispartofseries | Master's thesis - Department of Mechanics and Maritime Sciences : 2019:52 | |
dc.setspec.uppsok | Technology | |
dc.subject | Informations- och kommunikationsteknik | |
dc.subject | Transport | |
dc.subject | Hållbar utveckling | |
dc.subject | Innovation och entreprenörskap (nyttiggörande) | |
dc.subject | Sannolikhetsteori och statistik | |
dc.subject | Datavetenskap (datalogi) | |
dc.subject | Systemvetenskap, informationssystem och informatik | |
dc.subject | Datorseende och robotik (autonoma system) | |
dc.subject | Farkostteknik | |
dc.subject | Information & Communication Technology | |
dc.subject | Transport | |
dc.subject | Sustainable Development | |
dc.subject | Innovation & Entrepreneurship | |
dc.subject | Probability Theory and Statistics | |
dc.subject | Computer Science | |
dc.subject | Information Systems | |
dc.subject | Computer Vision and Robotics (Autonomous Systems) | |
dc.subject | Vehicle Engineering | |
dc.title | Lane-Level Map Matching using Hidden Markov Models | |
dc.type.degree | Examensarbete för masterexamen | sv |
dc.type.degree | Master Thesis | en |
dc.type.uppsok | H | |
local.programme | Computer science – algorithms, languages and logic (MPALG), MSc |
Ladda ner
Original bundle
1 - 1 av 1
Hämtar...
- Namn:
- 256993.pdf
- Storlek:
- 10.43 MB
- Format:
- Adobe Portable Document Format
- Beskrivning:
- Fulltext