JP2010249836A - Route search device, program, electronic map data, and recording medium - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a technique that achieves a route search in which the position of a doorway or the like of a facility is considered. <P>SOLUTION: In addition to usual nodes and links, a node and link are assigned also to the inside of the facility. Moreover, a node is also assigned to the doorway which connects the inside of the facility and the outside. In a route search in which a departure point is outside the facility, and a destination is inside the facility, a route going through the optimal doorway is searched by seamlessly using these nodes and links. <P>COPYRIGHT: (C)2011,JPO&INPIT

Description

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

  In recent years, car navigation systems have become widespread, and a user 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 an airport, a station, a department store, etc., each registered front entrance, entrance, or representative parking lot is guided. When a representative entrance / exit or parking lot was not registered for the facility, the closest point on the road was informed.

  However, such facilities are usually provided with a plurality of entrances and parking lots. For this reason, in the conventional technology, among the plurality of entrances, the guided entrance may be far from the target point in the facility. For example, when a user wants to go to a store in a facility on the north side of the facility, even if there is actually an entrance on the north side, the registered south side entrance is guided. The same can be said for the parking lot, and even if there is a parking lot close to the target point in the facility, a representative parking lot at a long distance may be guided. When such a route is guided, the user is forced to make a detour and move to the destination, which is a heavy burden for users who have difficulty walking such as elderly people and wheelchair users. It was. Such a problem can occur not only in a car navigation system but also in a recently proposed human navigation system.

  This invention is made | formed in view of such a subject, and provides the technique which implement | achieves the route search which considered the position of the entrance / exit of a facility, or the parking lot.

The present invention employs the following configuration in order to solve at least a part of the above problems. That is,
A route search device for searching a route,
A map data reference section for referring to electronic map data;
A condition input unit for inputting a starting point and a destination in route search;
A route search unit that searches for a route from the departure place to the destination using the electronic map data,
The electronic map data is
It is data that stores the connection state of the traffic path by node and link,
The nodes include an in-facility node that represents a point that exists in a facility having at least two or more entrances and can be set as a destination in the route search, and an entrance node that represents the entrance and exit,
The link includes a plurality of in-facility links that provide a passage from the entrance node to the in-facility node in the facility,
The route search unit, when the input destination or departure point is the in-facility node, searches for a route to the destination including the entrance / exit node and the in-facility link.

  According to the route search device having such a configuration, when a departure point and a destination are input from the condition input unit, the route search unit searches for a route from the departure point to the destination using the electronic map data. The electronic map data has data called nodes and links that store the connection state of the traffic path. Among these, the node includes an in-facility node that represents a point that exists in a facility having at least two or more entrances and can be set as a destination in route search, and an entrance node that represents an entrance and exit. In the facility, a plurality of in-facility links that provide a passage from the entrance node to the in-facility node are included.

  The route search unit is used when the departure point is outside the facility and the destination is within the facility, when the departure point is within the facility and the destination is outside the facility, or when the departure point and the destination are in different facilities. In the case of the above, the route search is performed using the nodes and links in the facility together with the normal nodes and links. At this time, since the route through the entrance / exit node of the facility is searched, the optimum entrance / exit can be guided to the user.

  The starting point input by the condition input unit may be performed manually, or may be automatically input by providing a position detection unit capable of detecting the current position using a GPS antenna or the like. Also good. Such automatic input is particularly effective when the departure location is the current location. In addition, the facility only needs to have at least two or more entrances, and various facilities such as a department store, a supermarket, an airport, a station, and a movie theater can be considered. For the route search in the route search unit, a known Dijkstra method or the like can be used.

