JP5771024B2 - Route search device - Google Patents

Description

  The present invention relates to a route searching apparatus for searching for and guiding a route in a building having a multi-layer structure.

Currently, pedestrian navigation using mobile terminals has been put to practical use outdoors. In addition, research on pedestrian navigation that searches for routes by setting departure points, destinations, and waypoints in indoor stations, underground malls, buildings, and the like is also in progress.
Indoor buildings often have a multi-layered structure and need to have a structure different from that of outdoor network data. For example, network data in an indoor building requires a node connected to another layer such as a staircase or an elevator. Further, when the guidance is provided for each hierarchy, network data for each hierarchy is required. And since the network data of a building having a multi-layer structure such as a high-rise commercial building requires network data corresponding to the layer, the capacity of the network data inevitably increases. As a result, such network data is a heavy burden for mobile terminals with limited capacity and CPU performance.
As a technique for solving this problem, a technique is disclosed in which network data corresponding to a plurality of floors in the height direction is compressed by projecting it onto a single plane by a map compression unit (see, for example, Patent Document 1). This technology projects network data of each layer, generates network data in one plane using spatial similarities, and manages the number of floors in which the network data exists with flags, so it is similar in space When there are a large number of hierarchies, the amount of data can be reduced.

JP 2008-83112 A

  However, although the technique described in Patent Document 1 reduces the capacity of network data, the efficiency of route search may deteriorate. Specifically, Patent Document 1 is subdivided so that network data of one plane generated by projecting each layer of network data having different shapes onto one plane can correspond to any hierarchy. Yes. Since the network data of each layer is generated based on this subdivided one plane network data, even if each layer is composed of network data with a simple structure, Network data may have a complicated structure including nodes that are not necessary. When performing a route search using such network data, the route search is a process for determining whether or not each node can pass, so a route search using an originally unnecessary node is performed. As a result, the route search efficiency decreases.

  An object of the present invention is to provide a route search device that reduces the capacity of network data while maintaining route search efficiency in route search in a multi-layered building.

In order to solve the above-described problems, the present invention is a route search device that performs a route search on a map including the inside of a building having a multi-layered structure, and is vertical in the passage network of each level of the building. A standard network data representing a predetermined passage network that matches the difference, and difference network data representing a difference between the passage network of each layer of the building and the passage network represented by the standard network data A storage unit for storing data, a point setting unit for setting a starting point and a destination on the map, and reading the standard network data and the difference network data of a desired hierarchy from the storage unit; A route search unit that performs a route search from the departure point to the destination by reproducing the passage network of the hierarchy.
Note that the above-described features do not enumerate all the features of the present invention, and a configuration (or method) including these as main parts can also be an invention.

  According to the route search device of the present invention, the route search is performed by generating the route network using the standard network data representing the predetermined route network that matches in the vertical direction and the difference network data. By not including unnecessary nodes in the hierarchical network data, it is possible to reduce the capacity of the network data of the multi-layered structure while maintaining the route search efficiency.

It is a figure showing the whole navigation system composition. It is a figure which shows the data structure of map data. It is a figure which shows the flowchart of the whole route guidance process. It is a figure which shows the flowchart of a point setting process. It is a figure which shows the flowchart of a route search process. It is a figure which shows the flowchart of the node data group production | generation process of a designated hierarchy. It is a figure which shows the flowchart of a route guidance process. (A) is a figure which shows the network data of each hierarchy in a building, (b) is the figure which looked at the whole network data in a building in the perpendicular direction. (A) And (b) is a figure which shows standard network data. It is a figure which shows difference network data. (A) is a figure explaining the network data in the building of Example 1, (b) is a figure explaining the network data of Example 2. FIG. It is a figure which shows the data structure of the node data of Example 2. It is a figure which shows the flowchart of the route guidance process of Example 2. FIG. It is a figure which shows the network data of each hierarchy in the building of Example 3. FIG. FIG. 10 is a diagram illustrating a flowchart of route search processing according to a third embodiment.

  Hereinafter, embodiments embodying the present invention will be described.

