JP6726436B2 - Facility search device and facility search method - Google Patents

Description

The present invention relates to a facility search device and a facility search method, and is particularly suitable for use in a navigation device that searches for a desired facility that can be set as a destination or waypoint of a guide route.

Generally, a navigation device has a function of searching a desired facility by designating a genre, a category and the like. The searched facility can be set as a destination or a waypoint for route search. A parking lot can be searched as an example of the facility.

For example, when a dedicated parking lot is not laid in the destination facility, a parking lot around the destination facility may be searched and the parking lot may be set as a destination for route search. Also, when there are multiple destination facilities in a certain area, instead of setting each destination facility as a destination or waypoint to perform route search, a parking lot at a place where each destination facility can be walked May be set as the destination for route search.

Conventionally, when there are a plurality of destinations, there is known a navigation device that searches a parking lot suitable for going to the plurality of destinations and performs a route search (for example, see Patent Documents 1 and 2). When a plurality of facilities existing in the same area are set as destinations, the navigation device described in Patent Document 1 searches and displays a parking lot that requires only one parking based on the condition of the minimum travel distance. Has been done.

In the navigation device described in Patent Document 2, among the plurality of set destinations, individual destinations that are associated in advance as a group in the database are calculated as a first route taxiway for moving on foot. On the other hand, for other destinations outside the group, a second route taxiway for moving by the vehicle is calculated. A parking lot suitable for visiting a plurality of destinations included in the group is set at a point connecting the first and second route taxiways.

However, in the above-mentioned Patent Documents 1 and 2, in order to search the nearest parking lot for a plurality of destination facilities, the distance must be calculated for each destination facility and a plurality of parking lots in the vicinity thereof. However, there is a problem that the calculation cost becomes high. For example, when there are two destination facilities, a plurality of parking lots within a predetermined distance of 360 degrees around one destination facility and a range of a predetermined distance around 360 degrees around the other destination facility. As a total combination with a plurality of parking lots inside, the distance from the parking lot to each destination facility must be calculated, and the parking lot with the shortest distance to the two destination facilities must be searched for.

In the system that analyzes the correspondence between destinations and parking lots, the destinations and the parking areas (rectangular areas surrounding a plurality of parking positions used when visiting the destinations) have a one-to-one correspondence. It is also stored in memory, and it is determined whether or not the parking areas overlap each other. If they overlap, the overlapping parking areas are identified as shared parking areas for multiple destinations. There is a known technology (see, for example, Patent Document 3).

JP 2001-50758 A JP, 2003-214875, A JP, 2014-182542, A

If the shared parking area is specified by using the analysis system described in Patent Document 3, when searching for a parking lot suitable for going to two destinations, the shared parking area specified for the two destinations is searched. It is possible to search for a parking lot for a parking area. However, in order to perform the analysis described in Patent Document 3, for each destination, it is necessary to previously set a rectangular area surrounding a plurality of parking positions used when visiting each destination as a parking area. There is. Therefore, there is a problem that the calculation cost for setting this parking area becomes high.

The present invention has been made to solve such a problem, and an object of the present invention is to make it possible to search a facility having good access when visiting a plurality of destination facilities in a short time with a small calculation cost. ..

In order to solve the above-mentioned problems, in the present invention, when an area is specified on a map, each of the areas existing in the specified area is displayed based on the graph data showing the connection relationship between a plurality of positions on the map. The mediation centrality of the position is calculated, and the facility corresponding to the position where the value of the mediation centrality satisfies a predetermined condition is extracted and presented.

According to the present invention configured as described above, when searching for a facility having good access to a plurality of destination facilities, among the positions existing in the designated area, the position where the connection is indicated by the graph data is shown. The intermediary centrality may be calculated for. In addition, in order to be able to search for a parking lot with good access, a rectangular area surrounding a plurality of parking positions used when visiting each of the facilities that can be destination facilities is preset as a parking region. You don't have to. As a result, when visiting a plurality of destination facilities, it is possible to search for facilities with good access in a short time with a small calculation cost.

