DE10200375A1 - Device and method for processing card data - Google Patents

Abstract

A map data processing device and an associated method are described which are designed such that update operation information is obtained, which indicates the update content of map data and update the map data in accordance with the update operation information obtained.

Description

BACKGROUND OF THE INVENTION 1. Field of the Invention

The invention relates to a device and a method for Processing of map data, to update Map data used by mobile units for example from a vehicle navigation system, a Mobile phone, a personal digital assistant, and like.

2. Description of the prior art

Fig. 42 schematically shows a conventional map data processing device described in, for example, Japanese Patent Application Laid-Open No. 11-95657. In the drawing, reference numeral 1 denotes an information center for generating update information for map data; 2 a transmitter for transmitting the update information generated by the information center; 3 a receiver for receiving the update information; 13, a map data storage device for storing the map data; 5 shows a map data processor for determining a part of the map data to be changed and the amount of the change in response to the update information received from the receiver 3 and for subsequently changing the map data; 6 an input device; and 7 an output device.

In FIGS. 43A to 43C Figure 43A is a view showing a road network before the update of a specific area, which is represented by a node, and a junction. Figure 43B is a view that represents the road network after updating a certain range, which is represented by the node and a link. and Fig. 43C is a view explaining a node number assigned to each node to refer to the nodes of Figs. 43A and 43B.

Next, the operation will be explained.

The information center 1 transmits update information, which is used to update the map data of each area to a most recent version, via the transmitter 2 . For example, when the road network is updated from FIG. 43A to FIG. 43B, the information center 1 sends update information indicating that links between nodes N2 and N5 and between nodes N5 and N7 of the area have been broken, link between nodes N3 and N6 has been added and nodes N5 and N7 have been removed.

After receiving the above-mentioned update information from the receiver 3 , the map data processor 5 extracts the map data of the road network of FIG. 4A stored in the map data memory 13 and performs an update of the map data based on the update information.

As a result, map data representing the road network ( FIG. 43B) is built up and the map data of the road network ( FIG. 43B) is stored in the map data memory 13 .

In the above-described construction of the conventional map data processing device, information is used as update information which indicates the addition or removal of nodes and links which form the road network. However, the map data representing the road network consists not only of data corresponding to a node or a link one to one, but also of data indicating a neighborhood relationship between a node and a link, data indicating traffic rules between links , etc. Such data of different types are closely related. Therefore, the map data processor 5 needs to calculate the type of data, a part to be changed, and the content of the change from the addition / deletion information of the node or the link as update information. Therefore, the load to which the card data processor 5 is subjected is excessively increased, resulting in the disadvantage that a quick update becomes difficult, etc.

In addition, there may be a case where transmission of update information from the transmitter 2 to the receiver 3 is interrupted, making it impossible to receive the update information related to a certain area. As a result of the impossibility of updating the map data of the area, the map data of a most recent version and the map data of an old version can be stored mixed in the map data storage device 13 . In the map data representing the road network, the nodes are arranged in a predetermined order, and reference is made to a desired node using a node number in the arrangement of the field. However, as shown in Fig. 43C, adding or dropping a node changes the node numbers, and is assigned a different node number when a version is different even though the same node is used.

The respective map data contain a node number for reference to the node of an adjacent area, that is to say the node number of an adjacent area, in order to indicate the connection of the road network between the adjacent areas. However, since the node number of an adjacent area indicates the node of the adjacent area in a version identical to that of the area in question, if the version of the adjacent area differs from that of the area, the node number of the adjacent area shows a different node which leads to a mismatch between the neighboring map data in different versions. As mentioned above, there may be a case where the map data of different versions are mixed in the map data storage device 13 . Then a mismatch between the neighboring map data occurs, which leads to the disadvantage that, for example, the processing of map data becomes impossible, etc.

SUMMARY OF THE INVENTION

The present invention has been made to solve the foregoing Difficulties developed, and the invention underlying goals are to provide one Device and a method for processing Card data, which quickly update the card data can.

Other objects of the invention are to provide a device and a method for processing Card data, which mismatch between the Can prevent card data in different versions.  

According to one aspect of the invention, a Map data processing device provided, which comprises: a storage device for storing Map data; an information acquisition device for Obtaining update operation information that the Update content of the map data indicates that in the Storage device are stored; and a Updating device for updating the map data, stored in the storage device accordingly the update operation information provided by the Information acquisition device was obtained.

In the card data processing device according to the Invention achieves the information acquisition device Update operation information which Contains update position information, part of which to be updated by an offset opposite a predetermined reference position in the map data is represented.

In the card data processing device according to the Invention obtains the information acquisition device Update operation information, which is among data that are contained in the card data, Data setting information for setting to contains updating data, as well Update position information that a card set indicates where the data is stored.

In the card data processing device according to the Invention achieves the information acquisition device Update operation information that Contains update position information, at least one or more update positions in the record indicates.  

In the card data processing device according to the Invention achieves the information acquisition device Update operation information that Update type information contains which Update types of at least one or more parts specifies which to update in the record.

In the card data processing device according to the Invention, a data storage device is provided to store the update operation information that is obtained from the information acquisition device when the update time as a result of Update device a predetermined reference time and to save map data Update by the update device if the Update time is less than the predetermined time.

In the card data processing device according to the Invention, a data storage device is provided to store the update operation information that was obtained from the information acquisition device, if the update time determined by the Update device a predetermined reference time and to save map data Update by the update device if the determined update time less than the predetermined Reference time is.

According to another aspect of the invention, a Map data processing device provided, which comprises: a storage device for storing Map data; an information acquisition device for Obtaining update information regarding the Map data stored in the storage device; and an update device for updating the Map data stored in the storage device according to the update information provided by the  Information acquisition device is obtained. In this Case receives the information acquisition device corresponding node information that is a correspondence between identical nodes of different versions indicates when the storage device stores map data, and a version of a certain range from that of one other area is different.

In the card data processing device according to the Invention obtains the information acquisition device Information regarding corresponding nodes only if Versions of adjacent areas are different are, the information obtained corresponding to each other Knot affects identical knots in each other neighboring areas are available.

In the card data processing device according to the Invention only obtains the information acquisition device Information related to corresponding nodes of the same Knot in an overlapping part of each other neighboring areas is available.

According to another aspect of the information, a Provided card data processing methods, which includes the steps of: Obtaining Update operation information which the Indicates update content of stored map data; and Update the map data according to the one received Updated operational information.

In the map data processing method according to the invention update operation information will be obtained which Contains update position information, part of which to be updated by an offset opposite a predetermined reference position represented in the card data is available.  

In the map data processing method according to the invention update operation information will be obtained which Contains data that provides information about how to set contains updating data, as well Update position information that a record indicates in which the data is stored, under which in the data contained in the card data.

In the map data processing method according to the invention will get update operation information that Contains update position information, at least one or more update positions in one Specifies record.

In the map data processing method according to the invention will get update operation information that Update type information contains which Update types of at least one or more parts specifies which to update in the record.

In the map data processing method according to the invention becomes the update operation information obtained saved when the update time of the map data exceeds a predetermined reference time, and the Card data saved after the update if the Update time less than the predetermined reference time is.

In the map data processing method according to the invention becomes the update operation information obtained saved when the determined update time of the Card data exceeds a predetermined reference time, and the card data is saved after the update, if the determined update time is less than that predetermined reference time.  

According to a further aspect of the invention, a Provided card data processing methods, which includes the steps of: Obtaining Update information for stored map data; and Update the map data according to the one received Update information. In this case, if stored map data are available, and a version one area is different from another Area differs, information related to receive corresponding nodes, which have an equivalent between identical nodes of the respective versions.

In the map data processing method according to the invention becomes information related to corresponding nodes obtained only when versions of adjacent to each other Areas are different, with the information related on corresponding nodes that are obtained identical Knot affects that in adjacent areas available.

In the card data processing device according to the Invention is only related to relevant information Obtain nodes, namely with respect to the same node that in an overlapping part of adjacent areas is available.

The invention is illustrated below with reference to drawings illustrated embodiments explained in more detail what other advantages and features emerge. It shows:

Fig. 1 is a schematic view of a map data processing device according to first to fourth embodiment of the present invention;

Fig. 2 is a schematic view of a map data providing station in each of the first to fourth embodiments;

Fig. 3 is a view of an example of map data;

FIGS. 4A and 4B are views each explaining a road network of a given area;

Fig. 5A to 5J are views of an example of a data structure of route calculation data;

Fig. 6 is a view for explaining the content of a node table of route calculation data of the data structure shown in each of Figs. 5A to 5J with respect to the road network of Fig. 4A;

Fig. 7 is a view for explaining the content of connection information of route calculation data of the data structure shown in each of Figs. 5A to 5J with respect to the road network of Fig. 4A;

Fig. 8 is a view for explaining the content of a cost table of route calculation data of the data structure shown in each of Figs. 5A to 5J with respect to the road network of Fig. 4A;

Fig. 9 is a view for explaining the content of a node table, connection information and a cost table corresponding to the road network of Fig. 4B;

Fig. 10 is a view for explaining the contents of the node table, the connection information and the cost table corresponding to the road network of Fig. 4B;

11 is a view for explaining the contents of the node table, the link information and the cost table corresponding to the road network of Fig. 4B.

Fig. 12 is a flow chart illustrating the operation of the map data providing station;

FIG. 13A to 13D are views each showing an example of a data structure of update operation information;

FIG. 14A to 14C are views each showing a setting data used for updating of operation information;

Fig. 15 is a view of update operation information of the data structure in each of Figs. 13A to 13D;

Fig. 16 is a flow chart of the operation of the map data processing means;

Fig. 17 is a flowchart of details of the processing of step ST18;

Figure 18 is a flow chart illustrating the definition of update type information in the update operation information of the 13A to 13D..;

FIG. 19A to 19C are views each explaining the data structure of an update record, if update type information indicating a partial update of a single type;

Figs. 20A to 20C are views for explaining the data structure of an update record, if update type information indicating a partial update of the composite type;

Fig. 21 is a view showing the example of defining information for partial data in a connection record of the route calculation data connection information shown in each of Figs. 5A to 5J;

FIG. 22A and 22B illustrated data structure 19A to 19C are views showing an example for the data in each of FIGS.

Figure 23 is a view showing an example of an update record for specifying the partial update of the composite type of a connection data set of connection information.

FIG. 24 is a flow chart of the operation of a card data processor;

Fig. 25 is a flowchart showing details of the partial update of each type of step ST31 of Fig. 24;

Fig. 26 is a flowchart showing details of the partial update of the composite type of step ST32 of Fig. 24;

Fig. 27 is a view of a data structure of an update operation information storage section;

FIG. 28 is a view of a data structure of a card buffer;

FIG. 29 is a flow chart of the operation of a map data processing device according to the third embodiment;

FIG. 30 is a flow chart of the operation of a card data processor;

FIG. 31 is a flow chart of the operation of the map data providing station according to the fourth embodiment;

Figure 32 is a view for explaining the relationship between the fields of map data.

FIG. 33A to 33E views of respective examples of a road network;

FIG. 34A to 34D examples for a respective road network;

FIG. 35A to 35F views showing examples of respective road networks;

