JP2003148983A - Electronic map data, and device for searching route - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a technique for realizing a route search taking the position of a gate way in a facility or the like into account. SOLUTION: Nodes and links are provided in the facility in addition to usual nodes and links. Nodes are also provided in the gate ways for connecting an inside of and an outside of the facility. The optimum route via the optimum gate way is made possible to be searched using those nodes and the links seamlessly, in the route search under the condition where a start point is outside the facility and where the destination is inside the facility.

Description

Detailed Description of the Invention

[0001]

TECHNICAL FIELD The present invention relates to a route search technique using electronic map data.

[0002]

2. Description of the Related Art In recent years, car navigation systems have become widespread, and users can search for a recommended route to a desired destination by setting a current position and a destination. In such a car navigation system, for example, at the time of route guidance to facilities such as airports, train stations, department stores, etc., registered front doors and doorways,
Or we were showing a typical parking lot. If the representative entrance or parking lot was not registered for the facility, the nearest point on the road was guided.

[0003]

However, such facilities are usually provided with a plurality of entrances and exits and parking lots. Therefore, in the conventional technique, the guided entrance / exit among the plurality of entrances / exits may be far from the target point in the facility. For example, when the user wants to go to a store in the facility on the north side of the facility, even if there is an entrance on the north side, the registered south side entrance is guided. The same thing can be said about the parking lot, and even if there is a parking lot near the target point in the facility, there is a case where a representative parking lot at a long distance is guided. When such a route is provided, the user is forced to take a detour and move to the destination, which is a great burden for users who have difficulty walking such as elderly people and wheelchair users. Was there.
Such a problem may occur not only in a navigation system for a vehicle but also in a navigation system for a human being recently proposed.

The present invention has been made in view of the above problems, and an object thereof is to provide a technique for realizing a route search in consideration of the entrance / exit of a facility and the position of a parking lot.

[0005]

[Means for Solving the Problem and Its Action / Effect] The present invention adopts the following constitution in order to solve at least a part of the above problem. That is, a route search device for searching a route, a map data reference unit for referring to electronic map data, a condition input unit for inputting a starting point and a destination in the route search, and a route from the starting point to the destination. A route search unit that searches for a route using the electronic map data is provided, and the electronic map data is data that stores a connection state of a traffic route by a node and a link, and in the node, An in-facility node that represents a point that can be set as a destination in the route search and an ingress / egress node that represents the entry / exit is included in the facility having at least two entrances / exits, and the link includes the in-facility In, including a plurality of in-facility links that give a passage from the entrance node to the in-facility node,
When the input destination or departure point is the in-facility node, the route searching unit searches for a route to the destination including the entrance / exit node and in-facility link.

According to the route search device having such a configuration,
When the starting point and the destination are input from the condition input section, the route searching section searches the route from the starting point to the destination using the electronic map data. The electronic map data has data called a node or a link that stores the connection state of the traffic route. Among these, the node includes an in-facility node that represents a point that can be set as a destination in a route search that exists in a facility that has at least two entrances and exits, and an entrance / exit node that represents an entrance / exit. It includes a plurality of in-facility links that provide a traffic route from the entrance / exit node to the in-facility node in the facility.

[0007] The route search unit determines whether the departure place is outside the facility and the destination is inside the facility, the departure place is inside the facility and the destination is outside the facility, or the departure place and the destination are different from each other. If it's in a facility, along with normal nodes and links,
The route is searched using the nodes and links in the facility. At this time, since the route through the entrance / exit node of the facility is searched, it is possible to guide the user to the optimum entrance / exit.

The departure point may be input manually by the condition input section, or automatically by providing a position detection section or the like capable of detecting the current position using a GPS antenna or the like. It may be done. Such automatic input is particularly effective when the departure place is the present place. In addition, the facility only needs to have at least two entrances and exits, such as department stores, supermarkets,
Various facilities such as airports, stations, movie theaters, etc. can be considered. The well-known Dijkstra method or the like can be used for the route search in the route search unit.

