WO2017191259A1 - Assemblage de tuiles cartographiques de version mixte en navigation hybride pour mises à jour cartographiques partielles - Google Patents

Assemblage de tuiles cartographiques de version mixte en navigation hybride pour mises à jour cartographiques partielles Download PDF

Info

Publication number
WO2017191259A1
WO2017191259A1 PCT/EP2017/060664 EP2017060664W WO2017191259A1 WO 2017191259 A1 WO2017191259 A1 WO 2017191259A1 EP 2017060664 W EP2017060664 W EP 2017060664W WO 2017191259 A1 WO2017191259 A1 WO 2017191259A1
Authority
WO
WIPO (PCT)
Prior art keywords
link
tile
map
links
data
Prior art date
Application number
PCT/EP2017/060664
Other languages
English (en)
Inventor
Alex GONOPOLSKIY
Daniel Rolf
Original Assignee
Here Global B.V.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Here Global B.V. filed Critical Here Global B.V.
Priority to EP17721382.4A priority Critical patent/EP3452783B1/fr
Priority to CN201780027897.9A priority patent/CN109073397B/zh
Publication of WO2017191259A1 publication Critical patent/WO2017191259A1/fr

Links

Classifications

    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/38—Electronic maps specially adapted for navigation; Updating thereof
    • G01C21/3863—Structures of map data
    • G01C21/387—Organisation of map data, e.g. version management or database structures
    • G01C21/3881—Tile-based structures
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34—Route searching; Route guidance
    • G01C21/36—Input/output arrangements for on-board computers
    • G01C21/3667—Display of a road map
    • G01C21/367—Details, e.g. road map scale, orientation, zooming, illumination, level of detail, scrolling of road map or positioning of current position marker
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/38—Electronic maps specially adapted for navigation; Updating thereof
    • G01C21/3804—Creation or updating of map data
    • G01C21/3859—Differential updating map data
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/38—Electronic maps specially adapted for navigation; Updating thereof
    • G01C21/3885—Transmission of map data to client devices; Reception of map data by client devices
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/28—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network with correlation of data from several navigational instruments
    • G01C21/30—Map- or contour-matching
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/38—Electronic maps specially adapted for navigation; Updating thereof
    • G01C21/3804—Creation or updating of map data