Further, the present invention can be configured as follows.
A route search device for searching a route,
Map data that refers to electronic map data in which the connection state of a traffic route is recorded by a link and a node including an in-facility node representing any point in the facility having at least two or more entrances and an entrance node representing the entrance / exit A reference section;
A condition input unit for inputting a starting point and a destination in route search;
When the input destination or departure point is the in-facility node, one is selected from the plurality of gateway nodes based on a predetermined criterion, and a route search result to the selected gateway node is output. A route search unit;
A route search device comprising:

  According to such a configuration, when the departure point and the destination are input from the condition input unit, the route search unit includes the in-facility node representing any point in the facility having at least two or more entrances, and the entrance / exit The route is searched while referring to electronic map data in which the connection state of the passage is recorded by a node and a link including the entry / exit node to be represented. 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 a predetermined criterion. can do. Such criteria include, for example, having attributes such as slope, stairs, automatic doors, voice guidance, braille guidance, wheelchair access, etc. in the entrance / exit node and selected according to the user's walking ability It is good. By doing so, it becomes possible for wheelchair users to guide the entrance node with a slope.

  As another criterion, the route search unit may select the entry / exit node based on a distance from the departure point or destination.

  With such a configuration, for example, it is possible to guide an entrance with the shortest distance from the departure place. It is also possible to guide the doorway with the shortest distance from the destination existing in the facility. The distance may be a linear distance or a path along the route. In addition, various values such as the distance of a broken line passing through main via points such as a bridge and a footbridge can be used.

In addition, the route search unit
A parametric route search unit for searching for a plurality of routes with the respective gateway nodes as destinations;
And a selection unit that selects a route determined to be most advantageous from the plurality of routes.

  The parametric route search unit selects one entry / exit node and performs route search using this as a destination. Next, another entrance / exit node is selected, and a route search is performed in the same manner. The selection unit selects one route determined to be the most advantageous from the routes that have been sequentially searched in this way. For example, when the route to each gateway node is calculated using an algorithm such as the Dijkstra method, the route with the lowest cost can be selected. When the cost is set based on the distance, the route with the shortest distance from the departure point is selected. In this way, the optimum entrance / exit can be guided to the user.

The electronic map data is
A storage unit that stores in advance a correspondence relationship that gives any one of the plurality of entrance / exit nodes according to the latitude and route of the departure point for the in-facility node,
The route search unit
You may provide the selection part which selects the entrance / exit node corresponding to the said departure place based on the said correspondence.

  With such a configuration, an optimum entrance / exit can be guided according to the latitude and longitude of the input departure place. For example, guidance such as gateway A when there is a departure place in town A and gateway B when there is a departure place in town B can be easily performed.

Further, the present invention can be configured as follows.
A route search device for searching a route,
A map data reference unit that refers to electronic map data that records an in-facility node representing any point in the facility, and an entrance / exit node that represents an entrance / exit of the facility and is associated with a moving means to the facility;
A condition input unit for inputting a starting point and a destination in route search and a moving means to be used;
A route search unit for searching for a route from the departure place to the destination using the electronic map data according to the input moving means;
A route search device comprising:

  In general, people use wheelchairs (including baby strollers), moving means such as automobiles, motorcycles, bicycles, buses, and trains in addition to walking. When moving from outside the facility to the inside of the facility, or from the inside of the facility to the outside of the facility using these means of transportation, avoid the stairs when using the wheelchair, and once use the car, use the slope. You will reach your destination via a nearby parking lot, a bicycle parking lot when using bikes and bicycles, a bus stop for buses, and a station for trains. Therefore, in a vast facility having a plurality of entrances and exits, the points through which the route passes differ depending on the moving means to be used. In the present invention, in consideration of these actual conditions, the route search unit searches for a route according to the moving unit by inputting the starting point and the destination and the moving unit to be used from the condition input unit. Thereby, the entrance / exit suitable for various moving means can be guided.

  In such a route search device, the route search unit selects at least one entry / exit node among the entry / exit nodes as a transit point according to the input moving means, and routes from the departure point to the destination It is good also as searching for.

  In the electronic map data, the entry / exit node and the moving means are recorded in association with each other, so that the optimum entry / exit node can be easily selected from the inputted moving means as a transit point.