FIG. 36A and 36B views of the respective correspondence between node record numbers;

FIG. 37A to 37C views of examples of a specific data structure corresponding node information;

FIG. 38A and 38B views of respective examples of a table of corresponding nodes of the data structure of each of Figs 37A to 37C.

Fig. 39 details of the flow chart of the step ST81 of Fig. 31;

FIG. 40 is a Flussdiagrarnm the operation of a card information processing apparatus according to a fifth embodiment;

Fig. 41 is a view of an example of a data structure of a node table memory portion;

Fig. 42 is a schematic view of a conventional map data processing device; and

FIGS. 43A to 43C views of a respective road network that is represented by a node and a link.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

An embodiment of the present invention will described below.

EMBODIMENT 1

Fig. 1 shows schematically a map data processing device according to the first embodiment of the invention. In the drawing, reference numeral 11 denotes an input device for inputting information and the like related to the operation of the map data processing device; 12 shows a vehicle position detector for detecting the position of a vehicle in which the map data processing device is provided using a GPS receiver and the like; and 13, a map data storage device (storage device) for storing map data.

Numeral 14 denotes a transmitter / receiver (information acquisition device) that uses a cell phone and the like to receive update operation information indicating the update content of map data and to send / receive various bits of information with a map data providing station via a communication network; and reference numeral 15 denotes a map data processor (update device) which serves to perform: map adjustment to identify a road on which a vehicle is running and its position on the road based on the vehicle position obtained from the vehicle position detector 12 is determined, and from map data stored in the map data storage device 13 , a route calculation used to calculate a route from a starting point to a destination using the map data; Route that serves to guide the vehicle from the starting point to the destination; Map display of the surroundings of the vehicle position; and various other navigation operations; and finally updating the map data stored in the map data storage device 13 in accordance with the update operation information indicating the content of the update and received by the transceiver 14 . In this case, the update operation information indicating the content of the update includes update position information,. which indicates a part to be updated, update type information indicating the type of update such as replace, delete, add, and the like, and data of the part to be updated, such as replaced, added, and the like.

Numeral 16 denotes an update data storage device for storing map data updated by the map data processor 15 ; and reference numeral 17 denotes an output device for displaying or outputting, by voice, a map, a vehicle position, a route, guidance information, and the like, specified by the map data processor 15 .

Fig. 2 shows schematically the map data providing station. In the drawing, reference numeral 21 denotes a transmitter / receiver which is made of a model or the like which is used for transmitting data with the transmitter / receiver 14 via the communication network; 22 denotes a road network database for storing road network data managed for each version; 23 denotes a road network update database for storing road network update data indicating how the road network was updated between different versions; and 24 denotes an update operation information generator for generating update operation information related to the road network data between versions in the map data processor 15 after referring to the road network database 22 and the road network update database 23 .

Fig. 3 shows an example of map data stored in the map data storage unit 13, in the update data storage device 16, and in the road network database 22.

Administrative information is available as card information, various map data, guide search data, as well various other dates.  

All map data will be assigned to each area Provided when the whole country in different Areas is divided. Information which the card of a associated area indicates is in the map data contain.

Administrative information represents data required for administration the card data are provided. The Administrative information contains information related to the Location of the card data in the card information, Version information for managing saved old or new information, etc.

The map data include road data that are used for Map adjustment, for displaying streets or the like be used; Background data used to display a Map background are used, for example one River, lake or the like; Name data used for Displays the name of a place, a name or the like be used; Route guidance data for Route guidance can be used; Route calculation data, used to calculate a route; Dates in Regarding local facilities used to find local Facilities used, etc. The card data also contain various attributes related to the map data of information and the like, which the specify the area concerned and a leader that Contains information needed to manage the places various data and the like is used.

Respectively, FIGS. 4A and 4B are views of the road network of a specific area. In these figures, N0 to N15 denote nodes which indicate intersections; and L0 to L16 links specifying a road for connecting the crossing points.

Fig. 4A shows the road network of the above-mentioned range during a given period; and FIG. 4B shows a most recent road network in which link L12 of the road network of FIG. 4A has been eliminated and the road of link L16 has been newly established.

FIGS. 5A to 5J are views each showing an example of the data structure of route calculation data.

Fig. 5A shows the structure of the route calculation data, which consist of a route calculation header, a route table, connection information, and a cost table.

FIG. 5B shows the structure of the route calculation leader, may be used in which offsets and data sizes to indicate the locations of a node table, link information, and each having a charge table, a length of 4 bytes. The offset represents the data size of data that is stored from the header of the route calculation data in the header of the respective data. Each digit in the drawing indicates an offset from the header of the route calculation header with respect to the respective data.

Fig. 5C shows the structure of the node table in which the fixed-length node records are arranged and the node records are provided in a one-to-one correspondence to the nodes which form the road network of the area in question. In addition, to identify a node record, each node record is provided with a node record number that represents a number in the order in which the node records are arranged.

Fig. 5F shows the structure of the node record consisting of a node coordinate indicating the geographic location of an associated node, a node attribute each indicating different attributes of the nodes, e.g. the presence of a traffic sign, the presence on the boundary of the area in question , and the like, the number of connected connections indicating the number of connections connected to the node; the number of regulated records that indicates the number of regulated records of an associated linked record, and the offset of a linked record that indicates the location of the associated linked record. The offset represents the data size of data that was stored from the header of the route calculation data in the header of the associated, connected data record.

As described above, the node table gives the location and the attribute of each node that the road network in the relevant area, the location of the associated area, connected data set, etc.

FIG. 5D shows the structure of the connection information in which the connected data records are arranged with variable lengths, and the connected data records are provided in a one-to-one correspondence to the nodes which form the road network of the area in question. Therefore, each linked record corresponds to each node in a one-to-one relationship. In addition, to indicate a linked record, each linked record is assigned a linked record number as a number in the order of the linked records.

Fig. 5G shows the structure of the linked record, in which linked records and regulated records are arranged, the linked records are provided in a one-to-one relationship with the connections connected to a corresponding node, and the regulated records are thus provided are that their number is equal to the number of traffic rules that exist between the links. In addition, in order to identify a linked data record, each linked data record is provided with the number of a linked data record, as a number in the order in which the linked data records are arranged. To identify a regulated data set, each regulated data set is provided with a number of a regulated data set, as a number in the order in which the regulated data sets are arranged.

Fig. 5H shows the structure of the linked record, which consists of information related to neighboring nodes and link cost information.

When the information regarding neighboring nodes is a Knot connected to a knot corresponding to the Record is connected using its Node record number represents. A knot through the information of the neighboring node is designated, is called the adjacent node of the node corresponding to the connected record, and the number of existing, neighboring nodes is equal to that of linked records.

The link cost information gives the location of the Information regarding costs incurred when driving the Node corresponding to the connected record to that neighboring nodes occur. A cost record corresponding to a link which corresponds to the linked Record is using its Represents cost record number.

Fig. 5I shows the structure of the regulated record consisting of input link information indicating the link of an input side by a number of a linked record, exit link information indicating the link of an exit side by the number of a linked record, and a regulated code between links that specifies existing traffic rules for driving from the link indicated by the input link information to the link indicated by the output link information.

As described above, the connection information gives the relationship between the node that the road network in the corresponding area, and the link to the Location of a cost record that indicates costs incurred for the Driving occurs between nodes, and traffic rules between the links in the node.

FIG. 5E shows the structure of the cost table in which the cost records with fixed lengths are arranged and the cost records are correspondingly present in a one-to-one relationship to the links that form the road network. In addition, to identify a cost record, each cost record is provided with a cost record number as a number in the order of ordering the cost records.

Fig. 5J shows the structure of the cost data set which consists of a linking attribute, which specifies each different link attributes, such as the road type of an associated link, and the like, a link length indicating the length of a link, an average running time which indicates the time, which is required to drive through a link and a width information item which indicates the road width of the link.

As mentioned above, the cost table gives several Bits of information needed for costing in terms of the cost of driving through the  Linkage occur which the road network in the area in question.

FIG. 6 is a view for explaining the contents of the route calculation data node table with the data structure shown in each of FIGS. 5A to 5J with respect to the road network of FIG. 4A. The nodes N0 to N15 are each provided with the node data records of the node data record numbers 0 to 15.

For example, the node record corresponds to a node record number in Fig. 6 to the node N1 of Fig. 4A, the node N1 is on a node coordinate (X1, Y1), there is a node attribute NA1, and the number of linked links is four, so that the links L0, L11, L1 and L8 are connected. The number of regulated data sets is four, so that there are four traffic rules under links L0, L11, L1 and L8, and an offset corresponds to the connected data set as JOFS1.

FIG. 7 schematically shows the content of the connection information of the route calculation data, which have the data structure according to FIGS. 5A to 5J, in the road network of FIG. 4A. The nodes N0 to N15 are each provided with the connected data records numbers 0 to 15 of the connected data records.

For example, the linked record of number 1 of FIG. 7 of a linked record corresponds to node B1 of FIG. 4A, its header offset is JOFS1, and corresponds to links L0, L11, L1 and L8, which are the linked records of numbers 0, 1 , 2 or 3 linked records, as well as the regulated records of the numbers 0, 1, 2 or 3 of the regulated records.

The information related to the neighboring node and the Information related to the linked costs of the linked record number 0 of a linked The data record is 0, the neighboring node of the Node N1 is node N0, and the cost of the node N1 to node N0 through the cost record with the Number 0 specified. In other words, the cost represented by the cost data record of link L0.

The information related to the neighboring node and the Information related to the linked costs of the linked record number 1 of the linked The data set is 12 and 11 respectively. The adjacent node of the Node N1 is a node N2, and the cost of the node N1 to node N12 through a cost record with the Number 11 specified. In other words, the cost represented by the cost data record of link L11.

The information related to the neighboring node and the Information related to the associated costs of the Link record number 2 of the linked The data set is 2 or 1. The adjacent node of the Node N1 is a node N2, and the cost of the node N1 to node N2 are identified by cost record number 1 specified. In other words, the cost of the Cost record of link L1 represents.

The information related to the neighboring node and the Information related to the linked costs of the linked record of a linked record with the Numbers 3 are 5 and 8 respectively. The neighboring node of node N1 is a node N5, and the cost of that Node N1 becomes node N5 through a cost record reproduced with the number 8. In other words, they are Costs through the cost data record of link L8 represents.  

The regulated data record of a regulated data record with the number 0 has input link information 5 , output link information 3 , and a regulated data record r10 between links. The traffic rules when driving from link L0 corresponding to the number 0 of the linked data record to link L8 corresponding to the linked data record with number 3 are therefore specified with r10.

The regulated record of a regulated record with the number 1 has input link information 1 , output link information 0, and a regulated record r11 between links. Traffic rules when driving from link L11 corresponding to number 0 of the linked data set to link L1 corresponding to number 2 of the linked data set are therefore indicated by r11.

The regulated record of a regulated record with the number 2 has input link information 2 , output link information 1 , and a regulated code r12 between links. Traffic rules when driving from link L1 corresponding to number 2 of the linked data set to link L11 corresponding to number 1 of the linked data set are therefore indicated by r12.