<Example 1>
As shown in FIG. 1, the navigation system 1 includes a mobile terminal 10 and a route guidance device 20 connected to the mobile terminal 10 through an information network. The mobile terminal 10 is a mobile phone including a wireless communication unit 11, a current position detection unit 12, an image display unit 13, an input unit 14, and an apparatus main body, and is used as a pedestrian navigation terminal. The route guidance device 20 is a distribution server that includes a data communication unit 21, a computer 22, and a storage unit 23. The computer 22 includes a point setting unit 30, a route searching unit 31, and a route guiding unit 32. The storage unit 23 stores map data including map display data 40 and network data 41.

  The wireless communication unit 11 constituting the mobile terminal 10 is a transceiver including a transmitter, a receiver, and an antenna. In addition, the current position detection unit 12 is installed to detect the current position in a GPS receiver that detects the current position based on the radio wave from the GPS satellite, and in an underground city where it is difficult to receive the radio wave from the GPS satellite. It consists of a short-range wireless position detector that obtains the current position based on the reception of short-range radio waves from the wireless station and outputs the data of the current position. The image display unit 13 is a device that displays an image such as a communication menu screen or a map image on an image display surface, such as a liquid crystal display. The input unit 14 has a touch panel function on the surface of the image display unit 13, and can specify a destination, a map area to be displayed, a scale, a facility hierarchy, and the like as specified by the user.

  The data communication unit 21 constituting the route guidance device 20 has a function of connecting to the Internet W through an optical fiber, and is connected to the wireless communication unit 11 of the mobile terminal 10 from the Internet W via wireless communication. The computer 22 is a large computer including an internal storage device such as a ROM and a RAM in which computer programs, processing conditions, and the like are stored in advance, and a CPU that executes the computer program. The storage unit 23 is an external storage device such as a flash memory, a hard disk, a DVD, or a Blu-ray disc, and stores map data.

  The point setting unit 30 has a function of receiving a signal from the data communication unit 21, setting points such as a departure point and a destination with reference to the map data stored in the storage unit 23, and outputting the point to the route search unit 31. Have.

  The route search unit 31 receives information on a departure place and a destination from the point setting unit 30, and generates a network data group that is a set of network data in a hierarchy necessary for route search with reference to map data; It has a function of searching for a route to the destination using the generated network data group and a function of outputting the searched route data to the route guide unit 32.

  The route guidance unit 32 has a function of receiving route data from the route search unit 31, generating map guidance information with reference to map data, and outputting the route guidance information to the data communication unit 21.

  The map data stored in the storage unit 23 indicates the connection state of map display data 40 such as polyline and polygon data for generating administrative boundary maps, road maps, and facility maps, and pedestrian passages. This is map data including network data 41 expressed by nodes and links.

  The network data in the present invention includes network data in a building that represents a multi-layered facility having a plurality of hierarchies having different hierarchies in the height direction and representing a passage network of each hierarchy. The network data in this building is the difference between the standard network data representing a predetermined channel network that matches in the vertical direction in the channel network of each layer and the channel network represented by this standard network data. It is distinguished from the difference network data that expresses.

  Each level of a building having a multi-level structure often has a common passage when viewed in the vertical direction. The path network generated so as to be configured by a common path is standard network data. It is desirable that the standard network data is constituted by network data that matches a lot in the network data in the building as viewed from the vertical direction. Since the standard network data shares the matching nodes as described later, the capacity of the network data of the building is reduced as the number of matches increases.

  The difference network data is data that does not match the standard network data when viewed in the vertical direction, and is set for each hierarchical unit. The network data in the building is preferably configured such that the difference network data is the smallest. By reducing the difference network data, there is an effect that the capacity of the network data in the building can be reduced more. Note that the network data of the hierarchy expressed as having no difference network data has the same configuration as the standard network data.