It is a block diagram showing an example of functional composition of a facility search device by a 1st embodiment. It is a figure which shows typically the graph data used for calculation of the mediation centrality of 1st Embodiment. It is a figure which shows the example of area designation by the area designation|designated part of 1st Embodiment. It is a figure which shows the example of presentation of the search result by the facility presentation part of 1st Embodiment. It is a flow chart which shows an example of operation of a facility search device by a 1st embodiment. It is a block diagram showing an example of functional composition of a facility search device by a 2nd embodiment. It is a figure which shows an example of the division which has connection relation in the graph data by 2nd Embodiment. It is a figure which shows typically the graph data used for calculation of the mediation centrality of 2nd Embodiment. It is a figure which shows the example of presentation of the search result by the facility presentation part of 2nd Embodiment. It is a flow chart which shows an example of operation of a facility search device by a 2nd embodiment. It is a figure which shows the other example of the division which has connection relation in the graph data by 2nd Embodiment.

(First embodiment)
Hereinafter, a first embodiment of the present invention will be described with reference to the drawings. FIG. 1 is a block diagram showing a functional configuration example of a facility search device according to the first embodiment. The facility search device 100 according to the first embodiment is suitable for being mounted on a navigation device that searches for a guide route connecting a current position to a destination using map data and guides a vehicle to the destination according to the searched guide route. It is something. For example, the facility search device 100 of the present embodiment is used when searching for a facility that is the destination of the guide route.

As shown in FIG. 1, the facility search device 100 according to the first embodiment has, as its functional configuration, a map data acquisition unit 11, a map display unit 12, an area designation unit 13, a graph data storage unit 14, a mediation centrality calculation. The unit 15, the position extracting unit 16, and the facility presenting unit 17 are provided. These functional blocks 11 to 17 can be configured by any of hardware, DSP (Digital Signal Processor), and software. For example, when configured by software, each of the functional blocks 11 to 17 is actually configured to include a CPU, RAM, ROM, etc. of a computer, and a program stored in a recording medium such as RAM, ROM, hard disk or semiconductor memory. Is realized by operating.

The map data acquisition unit 11 acquires map data from the map data storage unit 200. The map data stored in the map data storage unit 200 stores map data necessary for map display, route search, etc., and is composed of, for example, a hard disk. The map data includes not only node data and link data related to roads but also data related to various facilities that can be set as destinations. The facility data includes information such as facility name, genre (category), point ID, position (latitude/longitude), and the like.

In the first embodiment, the map data stored in the map data storage unit 200 is stored between a plurality of positions on the map (in the first embodiment, a point where a facility exists is used as an example of the position). It also includes graph data showing the connection relationship. FIG. 2 is a diagram schematically showing graph data according to the first embodiment. In FIG. 2A, nodes N1 to N5 indicate respective points where a plurality of facilities exist. Lines L1 to L5 drawn between the nodes N1 to N5 indicate the presence or absence of the connection relation between the points. For example, it is shown that the nodes N1 and N2 have a connection relationship, but the nodes N2 and N3 do not have a connection relationship.

As shown in FIG. 2B, the graph data is composed of node information and connection information. The node information is composed of point ID and latitude/longitude information. The connection information is composed of From point ID, To point ID, and distance information between points.

In the first embodiment, when visiting a plurality of destination facilities within an area of a certain range, it is assumed that both destination facilities can be searched for a parking lot that is easily accessible on foot. In this case, the graph data is a graph showing the connection relationship in which the points where the parking lot exists and the points where the facilities other than the parking lot exist are not connected, but the points where the parking lot exists are connected. It should be data. In particular, it is preferable to use graph data in which points of a parking lot within a predetermined distance are connected.

The map display unit 12 causes the display 300 to display a map image based on the map data acquired from the map data storage unit 200 by the map data acquisition unit 11. This map image is used when designating a target area for facility search. The map image is also used when displaying the result of facility search.

The area designating unit 13 designates an area including a plurality of destination facility points on the map as a search target area in response to a user operation on the operation unit 400. As an example, the area designating unit 13 designates an area including points of two destination facilities on the map. For example, by performing an operation of enclosing a desired area on the map image displayed on the display 300, the enclosed area is designated as the search target area. The operation of enclosing a desired area on the map image can be performed by a touch operation on a touch panel (an example of the operation unit 400) or a cursor movement operation of a pointing device (another example of the operation unit 400).