The regulated record of a regulated record with the number 3 has input link information 3 , output link information 2 , and a regulated code r13 between links. Traffic rules when driving from link L8 corresponding to number 3 of the linked data set to link L1 corresponding to number 2 of the linked data set are therefore indicated by r13.

FIG. 8 schematically shows the content of the cost table of the route calculation data with the data structure given in each of FIGS. 5A to 5J with respect to the road network of FIG. 4A. The cost data records with the cost data numbers 0 to 15 are assigned to the respective links L0 to L15.

FIGS. 9 to 11 show schematically the content of a node table, connection information, and a cost table corresponding to the road network of Fig. 4B.

By unlinking L12, the number of links connected to nodes N2 and N3 becomes 3, and the number of rules between links becomes 2. As shown in the node table of FIG. 9, the number becomes linked links and the number of regulated data records of the node data records with the node numbers 2 and 13 are updated to 3 and 2, respectively.

By adding the link L16, the number of links that are connected to the nodes N3 and N14 becomes 4. With regard to rules between these links, an input regulation r32, from link L16 to link L2, and an output regulation r33 from link L3 to link L6, are added at node N3, whereas the previous regulation at node N14 is retained. Therefore, as shown in the node table of Fig. 9, the number of linked links and the number of regulated records of the node record with the node record number 3 are updated to 4, and the number of linked links of the node record 14 of a node record number 14 is updated to 4.

In addition, as described above, since the Data size of the connected record has changed, the location of the linked records of the linked record numbers 3, 14 and 15 changed, and the offsets of the connected Records of the node codes with the node record numbers 3,  14 and 15 updated to JOFS2 ', JOFS14', respectively JOFS15 '.

In the connection information of FIG. 10, the link L12, in the connected data set with the number 2 a related set of data associated record number 1 of a linked record corresponding to the link L12 of the number 2 of the connected data set of Figure is deleted. 7 deleted, and the linked records of linked record numbers 0, 2 and 3 are arranged. The regulated records with the numbers 1 and 2 of regulated records, which specify rules relating to the link L12 in the linked record with the number 2 of a linked record of FIG. 7, are deleted, and the regulated records with the numbers 1 and 2 regulated records arranged. As explained below, since the link cost record number is changed by deleting link L12, the link cost information of the linked record number 1 is updated to 12.

As in the case of the linked data record with the number 13 of the linked data set, as a result of the change in Linking cost record number, bits of Linking cost information of the linked record of Number 0 of the connected data record from numbers 8 to 10 connected data records on 12, 13 and 14 respectively updated; and bits of link cost information in Reference to the linked data set with the number 1 linked records of numbers 12 and 14 linked Records updated to 12 and 14 respectively.

By adding the link L16 in the linked record with the number 3 of the linked record, the linked record with the number 3 of the linked record corresponding to the link L16 is added, and the numbers 1 and 2 are regulated records, which rules regarding the link Specify L16 inserted before the regulated record number 1 of the regulated record of the linked record number 3 of the linked record shown in FIG. 7. In the linked data record with number 14 of the linked data record, the linked data record with number 3 of the linked data record is added in accordance with link L16.

As a result of deleting link L12 and adding it the link L16, as described above, occur in addition the addition or deletion of linked Records and regulated records based on what changes in the data sizes of the connected data records with the numbers 2, 3, 13 and 14 linked records. Therefore the offsets of the linked records of numbers 3, 14 and 15 connected data records on JOFS3 ', JOFS14' or JOFS15 'changed, and will also change the data size of the Connection information changed. In line with the change the data size of the connection information is also the Cost table offset changed after the Connection information is arranged.

In node N12 the content of the traffic rules is related access from link L11 to link L5 from updated r63 to r63 '.

In the cost table of FIG. 11, by deleting the link L12, the cost record of a cost record number 12 of FIG. 8 corresponding to the link L12 is deleted, and the cost record numbers of the subsequent cost records are changed. Furthermore, the cost record of a cost record number 12 is added by adding the link L16.

As described above in relation to the Update, i.e. the deletion of the link L12 and the Deletion of link L16, the following was carried out: Update of the data record for the node data record numbers 2, 3, 13, 14 and 15 of the node table; Update the connected data records with the numbers 2, 3, 8, 9, 10, 12, 13 and 14 connected records of the connection information; Deletion of the cost records of cost record number 12 the cost table; and addition of the cost record on The End.

Therefore, updated map data can be obtained by collecting Update operation information related to the Records of different data are represented. At the Map data providing station using a processor has high processability, the updated map data in Update operation information of the records different data converted. In the Map data processing device can be updated the card data according to the Update operation information of the records Load which when updating the Card processing facility is exposed, essential can be reduced, and updating can be done quickly be performed.

An operation will be described next.

Fig. 12 is a flowchart showing the operation of the map data providing station. If the map data providing station is updated in step ST1, the process waits for the arrival of an update operation information request sent from the card data processing transceiver 14 to the transceiver 21 , and proceeds to step ST2 upon arrival.

In step ST2, the update operation information request is received from the transceiver 21 . This update operation information request includes map data identification information indicating the map data of an area and version information needed for the navigation processing of the map information processing device.

In step ST3, according to the map data identification information indicating map data ID M and the version information indicating a version V obtained in step ST2, the update operation information generator 24 generates update operation information with reference to the map data having map data ID M. stored in the road network update database 23 and on road network update data from version V to a most recent version VX with respect to the map data of map data ID M stored in the road network update database 23 .

In step ST4, the update operation information generated in step ST3 is transmitted to the transceiver 3 of the card data processing device by the transceiver 21 .

Then the process goes to step ST1 and becomes one similar processing as described above repeated.

Now, with the example of the route calculation data of FIGS. 5A to 5C, the update operation information generated in step ST3 will be described. For example, it is assumed that when the map data ID M indicates the map data of an area shown in each of FIGS. 4A and 4B, the version V corresponds to the road network of FIG. 4A and the road network of the most recent version VX is a street of Fig. 4B.

In this case, road network update data from version V to the most recent version, related to the map data of map data ID M stored in road network update database 23, contain information bits indicating deletion of link L12, addition of link L16, and different bits of information related to link L16 in each of Figures 4A and 4B.

The update operation information generator 24 generates information regarding how to update the records, which includes various data required to update from the route calculation data of FIGS. 6 to 8 to the route calculation data of FIGS. 9 to 11 by deleting the link L12 and adding link L16 shown in Figs. 4A and 4B in accordance with the road network update data mentioned above. In addition, since the data sizes of various data constituting the route calculation data are also changed, information is generated regarding how the route calculation header of Figs. 5A to 5J is to be changed.

, FIGS. 13A to 13D are views each showing an example of the data structure of update operation information show that is generated in the above manner by the updated operation information generator 24. As shown in Fig. 13A, update operation information consists of an update operation information header and one or more update segments. The update operation information includes an update operation information data size indicating the data size of the update operation information, map data identification information indicating the map data ID of the map data, update version information indicating an update version indicated by the update operation information, that is, from which version to which version the update is made, and an update segment number indicating the number or number of update segments of the update operation information.

If the most recent card details are already sent to the Map data processing device were supplied by which is the update operation information request ran out, so if the version information in the Update operation information request with the matches the latest version, the Update operation information as information set which is the update from the youngest Version affects the most recent version, the number or update segment number set to 0, and the update information consists only of the Updating operation information header.

As shown in Figure 13B, the update segment consists of an update segment header and one or more update records. The update segment header contains data type information, update type information, an update position section, and the number of update records. The data type information is defined as that shown in Fig. 14A and indicates the kind of data to be updated by the update segment, that is, a kind of data derived from the route calculation header, the node table, the connection information, the Cost table, etc. is selected. The update type information is defined as that shown in Fig. 14B and indicates an update operation to be performed, that is, an operation selected from delete, add, and overwrite. The update position section is defined as that shown in Fig. 14C, and indicates whether the setting of an update position is an offset type that uses the data size of data derived from the head of data indicated by the data type information, stored in the update position, or the record type using the record number of the data determined by the data type information. The number or number of update records indicates the number or number of update records of the update segment.

In the case of the record type the Update position department is a record type with fixed length or variable length, depending on whether the data specified by the data type information is fixed Have length or a variable length.

Fig. 13C shows the data structure of the update record when the update position division is of the offset type. A header offset indicates the header position of performing an update operation, determined by the update type information, by an offset from the header of the data, which is indicated by the data type information before the update. The update data size indicates the range of performing the update operation determined by the update type information. The number or number of update part data that is present is equal to a quantity indicated by the update data and indicates data for replacement and addition.

If the update type information indicates deletion, there are no update partial data.

In the case of the update data record of the offset type when the update type information is a deletion indicates only specified by the update data size Data deleted from the position by the header offset of the Data is specified by the data type information is specified. If the update type information is one Replacement specifies only through the Update data size specified data replaced by Update partial data from the location created by the Header offset of the data is specified by the Data type information is specified. If the Update type information indicates an addition Update partial data inserted in the position by the header offset of the data is specified by the Data type information is specified.

Fig. 13D shows the data structure of the update record when the update position division is a fixed-length or variable-length record type. A header record number indicates the header position for performing an update operation, determined by the update type information, by the record number of data indicated by the data type information before the update. The update part record number indicates the area for performing the update operation, which is determined by the update type information from the header record number. The number or number of update part records that are present is the same as that indicated by the update part record number and indicates data for replacement and addition. If the update type information indicates deletion, there are no update part data.

In the case of an update record of the record type when the update type information is a deletion indicates the number of records identified by the number of Update records are specified from one position deleted by the header record number of data is specified by the data type information becomes. If the update type information is a replacement indicates the number of records identified by the number of update records is indicated by Update part records replaced from the position that is indicated by the header record number of the data that is indicated by the data type information. If the Update type information indicates an addition an update partial record is inserted before the record, which is indicated by the header record number of the data, which is indicated by the data type information. When a Record is added to the end of data by the Data type information is set, so a value that by adding 1 to the record number of the final record of the data obtained is set as the header record number.

The update segments of Fig. 13B are continuous when data type information is identical. If the data type information is identical, the offset type is arranged in front of the data record type in the update position department. When the data type information and the update position section are identical, bits of update type information are arranged in the order of replacement, deletion and addition.

FIG. 15 shows the update operation information of the data structure shown in each of FIGS. 13A to 13D, which is generated by the update operation information generator 24 . An update operation from the route calculation data of Figs. 6 to 8 to that of Figs. 9 to 10 is given, and an update segment # 0 indicates that an offset from the header of the route calculation header is 12 to 8 bytes of data, in other words the command is issued to replace the data size of the connection information and the offset of the cost table with update data SSSS and OOOO.

An update segment # 1 indicates that replacement is performed in accordance with update records # 0 and # 1 of the node records of the node table. For example, update record # 0 instructs that two node records of node record number 2, that is, the node records with node record numbers 2 and 3, should be replaced by the node records of node record numbers 2 and 3 of FIG. 9.

An update segment # 2 indicates that a replacement is carried out in accordance with the update data records # 0 and # 1 of the connected data records of the connection information. For example, update record # 0 instructs that two linked records with number 2 of the linked records, that is, the linked records with numbers 2 and 3 of linked records, are replaced by the linked records of numbers 2 and 3 of the linked records of FIG. 10 should be.