The present invention also provides:
Electronic map data that is used for electronic route search and that stores the connection state of the route by nodes and links,
An in-facility node representing a point that exists in a facility having at least two or more entrances and can be set as a destination in the route search;
An entrance / exit node representing the entrance / exit and associated with the in-facility node;
It can also be configured as electronic map data in which is recorded.

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

  Moreover, you may comprise this invention as a program for implement | achieving the function of the above-mentioned various route search apparatus. Such a program and the above-mentioned electronic map data may be recorded on various recording media. As the recording medium, a flexible disk, a CD-ROM, a DVD, an MO, an IC card, a ROM cartridge, a hard disk, and the like can be used.

It is a schematic block diagram of a route search apparatus. It is a figure which shows schematic structure of electronic map data. It is a figure which shows an example of the data for a display. It is a figure showing the data for a search. It is a flowchart of a route search process. It is a figure showing the data for a display in 2nd Example. It is a figure showing the data for a search in 2nd Example. It is a flowchart of the route search process in 2nd Example. It is a figure showing the situation where a suitable road does not exist and must detour in order to reach an entrance / exit from a departure place. It is the figure which expressed the city map centering on the facility in a simplified manner. It is a figure showing the data for a display in 3rd Example. It is a figure showing the data for a search in 3rd Example. It is a flowchart of the route search process in 3rd Example. It is a figure which shows the waypoint according to various moving means.

Hereinafter, embodiments of the present invention will be described in the following order with reference to the drawings.
A. First embodiment:
(A1) Route search device configuration:
(A2) Electronic map data structure:
(A3) Route search process:
B. Second embodiment:
(B1) Modification 1 of the second embodiment
(B2) Modification 2 of the second embodiment:
C. Third embodiment:
D. Fourth embodiment:

A. First embodiment:
(A1) Route search device configuration:
FIG. 1 is a schematic configuration diagram of a route search apparatus according to the present embodiment. The route search apparatus 100 includes a display unit 101 and an operation unit 102 for displaying a map, a menu, and the like, and includes a control unit 103 therein. The operation unit 102 can input various commands such as moving the cursor displayed on the map, changing / scrolling the map display scale, starting a route search, inputting a destination, and the like by the operation.

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

  The control unit 103 is mainly configured by a CPU, a RAM, and a ROM (not shown). The ROM stores a program for realizing each functional unit shown in the figure, and the CPU executes the program using the RAM as a work area.

  The electronic map data input unit 104 inputs electronic map data from various recording media such as a memory card, a CD-ROM, and a DVD. Moreover, you may input from an external server etc. by using a GPS antenna, a wireless network, infrared communication, etc.

  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 from the main control unit 107 via the electronic map data reference unit 106. Note that when the electronic map data reference unit 106 directly refers to the medium on which the electronic map data is recorded, the electronic map data storage unit 105 may be omitted.

  The main control unit 107 performs a route search using the route search unit 109 according to various commands input from the operation unit 102 via the command input unit 108. 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 and infrared communication. The route search unit 109 searches for a route using, for example, a Dijkstra method that 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 the desired destination using the search result displayed on the display unit 101.