The area designation method is not limited to this. For example, as shown in FIG. 3, when the points P1 and P2 of two destination facilities are designated by a user operation, a rectangular area having two corners at the designated points P1 and P2 is automatically designated. Good. Alternatively, an area may be specified that is wider by a predetermined distance in each of the four sides than the rectangular area shown in FIG. As another area designation method, a desired administrative division may be designated by a user operation to specify the area in units of administrative division.

When designating the area, it is preferable to designate the points P1 and P2 of the two destination facilities so as to be separated from each other in the area. In particular, it is more preferable to specify the area so that the points P1 and P2 of the two destination facilities are both in the peripheral area of the area. By designating an area that is too wide, the points P1 and P2 of the two destination facilities are both in the substantially central region of the area, and the points P1 and P2 of the two destination facilities are the same in the area. This is because if there is a bias in the surrounding area, a parking lot with good access to the two destination facilities may not necessarily be searched for due to the calculation of intermediary centrality described later.

The graph data storage unit 14 stores the graph data in the area designated by the area designation unit 14 among the map data acquired from the map data storage unit 200 by the map data acquisition unit 11.

Based on the graph data in the area specified by the area specifying unit 14, that is, the graph data stored in the graph data storage unit 14, the intermediary centrality calculation unit 15 calculates each of the points existing in the specified area. Calculate intermediary centrality. The intermediary centrality refers to a centrality index that highly evaluates a node on a path connecting two nodes, and indicates the degree to which a certain node is on the shortest path connecting two other nodes. This median centrality can be calculated by a known method.

In the example of FIG. 2, since the node N1 is on the shortest path between the node N2 and the node N3, the value of the mediation centrality is incremented by one. Similarly, since the node N1 exists on the shortest path between the node N2 and the node N4 and on the shortest path between the node N2 and the node N5, the total count is three. On the other hand, the shortest route between the node N3 and the node N5 does not pass through the node N1 and is not counted up. Although there are two routes from the node N3 to the node N5, the route of N3→N4→N5 is shorter than the route of N3→N1→N5, so the shortest route is N3→N4→N5. .. As a result, the value of the mediation centrality of the node N1 becomes 3.

The position extraction unit 16 extracts a point where the value of the mediation centrality calculated by the mediation centrality calculation unit 15 satisfies a predetermined condition. For example, the position extraction unit 16 extracts a point having a median centrality value larger than a predetermined value from the designated area. Alternatively, the position extraction unit 16 may extract a predetermined number of points from the designated area in order from the largest median centrality value.

The facility presenting unit 17 presents the facility (parking lot) corresponding to the point extracted by the position extracting unit 16 on the display 300 as a search result. FIG. 4 is a diagram showing an example of presentation of search results by the facility presentation unit 17. As shown in FIG. 4, the facility presenting section 17 displays a map image including the area designated by the area designating section 13 on the display 300, and displays the parking lot icon 41 at the point extracted by the position extracting section 16. , Display it on the corresponding position on the map image. When two destination facilities P1 and P2 are designated when the area is designated by the area designation unit 13, it is preferable to display the icons of the destination facilities P1 and P2 together.

As in the first embodiment, an area in which the two destination facilities P1 and P2 are included in a relatively distant state is designated, and the mediation centrality is determined by using the graph data in which the points of the parking lot are connected. When calculated, the parking lot in the vicinity of one of the destination facilities P1 and P2, not the parking lot around the one of the destination facilities P1 and the parking lot around the other destination facility P2, has the intermediary centrality. It is extracted as a parking lot with a large value. Therefore, as shown in FIG. 4, a parking lot near the middle of each of the destination facilities P1 and P2 is presented as a search result.