An update segment # 4 indicates that the connection information is added or added in accordance with the update records # 0 and # 1. For example, update record # 0 instructs that the two linked records with numbers 2 and 3 of linked records of FIG. 10 are inserted before number 4 of the linked record.

An update segment # 3 indicates that a deletion is pending the connection information according to the Update records # 0 and # 1 is performed. So For example, update record # 0 instructs that two linked records from the number 2 linked Data records, i.e. the connected data records with the numbers 2 and 3 related records.

An update segment # 5 gives the deletion of one Cost record from the cost table. The Update record # 0 indicates that a Cost data record from the cost data record number 12, i.e. the Cost record with the cost record number 12, deleted becomes.

An update segment # 6 indicates the addition of a cost record to the cost table. Update record # 0 instructs that a node record of cost record number 15 of FIG. 11 is added before cost record number 16, that is, after cost record number 15.

Fig. 16 is a flowchart showing the operation of the map data processing device. When the device is started up, operation information is first input from the input device 11 in step ST11, for the operation of the map data processing device, information related to the reduced scale of the map display, scrolling of the map displayed, selection of a destination, route calculation, and like.

In step ST12, the current position of a vehicle is obtained from the vehicle position detector 12 .

In step ST13, map data of an area required for navigation processing is determined from the operation information obtained in step ST11, the current position of the vehicle obtained in step ST12, etc. Then, an update operation information request, which map data identification information and Contains version information representing the map data sent by the transceiver 14 to the map data providing station, and a request is made to send update operation information for updating the map data to recent map data.

In step ST14, the update operation information sent from the map data providing station is received by the transceiver 14 in accordance with the update operation information request of step ST13.

In step ST15, the update operation information received in step ST14 is bit by bit extracted from the transceiver 14 every time the process comes to this step, and then the process proceeds to step ST16. However, if all bits of the update operation information have been extracted and there are no more bits of update operation information, the process proceeds to step ST20.

In step ST16, reference is made to FIG Update operation information header in step ST15 obtained update operation information and if the number or number of Update segments is 0, it is determined that updating the map data is unnecessary. The process then proceeds to step ST17.  

In step ST17, reference is made to the update operation information header of the update operation information obtained in step ST15, and the map data input by the map data identification information is extracted from the map data storage device 13 .

In step ST18, an update is performed for the map data obtained in step 5 T17 in accordance with the update operation information obtained in step ST15.

In step ST19, the updated in step ST18 map data are stored in the update data storage device 16, and is also updated management information, which is stored in the update data storage device sixteenth When the storage capacity of the update data storage device 16 is exceeded by storing the map data, the map data stored in the update data storage device 16 is deleted, starting with those with the longest storage time until a required empty area can be secured, and then the Card data saved.

In step ST20, the management information of the update data storage device 16 is referred to, and required map data is obtained from the update storage device 16 . If the required map data is not present in the update data storage device 16 , required map data is obtained from the map data storage device 13 by referring to the management information in the map data storage device 13 , and then predetermined navigation processing is performed.

Then the process returns to step ST11, and is then the processing described above carried out.

Fig. 17 is a flow chart showing details of step ST18 shows. In step ST21, a segment specification value for specifying an update segment to be processed is set to 0, that is, a header update segment. For segment setting, one of the update segments is set in the update operation information obtained in step ST15 based on its number in the order of arrangement.

In step ST22, the number of update segments among the update segments in the Update operation information header in step ST15 obtained update operation information with the Compare segment set value. If there is a match is determined, then the processing of the step ST18 ended because all update segments of the Update operation information has been processed. Becomes If no match is found, the process goes to Over to step ST23 to update segment process that is specified by segment specification.

In step ST23, on Update record set value to set a update record to be processed to 0 set, i.e. a header update data record. For the Update record setting becomes one of the updated records in the by segment definition specified update segment based on its Number set in the order of arrangement.

In step ST24, the number of updated records in the update segment header of the by the Specification of the specified update segment with  compared to the update record set value. Becomes If a match is found, the process goes to Step ST30 over because all the updated records of the Update segment were processed by the Segment specification is specified. Will not match determined, the process goes to step ST25, at which to process updated data set by the Specification of the updated record is given.

In step ST25, a check is made on the Update type information of the Update segment header of the by the Specification of the specified update segment carried out. If the information indicates a deletion, it goes Process to step ST26. When added, the Process to step ST27. The process goes with replacement to step ST28.

In steps ST26, ST27 and ST28, reference is made to the Update segment header of the update segment taken, which is specified by the segment specification, will be a deletion, addition and replacement for the data performed by the data type information of the Update segment header in the in step ST17 received card data are given, according to the Update position department of the Update segment header, and corresponding to that updated record by setting the updated record is specified. Then he leaves Process to step ST29.

In step ST29, the set value for the updated record only increased by 1 to the next to it ordered, updated record. Then goes the process goes to step ST24.  

After that, the process goes from step ST24 to step ST30 repeated and when processing all updated Records of the specified by the segment specification Update segment is finished, goes as above the process is described from step ST24 to step ST30 about.

In step ST30, the segment setting value becomes only 1 incremented by the update segment next to it set. Then the process goes to step ST21.

Then the processing described above repeated, and all update segments in the im Step ST15 obtained update operation information processed. Then the processing of step ST18 completed.

The card data is as described above updated by performing a simple Processing, such as replacing, deleting and adding of data, according to the command of the Updated operational information. That way carried out a quick update.

EMBODIMENT 2

In the second embodiment, update type information is defined in the update operation information shown in each of FIGS. 13A to 13D as that shown in FIG. 18. The data structure of the updated record in the update operation information of each of Figs. 13A to 13D is set as shown in each of Figs. 19A to 19C when the update type information indicates partial update of the single type or as that in each of the FIG. 20A to 20C is shown, when the update type information indicating a partial update of the composite type. For the processing of step ST25 of FIG. 17, as shown in FIG. 24, a check if the update type information indicates a partial update of the single type and a check if the update type information indicates a partial update of the composite type. In the case of partial updating of the single type, the processing of step ST31 is carried out. If the composite type is partially updated, the processing of step ST32 is carried out. In this way, a partial update can be carried out in the data record.

Figure 19A shows the data structure of the updated record consisting of an updated record header and one or more partially updated records. The updated record header includes a record number indicating a record to be updated, data indicated by data type information, partial update type information, an update position department, a partially updated record number indicating the number of partially updated records. The partial update type information and the update position section are defined as in Figs. 14B and 14C, respectively.

Figure 19B shows the data structure of a partially updated record when the update position division is of the offset type. A header offset indicates the header position for performing an update operation, indicated by the partial update type information of the updated record header, by an offset from the header of a record, which is indicated by the record number of the updated record header. An update data size indicates the area for performing the update operation, determined by the partial update type information of the header offset. The number or number of update part data present is equal to an amount indicated by the update data size and data to be replaced and added. If the partial update type information indicates deletion, there is no update partial data.

Fig. 19C shows the data structure of a partially updated record when the update position division is of the record type. Partial data type information indicates the type of data to be updated in the record to be updated in the updated records. A header record number indicates the header position for performing an update operation, determined by the partial update type information, by the record number of data indicated by the partial data type information before the update. The number or number of update part records indicates the area for performing the update operation, determined by the partial update type information, from a header record number. The number or number of existing update part records is equal to the number or number of update part records, and indicates data for replacement and addition. No update partial data is available when the partial update type information indicates deletion.

Through the above described, updated Records can be an update operation of the same kind be ordered for one or more locations in the data set.  

FIGS. 20A to 20C are views each showing a case in which the information of the type of partial update and the update position department in the updated data set bias in each of FIGS. Retained 19A to 19C for each partially updated record, and the update operations of different Species can be ordered in a record.

As described above, by setting the updated records in such a manner as shown in each of Figs. 19A to 19C and each of Figs. 20A to 20C, multiple update operations for a record can be determined by a partially updated record. Therefore, the data size of the update operation information can be reduced.

FIG. 21 shows a definition example of information of the type of partial data in the connected data record of the connection information of the route calculation data of FIGS. 5A to 5J. 0 and 1 are each assigned to the field of the linked data records or the field of the regulated data records which form the linked data record.

FIG. 22A and 22B are views showing examples of updated records show that have the data structures of FIGS. 19A to 19C, when the node record of the node record number is updated 15 of the node table from that in Fig. 6 to that of Fig. 9, and when the linked record of the linked information number 12 of the link information is updated from that in FIG. 7 to that in FIG. 10. A partial data type is defined as that shown in each of Figs. 19A to 19C.

In FIGS. 22A and 22B, FIG. 22A shows an example of an updated data record that indicates the partial update of the individual type of the node data record in the node table. Specifically, from a position at which there is an offset of 10 from the header of the node record of node record number 15 of Fig. 6, it is instructed that 2 bytes be replaced by update part data JOFS15 '.

It is assumed that the offset of the connected Record of the node record is 10, and its Data length is 2 bytes.

FIG. 22B shows the example of an updated record indicating the partial update of the single type of the connected record of the connection information. With respect to the associated data set with the number 12 associated records in Fig. 7 has the partially updated record # 0 that the record of a point 1 of linked records to be replaced by the update data subset # 0, so that the contents of a linked record to which the number of linked records of linked records of the number 12 of linked records in FIG. 10 is 1. The partially updated data record # 1 indicates that the data record with the number 3 of regulated data records is to be replaced by the update part data record # 0, i.e. a regulated data record on which the number of the regulated data record of the linked data record with number 12 of linked data records in FIG. 10 is 3.

Fig. 23 shows an example of an updated record indicating the partial update of the compound type of the connected record of the connection information. With respect to the associated data set with the number 14 associated records in Fig. 7, the partially updated record # 0 indicates that the record of a point 1 of linked records to be replaced by the updated part record # 0, so that the contents of a linked record, where the number of the linked record of the linked record with the number 14 of linked records of FIG. 10 is 1. The partially updated data record # 1 instructs that the updated partial data record # 0 should be added to the end of the field of linked data records of the linked data record with the number 14 of linked data records in FIG. 7, i.e. a linked data record on which the number of linked data records of the associated record with the number 14 associated records of FIG. 10 is 3.

FIG. 25 is a flowchart showing in detail the partial update of the single type of step ST31 of FIG. 24.

In Fig. 25, in step ST41, target record setting indicating a record to be updated is set equal to the value of the record number of the updated record header in each of Figs. 19A to 19C.

In step ST42, update operation setting and update position department setting for setting an update operation and an update position department are set equal to values determined by the partial update type information and the update position department of the updated record header of Figs. 19A to 19C.

In step ST43 is partial for one to be processed updated record, a set value for one partially updated record based on the Order of the updated records is set to 0, i.e. to a head of one partially updated record.

In step ST44, the number is partially updated Records in the update record header with the Setpoint value for partial update compared.  

If a match is found, the processing is ended in step ST31 because then the processing of all partially updated records of the updated Record is finished. Will not match determined, the process proceeds to step ST45 to process partially updated data set by the definition of a partially updated data set is specified.

In step ST45, accordingly, is partial updated record, which is determined by the partially updated record is specified Record specified by target record set updated based on the update operation and the update position department that in step ST42 have been set.