(A2) Electronic map data structure:
Next, electronic map data input by the route search device 100 through 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 for a route by the control unit 103. The display data represents in detail graphics such as traffic paths and facilities based on latitude / longitude information. A series of figure numbers is assigned to the figure, and the figure is displayed as polygon data based on latitude and longitude information. The search data holds a node table and a link table, and represents the connection state of the traffic path by the nodes and links recorded in the respective tables. Nodes are data representing intersections between roads, end points of roads, and the like, a series of node numbers are given, and their positions are set by latitude and longitude. In addition, a node type indicating the type of the node, and attribution information indicating which facility is included when the node is included in the facility or the like are set. As the node type, for example, there are types such as an intersection, an entrance / exit, and an end point. As the attribution information, a facility name such as department store B or facility A, an identifier indicating the facility, or the like is 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 number. Also, a link type indicating the type of link, and attribution information indicating which facility is included when the link is included in a facility or the like are set. In addition, the link cost set based on information such as the length and width of the roadway, whether it is a slope or stairs, the presence or absence of an automatic door, the availability of wheelchair traffic, etc. is recorded. The link cost is a parameter indicating the ease with which a link can be selected during route search. The smaller the value, the easier the link is selected.

  FIG. 3 is a diagram illustrating an example of the display data. As shown in the drawing, the electronic map data in the present embodiment also forms a graphic of the structure in the facility. FIG. 4 is a diagram showing search data corresponding to the display data of FIG. Similar to the display data, in the search data, the connection state of the traffic paths 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 a store in the facility is indicated by a star mark “★”. A node representing an intersection is indicated by a circle mark “●”. A line segment connecting each node represents a link.

(A3) Route search process:
FIG. 5 is a flowchart of route search processing using the electronic map data. First, the route search apparatus 100 receives a destination input from the user via the operation unit 102 (step S10). There are various methods 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 exists in a specific facility and whether the departure location exists outside the facility (step S12). This determination is made by referring to the attribution parameter shown in FIG. This is because when the destination exists in the facility, the facility name and identifier are set in the attribution parameter. If nothing is set in the attribution parameter, it indicates a node or link outside the facility. As a result of the determination, if both the destination and the departure point satisfy the above conditions, the user is further requested to select whether or not to search for a route including the internal route of the facility (step S13). As a result of the inquiry, if there is a selection not to include the inside of the facility, a normal route search (step S14) is performed. The normal search is a search by a conventional technique such as a route search using a node outside the facility closest to the facility including the destination as a virtual destination. In step S12, a normal search is similarly performed when both the destination and the departure point are outside the facility. Returning to step S13, if there is a selection to search for the route including the inside of the facility, the route is searched for including the node and the entrance / exit node in the facility (step S15). Finally, the route search device 100 guides the route by displaying the route searched in step S14 or S15 on the display unit (step S16), and ends the process. The route search in step S14 or step S15 can be performed using the Dijkstra method, which is a well-known route search algorithm.

  In this way, by using the in-facility node, the in-facility link, and the entrance / exit node recorded in the electronic map data, even if the destination is in the facility, the same algorithm as the route search outside the facility is used. Route search can be performed seamlessly. 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 reach the destination in the facility efficiently. In the above description, the route search in the case where the departure point is outside the facility and the destination is in the facility has been described. However, in the route search in which the departure point is inside the facility and the destination is outside the facility, the determination in step S12 is performed. Such a change can be made and a route can be searched for by the same processing. 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 including the entrance / exit nodes of both facilities.

  In the above route search processing, the normal route search is performed when the selection without guidance in the facility is performed in step S13. However, the route search in step S15 may be performed. In this case, in step S16, the route to the entrance / exit may be displayed and the route in the facility may not be displayed.

B. Second embodiment:
In the second embodiment, a technique for guiding an optimum route to a user using electronic map data in which detailed nodes and links in the facility are not set will be described. However, the electronic map data includes a facility representative node representing a facility representative point and an entrance / exit node. 6 and 7 are 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 “□”. A normal intersection node is represented by a circle mark “●”. Also in this embodiment, the hardware configuration of the route search apparatus can be the same as that in the first embodiment.

  FIG. 8 is a flowchart of route search processing using the electronic map data. First, the route search apparatus 100 inputs a destination and sets a departure place in the same manner as steps S10 and S11 in FIG. 5 (step S20). Next, it is determined whether or not the input destination is a specific facility representative node (step S21). This determination is made based on whether there is a setting representing the representative node of a specific facility in the attribution parameter of the node set as the destination. If it is not a facility representative node, a normal route search is performed (step S22). If it is a facility representative node, an entry / exit node associated with the facility is extracted (step S23). This extraction process may be performed by referring to the attribution parameter of the node having the “entrance / exit” type and detecting whether or not information indicating the facility as the destination is recorded. In addition, 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 facility representative node as the destination from the link table. Next, the route search device 100 calculates the straight line distance from the departure point for all the extracted entrance / exit nodes (step S24). The distance is calculated based on the latitude and longitude information held by each node. Subsequently, the route search apparatus 100 sets the gateway node with 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 S26), and guides the route by displaying the searched route on the display unit 101 (step S27). Exit.

  By such processing, it is possible to guide the route from the departure point to the entrance / exit at the shortest distance in a straight line distance. Since the distance from the departure place to the entrance is determined by a simple straight line calculation, the load on the route search device 100 can be reduced.

