定位匹配 模板匹配 地图_什么是地图匹配？

定位匹配 模板匹配 地图

By Marie Douriez, James Murphy, Kerrick Staley

玛丽·杜里兹(Marie Douriez)，詹姆斯·墨菲(James Murphy)，凯里克·史塔利(Kerrick Staley)

When you request a ride, Lyft tries to match you with the driver most suited for your route. To make a dispatch decision, we first need to ask: where are the drivers? Lyft uses GPS data from the drivers’ phones to answer this question. However, the GPS data that we get is often noisy and does not match the road.

当您请求乘车时，Lyft会尝试将您与最适合您的路线的驾驶员进行匹配。 要做出调度决定，我们首先需要问： 驾驶员在哪里？ Lyft使用驾驶员电话中的GPS数据来回答此问题。 但是，我们获取的GPS数据通常比较嘈杂，与道路不匹配。

To get a clearer picture from this raw data, we run it through an algorithm that takes raw locations and returns more accurate locations that are on the road network. This process is called map-matching. We recently developed and launched a completely new map-matching algorithm and found that it improved driver location accuracy and made Lyft’s marketplace more efficient. In this post, we’ll discuss the details of this new model.

为了从原始数据中获得更清晰的图像，我们通过一种算法来运行它，该算法将获取原始位置并返回道路网络上的更精确位置。 这个过程称为map-matching 。 我们最近开发并推出了一种全新的地图匹配算法，发现它提高了驾驶员的定位准确性，并使Lyft的市场更加高效。 在这篇文章中，我们将讨论这个新模型的细节。

什么是地图匹配？ (What is map-matching?)

Map-matching is a process that maps raw GPS locations to road segments on a road network in order to create an estimate of the route taken by a vehicle.

地图匹配是一种将原始GPS位置映射到路网上的路段的过程，以创建对车辆所走路线的估算。

为什么需要地图匹配？ (Why do we need map-matching?)

At Lyft, we have two main use cases for map-matching:

在Lyft，我们有两个主要的地图匹配用例：

1. At the end of a ride, to compute the distance travelled by a driver to calculate the fare.
   乘车结束时，计算驾驶员行进的距离，以计算票价。

2. In real-time, to provide accurate locations to the ETA team and make dispatch decisions as well as to display the drivers’ cars on the rider app.

   实时 ，为ETA团队提供准确的位置并做出调度决策，并在rider应用程序上显示驾驶员的汽车。

display the drivers’ cars on the rider app (left) and make efficient 显示驾驶员的汽车(左)，并做出有效的 dispatch decisions (right). 调度决策(右)。

These two use cases differ by their constraints: in real-time, we need to be able to perform map-matching quickly (low latency) and with the locations available up to the current time only. At the end of a ride however, the latency requirements are less stringent and the whole history of the ride is available to us (allowing us to work “backwards” from future locations). As a result, End-Of-Ride Map-Matching (EORMM) and Real-Time Map-Matching (RTMM) are solved using slightly different approaches. In this post, we will focus on algorithms used for Real-Time Map-Matching.

这两个用例的约束条件不同：实时，我们需要能够快速执行地图匹配(低延迟)，并且仅在当前时间可用位置。 但是，在乘车结束时，对等待时间的要求不那么严格，并且可以使用乘车的全部历史记录(允许我们从将来的位置“向后”工作)。 结果，使用略有不同的方法解决了行进路线图匹配(EORMM)和实时地图匹配(RTMM)。 在本文中，我们将重点介绍用于实时地图匹配的算法。

为什么地图匹配具有挑战性？ (Why is map-matching challenging?)

A bad map-matched location leads to inaccurate ETAs, then to bad dispatch