In step ST46, the set value for the updated record just increased by 1, so one next to it lying updated record is set, and then the process goes to step ST44.

After that, the process goes from step ST44 to step ST46 repeated. If all processing is partial updated records is finished processing finished in step ST31.

FIG. 26 is a flowchart showing in detail the partial update of the compound type of step ST32 in FIG. 24.

In Fig. 26, in step ST51, target record setting indicating a record to be updated is set equal to the value of the record number of the updated record header of Figs. 20A to 20C.

In step ST52, the partially updated Record to be processed, the set value for the partially updated record on the Basis of the order of the updated Records is set to 0, i.e. to the Header of a partially updated data record.

In step ST53, the number is partially updated Compare records in the updated record header with the set value for the partially updated Record. If agreement is found, the Processing of step ST32 ends because then Processing of all partially updated data records of the updated record has ended. Will not If there is a match, the process goes to step ST54 over to the partially updated record process that by laying down for the partial updated record is specified.

In step ST54, update operation setting and update position department setting for setting an update operation and an update position department are set equal to values set in the partial update type information and the update position department of the updated record header of Figs. 20A to 20C, the partially updated record set by the setting of the partially updated data set is specified.

In step ST55, the data record that is generated by the Target record setting is specified, updated, corresponding to the partially updated data set that is generated by the definition for the partially updated data set is specified.  

In step ST56, the set value for the updated record only increased by 1, so the next to it ordered, updated record is set. Then the process goes to step ST422.

After that, the process goes from step ST53 to step ST56 repeated. If all processing is partial updated records is finished processing of step ST32 finished.

As described above, updating several identical update types in the record as one partially updated record achieved, and will Update several different ones Update types in the record as a partial updated record achieved. Hence the time be shortened, which is necessary to Update operation information from the Obtaining map data providing station can Map data updates can be done quickly, and communication costs can be reduced.

EMBODIMENT 3

Fig. 27 shows the data structure of an update operation information storage portion which is provided in the update data storage device 16 according to the third embodiment.

Update operation information is stored in accordance with update operation information management information. The update operation information management information indicates the location of the update operation information stored in the update data storage device 16 .

Fig. 28 shows the data structure of a card buffer which is provided in the map data processor 15 according to the third embodiment. The card buffer stores card data in accordance with card management information. The map management information consists of a map data number indicating the number of map data required for navigation processing and map management data records provided according to the map data required for navigation processing. The card management record includes card data identification information indicating the card data ID of the corresponding card data, card data presence information indicating the presence of the corresponding card data in the card buffer, and card data position information indicating the location of the corresponding card data in the card buffer.

FIG. 29 is a flowchart showing the operation of the map data processing device according to the third embodiment, with steps ST61 to ST65 added to the process of FIG. 16. In step ST18, the time that is used for the update is measured.

In step ST61, an initialization is carried out with the card management information of the card buffer of the card data processor 15 . The number or number of map data required for the navigation processing of step ST20 is set for the number or number of map data. The map data ID of each map data required for the navigation processing of step ST20 is set in each map data identification information. Each card data existence information is set to nonexistent.

In step ST62, the map data updated in step ST18 is stored in the map buffer of the map data processor 15 . The map data existence information of a map management record corresponding to the stored map data is set to exist. The location of the map data is set in the map data position information.

In step ST63, it is determined whether it is necessary to obtained in step ST15 Store update operation information. Is the time required for updating in step ST18 is larger or equal to a predetermined value, the process goes to Step ST63 over, and determines that storage is required. If not, 63193 00070 552 001000280000000200012000285916308200040 0002010200375 00004 63074 the process goes to step ST19 over, and determines that storage is unnecessary.

In step ST64, in accordance with the update operation information management information of the updated data storage device 16, the update operation information obtained in step ST15 is stored in the update data storage device 16 , and the update operation information management information is updated. In this case, the update operation information stored in the updated data storage device 16 is referred to as update operation information already received. When the storage capacity of the updated data storage device 16 is exceeded by storing the update operation information, the update operation information stored in the updated data storage device 16 is deleted, starting with that with the longest storage time until a required free area is determined, and then the update operation information is stored.

Furthermore, the map data stored in the update data storage device 16 in step ST19 is referred to as map data already updated.

In step ST65, the process shown in the flowchart of FIG. 30 is performed. For the map data not stored in the map buffer of the map data processor 15 among the map data required for the navigation processing of step ST20, the update operation information already received or the map data already updated was stored in the updated data storage device 16 by the previously update operation request made. In this step, the map data updated by the update operation information already received or the map data already updated is stored in the map buffer of the map data processor 15 . This processing is called retrieving updated map data.

In step ST20, the predetermined navigation processing is performed by referring to the map data stored in the map buffer of the map data processor 15 .

In Fig. 30 of the map management information set of the map management information of the card buffer of the map data processor 15 is removed in step ST71. The card management information is sequentially extracted bit by bit in the order of arrangement each time the process comes to this step, and then the process proceeds to step ST27. If there are no more card management records to be extracted, the processing of step ST20 is ended.

If, in step ST72, the map data existence information of the map management record extracted in step ST71 indicates non-existence, then the process proceeds to step ST73, in which it is determined that the update operation information already received or the map data already updated is stored in the storage device for the map data 16 for updated data was saved by the update operation information request already made. If an existence is indicated, the process proceeds to step ST71, at which it is determined that the card data of a most recent version has been stored in the card buffer of the card data processor 15 .

In step ST73, an investigation is made as to whether or not the update operation information of the map data already obtained, which is indicated by the map data identification information of the map management record extracted in step ST71, has already been stored in the updated data storage device 16 based on the update operation information management information of the storage device 16 for updated data. If the update operation information already received is not available, the process proceeds to step ST74. If it is present, the process goes to step ST75.

In step ST74, the already updated map data, which is indicated by the map data identification information of the map management data record extracted in step ST71, is received by the updated data storage device 16 .

In step ST75, the update operation information of the map data already obtained, which is indicated by the map data identification information of the map management record extracted in step ST71, is obtained from the updated data storage device 16 . The map data indicated by the map data identification information of the map management record extracted in step ST71 is taken from the map data storage device 13 . As in the case of step ST18, the map data is updated based on the update operation information already received, and then the process proceeds to step ST76.

In step ST76, the map data already updated in step ST74, or the map data updated in step ST75, are stored in the map buffer of the map data processor 15 . The card management information is updated as in the case of step ST62, and then the process proceeds to step ST71.

After that, the procedure of step ST71 and the following Steps for all card management records of the Card management information performed, and then the Processing of step ST20 ended.

As described above, the update operation information indicating that the processing time required for the update is longer than the predetermined time than the map data already updated is stored in the update data storage device 16 , and the map data already updated is taken out as required. Therefore, the time for obtaining the updated map data again becomes less than or equal to a predetermined time.

EMBODIMENT 4

Fig. 31 is a flow chart showing the operation of a map data processing device according to the fourth embodiment, in which the process of Fig. 12 steps ST82 and ST82 are added. In step ST81, the update operation information generator 24 generates the necessary information for corresponding nodes by referring to the update operation information request obtained in step ST2. In step ST82, the information regarding corresponding nodes that was generated in step ST81 is transmitted to the transceiver 14 by the transceiver 21 .

The update operation information request made in the Step ST2 included contains the number of bits adjacent information, and bits of adjacent information according to the number or number. The neighboring one Information consists of an adjacent number, each Map data adjacent to map data displayed by the Card data identification information in the Update operation information request specified as well as the relevant version.

As described above occurs when only the card data be updated in a specific area, a Mismatch in the correspondence of nodes on, due to a version difference between the range and its neighboring area.

Fig. 32 shows a relationship between the areas of the map data. A rectangular area 0 indicates a report of the map data of the map data ID M indicated by the map data identification information in the update operation information request obtained in step ST2. Rectangular areas 1 to 8 denote areas of adjacent map data. The map data of the adjacent area is referred to as adjacent map data. Furthermore, numbers or numbers shown in Fig. 31 are used to determine the adjacent areas and the adjacent map data, and each of these numbers is referred to as an adjacent number.

In FIGS. 33A to 33E 33A shows an example of the road network of map data of a version V of map data ID. and Fig. 33B shows an example of the road network of the map data version V and the map data ID Mb of an adjacent number 3 in addition to the map data mentioned above.

Fig. 33C shows a relationship between the node and the node record number of route calculation data in each of Figs. 5A to 5J with respect to the road network of Fig. 33A; and Fig. 33D shows the node record number of the node of the route calculation data in each of Figs. 5A to 5J with respect to the road network of Fig. 33B.

Nodes N04, N05 and N06, as well as nodes N31, N32 and N33 are on the boundary of the areas of each Map data. Nodes N04 and N31 are the same nodes; nodes N05 and N32 are the same nodes; and the knots N06 and N33 are the same nodes.

In order to represent a node relationship between such adjacent map data, for example, the node N31 of the map data of the neighboring number 3 is represented as an adjacent node of the node N04. Therefore, adjacent numbers are assigned to the linked records of Fig. 5H. If an adjacent number is 0, a node indicated by information related to an adjacent node is a node of the map data. If an adjacent number is other than 0, a node indicated by information for adjacent nodes is a node of the map data indicated by the adjacent number. As an example, the connected record of node N04 is shown in Fig. 33E.

In FIGS. 34A to 34D Fig 34A shows a road network of a version VX at which the node N03 of the road network of Figure 34A is deleted..; Fig. 34B shows a road network of a version VX in which the node N30 of the road network of Fig. 33B is deleted; and Figs. 34C and 34D show node record numbers of the nodes of the road networks of Figs. 34A and 34B, respectively, specifically showing that the node record numbers of nodes N04, N05 and N06 have been changed to 3, 4 and 5 by deleting node N03, and the node record numbers of the nodes N31 to N36 have been changed to 0 to 5 by deleting a node N30.

Each of Figs. 35A to 35F shows the state of only the road network of Fig. 33A updated to the VX version based on the update operation information generated in step ST3 of Fig. 31. In detail, FIG 35A shows a road network 34A is identical to that of FIG..; Fig. 35B shows a road network identical to that of Fig. 33B; Figures 35C and 35D show node record numbers of the road networks of Figures 34A and 34B; and Figures 35E and 35F show node record numbers of the nodes of the road networks of Figures 34A and 34B. For the information related to the adjacent node of the linked record with number 1 of linked records of Fig. 35E, the node record number of version V of Fig. 34D is used. For the information related to the adjacent node of the linked record number 1 of the linked records of Fig. 35F, the node record number of version V of Fig. 33C is used. Therefore, in FIGS. 35E and 35F, the relationship between the road networks of FIGS. 35A and 35B cannot be correctly represented. For example, in Fig. 35E, an adjacent node of node N04 has a node record number of 0, namely node N30. In Fig. 35F, an adjacent node of node N31 has a node record number 4, that is, a node N05. Therefore, a mismatch occurs between adjacent map data that exist in different versions.