(B1) Modification 1 of the second embodiment
In the above route search processing, the gateway as the destination is selected by a calculation based on a simple straight line distance. However, in practice, there is no suitable road to reach the gateway selected in this way, and it is necessary to make a detour. It may be necessary. FIG. 9 is a diagram showing such a situation. This figure shows a situation in which a national road exists between the departure point and the destination facility, and either the pedestrian bridge A or the pedestrian bridge B must be passed to the facility. It is clear from the figure that the distance to the entrance / exit B is short when the straight distances from the departure point to the entrance / exit A / B are calculated. Therefore, according to the route search process, the entrance / exit B is guided. However, in practice, the route to the entrance / exit B must pass through the pedestrian bridge B at a distance, and the entire route becomes longer than using the entrance / exit A. In order to avoid such a situation, the entrance / exit selection based on the linear distance performed in steps S24 and S25 may be the entrance / exit selection based on the Dijkstra method. In this case, the route search apparatus 100 first selects one entrance and performs a route search by the Dijkstra method using this as a destination. Next, another doorway is selected and a route search is performed in the same manner. The route search device 100 selects the route with the lowest cost among the routes that have been sequentially searched for the respective entrance / exit nodes as described above. By doing so, it is possible to guide the user to the optimal entrance to reach the destination. When the cost is set based on the distance, the route with the shortest distance from the departure point is selected. However, since the load on the route search device 100 is increased as compared with a simple straight-line distance calculation, the processing may take time. Therefore, which method is used to search for a route is preferably used as a user setting item flexibly depending on the situation.

(B2) Modification 2 of the second embodiment:
In addition to the above, as a means for guiding the optimum entrance / exit, a route to the entrance / exit set in advance according to the latitude / longitude of the departure place may be guided. Next, an example of the means will be described. FIG. 10 is a simplified representation of a city map centered on facilities. As shown in the figure, here, the city map is divided into two regions, a region A within a dotted line and a region B within a one-dot chain line. These divisions are respectively associated with the entrance / exit A and entrance / exit B, and data defining such correspondence is recorded in advance in the electronic map data. This association may be performed by assigning an entrance / exit that is likely to be reached in consideration of a passage around the facility for each departure place. Then, in place of the steps S23, S24, and S25, a step of selecting a preset entrance 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 / exit A when the departure place exists in the region A and to the entrance / exit B when the departure point exists in the region B.