Definitions

  • Example embodiments relate generally to partial map updates.
  • example embodiments generally relate to the use of mixed- version map tiles in hybrid navigation for partial map updates.
  • map data stored by an in car navigation system or other mobile system may be updated frequently.
  • the map data may be stored in a tile-based format (e.g., MOS-F8, NDS, etc.) such that the map data may be updated in a modular fashion.
  • updated map data may be provided tile by tile.
  • a user wants a requested route to be provided as quickly as possible and may be unsatisfied with the time required to provide a route if the entire map is to be updated.
  • the available bandwidth and/or connectivity of the user apparatus to the update server may be limited such that updating the entire map is not feasible.
  • a map gets partially updated, the problem is that there are now tiles of different versions on the in car navigation system or other mobile system. For example, a map update for one tile may be received but a map update for an adjacent tile may not be received. Thus, the boundary where the two adjacent tiles meet may not be compatible because of changes in the road topology. However, any provided route or displayed map should be locally connected and functional.
  • Example embodiments are configured to provide the user (e.g., operating a user apparatus) with a locally connected and functional map that may be used to quickly provide routes or other information using the latest possible map version while not requiring that the entire map be updated simultaneously.
  • updated map data is received.
  • the updated map data comprises a plurality of links.
  • One or more changed or new links of the plurality of links are identified.
  • a changed link is different than the corresponding link in previous map data and a new link does not have a corresponding link in the previous map data.
  • a tiling of the updated map data is determined. Based on the tiling of the updated map data, it is determined that a tile boundary intersects at least one of the one or more changed or new links.
  • the tile boundary is the boundary between a first tile and a second tile.
  • a map update is compiled based on the updated map data, previous map data corresponding to the one or more changed or new links intersected by the tile boundary, and the tiling.
  • a method comprises receiving updated map data.
  • the updated map data comprises a plurality of links.
  • the method further comprises identifying one or more changed or new links of the plurality of links.
  • a changed link is different than the corresponding link in previous map data and a new link does not have a corresponding link in the previous map data.
  • the method further comprises determining a tiling of the updated map data and determining, based on the tiling of the updated map data, that a tile boundary intersects at least one of the one or more changed or new links.
  • the tile boundary is the boundary between a first tile and a second tile.
  • the method further comprises compiling a map update based on the updated map data, previous map data corresponding to the one or more changed or new links intersected by the tile boundary, and the tiling.
  • identifying a changed or new link comprises determining if the previous map data comprises a corresponding link corresponding to a link of the plurality of links.
  • the link of the plurality of links comprises link attributes and identifying one or more changed or new links of the plurality of links further comprises comparing the link attributes of the link to the link attributes of the corresponding link.
  • the link attributes comprise one or more of a link identifier, link geometry, link location, intersection identifier, street number range, a traffic direction flow indicator, a carpool lane presence indicator, a car open indicator, a through traffic indicator, time restriction(s), a driving side indicator, a controlled access indicator, a service road indicator, a construction indicator, a ferry indicator, a private road indicator, or seasonal closures.
  • the previous map data corresponding to the one or more changed or new links intersected by the tile boundary corresponds to a fully connected broken cluster that is only partially contained with the first tile.
  • when the previous map data corresponding to the one or more changed or new links intersected by the tile boundary is for use or display when (a) map update data has not been provided for the second tile and (b) an area comprising the tile boundary between the first tile and the second tile is in a map region of interest.
  • a link of the plurality of links represents a road section between a first intersection and a second intersection.
  • an apparatus comprising at least one processor and at least one memory storing computer program code.
  • the at least one memory and the computer program code configured to, with the processor, cause the apparatus to at least receive updated map data.
  • the updated map data comprises a plurality of links.
  • the at least one memory and the computer program code are further configured to, with the processor, cause the apparatus to at least identify one or more changed or new links of the plurality of links.
  • a changed link is different than the corresponding link in previous map data and a new link does not have a corresponding link in the previous map data.
  • the at least one memory and the computer program code are further configured to, with the processor, cause the apparatus to at least determine a tiling of the updated map data and determine, based on the tiling of the updated map data, that a tile boundary intersects at least one of the one or more changed or new links.
  • the tile boundary is the boundary between a first tile and an adjacent second tile.
  • the at least one memory and the computer program code are further configured to, with the processor, cause the apparatus to at least compile a map update based on the updated map data, previous map data corresponding to the one or more changed or new links intersected by the tile boundary, and the tiling.
  • the at least one memory and the computer program code are further configured to, with the processor, cause the apparatus to at least provide the map update for at least the first tile.
  • the at least one memory and the computer program code are configured to, with the processor, cause the apparatus to at least determine if the previous map data comprises a corresponding link corresponding to a link of the plurality of links.
  • the link of the plurality of links comprises link attributes and identifying one or more changed or new links of the plurality of links further comprises comparing the link attributes of the link to the link attributes of the corresponding link.
  • the link attributes comprise one or more of a link identifier, link geometry, link location, intersection identifier, street number range, a traffic direction flow indicator, a carpool lane presence indicator, a car open indicator, a through traffic indicator, time restriction(s), a driving side indicator, a controlled access indicator, a service road indicator, a construction indicator, a ferry indicator, a private road indicator, or seasonal closures.
  • the previous map data corresponding to the one or more changed or new links intersected by the tile boundary corresponds to a fully connected broken cluster that is only partially contained with the first tile.
  • when the previous map data corresponding to the one or more changed or new links intersected by the tile boundary is for use or display when (a) map update data has not been provided for the second tile and (b) an area comprising the tile boundary between the first tile and the second tile is in a map region of interest.
  • a link of the plurality of links represents a road section between a first intersection and a second intersection.
  • a computer program product comprises at least one non-transitory computer-readable storage medium having computer-executable program code instructions stored therein.
  • the computer-executable program code instructions comprise program code instructions configured to receive updated map data.
  • the updated map data comprises a plurality of links.
  • the computer-executable program code instructions further comprise program code instructions configured to identify one or more changed or new links of the plurality of links. A changed link is different than the corresponding link in previous map data and a new link does not have a corresponding link in the previous map data.
  • the computer-executable program code instructions further comprise program code instructions configured to determine a tiling of the updated map data and determine, based on the tiling of the updated map data, that a tile boundary intersects at least one of the one or more changed or new links.
  • the tile boundary is the boundary between a first tile and an adjacent second tile.
  • the computer-executable program code instructions further comprise program code instructions configured to compile a map update based on the updated map data, previous map data corresponding to the one or more changed or new links intersected by the tile boundary, and the tiling.
  • the computer-executable program code instructions further comprise program code instructions configured to provide the map update for at least the first tile.
  • the link of the plurality of links comprises link attributes; identifying a changed or new link comprises determining if the previous map data comprises a corresponding link corresponding to a link of the plurality of links; and/or identifying one or more changed or new links of the plurality of links further comprises comparing the link attributes of the link to the link attributes of the corresponding link.
  • the previous map data corresponding to the one or more changed or new links intersected by the tile boundary corresponds to a fully connected broken cluster that is only partially contained within the first tile..
  • when the previous map data corresponding to the one or more changed or new links intersected by the tile boundary is for use or display when (a) map update data has not been provided for the second tile and (b) an area comprising the tile boundary between the first and second tile is in a map region of interest.
  • an apparatus comprising means for receiving updated map data, wherein the updated map data comprises a plurality of links.
  • the apparatus further comprises means for identifying one or more changed or new links of the plurality of links, wherein a changed link is different than the corresponding link in previous map data and wherein a new link does not have a corresponding link in the previous map data.
  • the apparatus further comprises means for determining a tiling of the updated map data and determining, based on the tiling of the updated map data, that a tile boundary intersects at least one of the one or more changed or new links.
  • the tile boundary is the boundary between a first tile and an adjacent second tile.
  • the apparatus comprises means for compiling a map update based on the updated map data, previous map data corresponding to the at least one of the one or more changed or new links intersected by the tile boundary, and the tiling. Furthermore, the apparatus comprises means for providing the map update for at least the first tile.
  • map update data is received for at least a first tile.
  • the map update data comprises updated map for the first tile and previous map data for the first tile corresponding to one or more changed or new links intersected by a tile boundary between the first tile and a second tile.
  • a map region of interest is determined.
  • the map region of interest comprises at least a portion of the first tile.
  • the previous map data for the one or more changed or new links intersected by the tile boundary is not used or displayed.
  • the previous map data for the one or more changed or new links intersected by the tile boundary is used or displayed.
  • a method comprises receiving a map update for at least a first tile.
  • the map update comprises updated map data for the first tile and previous map data for the first tile corresponding to one or more changed or new links intersected by a tile boundary between the first tile and a second tile.
  • the method further comprises determining a map region of interest.
  • the map region of interest comprises at least a portion of the first tile.
  • the method comprises determining if a map update for the second tile has been received.
  • the method further comprises, (a) when it is determined that a map update for the second tile has been received, not using or displaying the previous map data for the one or more changed or new links intersected by the tile boundary and (b) when it is determined that a map update for the second has not been received, using or displaying the previous map data for the one or more changed or new links intersected by the tile boundary.
  • the method further comprises, using or displaying updated map data for the portion of the first tile within the map region of interest.
  • the previous map data corresponding to the one or more changed or new links intersected by the tile boundary corresponds to a fully connected broken cluster that is only partially contained within the first tile.
  • the previous map data of the map update for the first tile only comprises previous map data for the portion of the fully connected broken cluster that is contained within the first tile.
  • the previous map data of the map update does not comprise previous map data for a link that is not a link of a fully connected broken cluster that is only partially contained within the first tile.
  • the method when it is determined that a map update for the second tile has not been received, the method further comprises, using or displaying the previous map data for only the fully connected broken cluster and the links thereof.
  • the previous map data of the map update consists of (a) previous map data for making the map locally connected across the tile boundary when the map update for the second tile has not been received and (b) an indication of the map version corresponding to the previous map data.
  • the map region of interest is determined based on at least one of a current location, a route, or a zoom level.
  • an apparatus is provided.
  • the apparatus comprises at least one processor and at least one memory storing computer program code.
  • the at least one memory and the computer program code configured to, with the processor, cause the apparatus to at least receive a map update for at least a first tile.
  • the map update comprises updated map data for the first tile and previous map data for the first tile corresponding to one or more changed or new links intersected by a tile boundary between the first tile and a second tile.
  • the at least one memory and the computer program code are further configured to, with the processor, cause the apparatus to at least determine a map region of interest.
  • the map region of interest comprises at least a portion of the first tile.
  • the at least one memory and the computer program code are further configured to, with the processor, cause the apparatus to at least determine if a map update for the second tile has been received.
  • the at least one memory and the computer program code are further configured to, with the processor, cause the apparatus to at least (a) when it is determined that a map update for the second tile has been received, not use or display the previous map data for the one or more changed or new links intersected by the tile boundary and (b) when it is determined that a map update for the second has not been received, use or display the previous map data for the one or more changed or new links intersected by the tile boundary.
  • the at least one memory and the computer program code are further configured to, with the processor, cause the apparatus to at least, use or display updated map data for the portion of the first tile within the map region of interest.
  • the previous map data corresponding to the one or more changed or new links intersected by the tile boundary corresponds to a fully connected broken cluster that is only partially contained within the first tile.
  • the previous map data of the map update for the first tile only comprises previous map data for the portion of the fully connected broken cluster that is contained within the first tile.
  • the previous map data of the map update does not comprise previous map data for a link that is not a link of a fully connected broken cluster that is only partially contained within the first tile.
  • the at least one memory and the computer program code are further configured to, with the processor, cause the apparatus to at least, use or display the previous map data for only the fully connected broken cluster and the links thereof.
  • the previous map data of the map update consists of (a) previous map data for making the map locally connected across the tile boundary when the map update for the second tile has not been received and (b) an indication of the map version corresponding to the previous map data.
  • the map region of interest is determined based on at least one of a current location, a route, or a zoom level.
  • a computer program product comprises at least one non-transitory computer-readable storage medium having computer-executable program code instructions stored therein.
  • the computer-executable program code instructions comprise program code instructions configured to receive a map update for at least a first tile.
  • the map update comprises updated map data for the first tile and previous map data for the first tile corresponding to one or more changed or new links intersected by a tile boundary between the first tile and a second tile.
  • the computer-executable program code instructions further comprise program code instructions configured to determine a map region of interest.
  • the map region of interest comprises at least a portion of the first tile.
  • the computer-executable program code instructions further comprise program code instructions configured to, in response to determining that the map region of interest comprises at least a portion of the second tile, determine if a map update for the second tile has been received.
  • the computer-executable program code instructions further comprise program code instructions configured to (a) when it is determined that a map update for the second tile has been received, not use or display the previous map data for the one or more changed or new links intersected by the tile boundary and (b) when it is determined that a map update for the second has not been received, use or display the previous map data for the one or more changed or new links intersected by the tile boundary.
  • the computer-executable program code instructions further comprise program code instructions configured to, when it is determined that a map update for the second tile has been received, use or display updated map data for the portion of the first tile within the map region of interest.
  • the previous map data corresponding to the one or more changed or new links intersected by the tile boundary corresponds to a fully connected broken cluster that is only partially contained within the first tile.
  • the previous map data of the map update for the first tile only comprises previous map data for the portion of the fully connected broken cluster that is contained within the first tile.
  • the previous map data of the map update does not comprise previous map data for a link that is not a link of a fully connected broken cluster that is only partially contained within the first tile.
  • the computer-executable program code instructions further comprise program code instructions configured to, when it is determined that a map update for the second tile has not been received, use or display the previous map data for only the fully connected broken cluster and the links thereof.
  • the previous map data of the map update consists of (a) previous map data for making the map locally connected across the tile boundary when the map update for the second tile has not been received and (b) an indication of the map version corresponding to the previous map data.
  • the map region of interest is determined based on at least one of a current location, a route, or a zoom level.
  • an apparatus comprising means for receiving a map update for at least a first tile.
  • the map update comprises updated map data for the first tile and previous map data for the first tile corresponding to one or more changed or new links intersected by a tile boundary between the first tile and a second tile.
  • the apparatus further comprises means for determining a map region of interest.
  • the map region of interest comprises at least a portion of the first tile.
  • the apparatus further comprises means for, in response to determining that the map region of interest comprises at least a portion of the second tile, determining if a map update for the second tile has been received.
  • the apparatus further comprises means for, (a) when it is determined that a map update for the second tile has been received, not using or displaying the previous map data for the one or more changed or new links intersected by the tile boundary, and (b) when it is determined that a map update for the second has not been received, using or displaying the previous map data for the one or more changed or new links intersected by the tile boundary.
  • Figure 1 is a block diagram showing an example architecture of one embodiment of the present invention
  • Figure 2A is a block diagram of an update apparatus that may be specifically configured in accordance with an example embodiment
  • Figure 2B is a block diagram of an user apparatus that may be specifically configured in accordance with an example embodiment
  • Figure 3A shows previous map data for two example tiles, in accordance with an example embodiment
  • Figure 3B shows updated map data for the two example tiles shown in Figure 3A, in accordance with an example embodiment
  • Figure 4 is a flowchart illustrating operations performed, such as by the update apparatus of Figure 2 A, in order to provide map updates for one or more tiles, in accordance with an example embodiment
  • Figure 5 shows a schematic diagram of a broken cluster, in accordance with an example embodiment
  • Figure 6 is a flowchart illustrating operations performed, such as by the update apparatus of Figure 2A, in order to determine if a link is an anchor or a broken link, in accordance with an example embodiment
  • Figure 7 is a flowchart illustrating operations performed, such as by the update apparatus of Figure 2 A, in order to identify a broken cluster, in accordance with an example embodiment
  • Figure 8 is a flowchart illustrating operations performed, such as by the user apparatus of Figure 2B, in order to use/display a map using mixed-version tiles, in accordance with an example embodiment.
  • the term 'circuitry' refers to (a) hardware -only circuit implementations (e.g., implementations in analog circuitry and/or digital circuitry); (b) combinations of circuits and computer program product(s) comprising software and/or firmware instructions stored on one or more computer readable memories that work together to cause an apparatus to perform one or more functions described herein; and (c) circuits, such as, for example, a microprocessor(s) or a portion of a microprocessor(s), that require software or firmware for operation even if the software or firmware is not physically present.
  • This definition of 'circuitry' applies to all uses of this term herein, including in any claims.
  • the term 'circuitry' also includes an implementation comprising one or more processors and/or portion(s) thereof and accompanying software and/or frrmware.
  • the term 'circuitry' as used herein also includes, for example, a baseband integrated circuit or applications processor integrated circuit for a mobile phone or a similar integrated circuit in a server, a cellular network device, other network device, and/or other computing device.
  • the map may be tiled such that map information/data may be stored, received, provided, transmitted, and/or the like in a modular format (e.g., tile by tile).
  • the tiles may be defined by a set of parallel and perpendicular tile boundaries.
  • the tiles may be rectangular or square (e.g., 2 km by 2 km squares).
  • the tiles may be defined by boundaries which are curved, not parallel and/or perpendicular to one or more other boundaries, and/or the like.
  • the tiles may be a uniform tiling of the map.
  • the tiles may vary in size and/or shape based on the geography of the map region, the topology of the map region, population density within the map region, and/or the like.
  • a boundary between an updated version tile and an adjacent previous version tile may need to be navigated across. If the updated version tile includes changes in the area near the boundary between the tiles, a section of road in the updated version tile may not properly align across the boundary with the corresponding section of road in the previous version tile.
  • Example embodiments ensure consistency of road sections or links across tile boundaries wherein one tile is an updated version tile and the adjacent tile is a previous version tile.
  • a link may be a portion of a road, street, highway, path, and/or the like between a first intersection and a second intersection.
  • the first intersection and the second intersection may be adjacent intersections (e.g., after passing through the first intersection, the second intersection may be the next intersection you come to when traveling along the link).
  • Figure 1 provides an illustration of an example system that can be used in conjunction with various embodiments of the present invention.
  • the system may include one or more user apparatus 20, one or more update apparatus 10, one or more networks 50, and/or the like.
  • the user apparatus 20 may be an in vehicle navigation system, a mobile computing device, and/or the like.
  • vehicle navigation system mounted within and/or be onboard a vehicle such as a motor vehicle, non-motor vehicle car, scooter, truck, van bus, motorcycle, bicycle, Segway, golf cart, and/or the like.
  • the user apparatus 20 may be a smartphone, tablet, personal digital assistant (PDA), and/or other mobile computing device.
  • PDA personal digital assistant
  • an update apparatus 10 may comprise components similar to those shown in the example update apparatus 10 diagrammed in Figure 2A.
  • a user apparatus 20 may comprise components similar to those shown in the example user apparatus 20 diagrammed in Figure 2B.
  • the update apparatus 10 may be located remotely from the user apparatus 20.
  • Each of the components of the system may be in electronic communication with, for example, one another over the same or different wireless or wired networks including, for example, a wired or wireless Personal Area Network (PAN), Local Area Network (LAN), Metropolitan Area Network (MAN), Wide Area Network (WAN), cellular network, and/or the like.
  • PAN Personal Area Network
  • LAN Local Area Network
  • MAN Metropolitan Area Network
  • WAN Wide Area Network
  • cellular network and/or the like.
  • a user apparatus 20 may be in communication with an update apparatus 10 via the network 50.
  • the user apparatus 20 may communicate with the update apparatus 10 via the Cloud.
  • the user apparatus 20 may comprise a processor 22, memory 24, a user interface 28, one or more sensors 30 (e.g., a location sensor such as a GPS sensor), a communications interface 26, and/or other components configured to perform various operations, procedures, functions or the like described herein.
  • the update apparatus 10 may comprise a processor 12, memory 14, a user interface 18, a communications interface 16, and/or other components configured to perform various operations, procedures, functions or the like described herein. Example embodiments of the user apparatus 20 and the update apparatus 10 are described in more detail below with respect to Figures 2A and 2B.
  • updated map information/data may be received and it may be determined if/which links have been updated, changed, or added in the updated map information/data compared to the previous map information/data.
  • the previous map information/data may refer to map information data from the version of the map that immediately proceeds the updated version of the map corresponding to the updated map information/data.
  • the previous map information/data is map information/data from a previous version of the map but need not be from the immediately preceding version of the map.
  • a link may comprise and/or be associated with one or more link attributes.
  • the link attributes may comprise one or more of a link identifier configured to (uniquely) identify a link, link geometry information/data configured to describe the shape and/or length of the link, a link location configured to provide geo-location information for one or both ends of a link, one or more intersection identifiers configured to identify one or more intersections that define an end of the link, a range of street numbers configured to identify the street numbers located along the link, a traffic direction flow indicator, a carpool lane presence indicator, a car open indicator, a through traffic indicator, time restriction(s), a driving side indicator, a controlled access indicator, a service road indicator, a construction indicator, a ferry indicator, a private road indicator, seasonal closures, link height/weight restrictions, and/or the like.
  • a link identifier configured to (uniquely) identify a link
  • link geometry information/data configured to describe the shape and/or length of the link
  • a link location configured to provide geo-location information for one or both ends of a link
  • the map update information/data may be compiled.
  • the map update information/data may comprise the updated map information/data, a new change set, and/or an old change set, wherein a new change set may comprise zero, one, or more links from the updated map information/data and the old change set may comprise zero, one, or more links from the previous map information/data.
  • the map update information/data provides a tile of the updated version of the map consistent with an adjacent tile of the previous version of the map.
  • the ol change set may comprise previous map information/data for a link that has been changed in the updated map information/data with respect to the previous map information/data.
  • One or more tiles of the updated version of the map may then be provided.
  • one or more tiles of the updated version of the map may be transmitted through a wired or wireless network (e.g., network 50).
  • a wired or wireless network e.g., network 50.
  • At least one of the one or more provided tiles of the updated version of the map may be received and used to display a map region, determine and/or navigate a route, and/or the like.
  • Figure 3A illustrates a first tile 50 and a second tile 55 of a new version of a map 45.
  • Figure 3B illustrates the same first tile 50 and second tile 55 in a previous version of the map 40.
  • the first tile 50 and the second tile 55 are adjacent tiles sharing tile boundary 52.
  • the dotted links show the broken links 70 of a broken cluster of the updated map information/data intersected by the tile boundary 52 and the corresponding links 75 in the previous map information/data.
  • the thick solid links show the anchor links 60 immediately adjoining the broken links 70 of the broken cluster.
  • the anchor links 60 are present and unchanged between the new version of the map 45 and the previous version of the map 40.
  • Figure 4 provides a flowchart illustrating various operations and procedures that may be completed in accordance with an example embodiment of the present invention to provide a map update.
  • example embodiments relate to providing a partial map update.
  • map update information/data for one or more tiles may be provided, however, map update information/data may not always be provided for all of the tiles in the map.
  • updated map information/data is received.
  • the update apparatus 10 may receive updated map information/data.
  • the update apparatus 10 may comprise means, such as the processor 12, the communication interface 16, user interface 18, or the like, for receiving the updated map information/data.
  • the updated map information/data may comprise map information/data comprising a plurality of links and the corresponding link attributes.
  • the updated map information/data may provide the map information/data needed to provide an updated version of the map.
  • anchor links and broken links are identified.
  • the update apparatus 10 may identify anchor links and broken links.
  • the update apparatus 10 may comprise means, such as the processor 12 or the like, for identifying anchor links and broken links.
  • an anchor link is a link that is substantially the same in the updated map information/data as in the previous map information/data.
  • an anchor link may be a link that is not significantly updated or changed from the previous version of the map information/data.
  • a broken link may be a link that has been significantly changed from the previous version of the map information/data or that was not present in the previous version of the map information/data.
  • a link may be significantly changed or different from the corresponding link in the previous map information/data if any of the link attributes for the link are different from the corresponding link attribute for the corresponding link in the previous map information/data and/or if a change flag associated with any of the link attributes indicates a change in an attribute for the link. For example, a new link may be classified as a broken link, since the new link was not present in the previous map information/data. In various embodiments, each link in the updated map information/data is classified as either an anchor link or a broken link. An example method for identifying anchor links and broken links is described in more detail elsewhere herein.
  • a broken cluster is identified.
  • the update apparatus 10 may identify a broken cluster for any broken links identified.
  • the update apparatus 10 may comprise means, such as a processor 12 or the like, for identifying a broken cluster for any broken links identified.
  • a broken link is identified, a broken cluster for the broken link is identified.
  • a fully connected broken cluster comprising the broken link may be identified.
  • the links in the previous map information/data corresponding to the broken links comprising the broken cluster may be a fully connected cluster of links in the previous map information/data bordered by the anchor links of the broken cluster.
  • the map may be traversed in all directions from the broken link.
  • the link For each link that the process comes to, it may be determined if the link is an anchor link or a broken link. If the link is a broken link, the broken link is added to the broken cluster and the process continues to traverse the map in that direction. If the link is an anchor link, the anchor link is remembered and process stops in that direction. In example embodiments, one broken cluster may be identified for each set of connected broken links.
  • Figure 5 provides an example schematic of identifying a broken cluster, wherein the solid lines represent anchor links and the non-solid lines represent broken links. It is determined that link 1 , shown as the dotted line, is a broken link. The map is then traversed in all directions from link 1. On the right side of link 1, a second broken link, link 2, is identified. Following the map along link 2, two anchor links, links 3 and 4, are reached. The link identifiers for links 3 and 4 are stored in association with the broken cluster and the process stops traversing the map in that direction. On the left side of link 1 , there are three directions in which the map may be traversed. Links 5 and 6 are anchor links.
  • link identifiers for links 5 and 6 are stored in associated with the broken cluster and the process stops traversing the map in those directions. It is determined that link 7 is a broken link. Link 7 is added to the broken cluster and the process continues to traverse the map along link 7. Links 8 and 4 are then reached, which are both anchor links. Thus, link identifiers for links 8 and 4 are stored in associated with the broken cluster and the process stops traversing the map in that direction.
  • this example broken cluster is a fully connected change cluster comprising links 1 , 2, and 7 and bordered by anchor links 3, 4, 5, 6, and 8.
  • a broken cluster is intersected by a tile boundary. For example, it is determined if part of a broken cluster is in one tile and part of the broken cluster is in another tile.
  • the update apparatus 10 may determine if a broken cluster is intersected by a tile boundary.
  • the update apparatus 10 may comprise means, such as the processor 12 or the like, for determining if a broken cluster is intersected by a tile boundary.
  • the changes between the new map version and the previous map version based on the broken cluster will not cause any issues when navigating across a tile boundary or when displaying two adjacent map tiles.
  • the new change set and the old change set for each map tile comprising a portion of the broken cluster are identified, at block 110.
  • the links in the previous map information/data corresponding to the broken cluster are identified.
  • a broken link in the previous map information/data of the broken cluster may correspond to a link in the previous map information/data that has been changed or is not present in the updated map information/data.
  • the broken links of the broken cluster identified in the previous map information/data comprise the old change set.
  • the broken links of the broken cluster identified in the updated map information/data comprise the new change set.
  • the new change set may be non-empty and the old change set may be an empty set, or vice-versa, depending on the changes made to the map between the updated map information/data and the previous map information/data.
  • the update apparatus 10 may identify the new change set and the old change set for a map tile based on one or more broken clusters that are each only partially contained within the map tile.
  • the update apparatus 10 may comprise means, such as processor 12 or the like, for identifying the new change set and the old change set for a map tile based on one or more broken clusters that are each only partially contained within the map tile.
  • the map update information/data may be compiled.
  • map update information/data may be compiled for one or more map update tiles.
  • the map update information/data comprises the updated map information/data, a new change set, and an old change set.
  • Each change set may be marked with an indication of which map version the change set information/data is from (e.g., the new version, the previous version, the version from April 19, 2016, version 3.6.9, and/or the like).
  • the new change set may comprise updated map information/data related to one or more broken links in the new version of the map and the old change set may comprise previous map information/data related to one or more broken links in the previous version of the map.
  • the new change set for a map tile, old change set for a map tile, or both change sets for a map tile may be empty sets.
  • the update apparatus 10 may compile the map update information/data.
  • the update apparatus 10 may comprise means, such as the processor 12 or the like, for compiling the map update information/data.
  • the compiling of the map update information/data may comprise packaging the updated map information/data, the new change set for the tile, and the old change set for the tile into tiles of map update information/data.
  • compiling the map update information/data may comprise embedding a new change set and/or an old change set into tiles of updated map information/data.
  • the new change set may comprise a set of changed components from the updated map information/data and the old change set may comprise a set of changed components from the previous map information/data, wherein the change is with respect to the other map version.
  • the map update information/data may comprise a new change set of changed components marked as corresponding to the new version of the map, and an old change set of changed components marked as corresponding to the previous version of the map.
  • the new change set of changed components may comprise one or more broken clusters for the new map version that cross a tile boundary and the old change set of changed components may comprise the previous map information/data for the links corresponding to the one or more broken clusters that cross a tile boundary in the previous map version.
  • the links shown as the dashed lines (70) in Figure 3A may comprise the new change set marked as corresponding to the new version of the map and the links shown as the dashed lines (75) in Figure 3B may comprise the old change set marked as corresponding to the previous version of the map for their respective tiles.
  • the new change set and/or the old change set may be an empty set.
  • the new change set and/or the old change set may be embedded into the new version map tiles as layers, additional payload, and/or the like.
  • the update apparatus 10 may provide at least a portion (e.g., at least one tile) of the compiled map update information/data.
  • the update apparatus 10 may comprise means, such as the processor 12, communications interface 16, or the like, for providing at least a portion (e.g., at least one tile) of the compiled map update information/data.
  • the compiled map updated information/data may be provided in blocks or packages each relating to one tile.
  • the compiled map update information/data may be provided corresponding to an integer number of tiles may be provided.
  • Figure 6 provides a flowchart illustrating operations performed to identify anchor links and broken links in the updated map information/data, in accordance with an example embodiment.
  • each link in the updated map information/data it may be determined if the link is an anchor link or a broken link.
  • an unclassified link is selected.
  • each link of the updated map information/data may be marked as unclassified previous to beginning to identify the anchor links and the broken links.
  • the process of identifying the anchor links and broken links may continue until all of the links in the updated map information/data and/or previous map information/data are classified.
  • the apparatus 10 may select a link in the updated map information/data and/or previous map information/data marked as unclassified.
  • the apparatus 10 may comprise means, such as the processor 12 or the like for selecting a link in the updated map information/data and/or previous map information/data marked as unclassified.
  • the apparatus 10 may determine if the link exists in both the new version of the map and the previous version of the map.
  • the apparatus 10 may determine if the link exists in both the new version of the map and the previous version of the map.
  • the apparatus 10 may comprise means, such as the processor 12 or the like, for determining if the link is exists in both the new version of the map and the previous version of the map.
  • the selected link from the updated map information/data may be compared to the previous map information/data. For example, it may be determined if a corresponding link exists in the previous map information/data. For example, based on the link identifier associated with the selected link, it may be determined if a corresponding link exists in the previous map information/data.
  • a broken link is a link in either the updated map information/data or the previous map information/data for which a corresponding link does not exist in the previous map information/data or the updated map information/data and/or for which the link in the updated map information/data is (substantially/significantly) different from the corresponding link in the previous map information/data.
  • the update apparatus 10 may classify the link as a broken link.
  • the update apparatus 10 may comprise means, such as the processor 12 and/or the like, for classifying the link as a broken link.
  • the update apparatus 10 may determine if all of the links have been classified.
  • the update apparatus 10 may comprise means, such as the processor 12 and/or the like, for determining if all of the links have been classified. If all of the links have been classified, the process may continue to identifying broken clusters. For example, broken clusters may be identified as illustrated in Figure 7. If all of the links have not yet been classified, the process returns to step 202 and another unclassified link is selected.
  • the process continues to block 206.
  • the apparatus 10 may determine if the link is significantly changed from the previous map version to the new map version.
  • the apparatus 10 may comprise means, such as the processor 12 and/or the like, for determining if the link is significantly changed from the previous map version to the new map version.
  • the link attributes of the corresponding link may be determined if the link attributes of the corresponding link are the same as the link attributes of the selected link. If the link attributes of the corresponding link are the same as the link attributes of the selected link, it is determined that the link is unchanged. If the link attributes of the corresponding link for the selected link differ more than a threshold amount from the link attributes for the corresponding link, it may be determined that the corresponding link is changed. In an example embodiment, the threshold amount does not allow for any difference between the link attributes for the selected link and the link attributes for the corresponding link.
  • the link attributes may comprise one or more of a link identifier configured to (uniquely) identify a link, link geometry information/data configured to describe the shape and/or length of the link, a link location configured to provide geo-location information for one or both ends of a link, one or more intersection identifiers configured to identify one or more intersections that define an end of the link, a range of street numbers configured to identify the street numbers located along the link, a traffic direction flow indicator, a carpool lane presence indicator, a car open indicator, a through traffic indicator, time restriction(s), a driving side indicator, a controlled access indicator, a service road indicator, a construction indicator, a ferry indicator, a private road indicator, seasonal closures, link height/weight restrictions, and/or the like.
  • a link identifier configured to (uniquely) identify a link
  • link geometry information/data configured to describe the shape and/or length of the link
  • a link location configured to provide geo-location information for one or both ends of a link
  • link attributes may be associated with a change flag such that if the link attribute is changed in the updated map information/data, the change flag corresponding to that link attribute is set to true and if the link attribute is not changed in the updated map information/data, the change flag associated with that link attribute is set to false.
  • it may be determined if any of the link attributes have been updated and/or changed from the previous map information/data to the updated map information/data by considering the change flags for the updated map information/data.
  • the process continues to step 212.
  • the selected link is classified as an anchor link.
  • the update apparatus 10 may identify the selected link as an anchor link.
  • the update apparatus 10 may comprise means, such as the processor 12 or the like for identifying the selected link as an anchor link.
  • the update apparatus 10 may determine if all of the links have been classified.
  • the update apparatus 10 may comprise means, such as the processor 12 and/or the like, for determining if all of the links have been classified. If all of the links have been classified, the process may continue to identifying broken clusters. For example, broken clusters may be identified as illustrated in Figure 7. If all of the links have not yet been classified, the process returns to step 202 and another unclassified link is selected.
  • Figure 7 provides a flowchart illustrating operations performed to identify a broken cluster, in accordance with an example embodiment.
  • a broken cluster corresponding to a broken link in example embodiments, may be a fully connected cluster of broken links and the immediately adjoining anchor links and containing the corresponding broken link.
  • the broken cluster may be identified by traversing the map in all directions from the broken link until an anchor link is reached. Each traversed broken link is added to the broken cluster. Information identifying each reached anchor link may also be added to and/or associated with the broken cluster.
  • a broken cluster may be identified in the updated map information/data, the previous map information/data, or both.
  • each link classified as a broken link may be labeled as an unresolved broken link.
  • An unresolved broken link may be selected at block 250.
  • the update apparatus 10 may select an unresolved broken link at step 250.
  • the update apparatus 10 may comprise means, such as the processor 12 and/or the like, for selecting an unresolved broken link.
  • the map may be followed in all directions starting from the selected broken link.
  • the update apparatus 10 may follow the map in all directions starting from the selected broken link.
  • the update apparatus 10 may comprise means, such as the processor 12, for following the map in all directions starting from the selected broken link.
  • the each link adjoining/adjacent the selected broken link may be assessed to determine if the link adjoining/adjacent link is an anchor link.
  • the update apparatus 10 may determine if the reached link is an anchor link.
  • the update apparatus 10 may comprise means, such as the processor 12 and/or the like, for determining if the reached link is an anchor link. For example, it may be determined if the reached link is classified as an anchor link. If it is determined that the reached link is not an anchor link, the process continues to step 252, and the map is continued to be followed until another link is reached.
  • the update apparatus 10 may add all of the broken links leading to the anchor link from the selected broken link and the anchor link to the broken cluster.
  • the update apparatus 10 may comprise means, such as the processor 12 and/or the like, for adding all of the broken links leading to the anchor link from the selected broken link and the anchor link to the broken cluster.
  • an anchor link has been reached in all directions. For example, it may be determined if there are no further directions that may be followed starting from the selected broken link along which an anchor link has not yet been reached.
  • the update apparatus 10 may determine if an anchor link has been reached in all directions.
  • the apparatus 10 may comprise means, such as the processor 12, for determining if an anchor link has been reached in all directions. If an anchor link has not yet been reached, the process continues to block 252, and the map is followed along a direction along which an anchor link has not yet been reached.
  • the process continues to block 260.
  • all the broken links in the broken cluster are marked as resolved.
  • the update apparatus 10 may mark all of the broken links of the broken cluster as resolved.
  • the update apparatus 10 may comprise means, such as the processor 12, for marking all of the broken links of the cluster as resolved. If there are broken links remaining that have not been resolved, another broken cluster may be identified. For example, if there are broken links remaining that are still marked unresolved, the process of identifying a broken cluster may be repeated for a selected one of the remaining broken links.
  • the update apparatus 10 may determine if there are any remaining unresolved broken links.
  • the update apparatus 10 may comprise means, such as processor 12 or the like, for determining if there are any remaining unresolved broken links. If it is determined at block 262 that there are one or more unresolved broken links remaining, the process returns to block 250 and one of the remaining unresolved broken links is selected.
  • the process continues to block 264.
  • the broken cluster(s) may be returned and/or provided.
  • the update apparatus 10 may return/provide the broken cluster(s).
  • the update apparatus 10 may comprise means, such as user interface 18, communications interface 16, processor 12, and/or the like, for returning the broken cluster(s).
  • the update apparatus 10 may provide (e.g., via the communication interface 16) one or more tiles of map update information/data (e.g., one or more tiles of a new version of a map).
  • a user apparatus 20 may receive (e.g., through the communication interface 26) the one or more tiles of map update information/data (e.g., one or more tiles of a new version of the map) and store the map update information/data locally (e.g., in memory 24).
  • the user apparatus 20 may then use the map update information/data (e.g., the one or more tiles of the new version of the map) to display a map region, navigate a route, and/or the like.
  • the user apparatus 20 may receive a first tile of map update information/data but not receive a second tile of map update information/data (and/or vice versa), wherein the first tile and the second tile are adjacent tiles in the map.
  • the user apparatus 20 may have to display a map region and/or navigate a route that encompasses both a new map version tile and a previous map version tile.
  • the user apparatus 20 may display a map region and/or navigate using mixed- version map tiles.
  • Figure 8 is a flowchart illustrating operations performed by the user apparatus 20 in order to display a map region and/or navigate using mixed-version map tiles, in accordance with an example embodiment. Starting at block 302, a map region of interest may be determined.
  • the map region of interest may be determined based on a route to be navigated, the current location of the user apparatus 20, the zoom level with which a map region is to be displayed, and/or the like.
  • the map region of interest is the map region that is to be displayed by the user interface 28 of the user apparatus 20.
  • a user apparatus 20 may determine a map region of interest.
  • the user apparatus 20 may comprise means, such as a processor 22, a user interface 28, a communications interface 26, sensors 30, and/or the like, for determining a map region of interest.
  • the map tiles in the map region of interest may be identified.
  • the user apparatus 20 may identify the map tiles in the map region of interest.
  • the user apparatus 20 may comprise means, such as the processor 22 or the like, for identifying the map tiles in the map region of interest.
  • the user apparatus 20 may determine if any of the boundaries of the map tiles in the map region of interest have a new change set or an old change set that is non-empty. In example embodiments, only map tile boundaries that are within the map region of interest are considered.
  • the user apparatus 20 may determine if any of the boundaries of the map tiles in the map region of interest have a non-empty change set corresponding thereto. For example, if a tile has a non-empty change set corresponding to a tile boundary that is not within the map region of interest, the nonempty change set may not affect the display or use of the map within the map region of interest.
  • the user apparatus 20 may comprise means, such as the processor 22 or the like, for determining if any of the boundaries of the map tiles in the map region of interest have a non-empty change set corresponding thereto.
  • the process continues to block 308.
  • the map update information/data is used/displayed for all of the map tiles for which the map update information/data is available (e.g., the map update information/data is stored in the memory 24).
  • the user apparatus 20 may use/display map update information/data for all of the map tiles for which the map update information/data is available.
  • the user apparatus 20 may comprise means, such as the processor 22, the user interface 28, and/or the like, for using/displaying map update information/data for all of the map tiles for which the map update information/data is available.
  • map update information/data is available for the two or more tiles that share the boundary at block 310.
  • the user apparatus 20 may determine if map update information/data is available for the two or more tiles that share the boundary corresponding to the non-empty change set (e.g., the boundary that intersects the broken cluster represented by the non-empty change set).
  • the user apparatus 20 may comprise means, such as the processor 22, the user interface 28, and/or the like, for determining if map update information/data is available for the two or more tiles that share the boundary corresponding to the non-empty change set.
  • map tile meta data may comprise a version indicator for the corresponding map tile.
  • the map tile meta data for each of the two or more tiles may be checked to determine the version of each map tile and determine if each of the two or more tiles are new map version tiles.
  • the updated map information/data is used/displayed at block 312.
  • the new change set information/data may be used.
  • the new version of the map may be used.
  • the user apparatus 20 may use/display the updated map information/data for the two or more tiles sharing the boundary corresponding to the non- empty change set.
  • the user apparatus may comprise means, such as a processor 22, user interface 28, and/or the like, for using/displaying the updated map information/data for the two or more tiles sharing the boundary corresponding to the non-empty change set.
  • the previous map information/data provided as the old change set is used/displayed at block 314.
  • the old change set information/data may be used.
  • the previous version of the map may be used.
  • the user apparatus 20 may use/display previous map information/data provided as the old change set.
  • the user apparatus may comprise means, such as a processor 22, user interface 28, and/or the like, for using/displaying the previous map information/data provided as the old change set for the two or more tiles sharing the boundary corresponding to the non-empty change set.
  • the used/displayed tile is the new version map tile except for the links of the broken cluster that comprise the non-empty change set. For example, if tile A is a new version map tile and shares a boundary with previous version map tile B that corresponds to a non-empty change set, the old change set information/data may be used/displayed for the portion of tile A along the boundary between tile A and tile B. If tile A shares another boundary with new version map tile C, new change set information/data may be used displayed along the boundary between tile A and tile C. Thus, the newest map information/data is used/displayed whenever it is possible to do so while keeping the map locally connected and functional.
  • the user apparatus 20 and/or update apparatus 10 of an example embodiment may be embodied by or associated with a variety of computing devices including, for example, such as a navigation system including an in-vehicle navigation system, a personal navigation device (PND) or a portable navigation device, an advanced driver assistance system (ADAS), a global positioning system (GPS), a cellular telephone, a mobile phone, a personal digital assistant (PDA), a watch, a camera, a computer, and/or other device that can perform navigation-related functions, such as digital routing and map display.
  • a navigation system including an in-vehicle navigation system, a personal navigation device (PND) or a portable navigation device, an advanced driver assistance system (ADAS), a global positioning system (GPS), a cellular telephone, a mobile phone, a personal digital assistant (PDA), a watch, a camera, a computer, and/or other device that can perform navigation-related functions, such as digital routing and map display.
  • a navigation system including an in-veh
  • the apparatus may be embodied in other types of computing devices, such as a server, a personal computer, a computer workstation, a laptop computer, a plurality of networked computing devices or the like, that are configured to analyze probe points for route planning or other purposes.
  • Figure 2 A depicts an update apparatus 10
  • Figure 2B depicts a user apparatus 20 of an example embodiment that may be embodied by various computing devices including those identified above.
  • the update apparatus 10 of an example embodiment may include, may be associated with or may otherwise be in communication with a processor 12 and a memory device 14 and optionally a communication interface 16 and/or a user interface 18.
  • a user apparatus 20 of an example embodiment may include, may be associated with, or may otherwise be in communication with a processor 22, and a memory device 24, and optionally a communication interface 26, a user interface 28, and/or one or more sensors 30 (e.g., a location sensor such as a GPS sensor).
  • a processor 22 may include, may be associated with, or may otherwise be in communication with a processor 22, and a memory device 24, and optionally a communication interface 26, a user interface 28, and/or one or more sensors 30 (e.g., a location sensor such as a GPS sensor).
  • the processor 12, 22 may be in communication with the memory device 14, 24 via a bus for passing information among components of the apparatus.
  • the memory device may be non-transitory and may include, for example, one or more volatile and/or non-volatile memories.
  • the memory device may be an electronic storage device (e.g., a computer readable storage medium) comprising gates configured to store data (e.g., bits) that may be retrievable by a machine (e.g., a computing device like the processor).
  • the memory device may be configured to store information, data, content, applications, instructions, or the like for enabling the apparatus to carry out various functions in accordance with an example embodiment of the present invention.
  • the memory device could be configured to buffer input data for processing by the processor.
  • the memory device could be configured to store instructions for execution by the processor.
  • the update apparatus 10 and/or user apparatus 20 may be embodied by a computing device.
  • the apparatus may be embodied as a chip or chip set.
  • the apparatus may comprise one or more physical packages (e.g., chips) including materials, components and/or wires on a structural assembly (e.g., a baseboard).
  • the structural assembly may provide physical strength, conservation of size, and/or limitation of electrical interaction for component circuitry included thereon.
  • the apparatus may therefore, in some cases, be configured to implement an embodiment of the present invention on a single chip or as a single "system on a chip.”
  • a chip or chipset may constitute means for performing one or more operations for providing the functionalities described herein.
  • the processor 12, 22 may be embodied in a number of different ways.
  • the processor may be embodied as one or more of various hardware processing means such as a coprocessor, a microprocessor, a controller, a digital signal processor (DSP), a processing element with or without an accompanying DSP, or various other processing circuitry including integrated circuits such as, for example, an ASIC (application specific integrated circuit), an FPGA (field programmable gate array), a microcontroller unit (MCU), a hardware accelerator, a special-purpose computer chip, or the like.
  • the processor may include one or more processing cores configured to perform independently.
  • a multi-core processor may enable multiprocessing within a single physical package.
  • the processor may include one or more processors configured in tandem via the bus to enable independent execution of instructions, pipelining and/or multithreading.
  • the processor 12, 22 may be configured to execute instructions stored in the memory device 14, 24 or otherwise accessible to the processor.
  • the processor may be configured to execute hard coded functionality.
  • the processor may represent an entity (e.g., physically embodied in circuitry) capable of performing operations according to an embodiment of the present invention while configured accordingly.
  • the processor when the processor is embodied as an ASIC, FPGA or the like, the processor may be specifically configured hardware for conducting the operations described herein.
  • the processor when the processor is embodied as an executor of software instructions, the instructions may specifically configure the processor to perform the algorithms and/or operations described herein when the instructions are executed.
  • the processor may be a processor of a specific device (e.g., a pass-through display or a mobile terminal) configured to employ an embodiment of the present invention by further configuration of the processor by instructions for performing the algorithms and/or operations described herein.
  • the processor may include, among other things, a clock, an arithmetic logic unit (ALU) and logic gates configured to support operation of the processor.
  • ALU arithmetic logic unit
  • the update apparatus 10 and/or user apparatus 20 may include a user interface 18, 28 that may, in turn, be in communication with the processor 12, 22 to provide output to the user, such as a proposed route, and, in some embodiments, to receive an indication of a user input.
  • the user interface may include a display and, in some embodiments, may also include a keyboard, a mouse, a joystick, a touch screen, touch areas, soft keys, a microphone, a speaker, or other input/output mechanisms.
  • the processor may comprise user interface circuitry configured to control at least some functions of one or more user interface elements such as a display and, in some embodiments, a speaker, ringer, microphone and/or the like.
  • the processor and/or user interface circuitry comprising the processor may be configured to control one or more functions of one or more user interface elements through computer program instructions (e.g., software and/or firmware) stored on a memory accessible to the processor (e.g., memory device 14, 24, and/or the like).
  • the update apparatus 10 and/or the user apparatus 20 may optionally include a communication interface 16, 26.
  • the communication interface may be any means such as a device or circuitry embodied in either hardware or a combination of hardware and software that is configured to receive and/or transmit data from/to a network and/or any other device or module in communication with the apparatus.
  • the communication interface may include, for example, an antenna (or multiple antennas) and supporting hardware and/or software for enabling communications with a wireless communication network.
  • the communication interface may include the circuitry for interacting with the antenna(s) to cause transmission of signals via the antenna(s) or to handle receipt of signals received via the antenna(s).
  • the communication interface may alternatively or also support wired communication.
  • the communication interface may include a communication modem and/or other hardware/software for supporting communication via cable, digital subscriber line (DSL), universal serial bus (USB) or other mechanisms.
  • a navigation system may also include or have access to a geographic database that includes a variety of data (e.g., map information/data) utilized in constructing a route or navigation path and determining the time to traverse the route or navigation path.
  • a geographic database may include node data records (e.g., including anchor node data records comprising junction identifiers), road segment or link data records, point of interest (POI) data records and other data records. More, fewer or different data records can be provided.
  • the other data records include cartographic ("carto") data records, routing data, and maneuver data.
  • One or more portions, components, areas, layers, features, text, and/or symbols of the POI or event data can be stored in, linked to, and/or associated with one or more of these data records.
  • one or more portions of the POI, event data, or recorded route information can be matched with respective map or geographic records via position or GPS data associations (such as using known or future map matching or geo-coding techniques), for example.
  • the road segment data records are links or segments, e.g., maneuvers of a maneuver graph, representing roads, streets, or paths, as can be used in the calculated route or recorded route information for determination of one or more personalized routes.
  • the node data records are end points corresponding to the respective links or segments of the road segment data records.
  • the road link data records and the node data records represent a road network, such as used by vehicles, cars, and/or other entities.
  • the geographic database can contain path segment and node data records or other data that represent pedestrian paths or areas in addition to or instead of the vehicle road record data, for example.
  • the road/link segments and nodes can be associated with attributes, such as geographic coordinates, street names, address ranges, speed limits, turn restrictions at intersections, and other navigation related attributes, as well as POIs, such as gasoline stations, hotels, restaurants, museums, stadiums, offices, automobile dealerships, auto repair shops, buildings, stores, parks, etc.
  • the geographic database can include data about the POIs and their respective locations in the POI data records.
  • the geographic database can also include data about places, such as cities, towns, or other communities, and other geographic features, such as bodies of water, mountain ranges, etc. Such place or feature data can be part of the POI data or can be associated with POIs or POI data records (such as a data point used for displaying or representing a position of a city).
  • the geographic database can include and/or be associated with event data (e.g., traffic incidents, constructions, scheduled events, unscheduled events, etc.) associated with the POI data records or other records of the geographic database.
  • the geographic database can be maintained by the content provider (e.g., a map developer) in association with the services platform.
  • the map developer can collect geographic data to generate and enhance the geographic database.
  • the map developer can employ field personnel to travel by vehicle along roads throughout the geographic region to observe features and/or record information about them, for example.
  • remote sensing such as aerial or satellite photography, can be used.
  • the geographic database can be a master geographic database stored in a format that facilitates updating, maintenance, and development.
  • the master geographic database or data in the master geographic database can be in an Oracle spatial format or other spatial format, such as for development or production purposes.
  • the Oracle spatial format or development/production database can be compiled into a delivery format, such as a geographic data files (GDF) format.
  • GDF geographic data files
  • the data in the production and/or delivery formats can be compiled or further compiled to form geographic database products or databases, which can be used in end user navigation devices or systems.
  • geographic data is compiled (such as into a platform specification format (PSF) format) to organize and/or configure the data for performing navigation- related functions and/or services, such as route calculation, route guidance, map display, speed calculation, distance and travel time functions, and other functions.
  • the navigation- related functions can correspond to vehicle navigation or other types of navigation.
  • the compilation to produce the end user databases can be performed by a party or entity separate from the map developer.
  • a customer of the map developer such as a navigation device developer or other end user device developer, can perform compilation on a received geographic database in a delivery format to produce one or more compiled navigation databases.
  • a navigation system that embodies an apparatus 10 in accordance with an example embodiment may determine the time to traverse a route that includes one or more turns at respective intersections more accurately.
  • FIGS 4, 6, and 7 illustrate flowcharts of apparatuses 10, 20, method, and computer program product according to example embodiments of the invention.
  • each block of the flowcharts, and combinations of blocks in the flowcharts may be implemented by various means, such as hardware, firmware, processor, circuitry, and/or other devices associated with execution of software including one or more computer program instructions.
  • one or more of the procedures described above may be embodied by computer program instructions.
  • the computer program instructions which embody the procedures described above may be stored by the memory device 14, 24 of an apparatus employing an embodiment of the present invention and executed by the processor 12, 22 of the apparatus.
  • any such computer program instructions may be loaded onto a computer or other programmable apparatus (e.g., hardware) to produce a machine, such that the resulting computer or other programmable apparatus implements the functions specified in the flowchart blocks.
  • These computer program instructions may also be stored in a computer- readable memory that may direct a computer or other programmable apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture the execution of which implements the function specified in the flowchart blocks.
  • the computer program instructions may also be loaded onto a computer or other programmable apparatus to cause a series of operations to be performed on the computer or other programmable apparatus to produce a computer-implemented process such that the instructions which execute on the computer or other programmable apparatus provide operations for implementing the functions specified in the flowchart blocks.
  • blocks of the flowcharts support combinations of means for performing the specified functions and combinations of operations for performing the specified functions for performing the specified functions. It will also be understood that one or more blocks of the flowcharts, and combinations of blocks in the flowcharts, can be implemented by special purpose hardware-based computer systems which perform the specified functions, or combinations of special purpose hardware and computer instructions.
  • certain ones of the operations above may be modified or further amplified. Furthermore, in some embodiments, additional optional operations may be included. Modifications, additions, or amplifications to the operations above may be performed in any order and in any combination.

