Abstract: An improved method for matching traces derived from probe data to one or more line segments in a digital vector map. Points in a probe trace are provisionally matched one-by-one to line segments in the digital vector map to identify all possible matching candidates. A graph of the matching candidates is created having one or more paths. The graph has a plurality of sequential levels corresponding to the points in the probe trace. Each matching candidate is assigned to a level of the graph corresponding with trace point to which it relates. Edges are established between matching candidates in adjacent levels provided they are topologically related to one another. The graph is simplified and scored. The best paths deliver the matching results. The invention allows use of graph theoretic methods to find the best path through the graph, which in turn represents an efficient map matching algorithm. The concepts of this invention may be used in conjunction with longitudinal distance as matching criterion.

Abstract: A system and method are disclosed for incrementally updating an existing digital map of a client device in a digital map update system. The digital map update system comprises, for each of one or more baseline digital maps, at least one digital map update repository comprising data which may be communicated to one or more remote client devices for use by the or each remote client device in incrementally updating an existing digital map of the device. Each repository includes one or more digital map forward update journals in respect of a respective given version of the baseline map to which the digital map update repository relates. The forward update journal comprises data indicative of a set of one or more incremental updates that may be used to update the given version of the baseline map to a later version.

Abstract: A system and method for generating a seamless road network of a large geographical area includes a plurality of GPS probe traces extending across a geographical area. The probe traces are divided into sub-sets base on criteria, such as accuracy. A plurality of threads simultaneously employ the sub-sets traces to generate an independent network of the entire geographical area. The networks generated using sub-sets having a high accuracy are preferred over networks generating using sub-sets having a lower accuracy. The independent networks are combined to form a seamless networks of road segments.

Abstract: Parking lot (18, 20) locations and geometries are discerned from probe data (22) and integrated with a digital map (12) for use in navigation and other map-related activities. The steps of this invention include: identifying the positions in the probe data (22) where cars are probably parked, detecting the positions of parking lots (18, 20), determining the extension and shape of the detected parking lots (18, 20), and adjusting the parking lots (18, 20) into the road network (14). Optionally, the parking lot (18, 20) can be classified and additional attributes computed. Finally, a topological connection of the parking lot (18, 20) is made to the road network (14) during which entrances (34) and exits (36) are identified.

Abstract: A digital map update system includes a digital map update server in communication with each one of a plurality of remote client devices for providing data indicative of a set of one or more digital map incremental updates thereto for use by the client devices in incrementally updating respective existing digital maps of the devices. The system comprises two or more digital map update repositories, each update repository comprising data indicative of a plurality of digital map incremental updates for use in incrementally updating a client device, and each being in respect of a different digital map incremental update profile. In use, the digital map update server provides a set of one or more digital map incremental updates from a given one of the update repositories to a remote client device for use by the device in incrementally updating an existing digital map of the device in accordance with the update profile of the given update repository.

Abstract: A system and method are disclosed for incrementally updating an existing digital map of a client device in a digital map update system. The digital map update system comprises, for each of one or more baseline digital maps, at least one digital map update repository comprising data which may be communicated to one or more remote client devices for use by the or each remote client device in incrementally updating an existing digital map of the device. Each repository includes one or more digital map forward update journals in respect of a respective given version of the baseline map to which the digital map update repository relates. The forward update journal comprises data indicative of a set of one or more incremental updates that may be used to update the given version of the baseline map to a later version.

Abstract: A system and method for generating a seamless road network of a large geographical area includes a plurality of GPS probe traces extending across a geographical area. The probe traces are divided into sub-sets base on criteria, such as accuracy. A plurality of threads simultaneously employ the sub-sets traces to generate an independent network of the entire geographical area. The networks generated using sub-sets having a high accuracy are preferred over networks generating using sub-sets having a lower accuracy. The independent networks are combined to form a seamless networks of road segments.

Abstract: An improved method for matching traces derived from probe data to one or more line segments in a digital vector map. Points in a probe trace are provisionally matched one-by-one to line segments in the digital vector map to identify all possible matching candidates. A graph of the matching candidates is created having one or more paths. The graph has a plurality of sequential levels corresponding to the points in the probe trace. Each matching candidate is assigned to a level of the graph corresponding with trace point to which it relates. Edges are established between matching candidates in adjacent levels provided they are topologically related to one another. The graph is simplified and scored. The best paths deliver the matching results. The invention allows use of graph theoretic methods to find the best path through the graph, which in turn represents an efficient map matching algorithm. The concepts of this invention may be used in conjunction with longitudinal distance as matching criterion.

Abstract: A system and method for generating a seamless road network of a large geographical area includes a plurality of GPS traces extending across a geographical area. A plurality of threads simultaneously employ entire traces to collectively generate the seamless road network. The method includes dividing the geographical area into tiles, with each trace extending across several tiles. Each thread can employ one of the traces while another thread employs another trace. Each thread employs an entire one of the traces extending across several tiles during a single step. A job scheduler and blocking table prevent threads from simultaneously processing traces having common tiles and disturbing one another. The threads employ an incremental map matching method, wherein the probe traces are compared to existing line segments of the digital map, and new line segments are created using the probe traces not matching the existing line segments.

Abstract: Parking lot (18, 20) locations and geometries are discerned from probe data (22) and integrated with a digital map (12) for use in navigation and other map-related activities. The steps of this invention include: identifying the positions in the probe data (22) where cars are probably parked, detecting the positions of parking lots (18, 20), determining the extension and shape of the detected parking lots (18, 20), and adjusting the parking lots (18, 20) into the road network (14). Optionally, the parking lot (18, 20) can be classified and additional attributes computed. Finally, a topological connection of the parking lot (18, 20) is made to the road network (14) during which entrances (34) and exits (36) are identified.