Depending on how the area is designated, the position extraction unit 16 may extract a parking lot point that is not suitable for walking because the distance between the two destination facilities P1 and P2 becomes a predetermined value or more. To be Therefore, the position extracting unit 16 may extract, from the points where the value of the mediation centrality satisfies the predetermined value, the points whose distances to the points of the two destination facilities P1 and P2 are less than the predetermined value. ..

The user can set the selected parking lot as the destination by performing an operation of selecting any one of the parking lot icons 41 displayed as shown in FIG. The method of presenting the search results is not limited to the example shown in FIG. For example, the parking lots corresponding to the points extracted by the position extracting unit 16 may be displayed as a list in a list format.

FIG. 5 is a flowchart showing an operation example of the facility search device 100 according to the first embodiment configured as described above. The flowchart shown in FIG. 5 starts when the navigation device is instructed to perform a facility search by designating a genre of a parking lot.

First, the map display unit 12 displays a map image on the display 300 based on the map data acquired from the map data storage unit 200 by the map data acquisition unit 11 (step S1). Here, a map image around the point where the two destination facilities P1 and P2 are located is displayed. This can be done, for example, by scrolling the map screen. Alternatively, it is also possible to jump display on the peripheral map of the searched point by searching either of the destination facilities P1 and P2.

Next, the area designating unit 13 designates an area including the points of the two destination facilities P1 and P2 on the map as a search target area according to a user operation (step S2). When the area is designated, the graph data in the area is stored in the graph data storage unit 14 (step S3). The mediation centrality calculation unit 15 calculates the mediation centrality of each parking lot point existing in the designated area based on the graph data stored in the graph data storage unit 14 (step S4).

Next, the position extraction unit 16 extracts a point where the value of the mediation centrality calculated by the mediation centrality calculation unit 15 satisfies a predetermined condition (step S5). Then, the facility presenting unit 17 presents the parking lot at the point extracted by the position extracting unit 16 as a search result on the display 300 (step S6). This completes the processing of the flowchart shown in FIG.

As described above in detail, in the first embodiment, an area including a plurality of destination facility points is specified on the map, and the area exists within the specified area based on the graph data in the specified area. The intermediary centrality of each parking lot is calculated, and the parking lot at the point where the value of the intermediary centrality satisfies a predetermined condition is extracted and presented.

According to the first embodiment configured as described above, in order to search for a parking lot that is easily accessible to a plurality of destination facilities, the distance is calculated by a total combination of each destination facility and a plurality of parking lots around the destination facility. It is not necessary to perform calculation, and the mediation centrality may be calculated for each of the points existing in the designated area and the connection of which is shown in the graph data. Further, it is not necessary to previously set a rectangular area surrounding a plurality of parking positions used when visiting each facility as a parking area for each facility that can be a destination facility. This makes it possible to search for a parking lot that is easily accessed when visiting a plurality of destination facilities in a short time with a small calculation cost.

In addition, in the said 1st Embodiment, although the area designation part 13 demonstrated the example which designates the area containing the point of two destination facilities on a map, the area containing the point of three or more destination facilities was designated. It is also possible to select a parking lot with good access when visiting three or more destination facilities. If you specify the area where three or more destination facilities are included relatively far from each other and calculate the intermediary centrality using the graph data that connects the points of the parking lot, the middle of each destination facility Parking lots in the vicinity can be extracted as parking lots having a large intermediary centrality value.

When there are three or more destination facilities, it is possible that one of them is a facility with a parking lot and has a large intermediary centrality with respect to the other remaining destination facilities. In this case, if you park in the facility with a parking lot, you can visit three or more facilities efficiently. Therefore, when the area is designated by designating three or more destination facilities, the position extraction unit 16 extracts the location of the parking lot or the destination facility with the parking lot in which the value of the intermediary centrality satisfies a predetermined condition. You may do so. However, in order to realize this, it is necessary not only to connect the points of the parking lot but also to use the graph data in which the points of the facility with the parking lot are added to the connection.

Moreover, in the said 1st Embodiment, the example which searches and presents the parking lot with a good access was demonstrated, The facility to search is not limited to a parking lot.