Landscapes

  • Engineering & Computer Science (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Automation & Control Theory (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Databases & Information Systems (AREA)
  • Navigation (AREA)
  • Instructional Devices (AREA)

Abstract

L'invention concerne des procédés, des appareils, des produits-programmes d'ordinateur et des systèmes relatifs à des mises à jour cartographiques partielles. Un mode de réalisation donné à titre d'exemple concerne un procédé comprenant l'étape consistant à recevoir des données cartographiques mises à jour comprenant une pluralité de liens. Un ou plusieurs liens nouveaux ou modifiés sont identifiés. Le procédé comprend en outre les étapes consistant à déterminer un tuilage des données cartographiques mises à jour et à déterminer, sur la base du tuilage des données cartographiques mises à jour, qu'une limite entre une première tuile et une seconde tuile coupe au moins l'un desdits un ou plusieurs liens nouveaux ou modifiés. Le procédé comprend en outre les étapes consistant à compiler une mise à jour cartographique sur la base des données cartographiques mises à jour, des données cartographiques précédentes comprenant au moins l'un des liens nouveaux ou modifiés croisés par la limite inter-tuiles, et le tuilage, et à procurer la mise à jour cartographique pour au moins la première tuile.
PCT/EP2017/060664 2016-05-06 2017-05-04 Assemblage de tuiles cartographiques de version mixte en navigation hybride pour mises à jour cartographiques partielles WO2017191259A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP17721382.4A EP3452783B1 (fr) 2016-05-06 2017-05-04 Assemblage de tuiles cartographiques de version mixte en navigation hybride pour mises à jour cartographiques partielles
CN201780027897.9A CN109073397B (zh) 2016-05-06 2017-05-04 用于提供部分地图更新的计算机实现的方法和设备

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US15/148,416 2016-05-06
US15/148,416 US9863774B2 (en) 2016-05-06 2016-05-06 Stitching mixed-version map tiles in hybrid navigation for partial map updates

Publications (1)

Publication Number Publication Date
WO2017191259A1 true WO2017191259A1 (fr) 2017-11-09

Family

ID=58669802

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2017/060664 WO2017191259A1 (fr) 2016-05-06 2017-05-04 Assemblage de tuiles cartographiques de version mixte en navigation hybride pour mises à jour cartographiques partielles

Country Status (4)

Country Link
US (1) US9863774B2 (fr)
EP (1) EP3452783B1 (fr)
CN (1) CN109073397B (fr)
WO (1) WO2017191259A1 (fr)

Families Citing this family (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10378909B2 (en) * 2016-05-06 2019-08-13 Here Global B.V. Stitching mixed-version map tiles in hybrid navigation for partial map updates
US10914607B2 (en) * 2017-03-07 2021-02-09 Here Global B.V. Method, apparatus and computer program product for providing route guidance to multiple points of interest
JP6828668B2 (ja) * 2017-12-04 2021-02-10 株式会社デンソー 車線ネットワークデータ生成装置、車線ネットワークデータ生成プログラム及び記憶媒体
CN109612475A (zh) * 2018-10-31 2019-04-12 百度在线网络技术（北京）有限公司 高精度电子地图的更新方法、装置及可读存储介质
US11402220B2 (en) * 2019-03-13 2022-08-02 Here Global B.V. Maplets for maintaining and updating a self-healing high definition map
US11096026B2 (en) * 2019-03-13 2021-08-17 Here Global B.V. Road network change detection and local propagation of detected change
US11796322B2 (en) * 2019-10-25 2023-10-24 Here Global B.V. Apparatus, method, and computer program product for updating link information on a client device
JP7276096B2 (ja) * 2019-11-22 2023-05-18 トヨタ自動車株式会社 情報処理装置、情報処理方法、およびシステム
US20230035071A1 (en) * 2020-01-08 2023-02-02 NNG Szoftverfejleszto és Kereskedelmi Kft. Map Data Updating Method And System
US11663911B2 (en) 2021-06-03 2023-05-30 Not A Satellite Labs, LLC Sensor gap analysis
US11670089B2 (en) 2021-06-03 2023-06-06 Not A Satellite Labs, LLC Image modifications for crowdsourced surveillance
CN114090706A (zh) * 2021-10-11 2022-02-25 深圳元戎启行科技有限公司 地图管理方法、装置及计算机可读存储介质

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2011002445A (ja) * 2009-05-18 2011-01-06 Denso Corp ナビゲーション装置及び地図更新システム
US20130117322A1 (en) * 2011-11-07 2013-05-09 Elektrobit Automotive Gmbh Technique for structuring navigation data
US20150377632A1 (en) * 2012-11-09 2015-12-31 Here Global B.V. Navigation System and Method

Family Cites Families (29)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3275190B2 (ja) * 1993-11-19 2002-04-15 本田技研工業株式会社 地図情報再生装置
US5893113A (en) * 1996-04-25 1999-04-06 Navigation Technologies Corporation Update transactions and method and programming for use thereof for incrementally updating a geographic database
JPH1165436A (ja) * 1997-08-21 1999-03-05 Toyota Motor Corp 地図データ選択支援装置、その支援装置を含む地図データ処理システムおよび処理装置
EP1134674A4 (fr) * 1998-11-24 2010-06-09 Panasonic Corp Structure de donn es d'un fichier cartographique num rique
US6343301B1 (en) * 1999-02-24 2002-01-29 Navigation Technologies Corp. Method and system for collecting data for updating a geographic database
JP2001012957A (ja) * 1999-06-29 2001-01-19 Mitsubishi Electric Corp カーナビゲーション用地図更新システムおよびカーナビゲーション端末
JP2001075967A (ja) * 1999-08-31 2001-03-23 Denso Corp 地図データの更新用情報作成方法及び地図データの差分更新システム
JP4064639B2 (ja) 2001-03-16 2008-03-19 松下電器産業株式会社 地図編集装置
JP2003044992A (ja) * 2001-07-31 2003-02-14 Pioneer Electronic Corp 通信ナビゲーションシステムにおける地図データの更新方法およびサーバ装置、記録媒体、通信ナビゲーション端末装置
JP2003042771A (ja) 2001-07-31 2003-02-13 Pioneer Electronic Corp 通信ナビゲーションシステムにおける地図データの更新方法およびサーバ装置、記録媒体、通信ナビゲーション端末装置
JP4162959B2 (ja) * 2002-09-27 2008-10-08 株式会社ザナヴィ・インフォマティクス 地図データ処理装置
JP4416996B2 (ja) 2002-11-01 2010-02-17 三菱電機株式会社 地図情報処理装置および地図情報提供装置
JP2004198811A (ja) 2002-12-19 2004-07-15 Denso Corp 電子機器及びプログラム
EP1785968B1 (fr) * 2004-07-29 2017-10-25 Hitachi, Ltd. Dispositif de livraison de données cartographiques, terminal de communication et procédé de livraison de carte
WO2006109625A1 (fr) * 2005-04-08 2006-10-19 Matsushita Electric Industrial Co., Ltd. Dispositif et procede de mise a jour d’informations de cartographie
JP4656023B2 (ja) * 2006-08-11 2011-03-23 株式会社デンソー 地図表示装置
JP5308621B2 (ja) 2006-10-05 2013-10-09 日立オートモティブシステムズ株式会社 地図データ配信システム
JP4156003B2 (ja) * 2006-10-12 2008-09-24 株式会社ゼンリン 地図情報管理システム及び地図情報配信システム
EP1944702B1 (fr) 2007-01-10 2018-07-25 Harman Becker Automotive Systems GmbH Base de données de navigation adaptée à être mise à jour
AU2007363086A1 (en) 2007-12-28 2009-07-09 Tele Atlas B.V. Method and apparatus for combining a first partition from a first digital map database and a second partition from a second digital map database
JP4905483B2 (ja) * 2009-03-05 2012-03-28 株式会社デンソー 地図データ更新装置および地図データ更新用プログラム
JP5440854B2 (ja) * 2010-01-29 2014-03-12 アイシン・エィ・ダブリュ株式会社 地図更新データ供給装置及び地図更新データ供給プログラム
US8521424B2 (en) * 2010-09-29 2013-08-27 Ford Global Technologies, Llc Advanced map information delivery, processing and updating
CN107063273B (zh) * 2011-05-19 2021-05-25 Sk 普兰尼特有限公司 实时地图数据更新系统和方法
US9202311B2 (en) 2012-02-10 2015-12-01 Google Inc. Accessing map tiles
US9123178B2 (en) * 2012-02-10 2015-09-01 Google Inc. Updating map tiles
US20150170386A1 (en) * 2012-02-10 2015-06-18 Google Inc. Managing updates to map tiles
DE102013200181A1 (de) * 2013-01-09 2014-07-10 Bayerische Motoren Werke Aktiengesellschaft Verfahren und Vorrichtung zum Verwalten von Kartendaten einer digitalen Karte einer Navigationseinrichtung
US9600146B2 (en) * 2015-08-17 2017-03-21 Palantir Technologies Inc. Interactive geospatial map

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2011002445A (ja) * 2009-05-18 2011-01-06 Denso Corp ナビゲーション装置及び地図更新システム
US20130117322A1 (en) * 2011-11-07 2013-05-09 Elektrobit Automotive Gmbh Technique for structuring navigation data
US20150377632A1 (en) * 2012-11-09 2015-12-31 Here Global B.V. Navigation System and Method

Also Published As

Publication number Publication date
CN109073397B (zh) 2022-04-26
EP3452783A1 (fr) 2019-03-13
US20170322036A1 (en) 2017-11-09
EP3452783B1 (fr) 2022-06-29
CN109073397A (zh) 2018-12-21
US9863774B2 (en) 2018-01-09

Similar Documents

Publication Publication Date Title
EP3452783B1 (fr) Assemblage de tuiles cartographiques de version mixte en navigation hybride pour mises à jour cartographiques partielles
US20210004013A1 (en) Lane-centric road network model for navigation
US11194847B2 (en) Method, apparatus, and computer program product for building a high definition map from crowd sourced data
US10502577B2 (en) Iterative map learning based on vehicle on-board sensor data
US10495470B2 (en) Map having computer executable instructions embedded therein
US10378909B2 (en) Stitching mixed-version map tiles in hybrid navigation for partial map updates
US10989553B2 (en) Method, apparatus and computer program product for determining likelihood of a route
US9983016B2 (en) Predicting short term travel behavior with unknown destination
US10899348B2 (en) Method, apparatus and computer program product for associating map objects with road links
US11193789B2 (en) Method, apparatus, and computer program product for identifying at-risk road infrastructure
EP3452784B1 (fr) Assemblage de tuiles cartographiques de version mixte en navigation hybride pour mises à jour cartographiques partielles
US9874449B2 (en) Efficient and error tolerant mapping from a source graph to a target graph
EP3351904A2 (fr) Procédé, appareil et programme informatique pour interface utilisateur de système de navigation
US9810539B2 (en) Method, apparatus, and computer program product for correlating probe data with map data
US11808601B2 (en) System and method for updating linear traffic feature data
US20230051155A1 (en) System and method for generating linear feature data associated with road lanes

Legal Events

Date Code Title Description
NENP Non-entry into the national phase

Ref country code: DE

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 17721382

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2017721382

Country of ref document: EP

Effective date: 20181206