The present invention can also have the following configurations. A route search device for searching a route, wherein a node and a link including a facility node that represents any point in a facility having at least two entrances and exit nodes that represent the entrances and exits are connected to each other by a link A map data reference section that refers to the electronic map data that records the state,
A condition input section for inputting a starting point and a destination in the route search, and when the input destination or starting point is the in-facility node, selects one from the plurality of entrance / exit nodes based on a predetermined criterion. And a route search unit that outputs a route search result to the selected entrance / exit node.

With such a configuration, when the departure point and the destination are input from the condition input section, the route search section and the in-facility node representing any point in the facility having at least two entrances and exits. , The route is searched while referring to the electronic map data in which the connection state of the traffic route is recorded by the node and the link including the gateway node indicating the gateway.
When the input destination or departure point is an in-facility node, the route search unit guides the user to the optimum entrance / exit by selecting one entrance / exit node from a plurality of entrance / exit nodes based on predetermined criteria. can do.
As such criteria, for example, attributes such as slopes, stairs, presence / absence of automatic doors, presence / absence of voice guidance, presence / absence of Braille guidance, wheelchair accessibility, etc. are given to the entrance / exit node and selected according to the walking ability of the user. May be By doing so, it becomes possible to guide the wheelchair user to the entrance / exit node with a slope.

As another criterion, the route searching unit may select the entrance / exit node based on the distance from the departure place or the destination.

With such a configuration, for example, it is possible to guide the doorway having the shortest distance from the departure place. Further, it is possible to guide the entrance / exit with the shortest distance from the destination existing in the facility. The distance may be a straight line distance or may be a path along a route. Also, various values such as the distance of a polygonal line passing through major via points such as bridges and pedestrian bridges can be used.

Further, the route searching unit includes a parametric route searching unit for searching a plurality of routes with the respective entrance / exit nodes as destinations, and a selecting unit for selecting a route judged to be the most advantageous from the plurality of routes. May be provided.

The parametric route search unit selects one entrance / exit node and performs route search with this selected as a destination.
Next, another entrance / exit node is selected and the route search is performed in the same manner. The selecting unit selects one of the routes determined to be the most advantageous among the routes sequentially searched in this way. For example, when the route to each entrance / exit node is calculated using an algorithm such as the Dijkstra method, the route with the smallest cost can be selected. When the cost is set based on the distance, the route having the shortest distance from the departure place is selected. By doing so, the optimal entrance / exit can be guided to the user.

Further, the electronic map data is provided with a storage unit for pre-storing a correspondence relation that gives any one of the plurality of entrance / exit nodes to the in-facility node according to the latitude and the route of the departure place. The route search unit may include a selection unit that selects an entrance / exit node corresponding to the departure place based on the correspondence relationship.

With such a configuration, it is possible to guide the optimum entrance / exit according to the latitude and longitude of the input starting point. For example, if there is a departure point in town A, the entrance / exit A,
If there is a departure place in town B, guidance such as entrance B will be possible easily.

Further, the present invention may have the following configurations. A route search device for searching a route, wherein an in-facility node that represents any point in the facility and an entry / exit node that represents an entrance / exit of the facility and is associated with a transportation means to the facility are recorded. A map data reference section for referring to electronic map data, a condition input section for inputting a starting point and a destination in a route search and a moving means to be used, and a route from the starting point to the destination according to the input moving means. A route search device comprising a route search unit that searches for a route using the electronic map data.

In general, people use transportation means such as wheelchairs (including strollers), automobiles, motorcycles, bicycles, buses and trains in addition to walking. When using these means of transportation to move from outside the facility to inside the facility or from inside the facility to the outside of the facility, avoid the stairs when using a wheelchair, and once when using a car, use the facility once. You will arrive at your destination via a nearby parking lot, a bicycle parking lot when using a motorcycle or bicycle, a bus stop for a bus, and a station for a train. Therefore, in a vast facility or the like having a plurality of entrances and exits, the point of passage differs depending on the means of transportation used, and thus the entrance and exit with high convenience naturally differs. In the present invention, in consideration of these actual conditions, the route search section searches for a route according to the moving means by inputting the departure place and the destination and the moving means to be used from the condition input section. Thereby, the entrance / exit suitable for various transportation means can be guided.