The difference network data includes additional network data described as “added” in the attribute information, deleted network data described as “deleted” in the attribute information, and “changed” in the attribute information. With modified network data. The additional type network data is network data that exists in one layer of interest and does not exist in the standard network data. The deletion-type network data is network data that exists in the standard network data and does not exist in that layer in one layer of interest. The modified network data is network data that matches the standard network data when viewed in the vertical direction but has different attributes such as the connection relationship.
Note that the change-type network data can also be expressed by using deletion-type network data and addition-type network data. That is, when changing some attributes of the standard network data, both the process of deleting the target standard network data by the deletion type network data and the process of adding the network data of the attribute changed by the addition type network data May be executed.

  For example, an example of network data of a multi-layered building having six different levels in the height direction will be described with reference to FIG. When the network data of each layer in the building shown in FIG. 8A is viewed in the vertical direction, it can be represented by network data including nodes N1 to N8 as shown in FIG. 8B. When the threshold value for determining whether or not to make standard network data is set to 3, among the network data viewed in the vertical direction, the nodes whose nodes that match in the vertical direction are equal to or greater than the threshold are nodes N1 to N1. N6. Therefore, the standard network data nodes of the building can be configured by nodes N1 to N6 as shown in FIG. In this embodiment, the links connecting these nodes are added to the standard network data for those that match the threshold value or more when viewed in the vertical direction. Specifically, as shown in FIG. 9, links L1 to L7 between the nodes N1 to N6 are added to the configuration.

  Moreover, the difference network data of each hierarchy of the building shown in FIG. 8 is demonstrated using FIG. Each layer from 1F to 6F is expressed by data that does not match when viewed in the vertical direction with respect to the standard network data shown in FIG. In the 1F hierarchy, nodes N2 and N5 existing in the standard network data are data not existing in the 1F hierarchy. In this case, the differential network data in the 1F hierarchy is composed of nodes N2 and N5 which are nodes of deletion-type network data (hereinafter referred to as deletion-type nodes). Further, the connection information to the node N2 for the nodes N1 and N3 and the connection information to the node N5 for the nodes N6 and N4 are respectively changed by the node of the change type network data (hereinafter referred to as the change type node). In addition, in the building shown in FIG. 8, the link corresponding to standard network data is not set.

  Further, since there is no difference information in the layers 2F to 4F, the example shown in FIG. 10 is expressed as “no difference”. In this case, the network data in hierarchical units from 2F to 4F has the same configuration as the standard network data. In the 5F hierarchy, nodes N7 and N8 that do not exist in the standard network data are data that exist in the 5F hierarchy. Accordingly, the difference network data in the 5F hierarchy is composed of nodes N7 and N8 which are nodes of additional network data (hereinafter referred to as additional nodes). Further, the connection information to the node 7 for the nodes N2 and N5 and the connection information to the node N8 for the nodes N3 and N4 are changed by the change type node, respectively.

  Further, in the 6F hierarchy, nodes N7 and N8 that do not exist in the standard network data are data that exist in the 6F hierarchy. The node N3 existing in the standard network data is data that does not exist in the 6F hierarchy. Accordingly, the difference network data in the 6F hierarchy is composed of the addition type nodes N7 and N8 and the deletion type node N3. Further, the connection information to the nodes N7 and N3 for the node N2, the connection information to the node N7 for the node N5, and the connection information to the node N8 for the node N4 are changed by the change type node.

  The map data of the present invention has a structure that allows standard network data to be prepared in a plurality of patterns for one building. When a plurality of patterns are prepared for one building, standard network data of one pattern arbitrarily selected is associated with each layer. When multiple patterns of standard network data are set, the difference network data is the difference between the passage network of each level of the building and one arbitrarily selected standard network data. When there are a plurality of common trends, there are cases where the number of difference network data is reduced and the capacity of the network data is reduced.