(Second embodiment)
Next, a second embodiment of the present invention will be described based on the drawings. In the above-described first embodiment, the “point” of the facility (parking lot) is used as an example of the position indicating the connection relationship in the graph data, but in the second embodiment, the position indicating the connection relationship is used. "Compartment" is used as.

FIG. 6 is a block diagram showing a functional configuration example of the facility search device according to the second embodiment. Note that, in FIG. 6, components denoted by the same reference symbols as those shown in FIG. 1 have the same functions, and therefore, redundant description will be omitted.

As shown in FIG. 6, the facility search device 100′ according to the second embodiment further includes a search condition input unit 18 as its functional configuration, and also includes an area designation unit 13, a graph data storage unit 14, and a mediation centrality calculation. Instead of the unit 15, the position extraction unit 16 and the facility presentation unit 17, an area designation unit 13', a graph data storage unit 14', a mediation centrality calculation unit 15', a position extraction unit 16' and a facility presentation unit 17' are provided. ing. Further, a map data storage unit 200' is provided instead of the map data storage unit 200.

In the second embodiment, the map data stored in the map data storage unit 200' includes graph data representing a connection relationship between a plurality of sections on the map. FIG. 7 is a diagram showing an example of sections having a connection relationship in the graph data according to the second embodiment. Further, FIG. 8 is a diagram schematically showing graph data according to the second embodiment.

As shown in FIG. 7, a section is set as an area divided by an intersection and a road. A partition ID (for convenience, indicated by numbers 01 to 13) is set for each partition. Further, in FIG. 8, nodes 01 to 13 indicate a plurality of partitions. The line drawn between the nodes 01 to 13 indicates whether or not there is a connection relationship between the sections. In the example of FIG. 8, the connection relation is set between the nodes of the adjacent partitions, and the connection relation is not set between the nodes of the adjacent partitions. Note that FIG. 7 shows an example in which all the intersections are divided, but any intersection may be selected and divided.

The area designating unit 13' designates an area including a plurality of sections on the map. FIG. 7 is assumed to be a rectangular area designated to include a plurality of sections 01 to 13. Here, a section of which a part is included in the rectangular designated area may or may not be included in the calculation target of the intermediary centrality. In addition, in the designated area, if only the sections including the entire area are set as the calculation targets of the intermediary centrality and the number of the calculation target sections is equal to or more than the predetermined number, the sections including only a part of the area are It may not be included in the calculation target of the mediation centrality, and may be included in the calculation target when the number of partitions is less than a predetermined number.

The graph data storage unit 14 ′ stores the graph data in the area designated by the area designation unit 13 ′ of the map data acquired from the map data storage unit 200 ′ by the map data acquisition unit 11. Particularly, the graph data of the section for which the median centrality is calculated is stored. As shown in FIG. 8, the graph data stored in the graph data storage unit 14' in the second embodiment represents the connection relationship between a plurality of sections on the map.

The intermediary centrality calculation unit 15′ exists in the specified area based on the graph data in the area specified by the area specifying unit 13′, that is, the graph data stored in the graph data storage unit 14′. The intermediary centrality of each compartment is calculated.

The position extraction unit 16' extracts a section in which the value of the mediation centrality calculated by the mediation centrality calculation unit 15' satisfies a predetermined condition. For example, the position extraction unit 16 ′ extracts the section having the largest median centrality value from the designated area. In the example of FIG. 8, the section having the section ID “10” has the largest intermediary centrality value. The position extracting unit 16 ′ may extract a predetermined number of sections from the designated area in order from the largest median centrality value.

The search condition input unit 18 inputs facility search conditions in response to a user operation on the operation unit 400. For example, a facility to be searched can be input as a search condition. That is, when searching for a parking lot, "parking lot" may be input as a search condition. When searching for accommodation facilities, “accommodation facilities” may be input as the search condition. In addition, attribute information attached to the facility such as facility usage fee, business hours, genre (category), or the like may be input as a search condition.

The facility presenting unit 17′ searches for facilities that match the search condition input by the search condition inputting unit 18 in the section extracted by the position extracting unit 16′, and presents the searched facility as a search result. .. FIG. 9 is a diagram showing an example of presentation of search results by the facility presentation unit 17'. The example of FIG. 9 shows a search result when a parking lot is input as a search condition. Specifically, the position extraction unit 16′ extracts the section with the section ID “10”, and the parking lot icon 91 included in the section is displayed in a superimposed manner at the corresponding position on the map image. Showing.

