WO2008047448A1 - Dispositif de mise à jour de données cartographiques, procédé de mise à jour de données cartographiques, programme de mise à jour de données cartographiques et support d'enregistrement - Google Patents

Dispositif de mise à jour de données cartographiques, procédé de mise à jour de données cartographiques, programme de mise à jour de données cartographiques et support d'enregistrement Download PDF

Info

Publication number
WO2008047448A1
WO2008047448A1 PCT/JP2006/320939 JP2006320939W WO2008047448A1 WO 2008047448 A1 WO2008047448 A1 WO 2008047448A1 JP 2006320939 W JP2006320939 W JP 2006320939W WO 2008047448 A1 WO2008047448 A1 WO 2008047448A1
Authority
WO
WIPO (PCT)
Prior art keywords
parcel
link
road
indicating
data
Prior art date
Application number
PCT/JP2006/320939
Other languages
English (en)
Japanese (ja)
Inventor
Ippei Nambata
Original Assignee
Pioneer Corporation
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 Pioneer Corporation filed Critical Pioneer Corporation
Priority to JP2008539659A priority Critical patent/JP4927860B2/ja
Priority to PCT/JP2006/320939 priority patent/WO2008047448A1/fr
Publication of WO2008047448A1 publication Critical patent/WO2008047448A1/fr

Links

Classifications

    • G—PHYSICS
    • G09—EDUCATION; CRYPTOGRAPHY; DISPLAY; ADVERTISING; SEALS
    • G09B—EDUCATIONAL OR DEMONSTRATION APPLIANCES; APPLIANCES FOR TEACHING, OR COMMUNICATING WITH, THE BLIND, DEAF OR MUTE; MODELS; PLANETARIA; GLOBES; MAPS; DIAGRAMS
    • G09B29/00—Maps; Plans; Charts; Diagrams, e.g. route diagram
    • 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/3878—Hierarchical structures, e.g. layering
    • 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/3807—Creation or updating of map data characterised by the type of data
    • G01C21/3815—Road data

