WO2006085412A1 - 地図情報処理装置および地図情報の記憶媒体 - Google Patents
地図情報処理装置および地図情報の記憶媒体 Download PDFInfo
- Publication number
- WO2006085412A1 WO2006085412A1 PCT/JP2005/020874 JP2005020874W WO2006085412A1 WO 2006085412 A1 WO2006085412 A1 WO 2006085412A1 JP 2005020874 W JP2005020874 W JP 2005020874W WO 2006085412 A1 WO2006085412 A1 WO 2006085412A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- link
- node
- map
- data
- information
- Prior art date
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/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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
Definitions
- the present invention relates to a map information processing apparatus and map information storage medium for processing map information, and more particularly to a data structure for facilitating updating of map data included in map information.
- a road network is a point on a road as shown in Non-Patent Document 1, for example.
- This is expressed by using a plurality of link strings that represent a series of roads as a series of links in a road network represented by a node representing a road and a link representing a road between points.
- the link string includes information on nodes and links, and each of the plurality of link strings has the same node information indicating the identity of the nodes.
- the connection relationship is displayed.
- Patent Document 1 enables efficient navigation processing even when differential data related to road data update is efficiently accessed and the differential data is reflected in the original road data.
- a differential update data creation device for navigation This differential update data creation device indicates new roads and roads that have been updated based on the existing roads and their connection points, as well as a plurality of navigation road data that conforms to a predetermined format.
- Differential update data including one road data indicating the connection point and the same road data that is the same as the new road or the existing road connected to the connection point and other road data indicating the connection point
- a second creation means for creating a total
- Non-Patent Document 1 “KIWI Format Ver. 1. 10”, KIWI Review Committee, 7. 2. Road Data Frame
- Patent Document 1 Japanese Patent Application Laid-Open No. 2004-198321
- the same node information provided in each node of the link row indicates the node of the other link row that is the same as the node of the certain link row.
- all nodes that appear until the node power of a certain link row is sequentially returned to the first node after passing through the nodes of another link row are determined to be the same node. This makes it possible to know that the links in each link row connected to these nodes are connected.
- a link string number for designating a link string and a node number in the link string for designating a node are used as the same node information.
- the link string number is the order of the link string
- the node number in the link string is the order of the nodes in the link string.
- the entry link to the node and the exit link of the node force are expressed using the order in which the nodes appear when the nodes are picked up according to the same node information. This order is Because the link sequence that appears while hitting a node according to the same node information changes when it is abolished or newly established, even if a link sequence that is not related to itself is abolished or newly established, the existing entry link force escapes The information representing the traffic restrictions on the link must also be changed. Therefore, there is a problem that the amount of data to be updated increases and the update process becomes complicated.
- the map data includes route guidance data indicating guidance information at intersections as node-related information, and is provided for each node in the address information counter row indicating the storage location of the route guidance data. Therefore, the storage location of existing route guidance data changes due to the abolition or new establishment of nodes or links. Therefore, there is a problem that the address information indicating the storage position of the route guidance data in the existing link string must be changed, and the amount of data to be updated increases and the update process becomes complicated.
- the present invention has been made to solve the above-described problem, and when a road or an intersection is newly established or abolished, the amount of data for instructing the update can be reduced. It is an object of the present invention to provide a map information processing apparatus and a map information storage medium that can perform update processing easily and quickly.
- a map information processing apparatus includes a map information storage device that stores map information including map data, and a processor that updates the map information stored in the map information storage device.
- road network data included in map data stored in a map information storage device is a sequence of roads in a road network represented by nodes representing points on the road and links representing roads between the points.
- the link string force is also expressed as a series of links connected by nodes, and the link string is represented by a link string record in which the link records that define the links are arranged in the order of the link string.
- a node identifier that gives a unique and invariant link identifier to a node included in the link string is a link that has that node as one end. It is configured to have a data structure represented by using the link identifier, Ru.
- a map information processing apparatus includes a map information storage device that stores map information including map data, and a program that updates map information stored in the map information storage device.
- the road network data included in the map data stored in the map information storage device is represented by a node representing a point on the road and a link representing a road between the points.
- a link string force that expresses a series of roads in a road network as a series of links connected by nodes is also provided.
- a link series is represented by a link series record in which the link records that define the links are arranged in the order of the series of links. Data that assigns the same node identifier that is unique and unchanged between the same nodes to the same node included in the column, and indicates the link that enters or leaves the node using the same node identifier. Constructed to have a structure.
- a storage medium for computer-readable map information provides a road network in a road network represented by nodes representing points on the road and links representing roads between the points.
- Link string force expressed as a series of linked links.
- the link string is represented by a link string record in which the link records that define the links are arranged in the order of the link string, and is unique to the links constituting the link string.
- the node designation information for assigning an invariable link identifier and indicating a node included in the link string includes road network data having a data structure represented using the link identifier of the link having the node as one end. Stores map data.
- the node instruction information is expressed using the link identifier that is unique and invariant to the links constituting the link string. It remains unchanged regardless of the discontinuation or establishment of other link columns or links. Accordingly, it is not necessary to update the node instruction information due to the abolition or establishment of other link strings or links, so the amount of data for instructing the update can be reduced, and the update process can be performed easily and quickly. Can be done.
- the unique and invariant identical node identifier that does not depend on the order of the sequence of link string records is used to indicate the link that enters or leaves the node. Therefore, it is not necessary to update the same node identifier due to deletion of irrelevant link string or new establishment. Therefore, the amount of data for instructing the update can be reduced, and the update process can be performed easily and quickly.
- this storage medium to the map information processing apparatus, Similar to the map information processing apparatus according to the first aspect of the invention, it is possible to reduce the amount of data for instructing update, and to realize map information processing that can perform update processing easily and quickly.
- ⁇ 1] is a block diagram showing the configuration of the map information processing apparatus according to Embodiment 1 of the present invention.
- FIG. 2 is a diagram showing a schematic data structure of map information stored in the map information storage device shown in FIG.
- FIG. 3 is a diagram showing an example of a road network in a rectangular region at the bottom layer representing the most detailed road network used in the map information processing apparatus according to Embodiment 1 of the present invention.
- FIG. 4 is a diagram showing an example of a road network in which the road network shown in FIG. 3 is represented using a link string.
- FIG. 5 is a diagram showing an example of a data structure of road network data used in the map information processing apparatus according to Embodiment 1 of the present invention.
- FIG. 6 is a diagram showing an example of a data structure of a link string record shown in FIG.
- FIG. 7 is a diagram showing an example of the data structure of route guidance data used in the map information processing apparatus according to Embodiment 1 of the present invention.
- FIG. 5 is a diagram showing an example of road network data representing the road network shown in FIG.
- FIG. 9 is a diagram showing an example of traffic regulation information when there is traffic regulation for the road network shown in FIG.
- FIG. 10 is a diagram showing an example of route guidance data in which a route guidance record is provided as node-related information for the road network of FIG.
- FIG. 11 is a diagram showing a schematic data structure of map update information stored in an update DVD-ROM inserted in the update information acquisition apparatus shown in FIG. 1.
- FIG. 12 is a diagram showing an example of a data structure of update records constituting the update data shown in FIG.
- FIG. 13 is a diagram showing a road network obtained by updating the road network shown in FIG. [14]
- FIG. 14 is a diagram showing a road network in which the road network shown in FIG. 13 is represented by using a link string.
- FIG. 15 is a diagram showing an example of road network data representing the road network shown in FIG.
- FIG. 16 is a diagram showing an example of route guidance data obtained by updating the route guidance data shown in FIG.
- FIG. 17 is a diagram showing an example of road network update data used to update the road network data shown in FIG. 8 to the road network data shown in FIG.
- 18 is a diagram showing an example of route guidance update data for updating the route guidance data shown in FIG. 10 to the route guidance data shown in FIG.
- FIG. 19 is a flowchart showing the operation of the map information processing apparatus in accordance with Embodiment 1 of the present invention.
- FIG. 20 is a diagram showing memory allocation of the processor shown in FIG. 1.
- FIG. 21 is a flowchart showing details of map data acquisition and update processing executed in step ST 18 of FIG. 19.
- FIG. 22 is a flowchart showing details of a road network data update process executed in step ST204 of FIG.
- FIG. 23 is a diagram showing an example of a road network in which the road network shown in FIG. 4 is represented using link strings in the map information processing apparatus according to Embodiment 2 of the present invention.
- FIG. 24 is a diagram showing an example of coincidence node instruction information used in the map information processing apparatus in accordance with Embodiment 2 of the present invention.
- FIG. 25 is a diagram showing an example of corresponding node instruction information used in the map information processing apparatus according to Embodiment 2 of the present invention.
- FIG. 1 is a block diagram showing the configuration of the map information processing apparatus according to Embodiment 1 of the present invention.
- the map information processing apparatus includes an input device 1, a position detection device 2, a map information storage device 3, an update information acquisition device 4, a processor 5, and an output device 6.
- the input device 1 outputs an instruction signal in accordance with a user operation or instruction. Specifically, the input device 1 recognizes the user's voice and outputs an instruction signal based on the recognition result. It can be composed of at least one of a voice recognition device, a button for outputting an instruction signal in response to a user's manual operation, and other appropriate input devices.
- the instruction signal output from the input device 1 is sent to the processor 5.
- the position detection device 2 detects the current position of the vehicle on which the map information processing device is mounted using, for example, a GPS (Global Positioning System) receiver, a vehicle speed sensor, and an angular velocity sensor.
- the current position detected by the position detection device 2 is sent to the processor 5 as position information.
- the map information storage device 3 is constituted by, for example, a hard disk drive that uses a hard disk as a storage medium for map information, and operates as map data acquisition means for acquiring map data.
- the map information storage device 3 stores map information in advance, and the stored map information is read by the processor 5. Further, the map information storage device 3 stores the map update information acquired from the update information acquisition device 4 by the processor 5.
- the update information acquisition device 4 is configured by, for example, a DVD (Digital Versatile Disk) drive, and reads map update information stored in an update DVD-ROM (Read Only Memory).
- This update information acquisition device 4 operates as map update data acquisition means for acquiring map update data.
- the map update information read from the update DVD-ROM by the update information acquisition device 4 is sent to the processor 5.
- the processor 5 operates as map data updating means, and executes various types of map information processing using the position information obtained from the position detection device 2 and the map information read from the map information storage device 3.
- map information processing map matching that estimates the current position of the vehicle based on location information and map data included in the map information, route calculation (route search) that calculates the route from the departure point to the destination, route calculation Candidates for suitable routes obtained as a result of the above are displayed on the screen of the output device 6 together with the road map, route guidance for guiding from the departure point to the destination according to the preferred route, and around the current position Includes map display processing.
- the processor 5 stores the map update information read by the update information acquisition device 4 in the DVD-ROM for update in the map information storage device 3, and updates the map information.
- the map information and map update information are read from the map information storage device 3 and the map information is updated using the map update information.
- the output device 6 presents various information to the user in accordance with the map information processing result sent from the processor 5.
- the output device 6 can be configured as, for example, a display device that displays a map, a current position, a route, guidance information, and the like, and a voice generation device that gives a voice instruction or plan to the user. .
- FIG. 2 shows a schematic data structure of the map information stored in the map information storage device 3.
- the map information is composed of “map management information”, “map data”, and “route calculation data”.
- the map data is hierarchized according to the degree of detail of the road network, and is prepared corresponding to each of a plurality of areas obtained by dividing the whole country into several for each hierarchy.
- the road network in each region consists of a “link string” that represents a series of roads as a series of links in the road network represented by “nodes” that represent points on the road and “links” that represent roads between the points. It is expressed using.
- the route calculation data is hierarchized according to the degree of detail of the road network, and a plurality of areas obtained by dividing the whole country into several for each hierarchy. It is prepared for each area.
- the road network in each area is represented using the nodes and links described above.
- the map management information is also configured with data power for managing map data and route calculation data prepared for each hierarchy.
- This map management information includes information for associating an area with map data and route calculation data, information indicating the storage location of map data and route calculation data in the map information, and information indicating the data size. Including.
- the map management information includes version number information indicating the version number of the map information.
- the map data includes “map data header”, “road network data”, “background data”, “name data”, “route guidance data”, and the like.
- Map data header is road network data Information power to manage background data, name data, route guidance data, etc.
- the road network data is used to express road shapes used for map matching and road display, road connection relationships, and the like.
- the background data is used to display map backgrounds such as rivers and seas.
- the name data is used to display place names in characters.
- the route guidance data is used for route guidance at an intersection or the like.
- the route calculation data is data representing a road network for route calculation and has a data structure different from the road network data constituting the map data.
- This route calculation data includes the link number of the road network link of the map data corresponding to the road network link for route calculation, and the links of both road networks can be associated with each other.
- Figure 3 shows an example of the lowermost rectangular area A road network representing the most detailed road network.
- the road network in area A consists of nodes, NO to N9, and links LOO, L01, L10, Lll, L20, L30, L40, L41, L42 and L50.
- Fig. 4 shows the road network shown in Fig. 3 using link strings.
- a link string is a series of one or more links.
- links LOO and L01 form a link row MLO
- links L10 and L11 form a link row ML1
- link L20 forms a link row ML2
- link L30 forms a link row.
- ML3 is formed
- L40, L41 and L42 form a link string ML4
- link L50 forms a link string ML5! /.
- the link string has directionality, and the directionality of the link string is referred to as “link string direction”.
- the direction of the link row is the direction from node NO to N2 in the link row MLO.
- the link also has directionality, and this is called “link direction”.
- the direction of the link is the same as the direction of the link row to which it belongs.
- the direction of the link LOO is the same as the direction of the link row MLO, and is the direction from the node NO to the node N1.
- the head (downstream) side node with respect to the link direction is referred to as a start point node
- the end (upstream) side node is referred to as an end point node.
- the start node of link LOO is NO
- the end node is N1.
- the first node in the link string is positioned at the first node and the end of the link string in the direction of the link string.
- the node to be called is called the end node of the link string.
- node NO is the first node of the link string MLO
- node N2 is the terminal node of the link string MLO.
- a unique link identifier for identifying the link is given to the link.
- the link identifier is unchanged at least as long as the link exists in the map data.
- a link identifier having a range can be used as the link identifier.
- Link identifiers with ranges are assigned to links that may be divided into multiple links in the future, and upper-level links that combine multiple links into one. For example, in the road network shown in FIG. 4, the links LOO, L10, Lll, L20, L30, L40, L41, and L50 have “100”, “110”, and “111” as link identifiers. , “120”, “130”, “140”, “141”, “142”, and “150”, respectively. Also, the link identifier “101” to “104” having a range is assigned to the link L01.
- each of the plurality of link strings includes the same node Nx.
- all links connected to node Nx are obtained by collecting the links connected to each node Nx in the multiple link strings. Therefore, by indicating the identity of the nodes included in the link strings between the different link strings, the connection relation of the links in the nodes can be expressed.
- the node Nl in the link row MLO, the node Nl in the link row ML1, the node Nl in the link row ML2, and the node N1 in the link row ML3 are the same. Therefore, it is possible to express that the link: LOO, LOL, L10, L11 ,: L20 and L30 are connected at node N1, and the connection relation of the link at node N1 in Fig. 3 can be expressed. .
- each node included in the link string has "matching node instruction information”.
- the matching node instruction information indicates a node of another link string that matches (that is, is the same as) the node having the matching node instruction information, and the matching node instruction information that indicates the same node is different from the node of the link string Is stipulated.
- information indicating the link string node is This is referred to as “command instruction information”.
- the matching node indication information indicates each node of a different link row.
- the node Nx in the link string that is different from the link string that includes the node Nx that has existed so far is reached, passes through all the link strings that include the node Nx, and finally the node Nx in the first link string MLx. To. Therefore, all the same nodes included in a plurality of link strings can be obtained by sequentially inputting nodes indicated by the matching node instruction information.
- the coincidence node indication information SO of node N1 in link string ML0 indicates node N1 in other link string ML1
- the coincidence node of node N1 in link string ML1 The instruction information S1 indicates the node N1 of the other link string ML2
- the matching node instruction information S2 of the node N1 of the link string ML2 indicates the node N1 of the other link string ML2
- the matching node of the node N1 of the link string ML3 indicates the node N1 of another link string ML0.
- the node N1 of the link string ML1 is reached by the instruction of the matching node instruction information SO
- the node N1 of the link string ML2 is reached by the instruction of the matching node instruction information S1
- the matching node instruction information S2 The instruction reaches the node N1 of the link string ML3 by the instruction and the node N1 of the link string ML0 can be reached by the instruction of the matching node instruction information S3. can do.
- the node N1 of the link strings ML0, ML1, ML2, and ML3 can be obtained.
- the matching node instruction information includes "link instruction information” indicating a link identifier of a link whose end point is a node indicated by the matching node instruction information, and the node indicated by the matching node instruction information is a start side or an end point. It is expressed using “start / end instruction information” indicating the force corresponding to any of the sides.
- the matching node instruction information SO indicates “111” as the link instruction information and “start point” as the start / end instruction information to indicate the start node N 1 of the link L 11. Is used.
- the link identifier of the link whose end point is the node indicated by the matching node indication information is a category.
- the link identifier having the lower limit value of the range is used, and when the start / end point instruction information represents the end point node, the upper limit value of the range is used as the link instruction information.
- a link identifier with is used.
- the matching node instruction information S3 indicates the start node N1 of the link L01, so “101” is used as the link instruction information and “start” is used as the start / end instruction information. Is done.
- the matching node instruction information S5 indicates the terminal node N2 of the link L01, “104” is used as the link instruction information, and “end point” is used as the start / end instruction information.
- the same node identifier that is unique and unchanged between the same nodes is assigned to the same node included in each link string.
- the node N1 in the link string ML0, the node Nl in the link string ML1, the node N1 in the link string ML2, and the node N1 in the link string ML3 have the same node identifier “3”, “ Numbers "1", "4" and "2" are assigned respectively.
- the numbers “1” and “2” are assigned to the node N2 of the link string ML0 and the node N2 of the link string ML4 as the same node identifier, respectively.
- FIG. 5 shows an example of the data structure of road network data representing the road network.
- the road network data is composed of a “road network data header” and a “link column list”.
- the road network data header stores information for managing the road network data, such as the data size of the road network data, the number of link column records stored in the link column list, and the like.
- the link string list also includes the collective power of link string records provided corresponding to the link strings constituting the road network represented by the road network data.
- the link string records are arranged in order from the smallest link identifier value of the links included in the link string.
- FIG. 8 is an example of road network data representing the road network shown in FIG.
- the link column list representing the road network includes link column record # 0, link column record # 1, link column record # 2, and link column record # 3 corresponding to link columns ML0, ML1, ML2, ML3, ML4, and ML5, respectively. , Link column record # 4 and link column record # 5.
- the link identifiers for link strings ML0, ML1, ML2, ML3, ML4, and ML5 are "100” to "104”, “110” to "111", “120” to “120", “130” to ", respectively. 130 ”,“ 140 ”to“ 142 ”, and“ 150 ”, and these link identifiers have the smallest value. Are lined up.
- FIG. 6 shows an example of the data structure of the link string record shown in FIG.
- a link string record consists of a “link string header” and a “link list”.
- the link column header corresponds to the “link column record size” indicating the data size of the link column record, the “number of link records” indicating the number of link records provided in the link column record, and the link column record.
- “Link identifier range information” indicating the range (minimum value and maximum value) of the link identifier of the link included in the link column
- “Link” indicating the road type, route number, etc. of the link column corresponding to the link column record
- Column attribute information "power is configured.
- the link list includes a collective power of link records provided corresponding to the links constituting the link string corresponding to the link string record.
- the link records are arranged so that they are the same as the link row when the link row is set in the same direction as the link row direction! /
- a termination virtual link that is a virtual link starting from the termination node of the link string is defined, and the link record for the termination virtual link is placed at the end of the link list.
- link record # 00 and link record # 01 are provided as a link list corresponding to links LOO and L01 for the link column MLO of the road network shown in FIG.
- Link record # 02 is provided for the end virtual link starting from the end node N2 of the row MLO, and these are arranged in the order of link record # 00, link record # 01, and link record # 02.
- the link record is composed of “link header”, “matching node instruction information”, “link shape information”, and “traffic restriction information”.
- the link header includes a "link record size” indicating the data size of the link record, a "number of interpolation point records” indicating the number of shape records constituting the link shape information, and a “restriction” constituting the traffic restriction information.
- Information for managing the link record such as ⁇ number of records '', ⁇ link identification information '' indicating the link identifier of the link, road width of the link, number of lanes, one-way regulation, vertical line separation Z non-separation, etc.
- Link type indicating road structural characteristics, whether the link start point is in contact with the boundary of the area represented by the road network data It consists of “link attribute information” representing various attributes of the link, such as boundary information indicating whether or not, and guidance presence / absence information indicating the presence / absence of guidance information related to the start node.
- the link identifier When the link identifier has a range, the lower limit value of the link identifier is represented by the link identification information of the link record of the link, and the upper limit value of the link identifier is the link identifier of the next link record. It is obtained by subtracting “1” from the value of the link identifier represented by the information. Further, the upper limit value of the link identifier when the link is the link at the end of the link string is obtained as the maximum value of the link identifier range information of the link string header.
- the coincidence node instruction information represents the coincidence node instruction information given to the link start point node, and is composed of the link instruction information and the start / end point instruction information as described above.
- “1” that is a value that is not given to the link as the link identifier is used as the link instruction information.
- the matching node instruction information of link record # 01 of link L01 of link string MLO includes “1 11” which is the link identifier of link L11 as link instruction information.
- the value indicating the start point side is used as the start / end point instruction information, and the matching node instruction information SO is expressed.
- the link node # 42 match record indication information of link L42 in the link string ML4 uses the link identifier "104" that is the link identifier of link L01 as the link indication information. Is used to represent the matching node indication information S5.
- the link shape information is composed of a set of shape records provided corresponding to the start node side end point of the broken line and each vertex when the road shape of the link is represented by a broken line approximating the road center line.
- the traffic restriction information includes information indicating restrictions on traffic between links at the start node of the link, and is configured from a set of traffic restriction records provided corresponding to the restrictions.
- the traffic regulation information is provided in any one of the same nodes included in multiple link strings.
- the traffic restriction record is a link string that includes the same node identifier that indicates the same node identifier of the starting node of the entry link, and the entry direction to the node indicated by the same node identifier of the entry side includes the node indicated by the same node identifier.
- Incoming direction indication information indicating whether the direction is the same direction or the reverse direction, and the same node identifier of the starting point node of the exit link “ “Escape side same node identifier”, “escape direction indication information” indicating whether the exit direction from the node indicated by the exit side same node identifier is the same direction or the reverse direction of the link string including the node indicated by the same node identifier, and It consists of a “traffic control code” that indicates the details of traffic control from the entrance link to the exit link.
- FIG. 9 is provided in the link record # 01 of the link L01 in the link row ML0 when there is a traffic restriction that enters the link L00 and exits to the link L10 in the road network shown in FIG. It is an example of the traffic regulation information.
- the traffic regulation record for traffic regulation stores “3”, which is the same node identification of the node N1 of the link string ML0 as the same node identifier on the entry side, and the same direction force as the link string ML0.
- a value indicating the same direction is stored as approach direction indication information for entering node N1, and “1”, which is the same node identification of node N1 of link string ML1, is stored as the same node identifier on the exit side.
- a value indicating the reverse direction is stored as the exit direction instruction information, and a code indicating, for example, prohibition of passage is stored as a traffic restriction code.
- FIG. 7 shows an example of the data structure of route guidance data.
- the route guidance data is composed of the collective power of route guidance records provided for each node. Information provided in association with a node like this route guidance record is called node-related information.
- the route guidance record is connected to the "route name record header", "intersection name data” indicating the node intersection name, "road name data” indicating the road name of the link connected to the node, and the node. It consists of various data capabilities required for guidance at the node, such as “direction name data” indicating the destination of the link.
- the route guidance record header includes “route guidance record size” indicating the data size of the route guidance record, “corresponding node indication information” indicating the corresponding node, and “intersection name” indicating the size of the intersection name data. “Data size”, “Road name data” indicating the size of the road name data, and “Direction name data size” indicating the size of the direction name data are configured.
- Corresponding node instruction information indicates a node associated with the route guidance record, and Link instruction information that represents the link identifier of a link whose end point is the node that is the end point, and start / end point instruction information that indicates whether the corresponding node is the start point node or the end point node of the link represented by the corresponding link instruction information ing.
- Corresponding node instruction information indicates a link string node, and is one of the node instruction information.
- the link identifier used in the corresponding node instruction information is unchanged, the abolition or establishment of a link other than the link represented by the link instruction information, or a link other than the link represented by the link instruction information is performed. Even if a link row that also has link power is abolished or newly created, the corresponding node instruction information of the route guidance record does not change. Therefore, it is not necessary to update the corresponding node instruction information in the route guidance record for the road network update as described above.
- the route guidance records are arranged in ascending order of the link identifier values indicated by the link instruction information, and the route guidance records can be easily searched by the link identifier.
- route guidance record # 0 and route guidance record # 1 are provided as node-related information in node N1 of link queue ML2 and node N2 of link queue ML4, respectively, for the road network of FIG.
- An example of route guidance data is shown.
- “1 20” which is the link identifier of the link L20 is used as the link instruction information of the corresponding node instruction information of the route guidance record # 0, and the value indicating the end point is used as the start / end instruction information.
- the corresponding link instruction information of the corresponding node instruction information of 1 "142", which is the link identifier of the link L42, the value indicating the start point is used as the start / end instruction information, and the ascending order of the link identifier value indicated by the link instruction information Route guidance record # 0 and route guidance record # 1 are stored in this order.
- Map update information data structure A data structure of map update information for updating map information used in the map information processing apparatus according to Embodiment 1 of the present invention will be described.
- FIG. 11 is a diagram schematically showing the data structure of the map update information stored in the update DVD-ROM inserted into the update information acquisition device 4. This map update information consists of “map update management information”, “map update data” and “route calculation update data”.
- the map update management information is composed of data for managing the map update data for each hierarchy, and information for associating the area with the map update data and the route calculation update data in each hierarchy, the map It includes information indicating the storage location in the map update information of update data and route calculation update data, and information indicating the data size.
- the map update management information includes “data identification information” indicating that the DVD-ROM stores the map update information, and “version target” indicating the version number of the map information to be updated by the map update information. Version information ”and“ update version information ”indicating the version number of the map information obtained by updating with the map update information.
- the map update data is data for updating the map data, and is provided corresponding to the map data. Map update data for map data that does not need to be updated is not included in the map update information.
- the route calculation update data is data for updating the route calculation data, and is provided corresponding to the route calculation data. Note that the route calculation update data for the route calculation data that does not require updating is not included in the map update information.
- Map update data includes road network update data, background update data, name update data, route guidance update data, etc. for updating road network data, background data, name data, route guidance data, etc. ( Hereinafter, it is collectively referred to as “update data”) and a map update data header. Update data corresponding to road network data, background data, name data, route guidance data, etc. that do not need to be updated is not included in the map update information. Each update data is composed of one or more update records.
- FIG. 12 is a diagram showing an example of the data structure of the update record.
- the update record includes “update record size”, “update target data type”, “update operation type”, “update target designation”, and “update operand”.
- the update record size is the update record concerned Indicates the data size.
- the update target data type indicates the type of data constituting the road network data, background data, name data, route guidance data, etc., to be updated by the update record.
- the update operation type indicates the type of update operation such as overwriting, deleting, replacing, adding to the data indicated by the update target data type and the update target specification.
- the update target designation indicates the update location in the data indicated by the update target data type.
- the update operand indicates the data to be overwritten, replaced or added according to the update operation type and the data size. In addition, it indicates the start position to be overwritten or replaced by an address based on the start of the data specified by the update target data type and update target designation. When the update operation type is delete, no update operand is provided
- the map update data header is data for managing the map update data header, road network update data, background update data, name update data, route guidance update data, and the like. It includes information indicating the storage location, data size, number of update records, etc. in the update data.
- Figure 13 shows the road network obtained by updating the road network shown in Figure 3.
- nodes N5 and N7 and links L20 and L40 of the road network shown in FIG. 3 are abolished, node N10 and node Nl l, link L 60 and link L61 are newly established, and link L01 Is divided into link LOla and link LOlb, and node Nla is newly established at the divided point.
- FIG. 14 shows a road network in which the road network shown in FIG. 13 is represented by using a link string.
- the link row ML2 is abolished in the road network shown in Fig. 4, the node N7 and link L40 in the link row ML4 are eliminated, the link row ML6 is newly established, and the link L01 in the link row MLO is added.
- the link LOla and the link LOlb are replaced with “101” to “102” as the link identifier of the link LOla, and “103” to “104” as the link identifier of the link LOlb.
- FIG. 15 is an example of road network data representing the road network shown in FIG. 14.
- This road network data is obtained by updating the road network data shown in FIG. 8 as follows. That is, the link column list shown in FIG. 15 is different from the link column list shown in FIG. 2 is deleted, and with the establishment of link column ML6, link column record # 6 representing link column ML6 is inserted before link column record # 1 so that link records are in ascending order of the range of link identifiers. It is composed by
- link list 0 of link column record # 0 shown in FIG. 15 is linked to link list 0 shown in FIG. 8, and link record # 01 is deleted along with the division of link L01. Record # Ola and Link LOlb link record # Olb is inserted.
- the link list 4 of the link row record # 4 shown in FIG. 15 is configured by deleting the link record # 40 from the link list 4 shown in FIG. 8 with the abolition of the link L40.
- the road network data header ', the link string header 0', and the link string header 4 'shown in FIG. 15 are the same as the road network data header, the link string header 0, and the link string header 4 shown in FIG. It has been changed to reflect the update.
- link record # 11 'shown in Fig. 15 is changed to indicate node N1 in link sequence ML3 in link record # 11 shown in Fig. 8 with the abolition of link sequence ML2.
- the node N1 of the link string ML3 is designated as the same node as the node N1 of the link string ML1.
- link record # 43 shown in FIG. 15 is obtained by changing the match node instruction information of link record # 43 shown in FIG. 8 to indicate node N9 of link string ML6. Further, the matching node instruction information of link record # 63 shown in FIG. 15 is set to indicate node N9 of link string ML4. As a result, the node N9 of the link string ML4 and the node N9 of the link string ML6 are matched with the matching node instruction information of the link record # 43 shown in FIG. 15 and the matching node instruction information of the link record # 62 shown in FIG. Are shown to be the same node.
- the lower limit value of the link identifier of the link LOla, the upper limit value of the link identifier of the link LOlb, and the link identifiers of the links L11 and L42 are unchanged even when the above-described road network is updated. Therefore, the matching node instruction information S0, S3, S4, and S5 does not change, and therefore, it is not necessary to update the matching node instruction information representing them. In addition, since the same node identifier of node N1 of link string ML0, ML1 and ML3 is not changed when the road network is updated, the traffic restriction information provided in link record # 01 of link L01 of link string ML0 ( Figure 9) is not changed by the update described above, and the update is unnecessary.
- route guidance data shown in Fig. 16 along with the abolition of link string ML2, route guidance for node N1 in link string ML2 is abolished, and route guidance record # 0 (see Fig. 10), which is the node related information, is routed.
- Guidance data has been deleted.
- FIG. 17 shows an example of road network update data used to update the road network data shown in FIG. 8 to the road network data shown in FIG.
- the link column number means the order of arrangement in the link column list of the link column record starting with “0”, and the link number is the link record link list starting with “0”. It means the order of arrangement in.
- the link string record and link record to be updated are specified by the link string number and link number set as the update target specification. In FIG. 17, the description of the data size and head position of the update operand is omitted.
- the update record #rl is a link column header shown in Fig. 15 reflecting the deletion of link record # 01 and the insertion of link record # Ola and link record # Olb in link column header 0 shown in Fig. 8. Instruct to overwrite '0'.
- Update record # r2 instructs to delete link record # 01 from link list 0 shown in FIG.
- Update record # r3 instructs to insert link record #Ola and link record #Olb before link record # 2 in link list 0 shown in the figure!
- Update record # r4 instructs to insert link string record # 6 of FIG. 15 before link string record # 1 shown in FIG.
- Update record # r5 overwrites the matching node instruction information of link record # 01 in link list 1 shown in FIG. 8 with the matching node instruction information indicating matching node instruction information S1 'indicating node N1 of link string ML3. Tell them to do it.
- Update record # r6 instructs to delete link string record # 2 shown in FIG.
- Update record # r7 shows link column header 4 of link column record # 4 shown in Fig. 8 in Fig. 15. Instruct to overwrite with the link column header 4 'shown.
- Update record # r8 instructs to delete link record # 40 in link list 4 shown in FIG.
- Update record # r9 overwrites the matching node instruction information of link record # 03 in link list 4 shown in Fig. 8 with the matching node instruction information indicating node N9 in link string ML6 and matching node instruction information S11. Tell me to do! / Speak.
- route guidance update data will be described. 18 shows an example of route guidance update data for updating the route guidance data shown in FIG. 10 to the route guidance data shown in FIG.
- update record # g0 indicates that route guidance record # 0 shown in FIG. 8 is to be deleted.
- the link identifier remains unchanged even when link string ML2 is abolished, link L40 is abolished, and link string ML6 is newly established, so it is not related to these abolished or newly established links or link strings.
- Nodes that is, nodes N1 and N4 in link string ML1, node N6 in link string ML3, and nodes N4 and N6 in link string ML5, which do not have matching node instruction information indicating the nodes included in them,
- the matching node indication information S0, S8, S6, S9 and S7 to be indicated respectively does not change. Therefore, the road network update data shown in FIG. 17 does not need to include an update record for updating the coincidence node instruction information resulting from the abolition or establishment of an unrelated link or link string.
- the amount of network update data can be reduced.
- the road network update data shown in FIG. 17 does not need to include an update record for updating the matching node instruction information resulting from the link division, and thus the amount of road network update data can be reduced.
- the matching node instruction information includes the start / end instruction information, so that the end node of the link string is also based on the link instruction information. Since the same node can be specified, all nodes in the road network are It is possible to represent the identity of the nodes using the link identifier, and the effect is that the amount of road network update data as described above can be reduced.
- the same node identifier of node N1 of link string MLO, ML1 and ML3 is unchanged.
- the same entry identifier on the entry side and the same node identifier on the exit side of the traffic restriction record # 0 provided in the link record # 01 of the link L01 of the link string ML0 do not change, and update data for these is not necessary. Therefore, the road network update data shown in FIG. 17 does not need to include the update record of the traffic regulation information caused by the update of the link string unrelated to the traffic regulation information shown in FIG. The amount of can be reduced.
- route guidance record # 0 of the route guidance data shown in Fig. 10 when route guidance record # 0 of the route guidance data shown in Fig. 10 is deleted, the storage location of route guidance record # 1 changes. Conventionally, the node and route guidance record are changed. Since the storage location of the corresponding route guidance record is held on the road network data side, the storage location is updated even though route guidance record # 1 itself has not been updated. Is necessary, and unnecessary update data is generated. On the other hand, in the first embodiment, the storage location of the corresponding route guidance record is held on the road network data side, so the above-mentioned update is unnecessary, and the road network update data shown in FIG. Since it is not necessary to include an update record for updating the storage location, the amount of road network update data can be reduced.
- the operation of the map information processing apparatus for updating the map information having the data structure configured as described above will be described with reference to the flowchart shown in FIG.
- the road network data shown in FIG. 8 and the route guidance data shown in FIG. 10 are updated to the road network data shown in FIG. 15 and the route guidance data shown in FIG.
- the case where the road network shown in FIG. 4 is updated to the road network shown in FIG. 14 will be described.
- FIG. 20 is a diagram showing allocation of memory (not shown) of the processor 5.
- an operation control data unit 10 for storing data for controlling the operation of the map information processing apparatus, and a traveling locus data for storing traveling locus data that is a time series of position information obtained by the position detecting device 2 are stored.
- current position data part 12 for storing data representing the current position of the vehicle
- route data part 13 for storing route data representing the route from the departure point to the destination
- Route calculation data management unit 14 Route calculation data unit 15 for storing route calculation data
- Route calculation update data unit 16 for storing route calculation update data
- Required map data management unit 17 for storing required map management data
- Map data A map data section 18 for storing and a map update data section 19 for storing map update data are allocated.
- Step ST10 it is checked whether or not an update DVD-ROM has been inserted into the update information acquisition device 4 (step ST11). If it is determined in step ST11 that the update DVD—ROM has been inserted, map update information is acquired (step ST12). That is, the processor 5 reads the map update management information of the map update information stored in the update DVD-ROM inserted in the update information acquisition device 4, and also reads the map information stored in the map information storage device 3. Read map management information. Then, the version number information included in the read map update management information is compared with the version information included in the map management information. If they match, the map information can be updated using the map update information. Judgment and update DVD—ROM power The map update information is read and stored in the map information storage device 3. Thereafter, the sequence proceeds to step ST13. If it is determined that the update DVD-ROM is inserted in step S Tl 1 above !!, na! /, The update map information is not acquired, and the sequence proceeds to step ST13. .
- step ST13 an input process is performed. That is, the processor 5 performs the operation of the map information processing apparatus such as the map display scale, the destination, and the start instruction of the route calculation based on the instruction signal according to the user's operation or instruction that also received the input device 1 power. Data for control is generated and stored in the operation control data section 10.
- step ST14 the current position is acquired (step ST14). That is, the processor 5 receives the position from the position detection device 2. Position information is acquired, and the acquired position information is cumulatively stored in the travel locus data section 11, and the acquired position information is stored as the current position in the current position data section 12 in the first step ST14. .
- step ST15 it is checked whether or not the start of route calculation is instructed.
- the processor 5 checks whether or not it is instructed to start the path calculation based on the data stored in the operation control data unit 10.
- step ST16 it is determined that the start of the route calculation is instructed.
- step ST18 it is determined that the start of the route calculation is instructed.
- step ST16 route calculation data is acquired and updated. That is, the profiler 5 stores the position information stored in the current position data unit 12 in the operation control data unit 10 as a departure point, and reaches from the departure point stored in the operation control data unit 10 to the destination. Obtain and update route calculation data necessary for route calculation to obtain a suitable route.
- route calculation is performed (step ST17). That is, the processor 5 performs route calculation using the route calculation data acquired and updated in step ST16, finds a suitable route from the departure place to the destination, and obtains route data representing the obtained route as a route data portion. Store in 13. In addition, the processor 5 cancels the instruction to start the route calculation stored in the operation control data unit 10. Thereafter, the sequence proceeds to step ST18.
- step ST18 map data is acquired and updated. That is, the processor 5 acquires map data necessary for map display, map matching, and route guidance around the current position indicated by the position information stored in the current position data section 12, and uses the acquired map data. The map data is updated by storing it in the map data section 18. The process executed in step ST18 will be described in detail later.
- map matching is performed (step ST19).
- the processor 5 uses the travel trajectory data stored in the travel trajectory data section 11 and the road network data included in the map data stored in the map data section 18 to determine the link traveled by the vehicle.
- the current position of the vehicle is obtained by estimating the position on the link, and the obtained current position is obtained.
- the estimation of the link and the position on the link is performed based on the relationship between the traveling locus data and the shape of the link or the linked link. In this way, link estimation accuracy is improved by using link connection relationships.
- the link shape is acquired from the link shape information of the link record.
- the link connection relation is obtained from the matching node indication information in the link record. That is, by sequentially hitting the same node according to the instruction of the matching node instruction information, all the same nodes are obtained, and the links having the obtained node as the start point or the end point are connected to each other.
- V cannot be specified, the latest position information stored in the travel locus data section 11 is stored in the current position data section 12 as the current position.
- map display is performed (step ST20). That is, the processor 5 displays the display indicated by the data stored in the operation control data unit 10 according to the road network data, background data, and name data included in the map data stored in the map data unit 18.
- the output device 6 displays a road, background and a map screen with name power drawn to scale.
- the road drawing color is determined by the road type in the link column attribute information of the link column header, and the broken line that indicates the link shape information of the link record in this determined drawing color Is drawn.
- step ST21 Displays the current position (step ST21). That is, the processor 5 displays a figure representing the current position at a location corresponding to the current position stored in the current position data section 12 on the map screen displayed in step ST20 and indicated by the position information. .
- route display is performed (step ST22). That is, the processor 5 displays the route data obtained in step ST17 on the map screen displayed in step ST20. The route is highlighted so that it can be identified as a route.
- route guidance is performed (step ST23). That is, the processor 5 checks the presence or absence of a route guidance record of a node ahead of the link on which the vehicle is traveling obtained in step ST19, and if there is a corresponding route guidance record, the corresponding route guidance data. By sending a route guidance record to be output to the output device 6, guidance screen display and voice guidance regarding the node ahead are performed. Thereafter, the sequence returns to step ST11, and thereafter, the processes of steps ST11 to ST23 are repeated.
- map display Using the map data updated with the map update information stored in the update DVD-ROM as described above, map display, map matching, route calculation, route guidance, etc., and V, map information processing Is done.
- step ST200 required map data is determined (step ST200). That is, the processor 5 obtains the hierarchy and area of each map data necessary for map display, map matching and route guidance around the current position indicated by the position information stored in the current position data section 12, and manages the required map. The data is stored in the required map data management unit 17 as data.
- map data is read (step ST201). That is, the processor 5 reads the map data indicated by the required map management data of the required map data management unit 17 from the map information of the map information storage device 3 and stores it in the map data unit 18.
- step ST202 it is checked whether or not map update data exists (step ST202). That is, the processor 5 determines whether the map update information is stored in the map information storage device 3, more specifically, the map acquired in step ST201 based on the map update management information of the map update information in the map information storage device 3. Check if there is map update data in the same layer and area as the data. If it is determined that there is no map update data, the sequence proceeds to step ST209.
- map update data is read (step ST203).
- Ie processor 5 reads the map update data in the same hierarchy and the same area as the map data acquired in the central step ST201 of the map update information in the map information storage device 3, and stores it in the map update data section 19;
- the road network data is updated (STEP ST204). That is, the processor 5 acquires the road network data included in the map data acquired in step ST201 and stored in the map data unit 18, and is acquired in step ST203 and stored in the map update data unit 19. Update with road network update data included in the map update data. This road network data update process will be described in more detail later.
- the background data is updated (step ST205). That is, the processor 5 uses the map update data acquired in step ST203 and stored in the map update data unit 19 as the background data included in the map data acquired in step ST201 and stored in the map data unit 18. It is updated by the background update data included in.
- the name data is updated (step ST206). That is, the processor 5 acquires the name data included in the map data acquired in step ST 201 and stored in the map data unit 18, and the map data acquired in step ST 203 and stored in the map update data unit 19. Update with the name update data included in the update data.
- the route guidance data is updated (step ST207). That is, the processor 5 updates the route guidance data included in the map data acquired in step ST201 and stored in the map data unit 18 to the map update data acquired in step ST203 and stored in the map update data unit 19. Update with the route guidance update data included in the data.
- the route guidance record number # 0 of the route guidance data shown in FIG. 10 is deleted by the update record #gO in the route guidance update data shown in FIG. 18, and the route guidance data shown in FIG. 10 is shown in FIG. Updated to route guidance data.
- the route guidance update data shown in FIG. 18 does not include link records that are not related to the route guidance data or update records resulting from link updates. Can be updated at high speed.
- step ST208 the map data header is updated (step ST208). That is, the processor 5 updates the contents of the map data header included in the map data in accordance with the update of the road network data, background data, name data, and route guidance data described above.
- step ST209 it is checked whether the required map data has been read. That is, the processor 5 checks whether reading of all map data indicated by the map management data of the required map data management unit 17 has been completed. If it is determined that the required map data has been read, the map data acquisition and update process is terminated. On the other hand, if it is determined that the required map data has not been read, the sequence returns to step ST201, and the processes of steps ST201 to ST209 are repeated thereafter.
- an update record is first acquired (step ST300). That is, the processor 5 acquires an update record from the road network update data included in the map update data acquired in step ST203 and stored in the map update data unit 18.
- the update target is updated (step ST301). In other words, processor 5 updates part of the road network data determined by the update target data type and update target specification of the update record acquired in step ST300, using the update operand data according to the update operation type. To do.
- link sequence record # 6 is inserted before link sequence record # 1 shown in FIG.
- step ST302 it is checked whether or not the update record acquisition is completed (step ST302). That is, the processor 5 checks whether or not acquisition of all the update records is completed based on the road network update data.
- the sequence returns to step ST300, and the above-described processing is repeatedly executed.
- the road network data header is updated (step ST303). In other words, the road network data header included in the road network data is updated according to the result updated according to the update record. This completes the road network data update process.
- the road network data shown in FIG. 8 and the route guidance data shown in FIG. 10 are updated to the road network data shown in FIG. 15 and the route guidance data shown in FIG. As a result, the road network shown in Fig. 4 is updated to the road network shown in Fig. 14.
- the road network update data shown in FIG. 17 does not include an update record of matching node instruction information resulting from the abolition or establishment of an unrelated link or link string. Therefore, the road network data can be updated at a higher speed.
- the road network update data shown in FIG. 17 does not include the update record of the matching node instruction information resulting from the division of the link, so that the road network data can be updated at a higher speed.
- the end node of the link string can also be instructed by the same node by the link instruction information, and link identifiers are used for all nodes in the road network. It becomes possible to express the identity of a node. As a result, unnecessary update data is not generated, and road network data can be updated at higher speed.
- the road network update data shown in Fig. 17 does not include the update record of the traffic regulation information caused by the update of the link column unrelated to the traffic regulation information shown in Fig. 9, so the road network data The data can be updated at higher speed.
- the road network update data shown in FIG. 17 does not include an update record for updating the storage position of the corresponding route guidance record, the road network data can be updated at higher speed.
- the identity of nodes does not depend on the order of link row records and link record arrangements. Since the link identifier is used to represent the link, the linking node indication information is not changed due to the abandonment or new establishment of an unrelated link string or link. As a result, the amount of update data can be reduced, and road network data can be updated more quickly. In addition, since it is possible to specify the end node of the link string using the start / end instruction information, it becomes possible to express the identity of all nodes using link identifiers that are unique to the link and are invariant. RU
- the corresponding node instruction information is configured to be provided in the route guidance record that is not included in the road network data, it is not necessary to update the road network data even if the route guidance record is updated. Accordingly, the amount of road network data update data can be reduced, and higher-speed update processing can be performed.
- link identifiers that are unique and invariant to links are used as link instruction information of corresponding node instruction information, there is no need to update the corresponding node instruction information due to the abolition or establishment of unrelated link strings or links. The amount of update data for route guidance data can be reduced, and faster update processing It is possible.
- the link string records are arranged in ascending order of the value of the link identifier range information, the link string record including the link of the desired link identifier can be quickly found, and the map information processing is performed at high speed. be able to.
- the link sequence is unrelated. It is possible to reduce the amount of update data and to update the road network data at a higher speed without the need to update the same node identifier due to deletion or new construction.
- the map information processing apparatus can be modified as follows. That is, the matching node instruction information and the corresponding node instruction information can be transformed to be expressed using the link identifier of the link whose end node is the node indicated by them. In this case, the link identifier is used as the link instruction information of the matching node instruction information and the corresponding node instruction information.
- the instructing node is the start node of the link string
- the matching node instruction information and the start / end instruction information of the corresponding node instruction information represent the starting point
- the instructing node is other than the starting node of the link string
- the start / end point instruction information is defined to represent the end point.
- the link identifier has a range
- the upper limit value of the link identifier range is used as the link instruction information of the matching node instruction information and the corresponding node instruction information.
- a link identifier is also given to the terminating virtual link, and the matching node instruction information is represented using only the link instruction information.
- the link identifier has a range
- the lower limit value of the range of the link identifier is used as the link instruction information.
- the corresponding node instruction information of the route guidance record is expressed using the link identifier of the link starting from the corresponding node.
- Fig. 23 is a diagram in which a link identifier is assigned to the end virtual link of the road network shown in Fig. 4, and the link identifier U child for the end virtual links L02, ⁇ 2, L21, L31, L43, and L51. As 105, 112, 121, 131, 143 and 151 powers are granted respectively! As described above, in Embodiment 2, since link identifiers are assigned to all links and termination virtual links, link identifiers are assigned to links starting from those nodes for all nodes constituting the link string. Will be granted. Therefore, all the nodes can be indicated using the link identifier of the link starting from that node, and the matching node indication information can be indicated only by the link indication information and the same node can be indicated.
- the road network data used in the second embodiment is composed of only the link instruction information in the matching node instruction information of the road network data in the first embodiment.
- FIG. 24 shows an example of the matching node instruction information used in the second embodiment.
- the matching node instruction information provided in the link record of the link L01 of the link string ML0 in FIG. 23 is the link identifier of the link L11 as the link instruction information indicating the node N1 of the link string ML1 " 111 "is stored and the matching node instruction information SO is represented.
- the matching node indication information provided in the link record of link L42 of link string ML4 stores “105”, which is the link identifier of termination virtual link L02, as link instruction information indicating termination node N2 of link string ML0.
- the matching node instruction information S5 is displayed.
- the route guidance data used in the second embodiment is composed of the corresponding link instruction information only in the corresponding node instruction information of the route guidance data in the first embodiment.
- FIG. 25 shows an example of corresponding node instruction information used in the second embodiment.
- the route guidance record # 0 and the route guidance record # 1 in FIG. 10 are respectively connected to the node N1 and the link in the link row ML2 for the road network in FIG. 23, as in the first embodiment. Node related information of node N2 in row ML4.
- “121”, which is the link identifier of the terminal virtual link L21 starting from the node N1 is stored as the link instruction information of the corresponding node instruction information of the route guidance record # 0, and the route guidance is performed.
- “142” that is the link identifier of the link L42 starting from the node N2 is stored. Also compatible
- the route guidance record # 0 and the route guidance record # 1 are stored in the order of the ascending order of the value of the link identifier represented by the link instruction information.
- the operation of the map information processing apparatus according to the second embodiment is similar to the operation of the map information processing apparatus of the first embodiment.
- the processing related to the start / end point instruction information is omitted.
- invariant link identifiers are assigned to all links and terminal virtual links, and the identity of the nodes is determined as a link string record.
- the link identifiers are used to represent all the nodes in the road network, so that the identity of the nodes can be expressed using the link identifiers for all nodes in the road network. It is possible to reduce the amount of update data that does not change the matching node instruction information due to deletion or establishment of irrelevant link rows or links, and to update road network data at high speed. Can do.
- Link instruction information can reduce the amount of update data that does not need to be updated, and enables faster update processing.
- the corresponding node instruction information is configured to be included in the route guidance record in the road network data, road network data that does not need to be updated even if the route guidance record is updated.
- the amount of update data can be reduced, and faster update processing is possible.
- an invariant link identifier is used as the link instruction information of the corresponding node instruction information, it is not necessary to update the corresponding node instruction information due to the abolition or establishment of an irrelevant link string or link, and the route guidance data update data The amount of data can be reduced, and faster update processing is possible.
- link sequence records are arranged in ascending order of the link identifier range information, a link sequence record including a link with a desired link identifier can be quickly found, and map information processing can be performed at high speed. it can. Furthermore, since the same node identifier that is unique to the node and does not depend on the order of the link sequence record is used for the link instruction for entering or leaving the node, the link identifier of the unrelated link sequence is not used. Deleted or newly established Therefore, it is not necessary to update the same node identifier, the amount of update data can be reduced, and road network data can be updated at higher speed.
- the map information processing apparatus can be modified as follows.
- the matching node instruction information and the corresponding node instruction information can be expressed by using a link identifier of a link whose end node is the node indicated by the matching node instruction information.
- the link identifier is used as the link instruction information of the matching node instruction information and the corresponding node instruction information.
- the link identifier has a range
- the upper limit value of the range of the link identifier is used as the link instruction information.
- a virtual start point link which is a virtual link having the start node in the link row as the end node, is assumed, and a unique and invariant link identifier is assigned to the virtual start point link.
- map information processing apparatus According to the map information processing apparatus according to the modification of the second embodiment of the present invention, for the same reason as the map information processing apparatus according to the second embodiment, the map information processing apparatus according to the second embodiment Similar effects can be obtained.
- a memory card, a magneto-optical disk, or the like instead of a hard disk that uses a hard disk as the storage medium of the map information storage device 3
- Storage media that can be read and written to can be used.
- the map information is stored in a hard disk of the map information storage device 3 and stored in a read-only storage medium such as a CD-ROM (Compact Disc-Read Only Memory) DVD ROM and read from the storage medium.
- the map information stored in the storage medium by the device can be read.
- the map data is obtained by reading from the map information storage device 3, but the other device power map data is obtained by using the communication means.
- a power using a DVD-ROM as a storage medium for map update information for example, a readable storage medium such as a CD-ROM or a memory card can be used.
- the DVD drive is used as the update information acquisition device 4
- various devices can be used as long as the device is suitable for the map update information storage medium.
- the update information acquisition device 4 Although the map update information is obtained from the storage medium of the figure update information, other device capabilities can be obtained by using the communication means to obtain the map update information.
- the map update information acquired by the update information acquisition device 4 is stored in the map information storage device 3 and the map update data is read from the map information storage device 3, but other devices can be used using the communication means. Force map update data can also be obtained. Further, the map update information acquired by the update information acquisition device 4 is stored in the map information storage device 3 and the map update data is read from the map information storage device 3, but the update information acquisition device 4 It can be configured to read the map update data directly from the storage medium.
- the updated map data can be configured to be stored in the map information storage device 3.
- the route calculation is configured to be performed using the route calculation data, but the route calculation may be performed using the road network data of the map data.
- the link string record number and the link number are used for specifying the update target, the link identifier can also be used.
- the map information processing apparatus and the map information storage medium according to the present invention reduce the amount of data for instructing the update when a road or an intersection is newly established or abolished, and are updated.
- the process can be performed easily and quickly, and is suitable for use in a car navigation device, a cellular phone, a portable information terminal, and the like.
Landscapes
- Engineering & Computer Science (AREA)
- Remote Sensing (AREA)
- Radar, Positioning & Navigation (AREA)
- General Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- Automation & Control Theory (AREA)
- Theoretical Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Navigation (AREA)
- Traffic Control Systems (AREA)
- Instructional Devices (AREA)
Description
Claims
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN2005800473220A CN101111878B (zh) | 2005-02-08 | 2005-11-14 | 地图信息处理装置 |
US11/791,939 US7877203B2 (en) | 2005-02-08 | 2005-11-14 | Map information processing apparatus and storage medium of map information |
DE112005003374T DE112005003374T5 (de) | 2005-02-08 | 2005-11-14 | Karteninformations-Verarbeitungsvorrichtung und Speichermedium für Karteninformation |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2005-032023 | 2005-02-08 | ||
JP2005032023A JP4727245B2 (ja) | 2005-02-08 | 2005-02-08 | 地図情報処理装置 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2006085412A1 true WO2006085412A1 (ja) | 2006-08-17 |
Family
ID=36792990
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2005/020874 WO2006085412A1 (ja) | 2005-02-08 | 2005-11-14 | 地図情報処理装置および地図情報の記憶媒体 |
Country Status (5)
Country | Link |
---|---|
US (1) | US7877203B2 (ja) |
JP (1) | JP4727245B2 (ja) |
CN (1) | CN101111878B (ja) |
DE (1) | DE112005003374T5 (ja) |
WO (1) | WO2006085412A1 (ja) |
Cited By (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP1950530A3 (en) * | 2006-12-27 | 2008-09-17 | Aisin AW Co., Ltd. | Road map data structure, road map data storage medium and navigation device |
WO2008126683A1 (en) * | 2007-03-27 | 2008-10-23 | Aisin Aw Co., Ltd. | Road map data structure5 road map data storage medium5 navigation device5 and method of generating road map data |
US7877203B2 (en) * | 2005-02-08 | 2011-01-25 | Mitsubishi Electric Corporation | Map information processing apparatus and storage medium of map information |
WO2012104965A1 (ja) * | 2011-01-31 | 2012-08-09 | パイオニア株式会社 | 経路探索装置、経路探索方法及び経路探索プログラム、並びにサーバ装置 |
CN113709700A (zh) * | 2020-05-21 | 2021-11-26 | 北京大唐高鸿数据网络技术有限公司 | 一种地图数据的处理方法、装置及设备 |
Families Citing this family (47)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP4162959B2 (ja) * | 2002-09-27 | 2008-10-08 | 株式会社ザナヴィ・インフォマティクス | 地図データ処理装置 |
KR100711866B1 (ko) * | 2005-05-18 | 2007-04-25 | 엘지전자 주식회사 | 소통상태에 대한 예측정보를 제공하고 이를 이용하는 방법및 장치 |
KR20060119739A (ko) * | 2005-05-18 | 2006-11-24 | 엘지전자 주식회사 | 구간 통과시간에 대한 예측정보를 제공하고 이를 이용하는방법 및 장치 |
KR20060119743A (ko) * | 2005-05-18 | 2006-11-24 | 엘지전자 주식회사 | 구간 속도에 대한 예측정보를 제공하고 이를 이용하는 방법및 장치 |
KR20060119746A (ko) | 2005-05-18 | 2006-11-24 | 엘지전자 주식회사 | 교통상태에 대한 정보를 제공하고 이를 이용하는 방법 및장치 |
KR20060119742A (ko) * | 2005-05-18 | 2006-11-24 | 엘지전자 주식회사 | 도로 정보를 제공하고 이를 이용하는 방법 및 장치 |
US8711850B2 (en) * | 2005-07-08 | 2014-04-29 | Lg Electronics Inc. | Format for providing traffic information and a method and apparatus for using the format |
KR101254219B1 (ko) * | 2006-01-19 | 2013-04-23 | 엘지전자 주식회사 | 링크 식별 방법 및 링크 식별 장치 |
US8396657B2 (en) * | 2005-12-22 | 2013-03-12 | Hewlett-Packard Development Company, L.P. | Techniques to improve location accuracy for a map |
DE112009000554B4 (de) * | 2008-04-28 | 2013-12-12 | Mitsubishi Electric Corp. | Navigationsgerät |
CN102027329B (zh) * | 2008-07-11 | 2013-10-16 | 电子地图有限公司 | 交叉点视图显示的设备和方法 |
JP5558684B2 (ja) * | 2008-07-25 | 2014-07-23 | 株式会社デンソー | 地図データ更新装置、地図データ更新プログラム及び地図データの更新方法 |
JP4743256B2 (ja) * | 2008-10-30 | 2011-08-10 | 株式会社デンソー | データ処理装置 |
JP5056737B2 (ja) * | 2008-12-04 | 2012-10-24 | アイシン・エィ・ダブリュ株式会社 | ナビゲーション装置及びナビゲーションの道路データ作成装置 |
US8825375B2 (en) * | 2009-09-29 | 2014-09-02 | Apple Inc. | Snap-to-road using wireless access point data |
JP5440477B2 (ja) * | 2010-01-29 | 2014-03-12 | 株式会社デンソー | 電子機器 |
JP5440220B2 (ja) * | 2010-01-29 | 2014-03-12 | 株式会社デンソー | ナビゲーション装置 |
JP5440219B2 (ja) * | 2010-01-29 | 2014-03-12 | 株式会社デンソー | 地図データ及び地図データ作成方法 |
JP5531649B2 (ja) * | 2010-01-29 | 2014-06-25 | 株式会社デンソー | 地図データ |
US8571793B2 (en) | 2010-01-29 | 2013-10-29 | Denso Corporation | Map data, method for preparing the same, data product containing the same, storage medium containing the same, and navigation apparatus using the same |
JP5388893B2 (ja) * | 2010-02-12 | 2014-01-15 | 日立オートモティブシステムズ株式会社 | 地図データ配信サーバ、地図更新方法、及び地図データ配信システム |
CN102194312B (zh) * | 2010-03-05 | 2014-07-02 | 高德软件有限公司 | 一种道路合并方法及道路合并装置 |
JPWO2012032619A1 (ja) * | 2010-09-08 | 2013-12-12 | クラリオン株式会社 | 地図データ処理装置、更新地図データ配信装置、地図データ更新システム、地図データ更新方法 |
JP2012093148A (ja) * | 2010-10-26 | 2012-05-17 | Navitime Japan Co Ltd | ナビゲーションシステム、端末装置、サーバ装置、ナビゲーション方法、および、プログラム |
EP2487461B1 (en) * | 2011-02-09 | 2015-10-07 | Harman Becker Automotive Systems GmbH | Vehicle navigation device and method |
JP5638125B2 (ja) * | 2011-03-29 | 2014-12-10 | 三菱電機株式会社 | 関連情報作成方法および関連情報作成装置 |
JP2012141321A (ja) * | 2012-03-28 | 2012-07-26 | Mitsubishi Electric Corp | 地図情報処理装置 |
US9052197B2 (en) | 2012-06-05 | 2015-06-09 | Apple Inc. | Providing navigation instructions while device is in locked mode |
US9230556B2 (en) | 2012-06-05 | 2016-01-05 | Apple Inc. | Voice instructions during navigation |
US10176633B2 (en) | 2012-06-05 | 2019-01-08 | Apple Inc. | Integrated mapping and navigation application |
US9997069B2 (en) | 2012-06-05 | 2018-06-12 | Apple Inc. | Context-aware voice guidance |
US9482296B2 (en) | 2012-06-05 | 2016-11-01 | Apple Inc. | Rendering road signs during navigation |
US9418672B2 (en) | 2012-06-05 | 2016-08-16 | Apple Inc. | Navigation application with adaptive instruction text |
US20130321400A1 (en) | 2012-06-05 | 2013-12-05 | Apple Inc. | 3D Map Views for 3D Maps |
US9886794B2 (en) | 2012-06-05 | 2018-02-06 | Apple Inc. | Problem reporting in maps |
CN103471603B (zh) * | 2012-06-06 | 2015-10-21 | 腾讯科技(深圳)有限公司 | 一种公交线路与道路网络的匹配方法和装置 |
US9171464B2 (en) | 2012-06-10 | 2015-10-27 | Apple Inc. | Encoded representation of route data |
US11935190B2 (en) | 2012-06-10 | 2024-03-19 | Apple Inc. | Representing traffic along a route |
CN105701555A (zh) * | 2014-11-28 | 2016-06-22 | 国际商业机器公司 | 用于划分路网的方法和*** |
US9575993B2 (en) | 2014-12-30 | 2017-02-21 | Here Global B.V. | Binary difference operations for navigational bit streams |
JP6391507B2 (ja) * | 2015-03-18 | 2018-09-19 | アイシン・エィ・ダブリュ株式会社 | ナビゲーション装置、ナビゲーションプログラム、及びナビゲーション方法 |
CN106156245B (zh) * | 2015-04-28 | 2020-02-14 | 高德软件有限公司 | 一种电子地图中的线要素合并方法及装置 |
US9880011B2 (en) * | 2015-07-31 | 2018-01-30 | International Business Machines Corporation | Simplification of trajectory representation |
JP6524892B2 (ja) * | 2015-11-13 | 2019-06-05 | 株式会社デンソー | 車両の走行路情報生成システム |
EP3252430B1 (en) * | 2016-05-31 | 2021-05-05 | HERE Global B.V. | Route determination and navigation based on multi-version map regions |
EP3279811B1 (en) | 2016-08-04 | 2023-10-04 | HERE Global B.V. | Reducing size of update package data for navigation databases |
WO2019135394A1 (ja) * | 2018-01-04 | 2019-07-11 | パイオニア株式会社 | 地図情報提供システム、地図情報提供方法、及び地図情報提供プログラム |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH10171347A (ja) * | 1996-12-12 | 1998-06-26 | Zanavy Informatics:Kk | 地図データベース装置 |
JP2004028846A (ja) * | 2002-06-27 | 2004-01-29 | Zenrin Co Ltd | 電子地図データにおける経路探索用データと経路誘導用データのデータ構造、およびこれらの利用 |
Family Cites Families (22)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH08332562A (ja) * | 1995-06-08 | 1996-12-17 | Toyota Motor Corp | 摺動用部材の製造方法 |
JP3208096B2 (ja) * | 1997-08-27 | 2001-09-10 | 株式会社アマダ | バーコードによる自動工作加工システム |
JPH11325940A (ja) * | 1998-05-18 | 1999-11-26 | Mitsubishi Electric Corp | 情報管理装置,ナビゲーション装置及びナビゲーション方法 |
JP3332225B2 (ja) * | 1998-11-24 | 2002-10-07 | 松下電器産業株式会社 | 地図提供システム |
JP3348675B2 (ja) * | 1999-03-16 | 2002-11-20 | 株式会社デンソー | 車載用ナビゲーション装置 |
CA2266208C (en) * | 1999-03-19 | 2008-07-08 | Wenking Corp. | Remote road traffic data exchange and intelligent vehicle highway system |
JP3761744B2 (ja) * | 1999-06-08 | 2006-03-29 | 三菱電機株式会社 | ナビゲーション装置 |
JP4566413B2 (ja) * | 2001-01-10 | 2010-10-20 | 三菱電機株式会社 | 地図情報処理装置 |
JP4416996B2 (ja) * | 2002-11-01 | 2010-02-17 | 三菱電機株式会社 | 地図情報処理装置および地図情報提供装置 |
JP2004198321A (ja) | 2002-12-19 | 2004-07-15 | Pioneer Electronic Corp | ナビゲーション用の差分更新データ作成装置及び方法、ナビゲーション装置及び方法、ナビゲーション用の差分更新データセット並びにコンピュータプログラム |
JP2004198841A (ja) * | 2002-12-19 | 2004-07-15 | Pioneer Electronic Corp | ナビゲーション装置及び方法、並びにコンピュータプログラム |
JP2004271953A (ja) * | 2003-03-10 | 2004-09-30 | Xanavi Informatics Corp | 地図データの構造および地図データ処理装置 |
JP4067467B2 (ja) * | 2003-07-07 | 2008-03-26 | 株式会社国際電気通信基礎技術研究所 | 情報検索表示システム |
WO2005107161A1 (fr) * | 2004-04-28 | 2005-11-10 | Beijing Jiaxun Feihong Electrical Co., Ltd. | Systeme et procede de communications d'un reseau de telecommunications ip et leur application |
JP4727245B2 (ja) * | 2005-02-08 | 2011-07-20 | 三菱電機株式会社 | 地図情報処理装置 |
CN101699546B (zh) * | 2005-04-08 | 2012-05-09 | 松下电器产业株式会社 | 地图信息更新装置及地图信息更新方法 |
US8909465B2 (en) * | 2005-12-29 | 2014-12-09 | Mapquest, Inc. | User-controlled alternative routing |
JP5093562B2 (ja) * | 2006-12-27 | 2012-12-12 | アイシン・エィ・ダブリュ株式会社 | ナビゲーション装置 |
US8103435B2 (en) * | 2007-07-27 | 2012-01-24 | George Mason Intellectual Properties, Inc. | Near real-time traffic routing |
CA2757647A1 (en) * | 2008-04-04 | 2009-12-03 | Powerwave Cognition, Inc. | Methods and systems for a mobile, broadband, routable internet |
US20100142446A1 (en) * | 2008-09-04 | 2010-06-10 | Ludger Schlicht | Business management systems for a mobile, broadband, routable internet |
US20100142447A1 (en) * | 2008-09-04 | 2010-06-10 | Ludger Schlicht | Web applications for a mobile, broadband, routable internet |
-
2005
- 2005-02-08 JP JP2005032023A patent/JP4727245B2/ja active Active
- 2005-11-14 WO PCT/JP2005/020874 patent/WO2006085412A1/ja not_active Application Discontinuation
- 2005-11-14 US US11/791,939 patent/US7877203B2/en not_active Expired - Fee Related
- 2005-11-14 CN CN2005800473220A patent/CN101111878B/zh not_active Expired - Fee Related
- 2005-11-14 DE DE112005003374T patent/DE112005003374T5/de not_active Ceased
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH10171347A (ja) * | 1996-12-12 | 1998-06-26 | Zanavy Informatics:Kk | 地図データベース装置 |
JP2004028846A (ja) * | 2002-06-27 | 2004-01-29 | Zenrin Co Ltd | 電子地図データにおける経路探索用データと経路誘導用データのデータ構造、およびこれらの利用 |
Cited By (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7877203B2 (en) * | 2005-02-08 | 2011-01-25 | Mitsubishi Electric Corporation | Map information processing apparatus and storage medium of map information |
EP1950530A3 (en) * | 2006-12-27 | 2008-09-17 | Aisin AW Co., Ltd. | Road map data structure, road map data storage medium and navigation device |
US7949467B2 (en) | 2006-12-27 | 2011-05-24 | Aisin Aw Co., Ltd. | Road map data structure, road map data structure creating method, road map data storage medium, and navigation device |
WO2008126683A1 (en) * | 2007-03-27 | 2008-10-23 | Aisin Aw Co., Ltd. | Road map data structure5 road map data storage medium5 navigation device5 and method of generating road map data |
CN101611292B (zh) * | 2007-03-27 | 2012-10-03 | 爱信艾达株式会社 | 道路地图数据的生成方法及装置 |
US8396660B2 (en) | 2007-03-27 | 2013-03-12 | Aisin Aw Co., Ltd. | Road map data structure, road map data storage medium, navigation device, and method of generating road map data |
WO2012104965A1 (ja) * | 2011-01-31 | 2012-08-09 | パイオニア株式会社 | 経路探索装置、経路探索方法及び経路探索プログラム、並びにサーバ装置 |
CN113709700A (zh) * | 2020-05-21 | 2021-11-26 | 北京大唐高鸿数据网络技术有限公司 | 一种地图数据的处理方法、装置及设备 |
CN113709700B (zh) * | 2020-05-21 | 2024-03-26 | 中信科智联科技有限公司 | 一种地图数据的处理方法、装置及设备 |
Also Published As
Publication number | Publication date |
---|---|
DE112005003374T5 (de) | 2008-01-10 |
US7877203B2 (en) | 2011-01-25 |
CN101111878A (zh) | 2008-01-23 |
JP2006220756A (ja) | 2006-08-24 |
US20080091344A1 (en) | 2008-04-17 |
JP4727245B2 (ja) | 2011-07-20 |
CN101111878B (zh) | 2011-05-04 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2006085412A1 (ja) | 地図情報処理装置および地図情報の記憶媒体 | |
JP4543637B2 (ja) | 地図情報処理装置 | |
US6542816B1 (en) | Communication navigation system | |
US6269303B1 (en) | Vehicle navigation system and recording medium | |
EP0838662B1 (en) | Navigation system | |
US6128573A (en) | Map database apparatus | |
JP3905136B2 (ja) | ナビゲーション装置 | |
EP0848232B1 (en) | Map database apparatus | |
KR100286398B1 (ko) | 항법장치 | |
EP1191499B1 (en) | Route search apparatus | |
JP2004157172A (ja) | 地図情報のデータ構造、更新指示情報のデータ構造、地図情報処理装置、および地図情報提供装置 | |
US5919245A (en) | Map database apparatus | |
JP3657763B2 (ja) | 地図表示装置 | |
JPH09292241A (ja) | ナビゲーションシステム | |
JP4752972B2 (ja) | 地図情報処理装置 | |
JPH1137783A (ja) | ナビゲーション装置 | |
JPH10239079A (ja) | ナビゲーション装置 | |
JP3869055B2 (ja) | 経路探索装置 | |
JP3774284B2 (ja) | 経路探索装置 | |
JP3798865B2 (ja) | 経路探索装置 | |
JPH07113650A (ja) | 経路探索装置 | |
JPH04177287A (ja) | 最適経路決定装置 | |
JPH09178501A (ja) | ナビゲーション装置 | |
JPH05232874A (ja) | 経路探索装置 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWE | Wipo information: entry into national phase |
Ref document number: 11791939 Country of ref document: US |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1120050033740 Country of ref document: DE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 200580047322.0 Country of ref document: CN |
|
RET | De translation (de og part 6b) |
Ref document number: 112005003374 Country of ref document: DE Date of ref document: 20080110 Kind code of ref document: P |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 05805946 Country of ref document: EP Kind code of ref document: A1 |
|
WWW | Wipo information: withdrawn in national office |
Ref document number: 5805946 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 11791939 Country of ref document: US |
|
NENP | Non-entry into the national phase |
Ref country code: JP |
|
REG | Reference to national code |
Ref country code: DE Ref legal event code: 8607 |