In Figs. 36A and 36B, FIG 36A, the correspondence between the node record numbers of the nodes versions VX and V in the range of 35A..; and Fig. 36B shows the correspondence between the node record numbers of the node versions VX and V in the area of Fig. 35B. From the correspondence of each of FIGS . 36A and 36B, a node record number can be found in a desired version, and a mismatch between the neighboring map data in different versions as described above can be prevented.

Each of FIGS . 37A to 37C shows an example of the data structure of information of corresponding nodes generated in step ST81 of FIG. 31. As is apparent from Fig. 37A, the information is in relation to respective nodes of a header of the information relating to respective nodes, and from one or more tables corresponding node. The header information for corresponding nodes includes an information data size for corresponding nodes, which indicates the data size of the information regarding corresponding nodes, and a table number or number of tables of corresponding nodes, which indicates the number or number of tables of corresponding nodes of the information regarding corresponding nodes.

FIG. 37B shows the data structure of the table corresponding node, there is a corresponding table from a header of the nodes, and one or more corresponding data records. The header of the table of corresponding nodes contains map data identification information indicating map data ID, information related to corresponding versions having versions 0 and 1 and indicating a correspondence between versions 0 and 1, information related to adjacent map data indicating one represents an adjacent number indicating map data adjacent to the map data indicated by the map data identification information, and a number of corresponding records indicating the number or number of corresponding records of the table of corresponding nodes. When the map data identification information indicates map data M, the table of corresponding nodes is referred to as a corresponding table of map data M.

Fig. 37C shows the data structure of the corresponding data set. For the node in the map data indicated by the map data identification information, which is a node contained in the map data indicated by the adjacent map data, the correspondence record has the node record number of version 0 stored in the node record number 0, as well as the node record number of version 1, stored in the node record number 1.

Each of FIGS. 38A and 38B show an example of the table of corresponding nodes of the data structure shown in each of FIGS . 37A to 37C. In detail, FIG 38A shows a correlation table in which the adjacent map data information of the map data of Figure 35A indicating the map data of Figure 35B...; and Fig. 38B is a correspondence table in which the adjacent map data information of the map data indicative of Fig. 35B, the map data of FIG. 35B.

FIG. 39 is a flowchart showing in detail the processing of step ST81 of FIG. 31.

In step ST91, an adjacent number Ai and a version Vi are extracted as bits of adjacent information in the update operation information request obtained in step ST2 of FIG. 31, and then the process proceeds to step ST94.

In step ST92, a latest version VX and the in Version ST obtained at step ST91 compared with each other. If a match is found, the process goes to Step ST91 over. If there is a lack of agreement, the Process to step ST93.

In step ST93, with reference to the road network database 22 and the road network update database 23, a correspondence between the node record numbers of the version VX of the map data indicated by map data identification information in the update operation information request and the node in the version Vi is obtained, and a table of corresponding nodes is generated shown in each of Figs. 37A to 37C. Further, a correspondence between the node record numbers of the VX version of the map data adjacent to the map data indicated by the map data identification information in the update operation information request as the adjacent number Ai and the node of the version Vi is obtained, and a table of corresponding nodes is generated which is shown in each of Figs. 37A to 37C. Then the process goes to step ST91.

Then for all bits of neighboring information in the Update operation information request the process of steps ST91, ST92 and ST93.

In step ST94, corresponding node information shown in each of FIGS . 37A to 37C is generated using the generated node corresponding table, and the processing of step ST81 is ended.

Fig. 40 is a flowchart showing the operation of a map data processing device according to a fifth embodiment, wherein steps ST101 and ST102 the process of Fig. 16 added. In step ST13, the number of adjacent information relating to the map data of an area adjacent to an area in which navigation processing is required and adjacent information are added to the update operation information request and transmitted from the transceiver 14 to the map data providing station.

In step ST101, in accordance with the update operation information request of step ST13, information about corresponding nodes sent from the map data providing station is received by the transceiver 14 . Then, according to the management information for the corresponding node table of a corresponding node storage section provided in the updated data storage device 14 , as shown in Fig. 41, a table of corresponding nodes in the received information regarding corresponding nodes in the Storage device 16 stored for updated data. The management information for the table of corresponding nodes is used to manage the location of each table of corresponding nodes. When the storage capacity of the updated data storage device 16 is exceeded by storing the corresponding node table, the corresponding node tables stored in the updated data storage device 16 are deleted, starting with those that have been stored longest until a required one free area can be secured, and then the above table of correspondences is stored.

In step ST102, the tables of corresponding nodes of all map data Ma in which the version of the map data stored in the map data storage device 13 is indicated by the information regarding neighboring map data of the table of corresponding nodes of the map data Ma updated in steps ST15 to ST19 , coincides with the version of the map data Ma, deleted from the memory device 16 for updated data. Further, among the tables of corresponding nodes where the information for adjacent map data indicates the map data Ma, the one in which the version of the map data indicated by the corresponding map data identification information matches that of the map data Ma is updated from the storage device 16 Data deleted.

The above-described process deletes the table of corresponding nodes, which becomes unnecessary because both adjacent map data are updated to the latest versions, so that the memory area of the storage device 16 is used efficiently for updated data.

If, in step ST20, the neighboring map data My of a version Vy is referred to while referring to specific map data Mx of a version Vx and the version Mx and the version My differ from one another, then on the basis of a table of corresponding nodes, the a correspondence shows being made, the information relating to the corresponding versions of the map data My, which are stored in the map data storage unit 13, is located between the versions Mx and My, reference to the map data My, using which is obtained by a node record number, that the node record number version Mx is converted to version My.

For example, in Figs. 35A to 35F and Figs. 37A to 37C with the values Mx = Ma, My = Mb, Vx = VX, and Vy = V, a reference to the neighboring node of the node N06 of the node record number 5 of the map data Ma of the version Vx, the node record number of the neighboring node is 2 in the map data Mb of the version VX of FIG. 35E. A correspondence data record is therefore determined from the correspondence table ( FIG. 38B) of the map data Mb, in which the node data record number 0 is 2, that is to say a correspondence data record # 2. Then, a node in map data Mb of version V in which a node record number indicated by the node record number 1 of the correspondence record # 2 is 3, that is, a node N33 is set as an adjacent node.

Therefore, using the table of corresponding nodes performed navigation processing in which a Adaptation of the map data in different versions was made.

In each of the first to fourth embodiments above, the update operation information and information for corresponding nodes are obtained from the transceiver 14 . However, such information can also be obtained from a removable storage medium, for example a memory card.

In each of the first to fourth embodiments, the map data storage device 13 and the updated data storage device 16 are provided separately. However, these devices can also be combined in a storage device, and when the updated map data is stored, the map data of an old version in the area of the map data can be deleted.

In each of the first to fourth embodiments, when the map data, the update operation information, and the table of corresponding nodes are stored in the updated data storage device 16 , if the storage capacity of the updated data storage device 16 is exceeded, the map data, the update operation information, and the table corresponding nodes stored in the updated data storage device 16 are deleted, starting with the oldest stored data. However, the deletion can also be done on the order of low frequency of referencing that has occurred in the past. The deletion can also be done in the order of data outside of an area determined to be needed for the next navigation processing, or in the order of the greatest distance from that area. Deletion can also be carried out by combining these conditions.

For each of the first to third above Embodiments became the example of Route calculation data shown. However, these can Embodiments are used for all data, which card data form.

In each of the first to third embodiments, the Version managed by a card data unit. Indeed a version can also be independent of any data managed, which form the card data, and can Update for all data to be performed which form the card data.

In each of the first to third embodiments, the Update the offsets and record numbers that are in different records are included without them as To get update operation information that  Calculation from the card data and the Update operation information before the update be made, and then the update is performed become.

In the above third embodiment, in step ST63, the determination of whether storage is necessary was made based on the processing time required for the update. However, the need for storage can also be determined based on whether the data size of the map data after the update is larger than or equal to a predetermined value. The need for storage can be determined when the data size of the free area of the storage device 16 for updated data is less than or equal to a predetermined value.

Furthermore, the previous fourth Embodiment the example of route calculation data shown. However, the embodiment can with all Data related to the road network are used, whereby the data form the card data.

Furthermore, the example was the fourth embodiment considered that the common area of the neighboring Areas was a line. The common area of however, adjacent areas can also be a level.

As is clear from the foregoing, is the present invention in particular in the following respects advantageous. The card data processing device comprises the information acquisition device for acquiring Update operation information which the Update content of the map data indicates that in the Storage device are stored, as well as the Updating device for updating the map data, stored in the storage device accordingly  the update operation information provided by the Information acquisition device is obtained. Therefore, it is possible to update the map data quickly.

The information acquisition device receives the Update operation information that Contains update position information, one being updating part by an offset from one predetermined reference position in the map data becomes. Therefore, it is possible to quickly determine the part to be updated.

The information acquisition device receives Update operation information that is among data stored in the map data is included, data setting information for specifying the data to be updated, and Update position information that a record indicates where the data is stored. Therefore, it is possible to quickly update the map data without the structure becomes more complicated.

The information acquisition device receives Update operation information that Contains update position information, at least one or more update positions in the record indicates. It is therefore possible to have partial data in the Update record.

The information acquisition device receives Update operation information which Contains update type information that the Update type of at least one or more parts specifies which to update in the record. On this way it is possible to have several Different types of update operations at once to perform in the same record.  

The data storage device is intended to Store update operation information by of the information acquisition device is obtained when the Update time of the update device exceeds a predetermined reference time, and for storing the Card data after update by the Update device when the update time is shorter than the predetermined reference time. Therefore, it is possible, a new acquisition processing of the perform updated map data.

The data storage device is intended to Store update operation information by of the information acquisition device is obtained when the determined processing time for the update by the Update device the predetermined reference time exceeds, and the map data after the update save by the update device when the determined processing time for the update shorter is as the predetermined reference time. This will enables new acquisition processing of the perform updated map data.

If the storage device stores the map data, so is when the version of a certain area different from that of another area, information obtained with respect to corresponding nodes, the one Correspondence between identical nodes of respective versions indicates. Even if the card data was saved, however the version of a certain area is different from that of a different area, it is possible to get one perform customized navigation processing.

The information acquisition device receives information regarding corresponding nodes only if the versions the areas that are adjacent to each other are different, the information obtained regarding corresponding  Knot affects identical knots that are adjacent to each other Areas are available. This enables efficient Use of the storage device.

The information acquisition device gets into each other neighboring areas, only the information regarding corresponding node for the same node that is in the overlapping part of the two areas is present. This enables efficient use of the storage device.

The update operation information is obtained which indicates the update content of the map data, and the card data will be according to the Update operation information updated. This enables a quick update of the map data.

The update operation information is obtained which contains the update position information at which is the location to be updated by an offset compared to the predetermined reference position in the map data is represented. This enables you to quickly understand the updating part.

Among the data contained in the card data is receive the data setting information which the updates data, as well as the Update operation information which the Contains update position information that the Data record indicates in which the data is stored. This makes it possible to quickly get the card data update without complicating the structure.

The update operation information is obtained which contains the update position information which at least one or more update positions in the Specifies record. Therefore, partial data in the Record to be updated.  

The update operation information is obtained which contains the update type information that the Update types of at least one or more parts specifies which to update in the record. Therefore, multiple update operations can be performed at once of different types.