Definitions

  • MAP DATA UPDATE DEVICE MAP DATA UPDATE METHOD
  • MAP DATA UPDATE PROGRAM AND STORAGE MEDIUM
  • the present invention relates to a method for updating map data.
  • map data used in a car navigation device or the like includes node data and link data.
  • the node data is data indicating a predetermined point on the road such as an intersection.
  • the link data is data indicating a link corresponding to a road.
  • Patent Document 1 proposes a method for giving a link ID to each link with a margin in advance.
  • this method multiple link IDs are assigned to one link as much margin as possible, and the number of link IDs used increases. Therefore, the data amount of the entire link data increases.
  • the link ID may be insufficient when the number of links increases.
  • Patent Document 1 Japanese Patent Application Laid-Open No. 2002-175593
  • the invention of claim 1 is a map data updating device, wherein link data indicating a link corresponding to a road, node data indicating a node corresponding to a predetermined point on the road, and a parcel
  • the link data includes a road ID indicating a road, an offset indicating the order of the first link in the parcel with reference to the start point of the road, and the order of each link in the parcel.
  • Storage means for storing in the storage unit map data including a link ID composed of an intra-parcel ID indicating a specific parcel when adding a new link on a specific road in the specific parcel. Update the intra-parcel ID after the new link, and include the offset of the parcel that includes the specific road and exists after the specific parcel.
  • new updating means characterized in that it comprises a.
  • the invention according to claim 5 is a map data updating method, comprising link data indicating a link corresponding to a road, and node data indicating a node corresponding to a predetermined point on the road,
  • the link data force A road ID indicating a road, a parcel ID indicating a parcel, an offset indicating the order of the first link in the parcel with reference to the start point of the road, and a parcel indicating the order of each link in the parcel
  • the Rukoto wherein the Rukoto.
  • the invention described in claim 6 is a map data update program executed in a terminal device including a storage unit and a computer, and includes link data indicating a link corresponding to a road, and a predetermined data on the road. Node data indicating a node corresponding to a point, and the link data indicates a road ID indicating a road, a parcel ID indicating a parcel, and an order of the first link in the parcel with reference to the start point of the road.
  • Storage means for storing map data including an offset and an ID in the parcel indicating the order of each link in the parcel in the storage unit, and when adding a new link on a specific road in the specific parcel In the parcel after the new link in the specific parcel
  • the computer is caused to function as an update means for updating an offset of a parcel that includes the specific road and exists after the specific parcel.
  • the invention according to claim 8 is a storage medium, and is link data indicating a link corresponding to a road, node data indicating a node corresponding to a predetermined point on the road, and a parcel ID indicating a parcel.
  • the link data includes a road ID indicating a road, an offset indicating the order of the first link in the parcel with reference to the start point of the road, and a parcel indicating the order of each link in the parcel. It is characterized by memorizing map data including link IDs composed of IDs.
  • FIG. 1 schematically shows the configuration of map data used in an embodiment of the present invention.
  • FIG. 4 is a diagram illustrating links and nodes.
  • FIG. 8 is a block diagram showing a configuration of a navigation device according to an embodiment.
  • FIG. 10 is a flowchart of data update processing for adding a new link.
  • FIG. 11 shows an example of a map data update system to which the present invention is applied.
  • the map data update device includes link data indicating a link corresponding to a road, node data indicating a node corresponding to a predetermined point on the road, and a parcel ID indicating a parcel.
  • the link data includes a road ID indicating a road, an offset indicating the order of the first link in the parcel with reference to the starting point of the road, and an in-parcel indicating the order of each link in the parcel.
  • the map data update device updates map data in response to addition of a link included in map data.
  • the map data includes link data indicating a link corresponding to a road, node data indicating a node corresponding to a predetermined point on the road, and a parcel ID indicating a parcel.
  • the link data includes a road ID indicating a road, an offset indicating the order of the first link in the parcel with reference to the start point of the road, and an intra-parcel ID indicating the order of each link in the parcel. Contains a link ID consisting of When a new link is added on a specific road in a specific parcel, the ID in the parcel after the new link in the parcel is updated. In addition, the offset of the parcel that includes the road and exists after the parcel that includes the road is updated.
  • each link in the parcel may be changed by changing only the offset. It is not necessary to change the parcel ID corresponding to. Therefore, the burden of the map data update process can be reduced.
  • the new link is 1
  • the updating unit increases the ID in the parcel and the offset by one each.
  • the map data is prepared for each of a plurality of layers corresponding to different scales, and the update unit performs update for each of the layers.
  • the same intra-parcel ID is assigned to the same link in the plurality of layers, and the layers other than the lowest layer are supported.
  • the ID in the parcel corresponding to the specific link is determined by the first and last ID in the parcel corresponding to the specific link in the lowest layer, or the first ID in the parcel. This is indicated by the difference between the parcel ID and the last parcel ID, and the updating means increases the first and last parcel IDs for layers other than the lowest layer.
  • the same link can be indicated by the same ID in a plurality of layers.
  • the map data update method includes link data indicating a link corresponding to a road and node data indicating a node corresponding to a predetermined point on the road.
  • the data includes a road ID indicating a road, a parcel ID indicating a parcel, an offset indicating the order of the first link in the parcel with reference to the start point of the road, and a parcel indicating the order of each link in the parcel.
  • the parcel corresponding to each link in the parcel can be changed by changing only the offset. Since it is not necessary to change the ID, the burden of the map data update process can be reduced.
  • a map data update program executed in a terminal device including a storage unit and a computer includes link data indicating a link corresponding to a road, a road Node data indicating a node corresponding to a predetermined point on the road, and the link data includes a road ID indicating a road, a parcel ID indicating a parcel, and a head in the parcel with reference to the start point of the road.
  • Storage means for storing map data including an offset indicating the order of links and an intra-parcel ID indicating the order of each link in the parcel in the storage unit, and on a specific road in the specific parcel
  • the computer is caused to function as an update means for updating.
  • this program By executing this program by a computer, the above map data updating apparatus can be realized. Further, this map data update program can be suitably handled in a state stored in a storage medium.
  • link data indicating a link corresponding to a road
  • node data indicating a node corresponding to a predetermined point on the road
  • a parcel ID indicating a parcel
  • the link data is composed of a road ID indicating a road, an offset indicating the position of the parcel set with reference to the starting point of the road, and an intra-parcel ID indicating the order of each link in the parcel.
  • a storage medium characterized by storing map data including.
  • FIG. 1 schematically shows the structure of map data used in this embodiment.
  • the map data has a hierarchical structure including a plurality of layers corresponding to a plurality of different scales.
  • FIG. 1 exemplifies map data of three layers for convenience of explanation, the map data may have a larger number of layer structures.
  • one unit of map data is called “Parcel! 3 ”.
  • “Parcel” is a concept indicating a geographically wide range, and can also be expressed as “block”, “mesh”, or the like.
  • layer 3 is the top layer and corresponds to the widest map.
  • Layer 1 is the lowest layer and corresponds to the most detailed map.
  • the map data 120 is prepared separately for each layer, and includes map display data 122 and route calculation data 124, respectively.
  • the map display data 122 is data used to display a map image to the user, and mainly includes image data corresponding to the map.
  • the route calculation data 124 is data used for route calculation by the route search function.
  • FIG. 2 shows the configuration of the route calculation data.
  • the route calculation data 124 includes node data 125 and link data 126.
  • the “node” corresponds to a predetermined point such as an intersection on the road, and the node data 125 is data indicating a node.
  • “link” corresponds to one section of the road divided by an intersection, etc., and link data 126 is data indicating a link.
  • FIGS. 4 (A) and 4 (B) Examples of nodes and links are shown in FIGS. 4 (A) and 4 (B).
  • a map including a plurality of roads 111 shown in FIG. 4 (A) includes a plurality of nodes and links as shown in FIG. 4 (B).
  • each node is indicated by a node ID (such as N00001) and each link is indicated by a link ID (such as LOOOO 1).
  • FIG. 3 shows an example of link data.
  • Figure 3 shows the areas corresponding to the four parcels. ID for each parcel is indicated by parcel ID (PID).
  • FIG. 3 shows areas corresponding to four parcels with parcel IDs “1” to “4”.
  • each parcel includes one or more nodes N indicated by white circles.
  • a road section divided by two adjacent nodes is a link.
  • a road ID is assigned to the road.
  • Figure 3 shows a road with a road ID of “5015”.
  • One road passes through several parcels.
  • an offset (OFST) is assigned.
  • the offset indicates the order of the top links in each parcel with the starting point of the road as a reference.
  • the offset indicates the starting link force in each parcel, and the number of links corresponding to the starting point of the road.
  • the “first link” refers to the link closest to the starting point of the road among a plurality of links in the parcel corresponding to the same road.
  • the offset of the parcel with “Parcel ID: 1” is “7833”. This indicates that the top link in the parcel is the 7833th link, including the starting point of the road. That is The offset is also information indicating the order of each parcel in a plurality of parcels through which a certain road passes.
  • IPID intra-parcel ID
  • the parcel ID is assigned to each parcel independently. Multiple links included in each parcel are given “0”, “1”, .. in-parcel IDs in the order of the direction force close to the starting point of the road.
  • the link ID indicating each link of the road is indicated as follows.
  • the number of the link counted from the starting point of the road is indicated by “offset + ID in parcel” that is not the serial number set in order of the starting point of the road.
  • the link ID is indicated by a combination of an offset indicating the order of the top links in the parcel and an ID in the parcel indicating the order of the links in the parcel.
  • the offset of the parcel of "PID: 1" is "7833" means that the number of start points of the road is counted and 7832 pieces of parcels are reached by the parcel. Indicates that a link exists.
  • the offset of the parcel of “PID: 2” located in the upper left of FIG. 3 is “7835”. There is only one link in this parcel, and “IPID: 0” is assigned to that link. Therefore, this link is the 7835th link including the starting point of the road.
  • the offset of the parcel of “PID: 3” located in the lower left of FIG. 3 is “7836”.
  • each link is indicated by “offset + parcel ID” that is not the serial number of the starting point force of the road, each link is unique while maintaining the order from the starting point of the road. Can be indicated by a simple link ID.
  • FIG. 5 shows an example of the data structure of link data.
  • Figure 5 shows a link for a parcel. It is an example of data.
  • the parcel ID is the ID of the parcel.
  • Each road ID is an ID of an individual road passing through the parcel.
  • an offset, link attributes, and multiple parcel IDs are set.
  • the “offset” indicates the head link order (serial number) of each road in the parcel based on the start point of the road.
  • “Link attribute” is information indicating the type of road (highway, prefectural road, etc.), width, coordinates, length, and the like. Usually, the road type of the same road is the same.
  • “Parcel ID” is a number indicating the order of each link in each parcel as shown in FIG. Using this information, the link ID corresponding to a link on a road is
  • FIG. 6 shows an example of link data in a certain area in detail.
  • level 3 shows a parcel of “PID: 3-1”.
  • the power corresponding to a part of them is a parcel of level 2 “PID: 2-1”, and a part of that is a parcel of level 1 “PID: 1—1”.
  • the ID in the parcel (IPID) of the lowest layer is indicated by a single number such as 0, 1, 2,.
  • the intra-parcel ID corresponding to each link is determined by the intra-parcel ID of the first link and the last link among the multiple links corresponding to the link in the lower layer. Indicated. That is,
  • IPID (first link number) (last link number)
  • FIG. 7 shows an example in which a new road (new link) is added in the area of FIG. Specifically, a new link is added in the middle of the link of “IPID: 3” in the parcel of “PID: 1-1” of level 1 in FIG.
  • the offset of the parcel of the level 1 “PID: 1-2” is “45”.
  • the offset of the parcel is “46”. . This is because a new link was added in the “PID: 1-1” parcel preceding this parcel. That is, as described above, the offset indicates the order (serial number) of the first link in the parcel with reference to the starting point of the road. Therefore, if the link increases by one in the preceding parcel, The offset of all subsequent parcels that the road passes will increase by one.
  • IPID: 3-10 is changed to“ IPID: 3-10 ”.
  • IDs in the parcels of all the links that follow are incremented by 1 for the “first link number” and “last link number” respectively.
  • IPIDs of the subsequent links in the parcel are all shifted by 1 so that “IPID: 30-45” becomes ⁇ : 31-46, “IPID: 101-105” becomes “IPID: 102-106”, Each is changed.
  • the link ID is indicated by “road ID + offset + in-parcel ID”. Therefore, when one new link is added to a road, the link of each level Only the following update process is required for the data.
  • backward in the following description means a direction force method toward the rear, that is, the end point in the order from the start point of a certain road.
  • the link ID is indicated by “road ID + offset + in-parcel ID”, and the in-parcel ID is assigned independently in units of parcels.
  • the number of digits in the parcel ID can be reduced compared with the case where link IDs are assigned serially to all links without introducing an offset, resulting in a reduction in the overall data volume. can do.
  • FIG. 8 shows a configuration of the navigation apparatus 100 according to the embodiment of the present invention.
  • the navigation device 100 includes a self-supporting positioning device 10, a GPS receiver 18, a system controller 20, a disk drive 31, a data storage unit 36, a communication interface 37, a communication device 38, a display unit 40, An audio output unit 50 and an input device 60 are provided.
  • the independent positioning device 10 includes an acceleration sensor 11, an angular velocity sensor 12, and a distance sensor 13.
  • the acceleration sensor 11 is made of, for example, a piezoelectric element, detects the acceleration of the vehicle, and outputs acceleration data.
  • the angular velocity sensor 12 also has a vibration gyro force, for example, detects the angular velocity of the vehicle when the vehicle changes direction, and outputs angular velocity data and relative bearing data.
  • the distance sensor 13 measures a vehicle speed pulse having a pulse signal force that is generated as the vehicle wheel rotates.
  • the GPS receiver 18 receives radio waves 19 carrying downlink data including positioning data from a plurality of GPS satellites.
  • the positioning data is used to detect the absolute position of the vehicle from latitude and longitude information.
  • the system controller 20 includes an interface 21, a CPU (Central Processing Unit) 22, a ROM (Read Only Memory) 23, and a RAM (Random Access Memory) 24, and controls the entire navigation device 200.
  • a CPU Central Processing Unit
  • ROM Read Only Memory
  • RAM Random Access Memory
  • the interface 21 performs an interface operation with the acceleration sensor 11, the angular velocity sensor 12, the distance sensor 13 and the GPS receiver 18. From these, vehicle speed pulses, acceleration data, relative bearing data, angular velocity data, GPS positioning data, absolute bearing data, and the like are input to the system controller 20.
  • the CPU 22 controls the entire system controller 20.
  • the ROM 23 includes a nonvolatile memory (not shown) in which a control program for controlling the system controller 20 is stored.
  • the RAM 24 stores various data such as route data set in advance by the user via the input device 60 so as to be readable, and provides a working area to the CPU 22.
  • System controller 20 disk drive 31 such as CD-ROM drive or DVD-ROM drive, data storage unit 36, communication interface 37, display unit 40, audio output unit 50 and input device 60 are bus lines 30 They are connected to each other via.
  • the disc drive 31 reads out and outputs content data such as music data and video data from the disc 33 such as a CD or DVD under the control of the system controller 20.
  • the disk drive 31 may be either a CD-ROM drive or a DVD-ROM drive, or may be a CD and DVD compatible drive.
  • the data storage unit 36 is composed of, for example, an HDD and stores various data used for navigation processing such as map data and facility data.
  • the communication device 38 is, for example, an FM tuner, a beacon receiver, a mobile phone, or a dedicated communication device. It consists of communication cards, etc., and receives traffic information such as traffic congestion and traffic information distributed from the VICS (Vehicle Information Communication System) center and other information via the communication interface 37.
  • VICS Vehicle Information Communication System
  • the display unit 40 displays various display data on a display device such as a display under the control of the system controller 20.
  • the system controller 20 reads map data from the data storage unit 36.
  • the display unit 40 displays the map data read from the data storage unit 36 by the system controller 20 on a display screen such as a display.
  • the display unit 40 includes a graphic controller 41 that controls the entire display unit 40 based on control data sent from the CPU 22 via the bus line 30 and image information that can be displayed immediately, such as a VRAM (Video RAM).
  • a display memory 43 that temporarily stores data, a display controller 43 that controls display of a display 44 such as a liquid crystal display or a CRT (Cathode Ray Tube) based on image data output from the graphic controller 41, and a display 44 are provided.
  • the display 44 is, for example, a liquid crystal display device having a diagonal angle of about 5 to 10 inches and is mounted near the front panel in the vehicle.
  • the audio output unit 50 is a digital to analog (DZA) of audio digital data sent from the CD-ROM drive 31 or DVD-ROM 32 or RAM 24 via the bus line 30 under the control of the system controller 20.
  • DZA converter 51 that performs conversion
  • AMP amplifier
  • speaker 53 that converts the amplified audio analog signal into audio and outputs it to the vehicle. It is configured with.
  • the input device 60 includes keys, switches, buttons, a remote controller, a voice input device, and the like for inputting various commands and data.
  • the input device 60 is arranged around the front panel and the display 44 of the main body of the in-vehicle electronic system mounted in the vehicle.
  • the display 44 is a touch panel system
  • the touch panel provided on the display screen of the display 44 also functions as the input device 60.
  • the CPU 22 functions as the updating means in the present invention by executing a map data update program stored in advance in the ROM 23 or the like. Further, the map data illustrated in FIG. 1 is stored in the data storage unit 36 as a storage unit. [0064] [Data update process]
  • Figure 9 (A) shows the format of link data update information.
  • the link data update information is information that is prepared when one new link is added to a plurality of links constituting a road.
  • the data update process described later executes data update accompanying the tracking of a new link based on this link data update information.
  • the link data update information includes additional link information, deletion link information, and change link information.
  • the additional link information includes the parcel ID, road, offset, parcel ID and link attribute for the new link to be added.
  • the deleted link information includes the road ID, offset, and parcel ID of the link that will be deleted when the new link is added.
  • the changed link information includes an intra-parcel ID and a link attribute that are changed as a new link is added.
  • FIG. 9B shows an example (level 1) of link data update information corresponding to the example of adding a new link described with reference to FIGS. 6 and 7.
  • a new link was added to the link of “IPID: 3” in the parcel of level 1 “PID: 1—1”.
  • the parcel ID in the additional link information is “1”.
  • the road ID is “0” and the offset is “40”.
  • the ID in the parcel in the additional link information is “3”.
  • level 2 and level 3 link data update information are shown in FIGS. 9 (C) and 9 (D).
  • Figure 10 shows the flowchart of data update processing. Show.
  • the CPU 22 executes the map data update program
  • the navigation device 100 operates as the map data update device and executes the data update process.
  • the map data update program for executing the above map data is executed on the navigation device, and the link data update information described above is input, so that it is stored in the navigation device. Map data can be updated.
  • FIGS. 9 (B) to 9 (D) It is assumed that the link data update information illustrated in FIGS. 9 (B) to 9 (D) is prepared in advance as a premise for executing the data update process.
  • the flowchart shown in FIG. 10 corresponds to one level of map data.
  • the map data is composed of three levels, the data update process is executed individually for each level based on the link data update information of each level.
  • the CPU 22 reads the corresponding parcel with reference to the additional link information in the prepared link data update information (step S10), and refers to the deletion link information to generate a link to be deleted. Delete from data (step Sl l). Through this process, in the example of FIGS. 6 and 7, the link “IPID: 3” in the original data shown in FIG. 6 is deleted.
  • the CPU 22 refers to the added link information and the changed link information, and adds the new link and the changed link to the original data (step S12).
  • new links of “I PID: 3” and “IPID: 4” are created in the previous example.
  • the CPU 22 rewrites the intra-parcel ID of the subsequent link in the parcel (that is, increments the intra-parcel ID by 1) (step S13).
  • the “IPID: 4” link in FIG. 6 is rewritten to “IPID: 5”.
  • step S14 determines whether or not the link to be processed has reached the end of the road. If the link has reached the end of the road (step S14; Yes), the data update process is terminated. . On the other hand, if the road has not reached the end of the road (step S14; No), it is determined whether or not the link to be processed has reached the boundary of the parcel (step S15). In this way, step S13 is repeated until reaching the boundary of the parcel to which a new link is added, and the intra-parcel IDs of all links existing after the new link are incremented by one.
  • step S15 When the intra-parcel IDs of all subsequent links in the parcel are rewritten and the link to be processed reaches the parcel boundary (step S15; Yes), the CPU 22 proceeds to the subsequent parcel. (Step S16) and rewrite the offset of the parcel (ie, increment it by 1) (step S17). The CPU 22 repeats the processes of steps S16 and S17 until the end of the road is found in the parcel (step S18; Yes). This completes the offset rewriting for all parcels located behind the parcel targeted for the new link follow-up.
  • the map data update device of the present invention is applied to a navigation device.
  • the present invention can also be implemented in a terminal device such as a PC that handles map data. For example, as shown in FIG. 10, by downloading and executing the map data update program and link data update information from the server 101 to the terminal device 150 such as a PC or the navigation device 100 via the network 105, the terminal device 150 Map data in the navigation system can be updated.
  • link data update information is prepared for each level of map data, and the data update process is executed for each level.
  • link data update information is prepared at the lowest level and data update processing is performed. For higher levels, link data update information is not prepared and the lowest level is prepared. It is also possible to update based on the link data after the data update.
  • one offset is set for each parcel.
  • one parcel may be divided into a plurality of sub-parcels, and a sub-offset may be set for each sub-parcel.
  • the parcel ID is expressed as “sub-offset + sub-parcel ID” in sub-parcel units. It is good as a thing.
  • the intra-parcel ID corresponding to the specific link is a plurality of intra-parcel IDs corresponding to the link in the lowest layer.
  • the first and last parcel ID are indicated.
  • the link 2 link corresponding to the links “0 3 10:10” to “0 3 10:15” going to the lowest layer 1 is expressed as “IPID: 10-15”.
  • it may be indicated by the first parcel ID in the lowest layer and the difference between the first and last parcel ID.
  • the above example may be expressed as “1-10: 10 (in the first parcel 10) +5 (difference)”.
  • all intra-parcel IDs are stored as link data. Instead, when the parcel ID is not stored and the parcel ID is required, the parcel ID may be obtained by counting the number of links from the head of each parcel.
  • the force storing the offset for each parcel instead, the offset corresponding to one road is separated as offset data independent of the data of each parcel. It may be configured. In this way, in the data update process for adding the new link, the offset rewrite process for the plurality of parcels only needs to be performed on the offset data, so that the processing time can be shortened. it can. Alternatively, a system may be used in which the offset data is replaced partially or entirely instead of rewriting independent offset data.
  • the road ID and the offset are separate data.
  • the road ID and the offset may be integrated data! /.
  • the present invention can be applied to various terminal devices that store and use map data. Specifically, it was downloaded from a server on the web in addition to the car navigation system. Map data is stored in HDD etc. and can be applied to terminal devices.