In such a route search device, the route search unit selects at least one of the entrance / exit nodes as a transit point according to the input means of travel, and selects from the departure point to the destination. It is also possible to search for a route to.

Since the entrance / exit node and the moving means are recorded in association with each other in the electronic map data, by doing so, it is possible to easily select the optimum entrance / exit node from the inputted moving means and use it as the transit point. You can

Further, the present invention is electronic map data used for electronic route search and storing the connection state of the traffic route by the node and the link, which exists in a facility having at least two doorways. The electronic map data may be configured by recording an in-facility node that represents a point that can be set as a destination in the route search, and an entrance / exit node that represents the entrance / exit and is associated with the in-facility node.

By using such electronic map data,
In addition to the nodes and links outside the facility, it is possible to search for routes using the nodes inside the facility and the entrance / exit nodes. Therefore, seamless route search using nodes and links outside and inside the facility is possible.

Further, the present invention may be configured as a program for realizing the functions of the above various route search devices. Such a program and the above electronic map data may be recorded in various recording media. As a recording medium, a flexible disk, a CD-ROM, a DVD, an M
O, IC cards, ROM cartridges, hard disks, etc. can be used.

[0024]

BEST MODE FOR CARRYING OUT THE INVENTION Embodiments of the present invention will be described below in the following order with reference to the drawings. A. First embodiment: (A1) Route search device configuration: (A2) Electronic map data configuration: (A3) Route search process: B. Second Embodiment: (B1) Modification 1 of Second Embodiment 1: (B2) Modification 2 of Second Embodiment: C.I. Third Example: D. Fourth embodiment:

A. First Embodiment: (A1) Route Search Device Configuration: FIG. 1 is a schematic configuration diagram of a route search device in the present embodiment. Route search device 100
Is a display unit 101 for displaying maps and menus.
And an operation unit 102, and a control unit 103 inside.
Is equipped with. By the operation, the operation unit 102 can input various commands such as movement of a cursor displayed on the map, change / scroll of the map display scale, starting point of route search, and input of destination.

The command input is not limited to the input by the operation unit 102. When the display unit 101 is a touch-panel type display unit, the display unit 101 may be directly touched and input with a finger or a touch pen 112.

The control unit 103 mainly comprises a CPU and RA.
It is composed of M and ROM (not shown). ROM
A program for realizing each illustrated functional unit is recorded in the CPU, and the CPU uses the RAM as a work area to execute the program.

The electronic map data input section 104 inputs electronic map data from various recording media such as a memory card, CD-ROM, DVD and the like. Alternatively, the data may be input from an external server by using a GPS antenna, a wireless network, infrared communication, or the like.

The electronic map data input by the electronic map data input unit 104 is stored in the electronic map data storage unit 105. The stored electronic map data is referred to by the main control unit 107 via the electronic map data reference unit 106. When the medium on which the electronic map data is recorded is directly referred to by the electronic map data reference unit 106, the electronic map data storage unit 105 may be omitted.

The main control section 107 has a command input section 108.
A route search is performed using the route search unit 109 in accordance with various commands input from the operation unit 102 via the. The starting point in the route search may be input by the position detection unit 110. In this case, the current position can be input by various wireless means such as a GPS antenna or infrared communication. The route search unit 109 searches for a route using, for example, the Dijkstra method, which is a well-known route search algorithm.

The result of the route search performed by the main control unit 107 and the route search unit 109 is displayed on the display unit 101 by the display control unit 111. The user can reach a desired destination by using the search result displayed on the display unit 101.