The map data of this embodiment is composed of map display data 40 and network data 41 as shown in FIG.
The map display data 40 has hierarchical unit display data for displaying an image of each layer for a facility having a plurality of layers different in the height direction. The hierarchical unit display data of the present embodiment includes a facility ID, a facility name, and a hierarchical ID as data.

  The network data 41 includes hierarchical unit data representing data of each level of the building, node data that defines points connecting passages, and link data that defines a line connecting two nodes. The hierarchical unit data includes a hierarchical ID, standard pattern information, difference information, and the like as data. The hierarchy ID stores an ID for identifying each hierarchy of the building. The standard pattern information stores a standard pattern ID, a node ID, and a link ID. In the standard pattern ID, a number defining a pattern of standard network data is stored. The node ID and link ID stored in the standard pattern information correspond to the node data and link data constituting the standard network data.

  The difference information stores information on whether or not there is difference network data with respect to the standard network data corresponding to the standard pattern ID. When the difference information is “none”, the network data in this hierarchy has the same configuration as the standard network data. On the other hand, when the difference information is “present”, an additional type node (link) ID indicating the ID of the additional type network data, a deletion type node (link) ID indicating the ID of the deletion type network data, or the change type network A change type node (link) ID representing the data ID is stored. The change type node (link) includes change information for changing attribute data of the node (link) to be changed.

  The node data that is node information of the network data 41 includes node ID, facility ID, connection node information, coordinate information, hierarchy transition information, and the like as data. The connection node information includes a connection node ID, cost information reaching the connection node, and a connection link ID. The hierarchy transition information is information connected to different hierarchies. When there are nodes that can make a hierarchy transition from the target node, the hierarchy transition information is created by the number of the nodes. The hierarchy transition information includes a hierarchy ID representing a hierarchy where the target node is located, a connection node ID of the connection destination, a connection link ID, a connection destination hierarchy ID, and cost information. The hierarchy transition information is, for example, information that expresses stairs and elevators.

  The link data that is the link information of the network data 41 includes a link ID, a facility ID, a connection node ID, coordinate information, a hierarchy transition flag, and the like as data.

  Processing of the navigation system 1 according to the present embodiment will be described with reference to FIGS. The present embodiment is an example in which a route from a starting point, which is the current position, to a destination is set, and a route search is performed using the connection relation of node data among network data. The link data is used when displaying a route after the route search. The starting point and destination are set in one building. Further, in the present embodiment, the nodes and links corresponding to the standard network data are defined as standard nodes and standard links, respectively, and the nodes and links corresponding to the differential network data are defined as differential nodes and differential links, respectively.

  First, the point setting unit 30 refers to the network data according to the input of the departure point and the destination by the input unit 14, and includes a hierarchy corresponding to the departure point and a search start node, and a hierarchy corresponding to the destination and a search end node. Is executed (point setting process) (step S100). Next, the route search unit 31 executes a process (route search process) for performing a route search from the search start node to the search end node set in step S100 (step S200). Next, the route guidance unit 32 executes a route guidance process (route guidance process) using the route data and link data searched in step S200 (step S300). In the above, each process of the main flow of this invention was demonstrated. Details of each process will be described below.

(Point setting process)
The point setting process in step S100 will be described in detail below with reference to FIG.
First, the user designates a destination by operating the touch panel of the input unit 14 on the mobile terminal 10 side. The designation of the destination is performed by designation of the hierarchy where the destination is located and designation of the position in the designated hierarchy. Further, the mobile terminal 10 designates the departure place by detecting the current position by the current position detection unit 12. The designation of the departure place is performed by designation of the hierarchy where the current position is located and designation of the position in the hierarchy. When the user's designation is accepted, a process of transmitting the designated destination data and departure data to the distribution server via the Internet W by the wireless communication unit 11 is executed (step S111).

  When step S111 is completed, on the distribution server side, the data communication unit 21 executes a process of receiving the destination data and the departure point data and outputting them to the spot setting unit 30 of the computer 22. Subsequently, the point setting unit 30 refers to the network data 41 stored in the storage unit 23 and executes a process of determining a search start node as a departure point and a search end node as a destination point on the map (step) S112). In the present embodiment, the point setting unit 30 sets the nearest node from the starting point designated position as the search start node and the nearest node from the destination designated position as the search end node. Information of the search start node and the search end node on the map determined by the point setting unit 30 is output to the route search unit 31 and the process proceeds to the route search process (step S200).

(Route search process)
The route search process in step S200 will be described in detail below with reference to FIG.
First, the route search unit 31 acquires the standard nodes of the departure point and destination layers from the network data 41 of the storage unit 23 (step S211). Specifically, the route search unit 31 refers to the standard pattern information corresponding to the hierarchy ID in the hierarchy corresponding to the departure place data, and acquires the standard node defined by the standard pattern ID.

  When step S211 is completed, the route search unit 31 acquires a difference node existing in the hierarchy corresponding to the departure point data from the network data 41, and applies it to the standard node acquired in step S211 to be a node necessary for the route search. A process of generating a node data group that is a set of data is executed (step S212). A detailed description of this process will be given later.

  When step S212 is completed, the route search unit 31 refers to the connection node information of the search start node, and executes a process of determining a node with the lowest cost from all the nodes determined to be reachable by the Dijkstra method (step S212). S213).

  When step S213 ends, the route search unit 31 performs a process of determining whether or not a confirmed node that is a confirmed node is a search end node (step S214). In the case of the present embodiment, the determination is performed by comparing the node ID of the confirmed node determined in the most recent step S213 and the hierarchy where the determined node is located with the node ID of the search end node and the hierarchy where the search end node is located. If the route search unit 31 determines in step S214 that the determined node is a search end node (step S214: Yes), the route search unit 31 ends the route search process. Then, the route search unit 31 outputs, to the route guidance process (step S300), the node constituting the route with the lowest cost among the nodes determined from the search start node to the search end node.

  On the other hand, when it is determined in step S214 that the determined node is not the search end node (step S214: No), the route search unit 31 determines whether or not the determined node has hierarchy transition information (step S215). ). Some node data corresponding to the confirmed node includes a plurality of pieces of hierarchy transition information. Therefore, specifically, when there is hierarchy transition information corresponding to the same hierarchy ID as the hierarchy ID of the hierarchy in which the confirmed node is located in the hierarchy transition information of the confirmed node, the route search unit 31 stores the hierarchy transition information. Judge that there is. In step S215, when there is no hierarchy transition information (step S215: No), the route search unit 31 determines that the search does not proceed to a different hierarchy, moves to step S213, and sets connection node information of the determined node. Search for the next node by referring to it.

  On the other hand, when it is determined in step S215 that the determined node has hierarchy transition information (step S215: Yes), the route search unit 31 refers to the connection destination layer ID, and the connection destination layer of the determined node is the node data. It is determined whether or not a group is generated (step S216). If it is determined in step S216 that the node data group of the connection destination layer has been generated (step S216: Yes), the route search unit 31 proceeds to step S213.

  When it is determined in step S216 that the node data group of the connection destination hierarchy has not been generated (step S216: No), the route search unit 31 proceeds to step S212 and generates the node data group of the connection destination hierarchy. The process to do is performed.