When the update time of the map data is the predetermined one Reference time is exceeded, the received Update operation information stored. Is the Update time less than the predetermined reference time, the map data will be saved after the update. This enables new acquisition processing to be carried out quickly the updated map data.

If the determined update time for the map data exceeds the predetermined reference time, the obtained one Update operation information stored. If the determined update time is less than that predetermined reference time, the map data after the Update saved. This enables quickly a new acquisition processing of the updated Perform card data.

If card data is saved, then when the Version of a certain area differs from that of the other Area differs, information regarding corresponding Get nodes that have a correspondence between identifies identical nodes of the respective versions. thats why it even if the card data was saved when the version of a certain range differs from that of one different area, possibly, an adjusted Execute navigation processing.

The information regarding corresponding nodes is only then get when the versions are adjacent  Differentiate areas from each other, the obtained Information regarding corresponding nodes is the same Knot affects that in the adjacent areas available. This enables efficient use of the Memory device.

It will only provide information regarding the corresponding nodes obtained for the same node as that in the overlapping part of adjacent areas. This enables efficient use of the storage device.  

FIGURE LABELING Fig. 1

11

input device

12

Vehicle position detector

13

Map data storage device

14

Transmitter-receiver

15

Map data processor

16

Storage device for updated data

17

output device

Fig. 2

21

Transmitter-receiver

22

Road network database

23

Road network update database

24

Updating operation information generator

Fig. 3

Map Information: Map information
Management information: management information
Map Data: Map data
Header: Leader
Road Data: road data
Background data: background data
Name Data: Name data
Route Guiding Data: route guidance data
Rout Calculation Data: route calculation data
Local facility data: data on local facilities
Guiding Search Data: Guiding Search Data

Figure 5A

Route Calculation Data: route calculation data
Route Calculation Header: Route calculation header
Node table: node table
Connection Information: connection information
Cost Table: cost table

Figure 5B

Route Calculation Header: Route calculation header
Offset of Node Table: Offset of the node table
Data Size of Node Table: Data size of the node table
Offset of Connection Information: Offset of the connection information
Data Size of Connection Information: Data size of the connection information
Offset of Cost Table: Offset of the cost table
Data Size of Cost Table: Data size of the cost table

Figure 5C

Node table: node table
Node Record: Node record
Node Record Number: Node record number

Figure 5D

Connection Information: connection information
Connected Record: Connected record
Connected Record Number: Number of the connected record

Figure 5E

Cost Table: cost table
Cost Record: cost record
Cost Record Number: Number of the cost record.

Figure 5F

Node Record: Node record
Node Coordinate: Node coordinate
Node attribute: node attribute
Number of Connected Links: Number (number) of connected connections
Number of Regulated Records: Number (number) of regulated records
Offset of Connected Record: Offset of the connected record

Figure 5G

Connected Record: Connected record
Linked Record: Linked record
Regulated Record: Regulated record
Regulated Record Number: Number of the regulated record

Figure 5H

Linked Record: Linked record
Adjacent Node Information: Information about neighboring nodes
Linked Cost Information: Information about linked costs

Fig. 5I

Regulated Record: Regulated record
Entry Link Information: Entry link information
Exit Link Information: Exit link information
Inter-Link Regulated Code: Regulation on rules between links

Figure 5J

Cost Record: cost record
Link Attribute: Link attribute
Link Length: Link length
Average Traveling Time: Average traveling time
Width Information: Information regarding the width

Fig. 6

Node table: node table
Node Record Number: Number of the node record
Node Coordinate: Node coordinate
Node attribute: node attribute
Number of Connected Links: Number of connected links
Number of Regulated Records: Number of regulated records
Offset of Connected Record: Offset of the connected record

Fig. 7

Connection Information: connection information
Linked Record: Linked record
Regulated Record: Regulated record
Connected Record Number: Number of the connected record
Linked Record Number: Number of the linked record
Adjacent Node Information: Information about neighboring nodes
Entry Link Information: Entry link information
Inter-Link Regulated Code: Regulation on rules between links
Hatched Part Indicated Non-Presence of Target Linked Record,
Regulated Record: hatched part indicates non-existence of the target link record, regulated record
Offset of Connected Record: Offset of the connected record
Regulated Record Number: Number of the regulated record
Linked Cost Information: Information about linked costs
Exit Link Information: Exit link information

Fig. 8

Cost Table: cost table
Cost Record Number: Cost record number
Link Length: Link length
Average Traveling Time: Average traveling time
Width Information: Width information

Fig. 9

Node table: node table
Node Record Number: Node record number
Node Coordinate: Node coordinate
Node attribute: node attribute
Number of Connected Links: Number of connected links
Number of Regulated Records: Number of regulated records
Offset of Connected Record: Offset of the connected record

Fig. 10

Connection Information: connection information
Linked Record: Linked record
Regulated Record: Regulated record
Connected Record Number: Number of the connected record
Linked Record Number: Number of the linked record
Adjacent Node Information: Information about neighboring nodes
Entry Link Information: Entry link information
Inter-Link Regulated Code: Regulation on rules between links
Hatched Part Indicated Non-Presence of Target Linked Record,
Regulated Record: hatched part indicates non-existence of the target link record, regulated record
Offset of Connected Record: Offset of the connected record
Regulated Record Number: Number of the regulated record
Linked Cost Information: Information about linked costs
Exit Link Information: Exit link information

Fig. 11

Cost Table: cost table
Cost Record Number: Cost record number
Link Length: Link length
Average Traveling Time: Average traveling time
Width Information: Width information

Fig. 12

No: No.
Yes Yes
ST1: Is there an update operation information request?
ST2: Update operation information request received
ST3: Generate update operation information
ST4: Send update operation information

Figure 13A

Updating Operation Information
Updating Operation Information Header: Update operation information header
Data Size of Updating Operation Information: Data size of the update operation information
Map Data Identification Information: Map data identification information
Update Version Information: Update version information
Number of Update Segments: Number of update segments
Update segment: update segment

Figure 13B

Update segment: update segment
Update segment header: update segment header
Date Type Information: data type information
Update Type Information: update type information
Updating Position Division: update position division
Number of Updated Records: Number of updated records
Updated Record: Updated record

Figure 13C

Updated Record (Offset Type): Updated record (offset type)
Head Offset: head offset
Updated Data Size: Size of updated data
Update Part Data: update part data

Figure 13D

Updated Record (Record Type): Updated Record (Record Type)
Head Record Number: Head record number
Number of Update Part Records: Number of update part records
Update Part Record: Update part record

Figure 14A

Data Type Information: data type information
Value: value
Data Type: data type
Route Calculation Header of Route Calculation Data: Route calculation header of route calculation data
Node Table of Route Calculation Data: Node table of the route calculation data
Connection Information of Route Calculation Data: Connection information of route calculation data
Cost Table of Route Calculation Data: Cost table of route calculation data

Figure 14B

Update Type Information: update type information
Value: value
Updating Operation: Update operation
Deletion: deletion
Substitution: replacement
Addition: addition

Fig. 14C

Updating Position Division: update position division
Value: value
Division: division
Offset Type: offset type
Fixed Length Record Type: Fixed length record type
Variable Length Record Type: Variable length record type

Fig. 15

Update segment: update segment
Update segment header: update segment header
Data Type Information: data type information
Update Type Information: update type information
Updating Position Division: update position division
Number of Updated Records: Number (number) of updated records
Updated Record: Updated record
Head Offset: head offset
Updated Data Size: Size of updated data
Update Part Data: update part data
Head Record Number: Head record number
Number of Updated Records: Number (number) of updated records
Update Part Record: Update part record
4-byte data indicating data size of connection information after updating: data with 4-byte, the data size of the connection information after updating
4-Byte Data Indicating Offset of Cost Table Head After Updating: 4-byte data that specify the offset of the cost table header after updating
Node Record Where Node Number of

FIG.

9 Is n: Node record if node number is from

FIG.

9 is n
Connected Record Where Connected Record Number of

FIG.

10 Is j: Connected record if the number of the connected Record of

FIG.

10 is equal to j
Cost Record Where Cost Record Number of

FIG.

11 Is c: Cost record if cost record number from

FIG.

11 is equal to c

Fig. 16

ST11: input
ST12: vehicle position received
ST13: Request update operation information
ST14: Update operation information received
ST15: Take update operation information
No: No.
Yes Yes
ST16: Is update necessary?
ST17: Remove card data
ST18: Update card data
ST19: Save card data
ST20: Execute navigation processing

Fig. 17

ST21: Initialize segment definition
ST22: Is there an update segment?
No: No.
Yes Yes
End: end
ST23: Initialize definition of the updated data record
ST24: Is there an updated data record?
ST25: Check update type information
Delete: delete
Substitute: replace
Add: Add
ST26: Execute deletion
ST27: Execute addition
ST28: Execute replacement
ST29: Update definition of the updated data record
ST30: update segment setting

Fig. 18

Update Type Information: update type information
Value: value
Updating Operation: Update operation
Deletion: deletion
Substitution: replacement
Addition: addition
Single Type Partial Updating: Partial update of the single type
Composite Type Partial Updating: Partial update of the composite type

Figure 19A

Updated Record: Updated record
Updated Record Header: header of the updated record
Record Number: record number
Partial Update Type Information: Information regarding the type of partial update
Updating Position Division: update position division
Number of Partially Updated Records: Number of partially updated records
Partially Updated Record: Partially updated record

Figure 19B

Partially Updated Record (Offset Type): Partially updated record (offset type)
Head Offset: head offset
Updated Data Size: Size of updated data
Update Part Data: update part data

Figure 19C

Partially Updated Record (Record Type): Partially Updated Record (Record Type)
Partial Data Type Information: Information regarding the type of partial data
Head Record Number: Head record number
Number of Update Part Records: Number (number) of update part records
Update Part Record: Update part record

Figure 20A

Updated Record: Updated record
Updated Record Header: header of the updated record
Record Number: record number
Number of Partially Updated Records: Number of partially updated records
Partially Updated Record: Partially updated record

Figure 20B

Partially Updated Record (Offset Type): Partially updated record (offset type)
Partially Update Type Information: Information regarding the type of partial update
Updating Position Division: update position division
Head Offset: head offset
Updated Data Size: Size of updated data
Update Part Data: update part data

Figure 20C

Partially Updated Record (Record Type): Partially Updated Record (Record Type)
Partial Update Type Information: Information regarding the type of partial update
Updating Position Division: update position division
Partial Data Type Information: Information regarding the type of partial data
Head Record Number: Head record number
Number of Update Part Records: Number (number) of update part records
Update Part Record: Update part record

Fig. 21

Value: value
Data Type: data type
Linked Record Array: field of linked records
Regulated Record Array: Field of regulated records

Figure 22A

Single Type Partial Updating of Node Record: Partial update of a node data record
Updated Record Header: header of the updated record
Record Number: record number
Update Type Information: update type information
Updating Position Division: update position division
Number of Partially Updated Records: Number of partially updated records
Head Offset: head offset
Updated Data Size: Size of updated data
Update Part Data: update part data

Figure 22B