(A2) Electronic map data structure: Next, the electronic map data input by the route search device 100 using the electronic map data input unit 104 will be described. FIG. 2 is a diagram showing a schematic configuration of electronic map data. The electronic map data mainly includes display data for displaying on the display unit 101 and search data for searching a route by the control unit 103. The display data represents in detail graphics such as traffic routes and facilities based on the latitude / longitude information. A series of figure numbers is assigned to the figure, and the figure is displayed as polygon data based on the latitude and longitude information.
The search data holds a node table and a link table, and the nodes and links recorded in the respective tables represent the connection state of the traffic route. A node is data representing an intersection between traffic roads, an end point of a traffic road, and the like, and a series of node numbers are given, and the position is set by latitude and longitude. In addition, attribution information indicating the node type indicating the type of node and, if the node is included in a facility or the like, belonging information indicating which facility is included. As the node type, for example, there are types such as intersections, entrances, and exits. As the attribution information, a facility name such as a department store B or a facility A and an identifier indicating the facility are set. On the other hand, a link is data representing a traffic route, and its start point and end point are designated by the node numbers. Also, the link type that represents the type of link,
When the link is included in a facility or the like, attribution information indicating which facility is included is set. In addition, the link cost set based on information such as the length and width of the passage, whether it is a slope or stairs, the presence or absence of automatic doors, and whether wheelchairs can be passed is recorded. The link cost is a parameter indicating the ease of selecting a link at the time of route search, and the smaller the value, the easier the link is to be selected.

FIG. 3 is a diagram showing an example of the display data. As shown in the figure, the electronic map data according to the present embodiment also represents the structure inside the facility. Figure 4
[Fig. 4] is a diagram showing search data corresponding to the display data of Fig. 3. Similar to the display data, in the search data, the connection state of the passages in the facility is represented by nodes and links. In this figure, the entrance / exit node indicating the entrance / exit of the facility is indicated by a square mark “□”, and the in-facility node indicating the store in the facility is indicated by a star mark “★”. In addition, a node representing an intersection is indicated by a circle mark “●”. The line segment connecting each node represents a link.

(A3) Route search process: FIG. 5 is a flowchart of the route search process using the electronic map data. First, the route search device 100 receives an input of a destination from the user via the operation unit 102 (step S1).
0). Various methods can be considered for inputting the destination, such as selecting from a menu. For example, when an arbitrary point on the map displayed on the display unit 101 is input by touching the touch pen 112 or the like, the node or link closest to the input point is set as the destination. Next, the route search device 100 acquires the current position from the position detection unit 110 and sets the node or link closest to the acquired current position as the departure point (step S11). Next, the route search device 100 determines whether the destination is inside a specific facility and the departure place is outside the facility (step S12). This judgment is made by referring to the attribution parameters shown in FIG. This is because when the destination exists in the facility, the facility name and the identifier are set in the attribution parameter. If nothing is specifically set for the attribution parameter, it indicates that the node or link is outside the facility. As a result of the determination, if both the destination and the departure place satisfy the above condition, the user is further requested to select whether to search for a route including a traffic route inside the facility (step S13). As a result of the inquiry, if it is selected that the facility is not included, a normal route search (step S14) is performed. The normal search is a search by a conventional technique such as performing a route search with a node outside the facility closest to the facility including the destination as a virtual destination. In addition, in step S12, when the destination and the departure point are both outside the facility, a normal search is similarly performed. The description is returned to step S13, and if there is a selection to search the route including the inside of the facility, the route is searched including the node inside the facility and the entrance / exit node (step S15). Finally, the route search device 100
The route searched by the steps S14 and S15 is displayed on the display unit to guide the route (step S16), and the process ends. The steps S14 and S1
The route search in 5 can be performed using the Dijkstra method, which is a well-known route search algorithm.

As described above, by using the in-facility node, the in-facility link, and the entrance / exit node recorded in the electronic map data, even when the destination is in the facility, the same route search as in the normal outside facility is performed. A route search can be performed seamlessly using an algorithm. Since the route searched by the route search process includes an entrance / exit node as a transit point, the user can clearly know which entrance / exit is used to efficiently reach the destination in the facility. In the above description, the route search when the departure place is outside the facility and the destination is inside the facility has been described. However, in the route search with the departure place inside the facility and the destination outside the facility, the determination in step S12 is also performed. With such a change, the route can be searched by the same process. In this case, the determination in step S13 may be omitted. In addition, a route in the case where the departure place and the destination exist in different facilities can be easily performed by searching for the entrance / exit nodes of both facilities.