Landscapes

  • Engineering & Computer Science (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Automation & Control Theory (AREA)
  • Databases & Information Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Mathematical Physics (AREA)
  • Business, Economics & Management (AREA)
  • Educational Administration (AREA)
  • Educational Technology (AREA)
  • Navigation (AREA)
  • Instructional Devices (AREA)
  • Traffic Control Systems (AREA)

Abstract

L'invention concerne un dispositif de mise à jour de données cartographiques qui met à jour des données cartographiques conformément à l'addition d'une liaison incluse dans des données cartographiques ou similaires. Ces données cartographiques comprennent des données de liaison indiquant des liaisons correspondant à des routes, des données de noeud indiquant des noeuds correspondant à des endroits prédéterminés sur les routes et des identifications de parcelle indiquant des parcelles. Par ailleurs, ces données de liaison comprennent des identifications de liaison constituées d'identification de routes indiquant des routes, des déviations indiquant des ordres de direction de liaisons dans les parcelles en référence au départ des routes et, des identifications dans les parcelles indiquant un ordre de chaque liaison dans la parcelle. Lorsqu'une nouvelle liaison est ajoutée sur une route spécifique dans une parcelle spécifique, une identification dans la parcelle d'une liaison suivante vers cette nouvelle liaison dans la parcelle est mise à jour. Des déviations comprenant la route et des parcelles suivant la parcelle comprenant la route sont mises à jour.
PCT/JP2006/320939 2006-10-20 2006-10-20 Dispositif de mise à jour de données cartographiques, procédé de mise à jour de données cartographiques, programme de mise à jour de données cartographiques et support d'enregistrement WO2008047448A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
JP2008539659A JP4927860B2 (ja) 2006-10-20 2006-10-20 地図データ更新装置、地図データ更新方法、地図データ更新プログラム、及び、記憶媒体
PCT/JP2006/320939 WO2008047448A1 (fr) 2006-10-20 2006-10-20 Dispositif de mise à jour de données cartographiques, procédé de mise à jour de données cartographiques, programme de mise à jour de données cartographiques et support d'enregistrement

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP2006/320939 WO2008047448A1 (fr) 2006-10-20 2006-10-20 Dispositif de mise à jour de données cartographiques, procédé de mise à jour de données cartographiques, programme de mise à jour de données cartographiques et support d'enregistrement

Publications (1)

Publication Number Publication Date
WO2008047448A1 true WO2008047448A1 (fr) 2008-04-24

Family

ID=39313706

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2006/320939 WO2008047448A1 (fr) 2006-10-20 2006-10-20 Dispositif de mise à jour de données cartographiques, procédé de mise à jour de données cartographiques, programme de mise à jour de données cartographiques et support d'enregistrement

Country Status (2)

Country Link
JP (1) JP4927860B2 (fr)
WO (1) WO2008047448A1 (fr)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPWO2010004655A1 (ja) * 2008-07-11 2011-12-22 パイオニア株式会社 情報処理装置、ナビゲーション装置、情報更新方法、情報検索方法、情報更新プログラム、情報検索プログラム、および記録媒体
EP2589931A1 (fr) * 2011-11-07 2013-05-08 Elektrobit Automotive GmbH Technique pour structurer les données de navigation
JP2016114698A (ja) * 2014-12-12 2016-06-23 株式会社トヨタマップマスター 地図データ処理装置、その方法、そのコンピュータプログラム及びそのコンピュータプログラムを記録した記録媒体
CN108241494A (zh) * 2016-12-23 2018-07-03 乐视汽车（北京）有限公司 车辆电子控制单元升级方法、装置、车辆控制电路和车辆
CN108243141A (zh) * 2016-12-23 2018-07-03 乐视汽车（北京）有限公司 车辆终端程序升级方法、装置和车辆终端

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2003090735A (ja) * 2001-04-19 2003-03-28 Navigation Technol Corp 分散型計算アーキテクチャによるナビゲーション・システム

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2003090735A (ja) * 2001-04-19 2003-03-28 Navigation Technol Corp 分散型計算アーキテクチャによるナビゲーション・システム

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
"Kiwi-W Consotium, Car Navigation System -Kokaigata Data Koho KIWI to Sono Riyo Hoho-", vol. 1ST ED., 25 February 2003, JIKUKAN GIS TO OYO SERIES, ISBN: 4-320-12057-4, pages: 23, XP003022357 *

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPWO2010004655A1 (ja) * 2008-07-11 2011-12-22 パイオニア株式会社 情報処理装置、ナビゲーション装置、情報更新方法、情報検索方法、情報更新プログラム、情報検索プログラム、および記録媒体
EP2589931A1 (fr) * 2011-11-07 2013-05-08 Elektrobit Automotive GmbH Technique pour structurer les données de navigation
US20130117322A1 (en) * 2011-11-07 2013-05-09 Elektrobit Automotive Gmbh Technique for structuring navigation data
US9507808B2 (en) 2011-11-07 2016-11-29 Elektrobit Automotive Gmbh Technique for structuring navigation data
JP2016114698A (ja) * 2014-12-12 2016-06-23 株式会社トヨタマップマスター 地図データ処理装置、その方法、そのコンピュータプログラム及びそのコンピュータプログラムを記録した記録媒体
CN108241494A (zh) * 2016-12-23 2018-07-03 乐视汽车（北京）有限公司 车辆电子控制单元升级方法、装置、车辆控制电路和车辆
CN108243141A (zh) * 2016-12-23 2018-07-03 乐视汽车（北京）有限公司 车辆终端程序升级方法、装置和车辆终端

Also Published As

Publication number Publication date
JPWO2008047448A1 (ja) 2010-02-18
JP4927860B2 (ja) 2012-05-09

Similar Documents

Publication Publication Date Title
JP4197724B2 (ja) 地点検索装置、ナビゲーション装置、地点検索方法並びに地点検索プログラム及びこの地点検索プログラムを記録した情報記録媒体
JP3967186B2 (ja) ナビゲーション装置、その施設情報更新方法、そのプログラム、および、そのプログラムを記録した記録媒体
WO2006132065A1 (fr) Dispositif de navigation, méthode de mise à jour de données et programme de mise à jour de données
JP4376295B2 (ja) 車載用ナビゲーション装置及び地図表示方法
JP4381466B2 (ja) 情報提供装置、情報提供方法、及び情報提供プログラム
JP4927860B2 (ja) 地図データ更新装置、地図データ更新方法、地図データ更新プログラム、及び、記憶媒体
JP2000258177A (ja) ナビゲーション装置及び記録媒体
US20050021510A1 (en) Data search apparatus and method, navigation apparatus and method, data set and computer program product for data search
JP5570615B2 (ja) 情報生成装置、情報生成方法、情報生成プログラム及び記憶媒体
JP2008122266A (ja) 経路探索装置、経路探索方法、経路探索プログラム及び記憶媒体
JP3569393B2 (ja) データ放送受信機
JP2008101977A (ja) 経路探索装置、経路探索方法、及び経路探索プログラム
JP4575491B2 (ja) ナビゲーション装置及びナビゲーション方法
JP4955774B2 (ja) 地図情報表示装置、地図情報表示方法、地図情報表示プログラム及び記憶媒体
WO2008044281A1 (fr) Dispositif, procédé et logiciel de recherche d'itinéraire, et support d'enregistrement
JP2006309581A (ja) ナビゲーションシステム、キャッシュメモリ及びキャッシュ管理方法
JP2008145193A (ja) 経路探索装置、経路探索方法、経路探索プログラム及び記憶媒体
JP4040937B2 (ja) カーナビゲーション装置
JP2002350162A (ja) 経路探索表示装置
JP2010086399A (ja) 施設検索装置、施設検索方法、施設検索システム及び施設検索プログラム
JP5526831B2 (ja) 図面データ管理装置
WO2012095974A1 (fr) Dispositif de mise à jour de données de carte, procédé de mise à jour de données de carte, programme de mise à jour de données de carte et système de mise à jour de données de carte
JP5619920B2 (ja) 情報処理装置、情報処理方法及び情報処理プログラム、並びに情報処理システム
JP2000283777A (ja) 車載用ナビゲーション装置
JP2005308542A (ja) ナビゲーション装置

Legal Events

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

Ref document number: 06822000

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 2008539659

Country of ref document: JP

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 06822000

Country of ref document: EP

Kind code of ref document: A1