Single Type Partial Updating of Connected Record: Partial update of a connected data record
Updated Record Header: header of the updated record
Record Number: record number
Update Type Information: update type information
Updating Position Division: update position division
Number of Partially Updated Records: Number of partially updated records
Partially Updated Record: Partially updated record
Partial Data Type: Type of partial data
Head Record Number: Head record number
Number of Update Part Records: Number (number) of update part records
Update Part Record: Update part record
Content of Link Record Where Linked Record Number of Connected Record of Connected Record Number j of

FIG.

10 Is
p: Contents of the linked data record if the number of the linked data record of the linked data record with the number j of the linked data record from

FIG.

10 is p Content of Regulated Record Where Regulated Record Number of Connected Record of Connected Record Number j of

FIG.

10 is
p: content of the regulated data set if the number of the regulated data set of the connected data set with the number j of the connected data set from

FIG.

10 is p

Fig. 23

Composite Type Partial Updating of Connected Record: Partial update of a connected data record
Updated Record Header: header of the updated record
Record Number: record number
Number of Partially Updated Records: Number of partially updated records
Partially Updated Record: Partially updated record
Update Type Information: update type information
Updating Position Division: update position division
Partial Data Type: Type of partial data
Head Record Number: Head record number
Number of Update Part Records: Number (number) of update part records
Update Part Record: Update part record
Content of Linked Record Where Linked Record Number of Connected Record of Connected Record Number j of

FIG.

10 Is
p: content of the linked data record if the number of the linked data record of the linked data record with the number j of a linked data record from

FIG.

10 equals p is

Fig. 24

ST25: Check update type information
Deletion: deletion
Addition: addition
Substitution: replacement
Single Type Partial Updating: Partial Updating (Single Type)
Composite Type Partial Updating: Partial Updating
To: After
ST31: Update single type part
ST32: Update composite type part

Fig. 25

ST41: Set target data record definition
ST42: Set update operation setting and update position department setting
ST43: Initialize definition of the partially updated data record
ST44: Is there a partially updated data record?
No: No.
Yes Yes
End: end
ST45: Perform partial update
ST46: Update definition of partially updated data record

Fig. 26

ST51: Set target data record definition
ST52: Initialize definition of the partially updated data record
ST53: Is there a partially updated data record?
No: No.
Yes Yes
End: end
ST54: update operation setting and
Set update position department setting
ST55: Perform partial update
ST56: Update definition of partially updated data record

Fig. 27

Updating Operation Information Storage Section
Updating Operation Information Management Information: Update operation information management information
Updating Operation Information

Fig. 28

Map buffer: map buffer
Map Management Information: Map management information
The Number of Map Data: The number (number) of map data
Map Management Record: Map management record
Map Data: Map data

Fig. 29

ST11: input
ST12 :. Get vehicle position
ST13: Request update operation information
ST14: Update operation information received
ST61: Initialize card management information
ST15: Is updated operation information available?
No: No.
Yes Yes
ST16: Is update necessary?
ST17: Remove card data
ST65: Update card data received again
ST18: Update card data
ST62: Save card data in the card buffer
ST63: Is storage required?
ST19. Save card data
ST64: Save update operation information
ST20: Execute navigation processing

Fig. 30

ST71: Is the removed card management data record available?
No: No.
Yes Yes
End: end
ST72: Is card data available?
ST73: Is there update operation information?
ST74: Card data received
ST75: Execute update
ST76: Save card data in the card buffer

Fig. 31

ST1: Is there an update operation information request?
No: No.
Yes Yes
ST2: Update operation information request received
ST3: Generate update operation information
ST81: Generate information about corresponding nodes
ST4: Send update operation information
ST82: Send information about corresponding nodes

Fig. 33C, Fig. 33D

Node: node
Node Record Number: Node record number

Fig. 33E

Linked Record Number: Number of the linked record
Adjacent Node Information: Information regarding neighboring nodes
Link Cost Information: Link cost information
Adjacent Number: Adjacent number
Invalid Value: Invalid value
Cost Record Number of Link Between N00 And N04:
Cost record number from link between N00 and N04

Fig. 34C, Fig. 34D

Node: node
Node Record Number: Node record number

Fig. 35C, Fig. 35D

Node: node
Node Record Number: Node record number

FIG. 35E, FIG. 35F

Node: node
Linked Record Number: Number of the linked record
Adjacent Node Information: Information about neighboring nodes
Linked Cost Information: Information about linked costs
Adjacent Number: Adjacent number
Invalid Value: Invalid value

FIG. 36A, Fig. 36B

Node: node
Node Record Number of Version: Node record number of version

Figure 37A

Corresponding Node Information: Information about corresponding nodes
Corresponding Node Information Header: Leader of the information about corresponding nodes
Corresponding Node Information Data Size: Data size of the information about corresponding nodes
Number of Corresponding Node Tables: Number (number) of tables via corresponding nodes
Corresponding node table: table of corresponding nodes

Figure 37B

Corresponding node table: table of corresponding nodes
Corresponding node table header: leader of the table of corresponding nodes
Map Data Identification Information: Map data identification information
Corresponding Version Information: Information about the corresponding version
Version: version
Adjacent Map Data Information: Information about neighboring map data
Number of Corresponding Records: Number (number) of corresponding records
Corresponding Record: Corresponding record

Figure 37C

Corresponding Record: Corresponding record
Node Record Number: Node record number

FIG. 38A, FIG. 38B

Corresponding node table: table of corresponding nodes
Map Data Identification Information: Map data identification information
Corresponding Version Information Version: Version of the information about the corresponding version
Adjacent Map Data Information: Information about neighboring map data
Number of Corresponding Records: Number (number) of corresponding records
Corresponding node header: header for corresponding nodes
Corresponding Record: Corresponding record
Node Record Number: Node record number

Fig. 39

ST91: Is extracted neighborhood information available?
No: No.
Yes Yes
Coincident: match
Non-Coincident: No match
ST92: Compare versions
ST93: Create table of corresponding nodes
ST94: Generate information about corresponding nodes
End: end

Fig. 40

ST11: input
ST12: vehicle position received
ST13: Request update operation information
ST14: Update operation information received
ST15: Is updated operation information available?
No: No.
Yes Yes
ST16: Is update necessary?
ST17: Remove card data
ST18: Update card data
ST19: Save card data
ST101: Receive information about corresponding nodes
ST102: delete table of corresponding nodes
ST20: Execute navigation processing

Fig. 41

Corresponding Node Table Storage Section: Storage section for the table of corresponding nodes
Corresponding Node Table Management Information: Management information for the table of corresponding nodes
Corresponding node table: table of corresponding nodes

Fig. 42

Prior Art: state of the art

1

information center

2

Channel

3

receiver

5

Map data processor

6

input device

7

output device

13

Map data storage device (under the arrow in

FIG.

42): Delete the link between N2 and N5
Delete the link between N5 and N7
Add link between N3 and N6
Delete N5 and N7

Figure 43C

Node: node
Node Number of: Node number of
None: None

Claims (20)

1. Map data processing device, which has:
a storage device ( 13 ) for storing map data;
an information acquisition device ( 14 ) for obtaining update operation information indicating the update content of the map data stored in the storage device ( 13 ); and
an update device ( 15 ) for updating the map data stored in the storage device in accordance with the update operation information obtained from the information acquisition device. 2. Map data processing device according to claim 1, characterized in that the information acquisition device ( 14 ) receives update operation information which comprises update position information, a part to be updated being represented by an offset relative to a predetermined reference position in the map data. 3. Map data processing device according to claim 1, characterized in that the information acquisition device ( 14 ) receives update operation information, which contains, among the data contained in the map data, data specification information for specifying data to be updated, and update position information which indicates a data record in which the data is stored are. 4. Map data processing device according to claim 3, characterized in that the information acquisition device ( 14 ) receives update operation information which contains update position information which indicates at least one or more update positions in the data record. The map data processing device according to claim 4, characterized in that the information obtaining device ( 14 ) receives update operation information, which contains update type information indicating the update types of at least one or more parts to be updated in the data set. The map data processing device according to claim 1, characterized by a data storage device ( 16 ) for storing the update operation information obtained from the information acquisition device ( 14 ) when the update time by the update device ( 15 ) exceeds a predetermined reference time, and for storing map data after the update by the update device ( 15 ) if the update time is less than the predetermined time. The map data processing device according to claim 1, characterized by a data storage device ( 16 ) for storing the update operation information obtained from the information acquisition device ( 14 ) when the determined update time by the update device ( 15 ) exceeds a predetermined reference time, and for storing map data after Update by the update device ( 15 ) if the determined update time is less than the predetermined reference time. 8. Card data processing device, which has:
a storage device ( 13 ) for storing map data;
an information acquisition device ( 14 ) for obtaining update information for the map data stored in the storage device ( 13 ); and
an update device ( 15 ) for updating the map data stored in the storage device in accordance with the update information obtained from the information acquisition device ( 14 ),
wherein the information acquisition device ( 14 ) obtains corresponding node information indicating a correspondence between identical nodes of respective versions when the storage device ( 13 ) stores map data and a version of a certain area is different from that of another area. 9. The card data processing device as claimed in claim 8, characterized in that the information acquisition device ( 14 ) only receives information relating to corresponding nodes if versions of mutually adjacent regions differ from one another, the information obtained relating to corresponding nodes relating to identical nodes located in the mutually adjacent regions available. 10. Card data processing device according to claim 9, characterized in that the information acquisition device ( 14 ) only receives information regarding corresponding nodes for the same node that is present in an overlapping part of the adjacent areas. 11. Card data processing method with the following steps:
Obtaining update operation information indicating an update content of stored map data; and
Update the map data according to the update operation information obtained. 12. Card data processing method according to claim 11, characterized in that Update operation information is obtained Contains update position information, where a part to be updated by an offset a predetermined reference position in the map data is represented. 13. Map data processing method according to claim 11, characterized in that Update operation information is obtained which contains data, the information for specifying updates data, and Update position information that a Data record indicates in which the data is stored are among the data contained in the map data.   14. Card data processing method according to claim 11, characterized in that Update operation information is obtained Contains update position information that at least one or more update positions in a record. 15. Card data processing method according to claim 14, characterized in that Update operation information is obtained Update type information contains which Update types of at least one or more Indicates parts that will be updated in the record should. 16. Card data processing method according to claim 11, characterized in that the received Update operation information is stored, if the update time of the card data is one exceeds predetermined reference time, and Card data is saved after the update, if the update time is less than that predetermined reference time. 17. Card data processing method according to claim 11, characterized in that the received Update operation information is stored, if the determined update time for the Card data exceeds a predetermined reference time, and the map data is saved after the update become smaller if the determined update time is smaller is as the predetermined reference time. 18. Card data processing method with the following steps:
Obtaining update information for stored map data; and
Updating the map data according to the update information received,
wherein when map data is stored and a version of a certain area is different from that of another area, information regarding corresponding nodes indicating a correspondence between identical nodes of the respective versions is obtained. 19. Card data processing method according to claim 18, characterized in that information regarding corresponding node is only obtained if there is Versions of adjacent areas from each other differ, the information regarding corresponding node that is obtained identical Affects nodes in the neighboring Areas are available. 20. Card data processing method according to claim 19, characterized in that only information regarding corresponding node of the same node is obtained, the one in an overlapping part of each other neighboring areas is available.