In the route search process, the normal route search is performed when the guidance for the facility is not selected in step S13, but the route search in step S15 may be performed. In this case, in step S16, the route to the doorway may be displayed, and the route inside the facility may not be displayed.

B. Second Example: In a second example, a technique for guiding a user to an optimum route using electronic map data in which detailed nodes and links in the facility are not set will be described. However, it is assumed that the electronic map data includes a facility representative node representing a representative point of the facility and an entrance / exit node. 6 and 7 show display data and search data represented by such electronic map data. As shown in FIG. 7, the facility representative node is represented by a star mark “★”, and the entrance / exit node is represented by a square mark “□”. Ordinary intersection nodes are indicated by a circle mark "●". Note that, also in the present embodiment, the hardware configuration of the route search device may be the same as that of the first embodiment.

FIG. 8 is a flow chart of a route search process using the electronic map data. First, the route search device 100 inputs a destination and sets a departure point in the same manner as steps S10 and S11 in FIG. 5 (step S20). Next, it is determined whether the input destination is a specific facility representative node (step S21). This determination is made based on whether or not the attribution parameter of the node set as the destination has a setting representing the representative node of the specific facility. If it is not the facility representative node, a normal route search is performed (step S22). If it is the facility representative node, the entrance / exit node associated with the facility is extracted (step S23). This extraction process may refer to the attribution parameter of the node having the “entrance / exit” type to detect whether or not the information indicating the destination facility is recorded. Further, when the facility representative node and the entrance / exit node are connected by a link, it can be extracted by detecting the entrance / exit node connected to the destination facility representative node from the link table. Next, the route search device 100
The straight line distance from the departure place is calculated for all the extracted entrance / exit nodes (step S24). The distance is calculated based on the latitude and longitude information held by each node. Then, the route search device 100 sets the gateway node having the shortest calculated distance as a virtual destination (step S25). Finally, the route search device 100 searches for a route to the set virtual destination (step S2
6) Then, the searched route is displayed on the display unit 101 to guide the route (step S27), and the process ends.

By such processing, it is possible to guide the route from the place of departure to the doorway which is the shortest distance in a straight line distance. The distance from the departure point to the entrance / exit is determined by a simple calculation of the straight line distance.
The load on 0 can be reduced.

(B1) Modification 1 of Second Embodiment: In the above route search processing, the destination entrance / exit is selected by a calculation based on a simple straight line distance. However, in reality, the entrance / exit thus selected. It may be necessary to make a detour without a suitable road to reach. FIG. 9 is a diagram showing such a situation. In this figure, there is a national road between the starting point and the facility which is the destination, and there is no choice but to pass either pedestrian bridge A or pedestrian bridge B to the facility. When the straight line distance from the departure place to the entrance A and the entrance B is calculated, it is clear from the figure that the distance to the entrance B is short. Therefore, according to the above route search processing,
This entrance B will be guided. However, in reality, the route to the entrance / exit B must pass through the pedestrian bridge B at a remote place, and the entire route is longer than the use of the entrance / exit A on the contrary. In order to avoid such a situation, the selection of the entrance / exit based on the straight line distance performed in steps S24 and S25 may be the selection of the entrance / exit based on the Dijkstra method. In this case, the route search device 100 first selects one entrance and exits, and performs a route search by the Dijkstra method using this as a destination. Next, another gateway is selected and the route search is performed in the same manner. The route search device 100 selects the route with the lowest cost from the routes that have been sequentially searched for to the respective entrance / exit nodes in this way. By doing so, it is possible to guide the user to the optimal entrance / exit for reaching the destination.
When the cost is set based on the distance, the route with the shortest distance from the departure place is selected. However, since the load on the route search device 100 is increased as compared with the simple calculation of the straight line distance, the processing may take time. Therefore, it is preferable that which method is used to search the route is flexibly used according to the situation as a setting item of the user.