Although an example in which the user inputs the search condition has been described here, the present invention is not limited to this. For example, the facility presenting unit 17 ′ searches the facilities extracted by the position extracting unit 16 ′ for a facility that matches the search condition determined in advance by the facility search device 100 ′, and searches for the searched facility. May be presented as.

FIG. 10 is a flowchart showing an operation example of the facility search device 100' according to the second embodiment configured as described above. Note that the flowchart shown in FIG. 10 starts, for example, when the search condition is input by the search condition input unit 18 and the user instructs the facility search.

First, the map display unit 12 causes the display 300 to display a map image based on the map data acquired from the map data storage unit 200' by the map data acquisition unit 11 (step S11).

Next, the area designating unit 13' designates an area including a plurality of sections on the map as an area to be searched according to a user operation (step S12). When the area is designated, the graph data in the area is stored in the graph data storage unit 14' (step S13). The intermediary centrality calculation unit 15' calculates the intermediary centrality of each section existing in the designated area based on the graph data stored in the graph data storage unit 14' (step S14).

Next, the position extraction unit 16' extracts a section in which the value of the mediation centrality calculated by the mediation centrality calculation unit 15' satisfies a predetermined condition (step S15). Then, the facility presenting unit 17′ searches the facilities extracted by the position extracting unit 16′ for a facility that matches the search condition input by the search condition input unit 18 (step S16), and searches for the searched facility. Is presented as a search result on the display 300 (step S17). This completes the processing of the flowchart shown in FIG.

As described in detail above, in the second embodiment, an area including a plurality of sections is specified on the map, and each section existing in the specified area is specified based on the graph data in the specified area. The centrality of mediation is calculated, the section whose value of the medianity satisfies a predetermined condition is extracted, and the facility matching the search condition is searched from the section and presented.

According to the second embodiment configured as described above, for example, when a user wants to visit a plurality of facilities in a desired area to travel around, a facility convenient for the travel is searched in a short time with a small calculation cost. can do. For example, when searching for a parking lot that has the best access to the tour area, when searching for the most accessible accommodation facility in a navigation device that can set the route over multiple days, or when traveling by electric vehicle. Searching for the charging station with the best access can be executed in a short time with a small calculation cost.

In addition, in the said 2nd Embodiment, although the example which sets the area|region divided by an intersection and a road as a division was demonstrated like FIG. 7, this invention is not limited to this. For example, as shown in FIG. 11, an area divided by a mesh having a predetermined shape and a predetermined size may be set as a section. Although FIG. 11 shows a rectangular mesh, the shape is not limited to this.

Further, in the first and second embodiments described above, an example in which the graph data is stored in advance in the map data storage unit 201 as a part of the map data has been described, but the present invention is not limited to this. For example, when the area is designated by the area designating unit 13, the graph data in the designated area may be generated in real time. If it is limited to the designated area, the generation of graph data does not require a large calculation cost.

Moreover, in the said 1st and 2nd embodiment, although the example which extracts and presents the parking lot with which the value of mediation centrality satisfy|fills predetermined conditions was demonstrated, you may add other extraction conditions. For example, if the parking lot charge information is included as facility data, only the parking lots where the value of intermediary centrality satisfies a predetermined condition and the parking lot charge is equal to or less than the predetermined value are presented. May be. When the search results are displayed as a list, parking lots whose intermediary centrality value satisfies a predetermined condition may be presented in ascending order of charges.

In addition, each of the first and second embodiments described above is merely an example of the embodiment for carrying out the present invention, and the technical scope of the present invention is not limitedly interpreted by these. It does not happen. That is, the present invention can be implemented in various forms without departing from the gist or the main features thereof.

13, 13' Area designation unit 14, 14' Graph data storage unit 15, 15' Mediation centrality calculation unit 16, 16' Position extraction unit 17, 17' Facility presentation unit 18 Search condition input unit 100, 100' Facility search device 200,200' Map data storage