(Node data group generation processing)
The node data group generation processing in step S212 will be described in detail below with reference to FIG.
First, the route search unit 31 refers to the difference information of the hierarchy unit data in the network data 41 and determines whether or not a difference node exists in the corresponding hierarchy (step S411). If it is determined in step S411 that there is no difference information (step S411: No), the route search unit 31 ends the node data group generation process for the corresponding hierarchy.

  On the other hand, when it is determined in step S411 that there is difference information (step S411: Yes), the route search unit 31 acquires the difference node of the corresponding hierarchy from the network data 41 (step S412). Specifically, the route search unit 31 refers to the difference information of the hierarchical unit data in the network data 41 and extracts from the storage unit 23 a corresponding node among the addition type node, the deletion type node, and the change type node that are the difference targets. To do.

  When step S412 ends, the route search unit 31 executes a process of combining the difference node acquired in step S412 with the standard node acquired in step S211 (step S413). As described above, the difference node includes an add type node, a delete type node, and a change type node. The route search unit 31 is, for example, a process of adding to the node data group composed of standard nodes for the additional type node, and another node connected to a specific node among the standard nodes for the change type node. A process for changing the connection relationship with the node, and for a deletion type node, a process for deleting a specific node from the node data group composed of standard node data is executed. In this way, the route search unit 31 generates a node data group of the corresponding hierarchy. Since the generated node data group is composed only of node data existing in each layer, there is no unnecessary node data. Therefore, by using the data structure as described above, there is an effect that the route search unit 31 can maintain the efficiency of the route search.

(Route guidance processing)
The route guidance process in step S300 will be described in detail below with reference to FIG.
First, the route guidance unit 32 executes a process of extracting link data connecting nodes output by the route search unit 31 from the network data 41 of the storage unit 23 (step S311). The route guidance unit 32 extracts link data with reference to the connection link ID of the node output by the route search unit 31.
For example, when the node output by the route search unit 31 in the hierarchy of 5F in FIG. 8 is node N6 → node N5 → node N7 → node N8, in this embodiment, the route guide unit 32 is shown in FIG. As shown in FIG. 5, the link L5 of standard network data and the links L8 and L9 of difference network data are extracted from the network data 41. Both links L8 and 9 are additional network data. Of these, the link L8 partially matches the link L7 of the standard network data as viewed in the vertical direction, so the processing of deleting the link L7 of the standard network data and the processing of adding the link L8 of the difference network data By executing both, the link is extracted as the link L8 corresponding to the node N5 → node N7.

  When step S311 is completed, the route guidance unit 32 executes processing for generating route guidance data from the extracted link data and display map data (step S312). The route guidance unit 32 extracts and superimposes the hierarchical unit display data corresponding to the route expression data on the route expression data processed so as to connect and display the link data extracted in step S311. Generate data.

  When step S312 ends, the route guidance unit 32 outputs the generated route guidance data to the data communication unit 21, and transmits the data from the distribution server 20 to the wireless communication unit 11 of the mobile terminal 10 via the Internet W. The mobile terminal 10 transmits route guidance data from the wireless communication unit 11 to the display unit 13 and displays the route guidance data on a liquid crystal display or the like (step S313).