(B2) Modified Example 2 of Second Embodiment: In addition to the above, as means for guiding an optimum entrance / exit, by guiding a path to an entrance / exit preset according to the latitude / longitude of the departure place. Good. Next, an example of the means will be described. FIG. 10 is a simplified view of a city map centering on facilities. As you can see, here is the city map,
It was divided into two areas, an area A within a dotted line and an area B within a chain line. These sections are associated with the entrance A and the entrance B, respectively, and data defining such a correspondence relationship is recorded in advance in the electronic map data. For this association, the entrances and exits that are considered to be easier to reach may be assigned to each departure place in consideration of the passage around the facility. Then, instead of steps S23, S24, and S25, a step of selecting a preset gateway as a virtual destination based on the latitude / longitude information of the departure place is added. By doing so, it is possible to search for a route to the entrance A when the departure place is in the area A and to the entrance B when the departure place is in the area B.

C. Third Example: In a third example, a technique of replacing a destination to be guided by a user's moving means will be described. In the electronic map data in this embodiment, a parking lot node is recorded in addition to a normal node and a link. In addition, a facility representative node representing a representative point in the facility and an entrance / exit node representing the entrance / exit are also recorded. 11 and 12 are views showing display data and search data of such electronic map data.
As shown in FIG. 12, the electronic map data of this embodiment includes
A parking lot node “◆”, a facility representative node “★”, and an entrance / exit node “□” are set. The hardware configuration of the route search device in this embodiment is similar to that of the route search device in the first embodiment.

FIG. 13 is a flowchart of a route search process using such electronic map data. First, the route search device 100 receives an input of a destination and a moving means from a user via the operation unit 102, and also the position detection unit 1
The current position is acquired from 10 and the departure place is set (step S30). Next, the route search device 100 determines whether the destination is a facility (step S31), and if it is not a facility, performs a normal route search (step S32). If the destination is a facility, the destination is replaced depending on whether the means of transportation is a car or a walk. In the case of a car, the destination is replaced with a parking lot located near the facility node (steps S33, S3).
4) If walking, replace the destination with the entrance / exit associated with the facility node (steps S35, S3).
6). Finally, the route search device 100 searches for a route to the replaced destination (step S37), and displays the route on the display unit 101 to guide the searched route (step S38). In addition, in steps S33 and S34, when the means of transportation is neither a car nor a walk, a normal route search is performed in step S32.

Thus, by replacing the destination with a parking lot or a doorway according to the means of transportation, it is possible to guide the optimum route. The replacement of the destination with the parking lot node in step S34 may be replaced with a parking lot located at a certain distance from the facility, or a predetermined parking lot is selected from a table in which the facility and the parking lot are associated with each other in advance. It may be replaced with. When there are a plurality of parking lots, the parking lot may be replaced with a parking lot selected based on the distance from the departure place or the destination. Further, the replacement of the entrance / exit in step S36 may be carried out by selecting and replacing one entrance / exit from a plurality of entrances / exits by various means similar to those in the second embodiment.

D. Fourth Embodiment: Next, an example in which a route is searched for according to the means of travel will be described. When moving from a place of departure to a destination, usually, a person uses a means of transportation such as a car, a bicycle, a motorcycle, a train, and a wheelchair in addition to walking. When using these means of transportation to move to the facility, they are moved via parking lots, bicycle parking lots, stations, slopes, etc., respectively. FIG. 14 is a diagram showing waypoints corresponding to various transportation means. In this figure, bus stops, parking lots, and stations are shown. Since these waypoints do not normally exist at the same point as shown in the figure, if the destination has a facility having a plurality of entrances and exits, the entrances and exits to be used also differ. For example, when using a car, there is an entrance A for going through a parking lot, when using a bus, there is an exit B for going through a bus stop, and when using a train, there is an exit C for going through a station. It is the best entrance and exit.

In this way, when performing a route search using various moving means, the route search unit 10 of the route search device 100.
9 sets a waypoint according to the means of transportation and searches the entire route. In order to set a waypoint according to the means of transportation, first, of the node data recorded in the electronic map data, move to a node that is set as "entrance / exit" as the node type, such as "car" or "train". Information indicating the means is associated in advance. Then, when receiving the input of the destination from the user, the input of the transportation means to be used is also received. By doing so, the route searching unit 109 can select an entrance / exit associated with the input transportation means from the electronic map data and set it as a transit point. After that, by searching the entire route by using the node / link data inside and outside the facility and the entrance / exit node set as the transit point, it is possible to guide the user to the optimal route according to the transportation means.