C. Third embodiment:
In the third embodiment, a technique for replacing a destination 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. FIGS. 11 and 12 are diagrams showing display data and search data of such electronic map data. As shown in FIG. 12, a parking lot node “♦”, a facility representative node “★”, and an entrance / exit node “□” are set in the electronic map data of this embodiment. Note that the hardware configuration of the route search apparatus in the present embodiment is the same as that of the route search apparatus in the first embodiment.

  FIG. 13 is a flowchart of route search processing using such electronic map data. First, the route search device 100 receives an input of a destination and moving means from the user via the operation unit 102, acquires a current position from the position detection unit 110, and sets a departure point (step S30). Next, the route search device 100 determines whether the destination is a facility (step S31), and if not, performs a normal route search (step S32). When the destination is a facility, the destination is replaced depending on whether the transportation means is a car or a walk. In the case of a car, the destination is replaced with a parking lot located in the vicinity of the facility node (steps S33 and S34). In the case of walking, the destination is replaced with the doorway associated with the facility node (steps S35 and S36). ). Finally, the route search device 100 searches for a route to the replaced destination (step S37), and guides the searched route by displaying the route on the display unit 101 (step S38). In steps S33 and S34, if the moving means is neither a car nor a walk, a normal route search is performed in step S32.

  Thus, the optimal route can be guided by replacing the destination with a parking lot or an entrance according to the moving means. The replacement of the destination to the parking lot node in step S34 may be replaced with a parking lot located at a fixed distance from the facility, or a predetermined parking lot is selected from a table in which the facility and the parking lot are associated in advance. It is also possible to replace it. 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 point or the destination. The replacement of the entrance / exit in step S36 may be performed by selecting and replacing one entrance / exit from a plurality of entrances / exits by various means similar to the second embodiment.

D. Fourth embodiment:
Next, an example of searching for a route according to the moving means will be described. When moving from the departure place to the destination, a person usually uses a moving means such as a car, a bicycle, a motorcycle, a train, a wheelchair, etc. in addition to walking. When moving to the facility using these moving means, the vehicle moves via a parking lot, a bicycle parking lot, a station, a slope, or the like. FIG. 14 is a diagram showing waypoints according to various moving means. In this figure, bus stops, parking lots, and stations are shown. Since these waypoints do not usually exist at the same point as shown in the figure, when there is a destination in a facility having a plurality of entrances, the entrances to be used are also different. For example, when using a car, the entrance / exit A goes through a parking lot, when using a bus, the entrance / exit B goes through a bus stop, and when using a train, the entrance / exit C goes through a station. It is an optimal entrance.

  As described above, when performing a route search using various moving means, the route search unit 109 of the route searching apparatus 100 searches for the entire route by setting a waypoint according to the moving means. In order to set the waypoint according to the means of transportation, first of all the node data recorded in the electronic map data, move to the node set as “entrance / exit” as the node type, such as “car” or “train” Information indicating the means is associated in advance. And when receiving the input of the destination from a user, the input of the moving means to utilize is also received simultaneously. By doing so, the route search unit 109 can select an entrance / exit associated with the input moving means from the electronic map data and set it as a transit point. After that, by searching the entire route using the node / link data inside and outside the facility and the entrance / exit node set as the transit point, the optimum route according to the moving means can be guided to the user.

  In the above description, an example of searching for a route from outside the facility to the inside of the facility has been shown, but a route from the inside of the facility to the outside of the facility can be similarly performed. Moreover, even if the departure point and the destination are in different facilities, an optimum route can be searched by setting each waypoint according to the moving means to be used. Note that 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 moving means.

  As mentioned above, although embodiment of this invention was described, this invention is not limited to these Examples, A various structure can be taken in the range which does not deviate from the meaning. In the above description, processing performed using hardware may be performed using software.

DESCRIPTION OF SYMBOLS 100 ... Route search apparatus 101 ... Display part 102 ... Operation part 103 ... Control part 104 ... Electronic map data input part 105 ... Electronic map data storage part 106 ... Electronic map data Reference unit 107 ... main control unit 108 ... command input unit 109 ... route search unit 110 ... position detection unit 111 ... display control unit 112 ... touch pen

Claims (13)