<Example 2>
In the second embodiment, the form of the link information corresponding to the connection node information of the node data is different from that of the first embodiment. Note that the spot setting process S100 and the route search process S200 are the same as those in the first embodiment.

  As shown in FIG. 12, in the node data in the second embodiment, the employed link ID is stored in the connection node information instead of the connection link ID in the first embodiment. The adopted link indicates a standard link that is adopted as a link with a node to be connected. In addition to the connection node ID and cost information, the connection node information includes link data in which the adopted link passes through the position of the connection target node as viewed in the vertical direction, and the adoption link is the position of the connection target node. Relative position information indicating the relative position of the connection target node on the adopted link when the link data passes through is included.

  When the relative position information has a valid value, it indicates that the adopted link passes through the node to be connected. For example, as shown in FIG. 11B, when the connection destination of the node N5 is N2, the adopted link that is a standard link is represented by a link L7. Here, when the node N7 is added on the link L7 and the connection destination of the node N5 is changed to the node N7, the connection node ID of the connection node information of the node N5 represents the node N7, and the adopted link ID represents the link L7. It will be.

  The relative position information is represented by the distance on the adopted link to the connection target node with respect to the distance from the start point to the end point of the adopted link. For example, in FIG. 11B, the distance from the start point to the end point of the employed link L7 connecting the node N5 to the node N2 is “100”, and the distance on the passing link to the connection target node N7 is “50”. If so, a value indicating 50% is written in the relative position information. By adopting such a data structure, the network data 41 does not need to store all the link data connecting the node data, so that the data capacity can be reduced. In FIG. 12, it is node data of the network data 41, and other data is omitted for convenience.

(Route guidance processing)
The route guidance process using the relative position information will be described in detail below with reference to FIG. First, the route guide unit 32 refers to the adopted link ID of the node output by the route search unit 31 and executes a process of extracting link data from the network data 41 of the storage unit 23 (step S1301). For example, in the hierarchy of 5F in FIG. 10, when the node output from the route search unit 31 is node N6 → node N5 → node N7 → node N8, in the second embodiment, the route guide unit 32 is shown in FIG. As shown in b), the standard network data links L5 and L7 and the differential network data link L9 are extracted from the network data 41.

  When step S1301 ends, the route guidance unit 32 performs a process of determining whether or not the relative position information indicates that the adopted link is link data passing through the position of the node to be connected as viewed in the vertical direction. (Step S1302). If it is determined in step S1302 that the adopted link is link data passing through the position of the node to be connected (step S1302: No), the route guidance unit 32 proceeds to step S1304 and generates route guidance data. The process to do is performed.

  On the other hand, when it is determined in step S1302 that the employed link includes valid relative position information (step S1302: Yes), the route guide unit 32 extracts the relative position information from the node data, and uses this relative position information. It changes by applying to the extracted employment link (step S1303). Specifically, in FIG. 11B, the route guidance unit 32 changes the length of the link L7 from the node N5 to 50% when the relative position information of the link L7 is 50%, for example. The route guidance unit 32 generates link L5 → link L7 (50%) → link L9 as route expression data.

  When step S1303 and step S1302 are completed, the route guidance unit 32 executes processing for generating route guidance data from the adopted link, the changed adopted link, and the display map data (step S1304). The route guidance unit 32 generates route guidance data by superimposing the hierarchical unit display data corresponding to the hierarchical ID of the link data on the route representation data representing the link data by an image.

  When step S1304 ends, the route guidance unit 32 outputs the generated route guidance data to the data communication unit 21 and transmits the data from the distribution server 20 to the wireless communication unit 11 of the mobile terminal 10 via the Internet W. The route guidance unit 32 transmits route guidance data from the wireless communication unit 11 to the display unit 13 and displays the data on a liquid crystal display or the like (step S1305).