Claims (13)

A graph data storage unit that stores graph data representing a connection relationship between a plurality of positions on a map,
An area designating section that designates an area on the map,
Based on the graph data in the area designated by the area designation unit, a mediation centrality calculation unit that calculates the mediation centrality of each position existing in the area designated by the area designation unit,
A position extraction unit that extracts a position where the value of the mediation centrality calculated by the mediation centrality calculation unit satisfies a predetermined condition,
A facility search device comprising: a facility presenting unit that presents a facility corresponding to the position extracted by the position extracting unit as a search result. The graph data storage unit stores graph data representing a connection relationship between a plurality of points on a map,
The area designating section designates an area including a plurality of destination facility points on the map,
The mediation centrality calculation unit calculates the mediation centrality of each point existing in the area designated by the area designation unit, based on the graph data in the area designated by the area designation unit,
The position extraction unit extracts a point where the value of the mediation centrality calculated by the mediation centrality calculation unit satisfies a predetermined condition,
The facility search device according to claim 1, wherein the facility presenting unit presents, as the search result, a facility corresponding to the point extracted by the position extracting unit. The position extracting unit extracts, from among points where the value of the intermediary centrality satisfies the predetermined condition, points whose distances to the points of the plurality of destination facilities are less than a predetermined value. The facility search device described in 2. The area designating section designates an area including points of two destination facilities on the map,
The facility search device according to claim 2, wherein the position extraction unit extracts a point in a parking lot where the value of the mediation centrality satisfies the predetermined condition. The area designation unit designates an area including three or more destination facility points on the map,
The facility search device according to claim 2, wherein the position extraction unit extracts a location of a parking lot or a destination facility with a parking lot in which the value of the mediation centrality satisfies the predetermined condition. The graph data storage unit does not connect the point where the parking lot exists and the point where the facility other than the parking lot exists, but displays the connection relationship that connects the points where the parking lot exists. The facility search device according to claim 2, wherein the graph data is stored. The facility search device according to claim 6, wherein the graph data storage unit stores graph data representing a connection relationship in which points of a parking lot within a predetermined distance are connected to each other. The graph data storage unit does not connect the point where the parking lot exists and the point where the facility other than the parking lot exists, but connects the points where the parking lot and the facility with the parking lot exist. The facility search device according to claim 5, wherein the graph data representing the connection relationship is stored. The graph data storage unit stores graph data representing a connection relationship between a plurality of sections on a map,
The area designating section designates an area including a plurality of sections on the map,
The mediation centrality calculation unit calculates the mediation centrality of each section existing in the area designated by the area designation unit, based on the graph data in the area designated by the area designation unit,
The position extraction unit extracts a section in which the value of the mediation centrality calculated by the mediation centrality calculation unit satisfies a predetermined condition,
The facility presenting unit searches for a facility that matches a search condition in the section extracted by the position extracting unit, and presents the searched facility as the search result. Facility search device. Further provided with a search condition input section for inputting a search condition for the above facility,
The facility presenting unit searches the facilities extracted by the position extracting unit for facilities that match the search condition input by the search condition input unit, and presents the searched facility as the search result. The facility search device according to claim 9, wherein: The facility search device according to claim 9, wherein the section is an area divided by an intersection and a road. The facility search device according to claim 9, wherein the section is an area divided by a mesh having a predetermined shape and a predetermined size. The area designating unit of the facility search device comprises a first step of designating an area on the map,
The area designated by the area designating section is referred to by the intermediary centrality calculating section of the facility searching device, with reference to a graph data storing section that stores graph data representing a connection relationship between a plurality of positions on the map. A second step of calculating the mediation centrality of each position existing in the area designated by the area designating unit, based on the graph data in
A third step in which the position extraction unit of the facility search device extracts a position where the value of the mediation centrality calculated by the mediation centrality calculation unit satisfies a predetermined condition;
The facility presenting unit of the above facility searching apparatus has a fourth step of presenting, as a search result, a facility corresponding to the position extracted by the above position extracting unit.