In the above description, an example in which a route from outside the facility to the inside of the facility is searched has been shown, but a route from the inside of the facility to the outside of the facility can be similarly performed. Further, even if the starting point and the destination are in different facilities, it is possible to search for the optimum route by setting the waypoints according to the moving means used. In addition, by preparing node data having attributes such as a parking lot, a bus stop, a station, and a slope, these points may be automatically set as the second waypoints according to the transportation means.

Although the embodiments of the present invention have been described above, the present invention is not limited to these embodiments.
Various configurations can be adopted without departing from the spirit of the invention. Further, in the above description, the processing performed using hardware may be performed using software.

[Brief description of drawings]

FIG. 1 is a schematic configuration diagram of a route search device.

FIG. 2 is a diagram showing a schematic configuration of electronic map data.

FIG. 3 is a diagram showing an example of display data.

FIG. 4 is a diagram showing search data.

FIG. 5 is a flowchart of a route search process.

FIG. 6 is a diagram showing display data in the second embodiment.

FIG. 7 is a diagram showing search data in the second embodiment.

FIG. 8 is a flowchart of a route search process in the second embodiment.

FIG. 9 is a diagram showing a situation in which a proper road does not exist and a detour is required to reach the entrance from the departure place.

FIG. 10 is a simplified view of a city map centering on facilities.

FIG. 11 is a diagram showing display data in the third embodiment.

FIG. 12 is a diagram showing search data in the third embodiment.

FIG. 13 is a flowchart of a route search process in the third embodiment.

FIG. 14 is a diagram showing waypoints according to various transportation means.

[Explanation of symbols]

100 ... Route search device 101 ... Display unit 102 ... Operation unit 103 ... Control unit 104 ... Electronic map data input section 105 ... Electronic map data storage unit 106 ... Electronic map data reference section 107 ... Main control unit 108 ... Command input section 109 ... Route search unit 110 ... Position detection unit 111 ... Display control unit 112 ... Touch pen

   ─────────────────────────────────────────────────── ─── Continued front page    (72) Inventor Yuji Torisu             1-1 Shimoiritsu, Kokurakita-ku, Kitakyushu City, Fukuoka Prefecture             No. 10 Zenrin Co., Ltd. (72) Inventor, Shuichi Ichihara             1-1 Shimoiritsu, Kokurakita-ku, Kitakyushu City, Fukuoka Prefecture             No. 10 Zenrin Co., Ltd. (72) Inventor Koji Hino             1-1 Shimoiritsu, Kokurakita-ku, Kitakyushu City, Fukuoka Prefecture             No. 10 Zenrin Co., Ltd. (72) Inventor Mamoru Okumura             1-1 Shimoiritsu, Kokurakita-ku, Kitakyushu City, Fukuoka Prefecture             No. 10 Zenrin Co., Ltd. F term (reference) 2C032 HB02 HB05 HB22 HB23 HB24                       HC08 HD16                 2F029 AA02 AA07 AB07 AB13 AC02                       AC09 AC14 AC16                 5B075 KK03 KK07 ND04 ND06 ND35                       UU14 UU16                 5H180 AA01 AA21 BB02 BB05 BB12                       BB13 CC12 FF05 FF13 FF22                       FF27 FF35

Claims (13)