<Example 3>
In the third embodiment, the number of patterns of standard network data in one building is different from those in the first and second embodiments. That is, the map data of the third embodiment has a structure capable of preparing standard network data in a plurality of patterns for one building. For example, in the case of a complex commercial facility having a structure in which the lower floor is a store floor and the middle and higher floors are office floors, it is not uncommon for the store floor and the office floor to have greatly different network structures. In such a case, the difference network data is a difference between the passage network of each layer and one standard network data arbitrarily selected. That is, the difference network data of each hierarchy is a difference from the standard network data corresponding to the selected store floor or the standard network data corresponding to the office floor. Thus, by having the standard network data pattern on the store floor and the standard network data pattern on the office floor, the difference network data can be reduced.

  For example, a building having a different structure depending on the hierarchy will be described with reference to FIG. The building B in FIG. 14 is a complex commercial facility in which 1F to 2F are store floors and 3F to 6F are office floors. Since the uses of the store floors 1F to 2F and the office floors 3F to 6F are different, the structures including the passages are greatly different. In such a case, the store floor and the office floor are distinguished by the standard pattern ID of the standard pattern information, the standard nodes corresponding to the store floor are set as nodes N111 to N115, and the standard nodes corresponding to the office floor are set as nodes N101 to N106. can do.

(Route search process)
The route search processing in the third embodiment will be described in detail below with reference to FIG.
Of the route search processing of the third embodiment, the processing from step S1501 to step S1505 shown in FIG. 15 is the same as the processing from step S211 to step S215 of the route search processing of the first embodiment shown in FIG. is there. Therefore, the description of the processing from step S1501 to step S1505 is omitted, and the processing from step S1506 will be described.

  When it is determined in step S1505 that there is hierarchy transition information in the confirmed node (step S1505: Yes), the route search unit 31 refers to the connection destination hierarchy ID, and whether or not the connection destination hierarchy generates a node data group. Is determined (step S1506). If it is determined in step S1506 that the node data group of the connection destination hierarchy has been generated (step S1506: Yes), the route search unit 31 proceeds to step S1503.

  When it is determined in step S1506 that the node data group of the connection destination hierarchy has not been generated (step S1506: No), the route search unit 31 determines whether or not the standard node data of the connection destination hierarchy has been acquired. Perform (step S1507). Specifically, the route search unit 31 refers to the network data 41, compares the standard pattern ID corresponding to the layer ID of the connection destination layer with the standard pattern ID obtained in the previous step S1501, and determines each ID. Are the same. In step S1507, the standard pattern ID corresponding to the hierarchy ID of the connection destination hierarchy by the route search unit 31 is the same as the standard pattern ID acquired in step S211. Thus, the standard node data of the connection destination hierarchy has been acquired. When it determines with there (step S1507: Yes), it transfers to step S1502.

  On the other hand, when it is determined in step S1507 that the standard pattern ID corresponding to the layer ID of the connection destination layer is different from the standard pattern ID acquired in step S211, thereby determining that the standard node data of the connection layer has not been acquired (step S1507). S1507: No), the process proceeds to step S1501.

  As described above, the map data of the third embodiment has an effect that the difference network data can be reduced and the capacity of the map data can be reduced by preparing a plurality of patterns of standard node data for one building. . For example, in the case of a complex commercial facility in which a store floor and an office floor are mixed, the difference network data can be reduced by setting the standard pattern of the store floor and the standard pattern of the office floor.

<Others>
Needless to say, the present invention is not limited to the above-described embodiments, and various modifications and improvements can be made without departing from the scope of the present invention. For example, in the first embodiment, the route search is performed using the connection node information of the node data and the link data is used for the route guidance display. However, the route search may be performed using the link data and the node data.

DESCRIPTION OF SYMBOLS 10 Mobile terminal, 11 Wireless communication part, 12 Current position detection part, 13 Image display part, 14 Input part, 20 Server apparatus, 21 Data communication part, 22 Computer, 23 Storage part, 30 Point setting part, 31 Route search part, 32 route guide, 40 map display data, 41 network data

Claims (2)

A route search device for searching a route on a map including a building having a multi-story structure,
Standard network data representing a predetermined passage network that matches in the vertical direction in the passage network of each level of the building, and a path expressed by the passage network of each level of the building and the standard network data A storage unit for storing map data including difference network data defined for each hierarchical unit expressing a difference with a network;
A point setting unit for setting a starting point and a destination on the map;
A route search unit that reads the standard network data and the difference network data of a desired hierarchy from the storage unit, reproduces the passage network of the desired hierarchy, and performs a route search from the departure point to the destination; ,
A route search device comprising: The route search device according to claim 1,
A plurality of standard network data stored in the storage unit is prepared in the building, and the difference network data is a difference between a passage network of each layer of the building and one standard network data arbitrarily selected. A route search device characterized by being.