A route search device for searching a route,
A map data reference section for referring to electronic map data;
A condition input unit for inputting a starting point and a destination in route search;
A route search unit that searches for a route from the departure place to the destination using the electronic map data,
The electronic map data is
It is data that stores the connection state of the traffic path by node and link,
The node includes an in-facility node that is present in a facility having at least two or more entrances and represents a point that can be set as a destination or a departure point in the route search, and an entrance node that represents the entrance and exit,
The link includes a plurality of in-facility links that provide a passage from the entrance node to the in-facility node in the facility,
The route search unit searches for a route to the destination, including an entrance / exit node of the facility and a link in the facility, when the input destination or departure point exists in a specific facility. . A route search device for searching a route,
Map data that refers to electronic map data in which a connection state of a traffic path is recorded by a link and a node including an in-facility node representing any point in the facility having at least two or more entrances and an entrance node representing the entrance / exit A reference section;
A condition input unit for inputting a starting point and a destination in route search;
When the input destination or departure point is the in-facility node, one is selected from the plurality of gateway nodes based on a predetermined criterion, and a route search result to the selected gateway node is output. A route search unit;
A route search device comprising:   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 point or destination. The route search device according to claim 2,
The route search unit
A parametric route search unit for searching for a plurality of routes with the respective gateway nodes as destinations;
A route search apparatus comprising: a selection unit that selects a route determined to be most advantageous from the plurality of routes. The route search device according to claim 2,
The electronic map data is
A storage unit that stores in advance a correspondence relationship that gives any one of the plurality of entrance / exit nodes according to the latitude and longitude of the departure place for the in-facility node,
The route search unit
A route search device comprising a selection unit that selects an entry / exit node corresponding to the departure place based on the correspondence. A route search device for searching a route,
A map data reference unit that refers to electronic map data that records an in-facility node representing any point in the facility, and an entrance / exit node that represents an entrance / exit of the facility and is associated with a moving means to the facility;
A condition input unit for inputting a starting point and a destination in route search and a moving means to be used;
A route search unit for searching for a route from the departure place to the destination using the electronic map data according to the input moving means;
A route search device comprising: The route search device according to claim 6,
The route search unit selects at least one entry / exit node of the entry / exit nodes as a transit point according to the input moving means, and searches for a route from the departure point to the destination. . A program for causing a computer to perform route search processing,
Map data reference function to refer to electronic map data,
Condition input function to enter the starting point and destination in route search,
A route search function for searching for a route from the departure place to the destination using the electronic map data,
The electronic map data is
It is data that stores the connection state of the traffic path by node and link,
The node includes an in-facility node that is present in a facility having at least two or more entrances and represents a point that can be set as a destination or a departure point in the route search, and an entrance node that represents the entrance and exit,
The link includes a plurality of in-facility links that provide a passage from the entrance node to the in-facility node in the facility,
The route search function is a program for searching a route to a destination including an entrance / exit node of the facility and an in-facility link when the input destination or departure point exists in a specific facility. A program for causing a computer to perform route search processing,
Map data that refers to electronic map data in which the connection state of a traffic route is recorded by a link and a node including an in-facility node representing any point in the facility having at least two or more entrances and an entrance node representing the entrance / exit A reference function,
Condition input function to enter the starting point and destination in route search,
When the input destination or departure point is the in-facility node, one is selected from the plurality of gateway nodes based on a predetermined criterion, and a route search result to the selected gateway node is output. With route search function,
A program comprising A program for causing a computer to perform route search processing,
A map data reference function for referring to electronic map data that records an in-facility node representing any point in the facility and an entrance / exit node that represents an entrance / exit of the facility and is associated with a moving means to the facility;
A condition input function for inputting a starting point and a destination in route search and a moving means to be used;
A route search function for searching for a route from the departure point to a destination using the electronic map data in accordance with the input moving means;
A program comprising   The computer-readable recording medium which recorded the program in any one of Claims 8-10. Electronic map data that is used for electronic route search and that stores the connection state of the route by nodes and links,
An in-facility node representing a point that exists in a facility having at least two or more entrances and can be set as a destination in the route search;
An entrance / exit node representing the entrance / exit and associated with the in-facility node;
Electronic map data recorded.   The computer-readable recording medium which recorded the electronic map data of Claim 12.