[Claims] 1. A route search device for searching a route, comprising a map data reference unit for referring to electronic map data, a condition input unit for inputting a departure place and a destination in the route search, and a destination from the destination. A route search unit that searches for a route to a ground using the electronic map data, wherein the electronic map data is data that stores a connection state of a traffic route by nodes and links; Includes an in-facility node that exists in a facility having at least two gateways and that can be set as a destination in the route search, and an gateway node that represents the gateway, and the link includes In the facility, a plurality of in-facility links that provide a traffic route from the entrance / exit node to the in-facility node are included, and the route search unit inputs the input. If target locations or departure point is the facility within a node, including the entrance nodes and facility links, route search device for searching for a route to The destination. 2. A route search device for searching for a route, the node including an in-facility node representing any point in a facility having at least two entrances and exits, and a node including an entrance / exit node representing the entrance / exit. The map data reference section that refers to the electronic map data that records the connection state of the traffic route, the condition input section that inputs the starting point and the destination in the route search, the input destination or the starting point is the in-facility node And a route search unit that selects one of the plurality of gateway nodes based on a predetermined criterion and outputs a route search result to the selected gateway node. 3. The route search device according to claim 2, wherein the route search unit selects the entrance / exit node based on a distance from the departure place or the destination. 4. The route search device according to claim 2, wherein the route search unit includes a parametric route search unit that searches for a plurality of routes with the respective entrance / exit nodes as destinations, and A route search device comprising: a selection unit that selects a route that is determined to be most advantageous. 5. The route search device according to claim 2, wherein the electronic map data is one of the plurality of entrance / exit nodes according to the latitude and longitude of the departure place with respect to the in-facility node. A route search device comprising: a storage unit that stores in advance a correspondence relation that gives a route, and the route search unit includes a selection unit that selects an entrance / exit node corresponding to the departure place based on the correspondence relation. 6. A route search device for searching a route, wherein a facility node that represents any point within the facility, a gateway of the facility, and a gateway that is associated with a transportation means to the facility. A map data reference unit that refers to electronic map data that records nodes, a condition input unit that inputs a departure place and a destination in a route search, and a travel means to be used, and the departure place according to the entered travel means. A route search device comprising: a route search unit that searches a route from a destination to a destination using the electronic map data. 7. The route search device according to claim 6, wherein the route search unit is configured to respond to the input travel means.
A search route search device that selects at least one of the entrance / exit nodes as a waypoint and searches for a route from the departure point to the destination. 8. A program for causing a computer to perform route search processing, comprising a map data reference function for referring to electronic map data, a condition input function for inputting a starting point and a destination in a route search, and the starting point. A route search function for searching a route from a place to a destination using the electronic map data is provided, and the electronic map data is data that stores a connection state of a traffic route by nodes and links. The node includes an in-facility node that exists in a facility having at least two gateways and that can be set as a destination in the route search, and an entrance / exit node that represents the gateway. Contains a plurality of in-facility links that provide a path from the entrance / exit node to the in-facility node within the facility. Program said route searching function, when the destination or departure point and the input is the facility within a node, which including the entrance nodes and facility links, searches for a route to The destination. 9. A program for causing a computer to implement route search processing, comprising: an in-facility node representing any point in a facility having at least two entrances and exits; and an entrance / exit node representing the entrance / exit. A map data reference function that refers to electronic map data that records the connection state of traffic routes by nodes and links, a condition input function that inputs a departure place and a destination in a route search, and the input destination or the departure place is the In the case of an in-facility node, a program including a route search function that selects one of the plurality of entrance / exit nodes based on a predetermined criterion and outputs a route search result to the selected entrance / exit node. 10. A program for causing a computer to realize a route search process, comprising: an in-facility node that represents any point within the facility, an entrance / exit of the facility, and a means of moving to the facility. The map data reference function that refers to the electronic map data that records the entered / exited node, the condition input function that inputs the starting point and the destination in the route search, and the transportation means to be used, and the inputting means according to the input transportation means. And a route search function for searching a route from the starting point to the destination using the electronic map data. 11. A computer-readable recording medium in which the program according to any one of claims 8 to 10 is recorded. 12. Electronic map data which is used for electronic route search and which stores a connection state of a traffic route by nodes and links, which exists in a facility having at least two entrances and exits, and the route search is performed. The electronic map data recording the in-facility node that represents a point that can be set as a destination, and the entry / exit node that represents the entrance / exit and is associated with the in-facility node. 13. A computer-readable recording medium in which the electronic map data according to claim 12 is recorded.