JP2021149746A - Spot retrieval system, spot retrieval method, and spot retrieval program - Google Patents

Abstract

To provide a spot retrieval system, a spot retrieval method, and a spot retrieval program which preferentially searches object spots with a high probability of being a correct spot to be retrieved even when multiple area names which are the same as an area name related to the spot to be retrieved exist.SOLUTION: A spot retrieval system includes a spot database, an area database 2, a search condition obtaining unit, and a search unit. When the name of an areas A is included in search conditions and if there are more than one area A having the same name in the area database, the search unit sets search priority for the multiple areas A based on priority setting conditions which use at least one of scales S of the areas A and positions Q1 through Q5 of the areas A, and searches for an object spot matching the search conditions prioritizing object spots having inclusion area information corresponding to areas with higher search priority.SELECTED DRAWING: Figure 4

Description

The present invention relates to a point search technique for searching a point based on a given search condition.

Japanese Patent No. 2575788 discloses a search method for searching a place name word dictionary by inputting a place name. In this search method, when the same place name exists more than once in the place name word dictionary, the physical distance between the installation location of the input device in which the place name is input as the search condition and each of the same place names is short. The location is preferentially selected for searching.

Japanese Patent No. 2575788

However, even if the areas have the same place name, the other attributes are not always the same, so that the size of the area may differ, for example. That is, even if the place names are the same, there are cases such as the names of large cities, the names of small and medium-sized cities, and the names of some cities. For example, "Boston" in the United States has more than 10 locations besides the capital of Massachusetts. Also in Japan, for example, there are multiple place names other than Kawasaki City, which are government-designated cities (cities with greater administrative authority than general cities). The search for a point is also performed, for example, when searching for a destination in a navigation system or the like, but in the case of travel or the like, a destination far from the current location is often searched. In such a case, if the search is executed in the order closer to the current location, the search for the destination will be slowed down, the ranking of the searched results will be lowered, and it will take time for the user to find the search results. There is a possibility that it will happen. On the other hand, when the purpose of the visit is daily, such as grocery shopping or refueling, the user rarely goes to a place far from the current location and may want to arrive at the destination early. Highly sexual. In this way, a search that emphasizes the distance to the destination may be required. In other words, if the search algorithm is always the same, the search result may not be what the user wants.

In view of the above background, even if there are a plurality of place names having the same name as the place name related to the search target point, it is possible to preferentially search the target point that is likely to be an appropriate search target. Providing technology is desired.

In view of the above, the point search system provides position information indicating the positions of a plurality of target points to be searched, affiliation area information indicating the area where the target points exist, and attribute information indicating the attributes of the target points. A point database to be stored, a place name information indicating each place name of a plurality of the areas, a scale information indicating the scale of the area, and an area database storing the area position information indicating the position of the area, and a search for receiving search conditions. A condition acquisition unit and a search unit that searches the point database based on the search condition and extracts the target point that matches the search condition from the point database are provided, and the search unit includes the search condition. When the place name of the area and the attribute of the target point are included, and when a plurality of the areas having the same place name exist in the area database, the conditions are set in advance according to the attribute. The target having the affiliation area information corresponding to the area having a high search priority by setting a plurality of search priorities of the area based on a priority setting condition using at least one of the scale and the position of the area. Priority is given to the point, and the target point that matches the search condition is searched.

According to this configuration, when a search condition includes a plurality of place names in which areas with the same place name are included in the area database, it is possible to search for the target points by appropriately prioritizing the plurality of areas. Even if the place name is the same, the scale may be different in each area. Larger areas generally tend to contain more target points, and are more likely to include target points that are appropriate search targets. In addition, since large areas are often more famous than smaller areas, it is highly likely that the place names specified by the user as search targets are also assumed to be large areas. .. On the other hand, as a matter of course, the time required to move to each area also differs depending on the position of each area. If you want to arrive at the target point early, it is preferable that the travel time is short. Whether or not to emphasize the travel time to the target point in this way depends on the purpose of the user's visit to the target point. The purpose of such a user's visit can be estimated based on the attributes of the target point included in the search conditions. According to this configuration, a plurality of search priorities of the above-mentioned areas are set based on the priority setting conditions using at least one of the scale and the position of the areas, which are preset conditions according to the attributes, and the search is performed. The target points are searched according to the priority. Therefore, it is possible to preferentially search for an appropriate target point according to the purpose of the visit estimated based on the attributes of the target point included in the search condition. That is, according to this configuration, even if there are a plurality of place names having the same name as the place name related to the point to be searched, the target point having a high possibility of being an appropriate search target is preferentially searched. Can be done.

The technical features of the above-mentioned point search system can also be applied to a point search method and a point search program. A typical embodiment thereof will be illustrated below. For example, the point search method can have various steps with the features of the point search system described above. Further, the point search program can realize various functions having the features of the above-mentioned point search system on the computer. As a matter of course, these methods and programs can also exert the effects of the above-mentioned point search system. Further, as a preferred embodiment of the point search system, various additional features exemplified in the description of the following embodiments can also be incorporated into these point search methods and point search programs, and the methods and the programs are respectively. It is also possible to play an action effect corresponding to the additional feature of.

As one preferred embodiment, the point search method shows position information indicating the position of each of a plurality of target points to be searched, affiliation area information indicating the area where the target point exists, and attributes of the target point. A point database that stores attribute information, a place name information that indicates the name of each of the plurality of areas, a scale information that indicates the scale of the area, and an area database that stores the area position information indicating the position of the area are used. It is a point search method for searching the target point, the search condition acquisition step for receiving the search condition, the point database is searched based on the search condition, and the target point matching the search condition is the point database. In the search step, the search condition includes a place name of the area and the attribute of the target point, and a plurality of the areas having the same place name are included in the area database. If it exists, a plurality of search priorities of the area are set based on the priority setting condition using at least one of the scale and the position of the area, which is a condition preset according to the attribute. The target point having the affiliation area information corresponding to the area having a high search priority is prioritized, and the target point matching the search condition is searched.

Further, as one preferred embodiment, the point search program may include position information indicating the position of each of a plurality of target points to be searched, affiliation area information indicating the area where the target point exists, and attributes of the target point. A point database that stores attribute information indicating the area, a place name information indicating each place name of a plurality of the areas, a scale information indicating the scale of the area, and an area database storing the area position information indicating the position of the area. It is a point search program that realizes the function of searching the target point on a computer by using the search condition acquisition function for receiving the search condition and the point database is searched based on the search condition and conforms to the search condition. A search function for extracting the target point from the point database is realized in a computer, and in the search function, the place name of the area and the attribute of the target point are included in the search condition. When a plurality of the areas having the same place name exist in the area database, a plurality of the areas are preset according to the attributes and are based on the priority setting condition using at least one of the scale and the position of the area. The search priority of the area is set, the target point having the affiliation area information corresponding to the area having the high search priority is prioritized, and the target point matching the search condition is searched.

Further features and advantages of the point search system, the point search method and the point search program will be clarified from the following description of the embodiments described with reference to the drawings.

Block diagram schematically showing an example of a point search system Block diagram schematically showing another example of a point search system Diagram showing an example of a point database Diagram showing an example of an area database Diagram showing an example of the point search procedure Diagram showing an example of the procedure for determining search priority A diagram showing an example of a procedure for determining a search priority using a search score. Diagram showing an example of an area with the same place name The figure which shows an example of the setting method of the search score in the 2nd setting condition The figure which shows an example of the setting method of the search score in the 1st setting condition Diagram showing an example of the relationship between area size and size score Diagram showing an example of the relationship between the representative distance and the distance score

Hereinafter, the point search system, the point search method, and the embodiment of the point search program will be described with reference to the drawings. 1 and 2 schematically show an example of the point search system 100. The point search system 100 searches for a target point as a destination, for example, in order to search for a movement route when the moving body 10 moves to the destination. Here, the moving body 10 is, for example, a vehicle, a mobile terminal carried by a user (personal computer, PDA (Personal Digital Assistant), smartphone), or the like. FIG. 1 shows a form in which a point search system 100 is configured by cooperation between a mobile body 10 and a server 20 (cloud) connected via a communication network 90 such as the Internet (cloud type system or server / client type system). Is illustrated. Further, FIG. 2 illustrates a form (standalone type system) in which the point search system 100 is mounted on the moving body 10.

The point search system 100 is configured with a computer as a core, whether it is a server / client type system or a stand-alone system. In the server / client type system, the server computer is configured as the core, and in the stand-alone system, the microcomputer, DSP (Digital Signal Processor) and the like are configured as the core. The point search method is a method executed by using these computers, and the point search program is a program realized by these computers.

As shown in FIGS. 1 and 2, the point search system 100 includes a point database 1, an area database 2, a search condition acquisition unit 3, and a search unit 5. Further, here, a mode in which the point search system 100 further includes a search condition input unit 6, a search result output unit 4, and a search result notification unit 8 is illustrated. However, the point search system 100 does not necessarily have to include these functional units. Further, FIG. 3 shows an example of the point database 1, and FIG. 4 shows an example of the area database 2.

The point database 1 shows the position information Ip indicating the position P of each of the plurality of target points F to be searched, the affiliation area information Ia indicating the area A where the target point F exists, and the attribute C of the target point F. This is a database that stores attribute information Ic. Here, the attribute C is information unique to each of the target points F, properties / characteristics that can be classified, and the like. In this example, at least the name of the target point F and the classification such as type and category are included. .. The area database 2 is a database that stores the place name information In indicating the place name N of each of the plurality of areas A, the scale information Is indicating the scale S of the area A, and the area position information Iq indicating the position Q of the area A. ..

As shown in FIG. 3, the point database 1 stores position information Ip indicating each position P (P1, P2, ...) For each of a plurality of target points F (F1, F2, ...). doing. In addition, the affiliation area information Ia indicating the area A (A1, A2, ...) In which each target point F exists is stored. Although the place name N is also shown in parentheses in FIG. 3, the affiliation area information Ia corresponds to each area A (A1, A2, ...) Stored in the area database 2 as shown in FIG. It suffices to have possible information (symbols, numbers, etc. that distinguish each area A). Further, as shown in FIG. 3, the point database 1 contains information indicating each name C2 (store name, facility name, etc.) of the target point F as attribute information Ic, and classification C1 such as the type and category of the target point F. I remember the information that indicates. Here, as classification C1, a hotel, a store, a movie theater, a theater, and the like are illustrated. In addition to these, the attribute C indicated by the attribute information Ic may include the telephone number, address, and the like of the target point F.

In addition, the attribute information Ic can include information indicating urgency according to the purpose of visiting the target point F. Here, the urgency is the necessity of shortening the travel time for visiting the target point F. This includes cases where there are many users who desire to shorten the travel time or cases where it is not appropriate to increase the travel time in view of the purpose of the visit. For example, in drug stores and convenience stores, it is considered that there are many users who want to arrive immediately and finish shopping, etc., rather than moving over time. Therefore, in these cases, it is preferable that the attribute information Ic contains information that the attribute C (classification C1) of the target point F is highly urgent. Further, when the moving body 10 is a vehicle, it is not appropriate to move a long distance for refueling, so it is considered that there are many cases where the gas station also arrives immediately and wants to finish refueling. Therefore, in this case as well, it is preferable that the attribute information Ic contains information that the urgency is high.

In addition, the attribute information Ic can also include information indicating an allowable movement range, which is a range of the allowable movement distance for a general user according to the purpose of visiting the target point F. This permissible movement range is a range set assuming a general user, and is preferably set so as to apply to a main user group by using statistical information or the like. Generally, the permissible range of movement of the user varies depending on the purpose of visiting the target point F. For example, when the purpose of the visit is daily, such as shopping for groceries or refueling, the permissible range of movement is relatively narrow. On the other hand, when the purpose of the visit is extremely important, such as sightseeing, lodging, and unusual shopping, the permissible range of movement is relatively wide. For example, when visiting a theme park, a hotel, an outlet mall, etc., there is a high possibility that a long travel time will be tolerated. Therefore, when the target point F is these cases, it is preferable that a relatively wide allowable movement range is set as the attribute information Ic. The permissible movement range becomes higher as the number of target points F having the same attribute information Ic (in this case, classification C1 such as type or category) in the point database 1 decreases. It can also be set to be wider according to. Since the target point F, which has low shortage, is a point that has a high frequency of existence and is ubiquitous, there is a high possibility that the user will place importance on arriving early. On the other hand, the target point F, which is highly rare, is likely to move even if the user takes time.

In FIG. 3, for example, the first target point F1 exists at the point “P1” in the first area A1, the target point F in which the classification C1 in the attribute C is “store” and the name C2 is “a1-mart”. Is. The second target point F2 exists at the point “P2” in the fourth area A4, which will be described later with reference to FIG. 8, and is the target point F whose classification C1 is “hotel” and whose name C2 is “a4-inn”. be. Although omitted in FIG. 3, the third target point F3 exists at the point “P3” in the third area A3 as shown in FIG. 8, and the classification C1 is the target point F of the “hotel” as described later (as described later). Name C2 is omitted). The fourth target point F4 exists at the point "P4" in the fifth area A5, and the classification C1 is "store" and the name C2 is the target point F of "a5-shop". The fifth target point F5 exists at the point “P5” in the fifth area A5, and the classification C1 is “hotel” and the name C2 is the target point F of “a5-hotel”. The sixth target point F6 exists at the point "P6" in the fifth area A5, and the classification C1 is "theater" and the name C2 is the target point F of "a5-cinema".

As shown in FIG. 4, the area database 2 stores the place name information In indicating each place name N for each of the plurality of areas A (A1, A2, ...). The place name information In may include a plurality of areas A having the same place name N. For example, FIG. 4 shows that a plurality of place names N named "Boston" are included in the place name information In. Here, the first area A1 is "Boston-Block in XX City", and the second area A2 is "Boston-Street in YY City ZZ City", as shown in FIG. Area 3 A3 and Area 4 A4 are omitted in FIG. 4, and Area 5 A5 is "Boston City".

Scale information Is is information indicating the scale S of each area A. The scale information Is visits the population of the area A, the population density of the area A, the number of target points which is the number of the target points F belonging to the area A, the target point density indicating the existence density of the target point F in the area A, and the area A. It is set based on at least one of the number of visitors, which is the number of people per unit period. Here, the scale information Is increases in scale S as the population of area A increases, and increases in scale S as the population density of area A increases, and is a target area which is the number of target points F belonging to area A. The scale S increases as the number of points increases, and the scale S increases as the target point density, which indicates the abundance density of the target point F in the area A, increases. The scale S is set to increase as the number increases. For example, "Boston City" in Area 5 A5 is set as such a large scale "LG", and "Boston Street in ZZ City YY Street" in Area 2 A2 is set as such a small scale "SM". The first area A1 "Boston Street, XX City" is set as "MD" of an intermediate scale between them. In addition, although the embodiment in which the scale S is set in three stages is illustrated here, it may be divided into four or more stages as a matter of course.

The area position information Iq is information indicating the position Q of each area A. Since the area A has a certain range, the position Q of the area A is the position Q (Q1, Q2, ...) Of the representative point G set in each area A. Here, the representative point G can be, for example, the location of the competent government office (city hall, etc.) of an administrative area such as a city, the location of a representative station of a railway, or the like. When the area A is a small area such as a "block", a representative point such as "address 1" can be appropriately set. A point other than these may be set as the representative point G, and for example, the position of the center of gravity as a figure of the area constituting the area A may be set.

The search condition acquisition unit 3 is a functional unit that receives search conditions. The moving body 10 is provided with a search condition input unit 6 provided with a touch panel 61, a microphone 62, and the like, and the user can perform a contact operation or voice input to name or classify the target point F as a destination (hotel, store, etc.). (Movie theater, etc.), enter search conditions such as the place name of the location. As shown in FIG. 2, when the point search system 100 is a stand-alone system, the search condition acquisition unit 3 acquires the search conditions input to the search condition input unit 6. As shown in FIG. 1, when the point search system 100 is a cloud type system (server / client type system), the search conditions input to the search condition input unit 6 of the moving body 10 as a client are input to the moving body side interface. The search condition acquisition unit 3 of the server 20 acquires the information via the 92, the communication network 90, and the server-side interface 91.

The search unit 5 is a functional unit that searches the point database 1 based on the search conditions and extracts the target point F that matches the search conditions from the point database 1. The search unit 5 searches the point database 1 based on the search conditions, and extracts the target point F that matches the search conditions from the point database 1. In the present embodiment, the search unit 5 is in the case where the search condition includes the place name N of the area A and the attribute C of the target point F, and there are a plurality of areas A of the same place name N in the area database 2. Is a condition preset according to the attribute C, and is a search priority SP of a plurality of areas A based on a priority setting condition using at least one of the scale S of the area A and the position Q of the area A (FIG. 9. (Refer to FIG. 10) is set, and the target point F having the affiliation area information Ia corresponding to the area A having the high search priority SP is prioritized, and the target point F that matches the search condition is searched. Details will be described later.

As described above, the area position information Iq is information indicating the position Q of the representative point G of the area A. The search unit 5 sets the first setting condition in which the search priority SP is set regardless of the scale S of each area A as the priority setting condition, and the search priority SP according to the scale S of each area A. Is selectively used with the second setting condition in which is set. Specifically, in the first setting condition, regardless of the scale S of each area A, it corresponds to the representative distance D which is the distance between the search reference point M which is the reference of the search and the representative point G of each area A. The search priority SP is set. In the second setting condition, the search priority SP is set according to the scale S of each area A and the representative distance D of each area A. In the first embodiment, in the first setting condition, the search priority SP is set so as to increase as the representative distance D becomes shorter, regardless of the scale S of each area A. Further, in the second setting condition, the search priority SP is set so that the representative distance D of each area A becomes higher as the representative distance D becomes shorter and the scale S becomes higher as the scale S becomes larger.

The search reference point M, which is the reference for the search, is, for example, the current position of the moving body 10, but may be a location specified by the user. For example, it may be at home, at work, or at any other designated location. When the search reference point M is set as the current position of the moving body 10, it is preferable that the moving body 10 is provided with the own position specifying portion 7 as shown in FIGS. 1 and 2. Here, as the self-positioning unit 7, a GPS positioning system that receives radio waves from a positioning satellite such as a GPS (Global Positioning System) satellite 70 and acquires coordinate values on the earth is illustrated. Even if the self-positioning unit 7 further identifies the self-positioning in cooperation with a moving distance sensor, a direction sensor, an image recognition system that captures the surroundings of the moving body 10, a wireless communication base station having position information, and the like. good.

The search result output unit 4 outputs information on one or more target points F extracted by the search unit 5. The search result notification unit 8 visually or audibly notifies the user of the information of the target point F extracted by the search unit 5. In the present embodiment, the touch panel 61, which also functions as the search condition input unit 6, illustrates a mode in which the extracted information of one or more target points F is displayed, but a speaker for notifying by voice ( (Not shown) and the like may be provided. When there is a plurality of extracted information on the target point F, the search result output unit 4 outputs the information on the target point F in the order extracted by the search unit 5. The search result notification unit 8 notifies the information of the target point F in the order of output from the search result output unit 4. When the information of a plurality of target points F is displayed, the user selects a matching target point F from the plurality of target points F.

When the point search system 100 is a stand-alone system, the search result notification unit 8 acquires the information of the target point F output from the search result output unit 4. When the point search system 100 is a cloud type system (server / client type system), the information of the target point F output from the search result notification unit 8 of the server 20 is sent to the server side interface 91, the communication network 90, and the mobile body side. The search result notification unit 8 of the moving body 10 on the client side acquires the information via the interface 92.

Hereinafter, the search of the target point F by the search unit 5 and the setting of the search priority SP at the time of the search will be described with reference to FIGS. 5 to 12.

The flowchart of FIG. 5 illustrates a procedure of point search by the point search system 100 (point search method, point search program). When the user sets the search condition, the search condition acquisition unit 3 receives the search condition (# 1: search condition acquisition step / function). When the search condition includes the place name N, the search unit 5 determines whether or not there are a plurality of areas A having the same place name N in the area database 2 (# 2: Search priority necessity determination step / function). When a plurality of areas A having the same place name N exist in the area database 2, the process of determining the search priority SP is executed (# 3: search priority determination step / function). If it is determined in step # 2 that there are not a plurality of areas A having the same place name N in the area database 2, step # 3 is not executed, and the search process for the target point F is executed based on the search conditions (# 4). : Search step / function). When the search priority SP is determined in step # 3, the search process of the target point F is executed in step # 4 based on the search condition and the search priority SP. Note that steps # 2 to step # 4 correspond to search steps / functions in a broad sense executed by the search unit 5. When the target point F is searched in step # 4, the search result output unit 4 outputs the search result (# 6: search result output step / function).

Here, a specific example of step # 3 (search priority determination step / function) will be described with reference to FIGS. 6 to 10. As shown in FIG. 6, in the present embodiment, the search unit 5 may have a target point F that is likely to be an appropriate search target at a short distance according to the attribute of the target point included in the search condition. The priority setting condition is selected from a plurality of conditions based on the sex (# 30J). If there is a high possibility that an appropriate target point F exists at a short distance, the first setting condition is selected (# 30A). If it is unlikely that a suitable target point F exists at a short distance, the second setting condition is selected (# 30B).

As described above, the attribute information Ic includes information indicating urgency according to the purpose of visiting the target point F and a range of travel distances that can be tolerated by a general user according to the purpose of visiting the target point F. Contains information indicating the permissible movement range. When the degree of urgency determined according to the attribute C included in the search condition is equal to or higher than the specified value, the search unit 5 determines that there is a high possibility that an appropriate target point F exists at a short distance, and the second is determined. 1 Use the setting conditions. Further, when the allowable movement range determined according to the attribute C included in the search condition is equal to or larger than the predetermined reference movement range, the search unit 5 may have an appropriate target point F at a short distance. Judging that it is not high, the second setting condition is used.

As described above, information set according to the purpose of visiting the target point F, such as urgency and allowable movement range, is set in association with the attribute C as a search condition. In the present embodiment, these pieces of information are set in association with the classification C1 as the attribute C. For example, information such as "urgency: high" and "allowable movement range: 20 km" is associated with the classification C1 of the "store". Further, for example, information such as "urgency: low" and "allowable movement range: 500 km" is associated with the classification C1 of "hotel". Further, for example, information such as "urgency: low" and "allowable movement range: 30 km" is associated with the classification C1 of "theater". Further, for example, information such as "urgency: low" and "allowable movement range: 1000 km" is associated with classification C1 such as "theme park" and "sightseeing spot".

For example, when the classification included in the search condition is "hotel", the search unit 5 adds the information "urgency: low" and "allowable movement range: 500 km" associated with the classification C1 of the "hotel". Based on this, it is determined that there is no high possibility that an appropriate target point F exists at a short distance, and the second setting condition is selected. Further, when the classification included in the search condition is "store", the search unit 5 adds the information "urgency: high" and "allowable movement range: 20 km" associated with the classification C1 of the "store". Based on this, it is determined that there is a high possibility that an appropriate target point F exists at a short distance, and the first setting condition is selected. Similarly, when the classification included in the search condition is "theater", the search unit 5 provides information such as "urgency: low" and "allowable movement range: 30 km" associated with the classification C1 of the "theater". Based on the above, it is determined that there is a high possibility that an appropriate target point F exists at a short distance, and the first setting condition is selected. Further, when the attributes included in the search conditions are, for example, "theme park" and "sightseeing spot", the search unit 5 has "urgency: low" and "allowable movement range" associated with the classification C1. Based on the information ": 1000 km", it is determined that there is no high possibility that an appropriate target point F exists at a short distance, and the second setting condition is selected.

The search unit 5 selects the second setting condition when the allowable movement range is equal to or greater than the predetermined reference movement range. This reference movement range can be, for example, 100 km or more or 200 km or more. Further, in terms of travel time, for example, it may be in a range that requires 3 hours or more for travel.

For example, the search priority SP can be quantitatively set based on the search score St, which is set so that the search priority SP increases as the score increases. In this case, the search unit 5 sets each search score St of the plurality of areas A based on the priority setting condition according to the attribute C. Here, the search score St is set based on the distance score Sd corresponding to the representative distance D and the scale score Ss corresponding to the scale S of each area A. Since at least one of the distance score Sd and the scale score Ss is set to a different value between the first setting condition and the second setting condition, a search score St different between the first setting condition and the second setting condition can be obtained. Can be set.

In the present embodiment, as described above, in the first setting condition, the search priority SP is set so as to increase as the representative distance D becomes shorter, regardless of the scale S of each area A. Further, in the second setting condition, the search priority SP is set so that the representative distance D of each area A becomes higher as the representative distance D becomes shorter and the scale S becomes higher as the scale S becomes larger. Here, in the first setting condition, only the distance score Sd is used with the scale score Ss set to zero, and in the second setting condition, the search score St is set using the scale score Ss and the distance score Sd (FIG.). 7, FIG. 9, FIG. 10, etc.). In this case, the value of the scale score Ss is different between the first setting condition and the second setting condition.

Not limited to this form, the search score St may be set by multiplying the scale score Ss and the distance score Sd by predetermined coefficients (for example, Ks for the scale score Ss and Kd for the distance score Sd). In the first setting condition, "Ks = 1" and "Kd = 10" are set, and in the second setting condition, "Ks = 1" and "Ks = 1". It may be larger than Ss. In this case, the value of the distance score Sd is different between the first setting condition and the second setting condition.

Further, by setting "Ks = 1" and "Kd = 9" in the first setting condition and "Ks = 5" and "Ks = 5" in the second setting condition, the distance score in the first setting condition is set. The influence of Sd may be greater than the scale score Ss. In this case, the values of the scale score Ss and the distance score Sd are different between the first setting condition and the second setting condition. In this way, at least one of the distance score Sd and the scale score Ss is set to different values in the first setting condition and the second setting condition, so that the search differs between the first setting condition and the second setting condition. The score St can be set.

FIG. 7 shows a procedure in which the scale score Ss is set to zero and only the distance score Sd is used in the first setting condition, and the search score St is set using the scale score Ss and the distance score Sd in the second setting condition. ing. When a predetermined coefficient (Ks, Kd) is used, "Sd (i)" in the flowchart is set to "Kd · Sd (i)" and "Ss (i)" is set to "Ks · Ss (i)". do it. Hereinafter, a case where the search priority SP is set for a plurality of areas A as shown in FIG. 8 will be described as an example.

FIG. 8 illustrates a case where the place name N of the area A is included in the search condition and five areas A of the same place name N exist in the area database 2. That is, the first area A1, the second area A2, the third area A3, the fourth area A4, and the fifth area A5 shown in FIG. 8 are areas A having the same place name N. The first area A1 is an area A having a scale S of "MD", and the position of the representative point G is "Q1". The second area A2 is an area A having a scale S of “SM”, and the position of the representative point G is “Q2”. The third area A3 is an area A having a scale S of “SM”, and the position of the representative point G is “Q3”. The fourth area A4 is an area A having a scale S of "MD", and the position of the representative point G is "Q4". The fifth area A5 is an area A having a scale S of “LG”, and the position of the representative point G is “Q5”.

Further, as for the representative distance D, which is the distance from the search reference point M to each representative point G, the first area A1 is the first representative distance D1, the second area A2 is the second representative distance D2, and the third area A3 is the third. The 3 representative distance D3, the 4th area A4 is the 4th representative distance D4, and the 5th area A5 is the 5th representative distance D5. Here, the first representative distance D1 is "200 km", the second representative distance D2 is "2 km", the third representative distance D3 is "250 km", the fourth representative distance D4 is "150 km", and the fifth representative distance D5 is "". It is "300km". The representative distances D are D2, D4, D1, D3, and D5 in ascending order.

The search condition includes attribute C such as the name C2 of the point and the classification C1 as information regarding the target point F. When "hotel", which is one of the classifications C1 of the attribute C, is included as a search condition, the third target point F3 (position "P3") is set in the third area A3 as the target point F that matches the search condition. "), The second target point F2 (position" P2 ") exists in the fourth area A4, and the fifth target point F5 (position" P5 ") exists in the fifth area A5. When "store", which is one of the classifications C1, is included as a search condition, the first target point F1 (position "P1") existing in the first area A1 is set as the target point F that matches the search condition. ), There is a fourth target point F4 (position "P4") existing in the fifth area A5. Although FIG. 8 also shows a sixth target point F6 (position “P6”), this target point F is a target point F whose classification C1 is “theater” as described above with reference to FIG. Is. Hereinafter, a case where "hotel" is included in the search condition and a case where "store" is included in the search condition will be described as an example.

As shown in FIG. 8, here, there are five areas A having the same place name N to be searched. “N” in step # 30s of the flowchart of FIG. 7 indicates the number of areas A having the same place name N, where “n = 5”. Further, "i" in step # 30s is a number for distinguishing the area A, "i = 1" in step # 30s indicates an initial value of the number, and "1" on the far right is the number 1. It shows that it increases one by one. The flowchart of FIG. 7 shows that the process between step # 30s and step # 30e is repeated 5 times from “i = 1” to “i = n”. That is, it is shown that the processing between step # 30s and step # 30e calculates the search score St of each of the five areas A having the same place name N. Then, in step # 33, the five search scores St (St (i): St (1), St (2), ... St (5)) are rearranged in the order of the scores, and the search priority SP is determined. NS.

Here, as shown in FIG. 8, as the scale score Ss based on the scale information Is, when the scale S is “SM”, it is “10”, when the scale S is “MD”, it is “30”, and the scale S is “ In the case of "LG", "100" is set. In the present embodiment, an embodiment in which the score increases as the numerical value increases is illustrated, but the scale score Ss may be set so that the score increases as the numerical value decreases. This also applies to the distance score Sd and the search score St, which will be described later.

The distance score Sd according to the representative distance D is set to decrease as the representative distance D becomes longer. As described above, the representative distances D of the first area A1 to the fifth area A5 are D2, D4, D1, D3, and D5 in ascending order of the representative distance. Therefore, the distance score Sd of the second area A2 based on the second representative distance D2 is the highest, and the distance score Sd of the fifth area A5 based on the fifth representative distance D5 is the lowest. Here, as shown in FIG. 8, the distance score Sd of the first area A1 having the representative distance D of “200 km” is “20”, and the distance score Sd of the second area A2 having the representative distance D of “2 km” is “100”. , The distance score Sd of the third area A3 with the representative distance D of "250 km" is "10", the distance score Sd of the fourth area A4 with the representative distance D of "150 km" is "30", and the representative distance D is "300 km". The distance score Sd of the fifth area A5 of "" is set to "5".

As shown in FIG. 7, in step # 30A in which the first setting condition is selected, only the distance score Sd is added, and in step # 30B in which the second setting condition is selected, the distance score Sd and the scale score Ss are added. Will be done. Here, first, a case where the search condition includes the classification C1 of "hotel" will be described. As described above, the classification C1 of the "hotel" is associated with information such as "urgency: low" and "allowable movement range: 500 km". Therefore, based on this information, the search unit 5 determines that there is not a high possibility that an appropriate target point F exists at a short distance (FIGS. 6 and 7: # 30J). As a result, the second setting condition is selected, and step # 30B in which the distance score Sd and the scale score Ss are added is executed.

In step # 31 of FIG. 7, which is repeatedly executed in step # 30B in which the second setting condition is selected and executed, the first area is first set as the search score St of the first area A1 corresponding to “i = 1”. The distance score Sd of A1 is added. Next, in step # 32, the scale score Ss of the first area A1 is added to the search score St of the first area A1 to which the distance score Sd is added. The distance score Sd and the scale score Ss are sequentially added to the initial value (for example, zero) of the search score St, and the search score St of the area A is calculated. In the case of the first area A1, "20" is added in step # 31, then "30" is added in step # 32, and the search score St is calculated as "50" (see FIG. 9).

Such processing is sequentially repeated from the first area A1 to the fifth area A5. FIG. 9 shows the representative distance D, the scale S, the distance score Sd, the scale score Ss, the search score St, and the search priority SP of the first area A1 to the fifth area A5. As shown in FIG. 9, the search score St of the first area A1 is "50", the search score St of the second area A2 is "110", the search score St of the third area A3 is "20", and the search score St of the fourth area A4. The search score St of is calculated as "60", and the search score St of the fifth area A5 is calculated as "105".

In step # 33, these five search scores St are rearranged in the order of scores to determine the search priority SP. FIG. 9 illustrates a mode in which the higher the search priority SP, the smaller the value (the search priority SP indicates the search order, and the smaller the value, the faster the search order). Since the highest search score St is "110" in the second area A2, the area A having the highest search priority SP is the second area A2, and the search priority SP in the second area A2 is set to "1". NS. Hereinafter, since the search score St is "105", "60", "50", and "20" in descending order, the search priority SP of the fifth area A5 is "2" and the fourth area according to the search score St. The search priority SP of A4 is set to "3", the search priority SP of the first area A1 is set to "4", and the search priority SP of the third area A3 is set to "5".

The search unit 5 gives priority to the target point F having the affiliation area information Ia corresponding to the area A having the set search priority SP high, and searches for the target point F that matches the search conditions. In other words, the search unit 5 gives priority to the target point F having the affiliation area information Ia corresponding to the area A having the set search score high St, and searches for the target point F that matches the search conditions.

Here, since "hotel" is included in the search condition, the search unit 5 uses the affiliation area information Ia corresponding to the second area A2 from the target points F in which the classification C1 shown in the attribute information Ic is "hotel". Search for the target point F having. As shown in FIG. 8, the corresponding target point F does not exist in the second area A2. Next, the search unit 5 searches for the target point F having the affiliation area information Ia corresponding to the fifth area A5 having the search priority SP of "2" from the target points F whose classification C1 is "hotel". .. Since the fifth target point F5 having the classification C1 of "hotel" exists in the fifth area A5, the fifth target point F5 is extracted. As described above with reference to FIG. 3, the fourth target point F4 existing in the fifth area A5 has a classification C1 of "store", and the sixth target point F6 has a classification C1 of "theater". Neither is extracted.

Next, the target point F having the affiliation area information Ia corresponding to the fourth area A4 having the search priority of "3" is searched. As shown in FIG. 8, since the second target point F2 having the classification C1 of “hotel” exists in the fourth area A4, the second target point F2 is extracted. Next, the target point F having the affiliation area information Ia corresponding to the first area A1 having the search priority of "4" is searched. As shown in FIG. 3, the first target point F1 existing in the first area A1 is not extracted because the classification C1 is “store”. Finally, the target point F having the affiliation area information Ia corresponding to the third area A3 having the search priority of "5" is searched. As shown in FIG. 8, since the third target point F3 having the classification C1 of “hotel” exists in the third area A3, the third target point F3 is extracted.

In this way, the target point F is extracted in the order of the fifth target point F5, the second target point F2, and the third target point F3 based on the search condition and the search priority SP.

In the above description, the search unit 5 exemplifies and describes a mode in which the search unit 5 searches for the target point F having the affiliation area information Ia corresponding to each area A from the target points F in which the classification C1 is “hotel”. bottom. However, the search unit 5 may search the target point F having the attribute information Ic whose classification C1 corresponds to "hotel" in each area A in the order of the search priority SP. In other words, the search unit 5 may search for the target point F that matches the search condition by giving priority to the area A having the set search score St high. In this case, the goodness of fit with the search condition is calculated for all the target points F belonging to each area A. Specifically, as the degree of conformity with the search condition of each target point F, the degree of matching between the attribute specified as the search condition and the attribute C shown in the attribute information Ic of the target point F is the degree of matching of each target point F. Calculated for each.

In this case, the search unit 5 has the target point F having the attribute information Ic in which the classification C1 is "hotel" from the target points F having the affiliation area information Ia of the second area A2 having the search priority SP of "1". Search for F. As described above, since the corresponding target point F does not exist in the second area A2, the target point F is not extracted. Next, the search unit 5 has a target point F having an attribute information Ic whose classification C1 is "hotel" from among the target points F having the affiliation area information Ia of the fifth area A5 having the search priority SP of "2". To search for. Since the fifth target point F5 having the classification C1 of "hotel" exists in the fifth area A5, the fifth target point F5 is extracted. The fourth target point F4 and the sixth target point F6 existing in the fifth area A5 are not extracted together because the classification C1 is “store” and “theater”, respectively.

Next, the target point F having the attribute information Ic whose classification C1 is "hotel" is searched from the target points F having the affiliation area information Ia of the fourth area A4 having the search priority of "3". Since the second target point F2 whose classification C1 is “hotel” exists in the fourth area A4, the second target point F2 is extracted. Next, the target point F having the attribute information Ic whose classification C1 is "hotel" is searched from the target points F having the affiliation area information Ia of the first area A1 having the search priority of "4". The first target point F1 existing in the first area A1 is not extracted because the classification C1 is “store”. Finally, the target point F having the attribute information Ic whose classification C1 is "hotel" is searched from the target points F having the affiliation area information Ia of the third area A3 having the search priority of "5". Since the third target point F3 whose classification C1 is "hotel" exists in the third area A3, the third target point F3 is extracted.

Also in this case, the target points F are extracted in the order of the fifth target point F5, the second target point F2, and the third target point F3 based on the search condition and the search priority SP.

Next, a case where the search condition includes the classification C1 of "store" will be described. As described above, the classification C1 of the "store" is associated with information such as "urgency: high" and "allowable movement range: 20 km". Therefore, based on this information, the search unit 5 determines that there is a high possibility that an appropriate target point F exists at a short distance (FIGS. 6 and 7: # 30J). As a result, the first setting condition is selected, and step # 30A in which only the distance score Sd is added is executed.

In step # 31 of FIG. 7, which is repeatedly executed in step # 30A in which the first setting condition is selected, the distance of the first area A1 is first set as the search score St of the first area A1 corresponding to “i = 1”. The score Sd is added. In step # 30A, since step # 32 is not executed, the distance score Sd is added to the initial value (for example, zero) of the search score St, and the search score St of the area A is calculated. In the case of the first area A1, "20" is added in step # 31, and the search score St is calculated as "20" (see FIG. 10).

Such processing is sequentially repeated from the first area A1 to the fifth area A5. FIG. 10 shows the representative distance D, the scale S, the distance score Sd, the scale score Ss, the search score St, and the search priority SP of the first area A1 to the fifth area A5. As shown in FIG. 10, the search score St of the first area A1 is "20", the search score St of the second area A2 is "100", the search score St of the third area A3 is "10", and the fourth area A4. The search score St of is calculated as "30", and the search score St of the fifth area A5 is calculated as "5".

In step # 33, these five search scores St are rearranged in the order of scores to determine the search priority SP. Since the highest search score St is "100" in the second area A2, the area A having the highest search priority SP is the second area A2, and the search priority SP in the second area A2 is set to "1". NS. Hereinafter, since the search score St is "30", "20", "10", and "5" in descending order, the search priority SP of the fourth area A4 is "2" and the first area according to the search score St. The search priority SP of A1 is set to "3", the search priority SP of the third area A3 is set to "4", and the search priority SP of the fifth area A5 is set to "5".

As described above, the search unit 5 searches for the target point F that matches the search condition by giving priority to the target point F having the affiliation area information Ia corresponding to the area A having the set search priority SP high. In other words, the search unit 5 gives priority to the target point F having the affiliation area information Ia corresponding to the area A having the set search score high St, and searches for the target point F that matches the search conditions.

Here, since the search condition includes "store", the search unit 5 uses the affiliation area information Ia corresponding to the second area A2 from the target points F in which the classification C1 shown in the attribute information Ic is "store". Search for the target point F having. As shown in FIG. 8, the corresponding target point F does not exist in the second area A2. Next, the search unit 5 searches the target point F having the affiliation area information Ia corresponding to the fourth area A4 having the search priority SP of "2" from the target points F whose classification C1 is "store". .. Also in the fourth area A4, there is no target point F whose classification C1 is “store”.

Next, the target point F having the affiliation area information Ia corresponding to the first area A1 having the search priority of "3" is searched. As shown in FIG. 8, since the first target point F1 having the classification C1 of “store” exists in the first area A1, the first target point F1 is extracted. Next, the target point F having the affiliation area information Ia corresponding to the third area A3 having the search priority of "4" is searched. Since the classification C1 of the third target point F3 in the third area A3 is "hotel", the third target point F3 is not extracted. Finally, the target point F having the affiliation area information Ia corresponding to the fifth area A5 having the search priority of "5" is searched. As shown in FIGS. 3 and 8, since the fourth target point F4 having the classification C1 of “store” exists in the fifth area A5, the fourth target point F4 is extracted. The fifth target point F5 existing in the fifth area A5 has a classification C1 of "hotel", and the sixth target point F6 is not extracted together because the classification C1 is "theater".

In this way, the target points F are extracted in the order of the first target point F1 and the fourth target point F4 based on the search condition and the search priority SP. That is, the target points F are extracted in order from the search reference point M.

Similar to the search when the classification C1 is "hotel", in the above, the search unit 5 performs the affiliation area information corresponding to each area A from the target points F whose classification C1 is "store". The form of searching for the target point F having Ia has been illustrated and described. However, the search unit 5 may search the target point F having the attribute information Ic whose classification C1 corresponds to "store" in each area A in the order of the search priority SP. In other words, the search unit 5 may search for the target point F that matches the search condition by giving priority to the area A having the set search score St high. In this case, the goodness of fit with the search condition is calculated for all the target points F belonging to each area A. Specifically, as the degree of conformity with the search condition of each target point F, the degree of matching between the attribute specified as the search condition and the attribute C shown in the attribute information Ic of the target point F is the degree of matching of each target point F. Calculated for each. Since a specific example is the same as the search for "hotel", a detailed description will be omitted.

By the way, in the above, the form in which the search priority SP is set so that the area A having a large scale S is higher than the area A having a small scale S, for example, the area A having a large scale S is higher. An example is shown in which the scale score Ss is set so as to be higher than the area A where the scale S is small. For example, as shown by the solid line in FIG. 11, the scale score Ss can be set to increase in proportion to the scale S from the minimum set value (min) to the maximum set value (max). Alternatively, as shown by the broken line or the alternate long and short dash line in FIG. 11, the scale S is set to increase from the minimum set value (min) to the maximum set value (max) in a non-linear relationship with respect to the scale S. can do.

Further, in the above, the area database 2 stores information indicating the scale S as the scale information Is, and the search unit 5 sets the scale score Ss according to the scale S. However, the scale score Ss may be stored as the scale information Is in the area database 2. Further, in the above, the scale information Is is stored as qualitative information such as "SM", "MD", and "LG", and the value corresponding to the qualitative information is set as the scale score Ss in the search unit 5. The morphology was illustrated. However, quantitative information such as area, population, population density, number of target points, target point density, and number of visitors representing the scale S is stored in the area database 2 as scale information Is, and these quantitative scale information Is. Based on the above, the scale score Ss may be set by calculation in the search unit 5.

Further, in the above, the embodiment in which the distance score Sd is set so as to decrease as the representative distance D becomes longer is illustrated. This distance score Sd can also be set to be lower in proportion to the representative distance D from the maximum set value (max) to the minimum set value (min), for example, as shown by the solid line in FIG. Alternatively, as shown by the broken line or the alternate long and short dash line in FIG. 12, the value from the maximum set value (max) to the minimum set value (min) is non-linear with respect to the representative distance D, and becomes lower as the representative distance D becomes longer. Can be set to.

Further, in the above embodiment, the configuration in which the information on the urgency and the allowable movement range is set in relation to the classification C1 has been described as an example, but the present invention is not limited to this. In addition to the classification C1, information on the urgency and the allowable movement range may be set in association with the attribute C that can be a search condition. For example, information on urgency and allowable movement range may be set in association with the name C2 as attribute C. In this case, for example, it is preferable that the name C2 of a famous tourist spot, a popular restaurant, etc. is set in association with information such as "urgency: low" and "allowable movement range: 500 km". .. Further, when the attribute information Ic indicating the scale of the facility to be the target point F is stored in the point database 1 as the attribute C, the urgency and allowable movement range information is set in association with the scale. May be good. In this case, for example, information such as "urgency: low" and "allowable movement range: 200 km" is associated with a large-scale facility, and "urgency: high" and "allowable" are associated with a small-scale facility. It is preferable that information such as "moving range: 10 km" is associated and set.

Further, in the above embodiment, the configuration in which the search unit 5 selectively uses the first setting condition and the second setting condition as the priority setting condition has been described as an example, but the present invention is not limited to this. The search unit 5 may be configured to select an appropriate priority setting condition from three or more priority setting conditions according to the attribute C included in the search condition. For example, a corresponding priority setting condition may be set for each of the attributes C (for example, classification C1) that can be a search condition. In this case, the search unit 5 sets the priority setting condition according to the attribute C included in the search condition without determining the urgency or the allowable movement range according to the attribute C included in the search condition. select.

[Outline of Embodiment]
Hereinafter, the outline of the point search system (100), the point search method, and the point search program described above will be briefly described.

As one aspect, the point search system (100) has a position information (Ip) indicating each position (P) of a plurality of target points (F) to be searched, and an area (F) in which the target points (F) exist. A point database (1) that stores the affiliation area information (Ia) indicating A) and the attribute information (Ic) indicating the attribute (C) of the target point (F), and each of the plurality of the areas (A). Place name information (In) indicating the place name (N), scale information (Is) indicating the scale (S) of the area (A), and area position information (Iq) indicating the position (Q) of the area (A). The area database (2) to be stored, the search condition acquisition unit (3) that receives the search condition, and the target point (F) that searches the point database (1) based on the search condition and matches the search condition. The search unit (5) includes a search unit (5) that extracts When the attribute (C) is included and a plurality of the areas (A) having the same place name (N) exist in the area database (2), they are set in advance according to the attribute (C). A plurality of search priorities (SP) of the area based on the priority setting condition using at least one of the scale (S) of the area (A) and the position (Q) of the area (A). ) Is set, and the target point (F) having the affiliation area information (Ia) corresponding to the area (A) having a high search priority (SP) is prioritized, and the target matching the search condition is satisfied. Search for point (F).

According to this configuration, when the area (A) of the same place name (N) includes a plurality of place names (N) included in the area database (2) in the search condition, the priority is appropriately given to the plurality of areas (A). The target point (F) can be searched by adding. Even if the place name (N) is the same, the scale (S) may be different in each area (A). The area (A) having a large scale (S) generally tends to have a large number of target points (F) included in the area (A), and the target points (F) that are appropriate search targets are included accordingly. It is also more likely that you will be affected. Further, since the area (A) having a large scale (S) is often more famous than the area (A) having a small scale (S), the place name (N) specified by the user as a search target is also the scale (S). It is highly probable that the area (A) with a large) is assumed. On the other hand, as a matter of course, the time required to move to each area (A) also differs depending on the position of each area (A). If you want to arrive at the target point (F) early, it is preferable that the travel time is short. Whether or not the travel time to the target point (F) is emphasized depends on the purpose of the user's visit to the target point (F). The purpose of such a user's visit can be estimated based on the attribute (C) of the target point (F) included in the search condition. According to this configuration, a plurality of conditions set in advance according to the attribute (C) based on a priority setting condition using at least one of the scale (S) and the position (Q) of the area (A). The search priority (SP) of the area (A) is set, and the target point (F) is searched according to the search priority (SP). Therefore, it is possible to preferentially search for an appropriate target point (F) according to the purpose of the visit estimated based on the attribute (C) of the target point (F) included in the search condition. That is, according to this configuration, even if there are a plurality of place names (N) having the same name as the place name (N) related to the point to be searched, the target point (N) with a high possibility of being an appropriate search target ( F) can be searched preferentially.

The technical features of the point search system (100) described above can also be applied to a point search method and a point search program. A typical embodiment thereof will be illustrated below. For example, the point search method can have various steps having the features of the point search system (100). Further, the point search program can realize various functions having the features of the above-mentioned point search system (100) on the computer. As a matter of course, these methods and programs can also exert the effects of the above-mentioned point search system (100). Further, as a preferred embodiment of the point search system (100), various additional features illustrated below can also be incorporated into these point search methods and point search programs, and the methods and the programs are each added. It is also possible to play an action effect corresponding to a specific feature.

As one preferred embodiment, the point search method includes position information (Ip) indicating the respective positions (P) of a plurality of target points (F) to be searched, and an area (A) in which the target points (F) exist. ), A point database (1) that stores the attribute information (Ic) indicating the attribute (C) of the target point (F), and the place names of each of the plurality of the areas (A). Stores place name information (In) indicating (N), scale information (Is) indicating the scale (S) of the area (A), and area position information (Iq) indicating the position (Q) of the area (A). A point search method for searching the target point (F) using the area database (2) to be performed, the search condition acquisition step (# 1) for receiving the search condition, and the point database based on the search condition. A search step (# 5) for searching (1) and extracting the target point (F) matching the search condition from the point database (1) is provided, and the search step (# 5) includes the search step (# 5). When the search condition includes the place name (N) of the area (A) and the attribute (C) of the target point (F), the area (A) of the same place name (N) is the area database. When there are a plurality of them in (2), at least the scale (S) of the area (A) and the position (Q) of the area (A) are set in advance according to the attribute (C). The search priority (SP) of a plurality of the areas (A) is set based on the priority setting condition using one of them, and the affiliation area information corresponding to the area (A) having a high search priority (SP) is set. Priority is given to the target point (F) having (Ia), and the target point (F) that matches the search condition is searched.

Further, as one preferred embodiment, the point search program has a position information (Ip) indicating each position (P) of a plurality of target points (F) to be searched, and an area in which the target point (F) exists. A point database (1) that stores affiliation area information (Ia) indicating (A), attribute information (Ic) indicating the attribute (C) of the target point (F), and a plurality of the areas (A), respectively. Place name information (In) indicating the place name (N), scale information (Is) indicating the scale (S) of the area (A), and area position information (Iq) indicating the position (Q) of the area (A). A point search program that allows a computer to realize a function of searching for the target point (F) using an area database (2) that stores search conditions, and a search condition acquisition function (# 1) that receives search conditions, and the above. A computer is realized with a search function (# 5) that searches the point database (1) based on the search conditions and extracts the target points (F) that match the search conditions from the point database (1). In the search function (# 5), the search condition includes the place name (N) of the area (A) and the attribute (C) of the target point (F), and the same place name (N). When a plurality of the areas (A) of the above area (A) exist in the area database (2), the scale (S) of the area (A) and the above-mentioned are the conditions set in advance according to the attribute (C). The search priority (SP) of a plurality of the areas (A) is set based on the priority setting condition using at least one of the positions (Q) of the area (A), and the search priority (SP) is high. The target point (F) having the affiliation area information (Ia) corresponding to the area (A) is prioritized, and the target point (F) matching the search condition is searched.

Further, in the point search system (100), the area position information (Iq) is information indicating the position (Q) of the representative point (G) of the area (A), and the search unit (5) is the information. As a priority setting condition, regardless of the scale (S) of each of the areas (A), the search reference point (M) which is the reference of the search and the representative point (G) of each of the areas (A) The first setting condition in which the search priority (SP) is set so that the representative distance (D), which is a distance, becomes higher as the distance becomes shorter, and the representative distance (D) in each of the areas (A) becomes shorter. It is preferable to selectively use the second setting condition in which the search priority (SP) is set so as to increase as the scale (S) increases as the scale (S) increases.

According to this configuration, the representative distance (D) between the search reference point (M) and the area (A) is also taken into consideration according to the attribute (C) of the target point (F) included in the search condition. , The target point (F) can be searched by setting the search priority (SP) more appropriately. When the first setting condition is selected, the target point (F) close to the search reference point (M) is preferentially searched, so those who emphasize that the travel time is short according to the purpose of the user's visit. It is possible to preferentially extract the target point (F) that requires a short travel time when it is assumed that is good. On the other hand, when the second setting condition is selected, priority is given to the target point (F) which is likely to be an appropriate search target in a wider range including the target point (F) where the travel time is long. Can be extracted as a target.

Further, the attribute (C) is associated with information indicating urgency according to the purpose of visiting the target point (F), and the search unit (5) includes the attribute (C) included in the search condition. ) Is greater than or equal to the specified degree of urgency, it is preferable to use the first setting condition.

When the degree of urgency is above the specified level, the user often wants to arrive at the target point (F) early. Therefore, in this case, the first setting condition is selected, and the target point (F) close to the search reference point (M) is preferentially searched, so that the target point (F) that can arrive early is selected. It can be extracted preferentially.

Further, the attribute (C) is associated with information indicating an allowable movement range which is a range of the allowable movement distance for a general user according to the purpose of visiting the target point (F), and the search unit. In (5), when the permissible movement range determined according to the attribute (C) included in the search condition is equal to or larger than a predetermined reference movement range, it is preferable to use the second setting condition. ..

The permissible range of movement of the user varies depending on the purpose of visiting the target point (F). For example, when the purpose of the visit is daily, such as shopping for groceries or refueling, the permissible range of movement is relatively narrow. On the other hand, when the purpose of the visit is very important, such as sightseeing or accommodation, the permissible range of movement is relatively wide. For example, when visiting a theme park, outlet mall, hotel, etc., there is a high possibility that a long travel time will be tolerated. According to this configuration, the second setting condition is selected when the permissible movement range determined according to the attribute (C) included in the search condition is equal to or larger than the predetermined reference movement range. Therefore, in such a case, the search priority (SP) is set based on both the scale (S) and the representative distance (D), including the target point (F) where the travel time becomes long. , It is possible to preferentially extract the target points (F) that are likely to be appropriate search targets in a wider range.

Further, when the attribute information (Ic) includes information indicating the allowable movement range and the allowable movement range is equal to or larger than the reference movement range, the search unit (5) sets the second setting condition. When used, the permissible movement range increases as the number of target points (F) having the same attribute (C) in the same point database (1) decreases, as the rarity increases. It is preferable that it is set to be wide.

Since the target point (F) having low shortage has a high frequency of existence, it is highly likely that the user will arrive early, and it is preferable to search using the first setting condition. On the other hand, since the target point (F) having a high rarity has a low frequency of existence, there is a high possibility that the user will move even if it takes time, and it is preferable to search using the second setting condition. By setting the permissible movement range according to the rarity, the search unit (5) appropriately selects the first setting condition and the second setting condition according to the purpose of visiting the target point (F). be able to.

Further, the search unit (5) sets each search score (St) of the plurality of the areas (A) based on the priority setting condition according to the attribute (C), and the search priority. (SP) is set so as to increase as the search score (St) increases, and the search score (St) includes a distance score (Sd) corresponding to the representative distance (D) and the respective areas. The scale score (Ss) according to the scale of (A) is set based on, and at least one of the distance score (Sd) and the scale score (Ss) is the first setting condition and the second setting condition. It is preferable that the values are set differently from and above.

According to this configuration, a quantitative search score (St) is set by a quantitative distance score (Sd) and a scale score (Ss), and a search priority (St) is appropriately used based on the search score (St). SP) can be set. Further, by making at least one of the distance score (Sd) and the scale score (Ss) different, the first setting condition and the second setting condition are set as appropriate setting conditions differentiated from each other. be able to.

Further, it is preferable that the point search system (100) includes a search result output unit (4) that outputs information of one or more target points (F) extracted by the search unit (5).

By providing the search result output unit (4), the extraction result of the target point (F) can be appropriately output.

Further, it is preferable that the search result output unit (4) outputs the information of the target point (F) in the order extracted by the search unit (5).

As described above, the point search system (100) can preferentially search the target point (F), which is likely to be an appropriate search target, by setting the search priority (SP). The search result output unit (4) outputs information on the target points (F) in the order extracted by the search unit (5), so that the target points (F) that are likely to be appropriate search targets are prioritized. It is possible to output to.

1: Point database 2: Area database 3: Search condition acquisition unit 4: Search result output unit 5: Search unit 100: Point search system A: Area C: Attribute D: Representative distance F: Target point G: Representative point Ia: Affiliation Area information Ic: Attribute information In: Place name information Ip: Location information Iq: Area location information Is: Scale information M: Search reference point N: Place name S: Scale SP: Search priority Sd: Distance score Ss: Scale score St: Search Score

Claims (10)

A point database that stores position information indicating the position of each of a plurality of target points to be searched, affiliation area information indicating the area where the target point exists, and attribute information indicating the attributes of the target point.
An area database that stores place name information indicating the place name of each of the plurality of areas, scale information indicating the scale of the area, and area location information indicating the position of the area.
The search condition acquisition department that receives search conditions and
A search unit that searches the point database based on the search conditions and extracts the target points that match the search conditions from the point database is provided.
When the search condition includes the place name of the area and the attribute of the target point, the search unit responds to the attribute when a plurality of the areas having the same place name exist in the area database. The search priority of a plurality of the areas is set based on the priority setting condition using at least one of the scale of the area and the position of the area, which is a preset condition, and the search priority is high. A point search system that searches for the target point that matches the search condition by giving priority to the target point having the affiliation area information corresponding to the area. The area position information is information indicating the position of a representative point of the area.
As the priority setting condition, the search unit increases as the representative distance, which is the distance between the search reference point as the search reference and the representative point of each of the areas, becomes shorter regardless of the scale of each of the areas. The first setting condition in which the search priority is set so as to be high, and the search priority is set so as to be higher as the representative distance of each of the areas is shorter and higher as the scale is larger. The point search system according to claim 1, wherein the second setting condition and the second setting condition are selectively used. Information indicating urgency according to the purpose of visiting the target point is associated with the attribute.
The point search system according to claim 2, wherein the search unit uses the first setting condition when the degree of urgency determined according to the attribute included in the search condition is equal to or higher than a specified value. The attribute is associated with information indicating an allowable travel range, which is a range of travel distances acceptable to a general user according to the purpose of visiting the target point.
The second setting condition is used when the allowable movement range determined according to the attribute included in the search condition is equal to or larger than a predetermined reference movement range, according to claim 2. Point search system. 4. The permissible movement range is set so as to increase as the rarity increases in accordance with the rarity that increases as the number of target points having the same attribute in the point database decreases. The point search system described in. The search unit sets a search score for each of the plurality of areas based on the priority setting condition according to the attribute.
The search priority is set to increase as the search score increases.
The search score is set based on a distance score according to the representative distance and a scale score according to the scale of each of the areas.
The point search system according to any one of claims 2 to 5, wherein at least one of the distance score and the scale score is set to a different value between the first setting condition and the second setting condition. The point search system according to any one of claims 1 to 6, further comprising a search result output unit that outputs information on one or more of the target points extracted by the search unit. The point search system according to claim 7, wherein the search result output unit outputs information on the target points in the order extracted by the search unit. A point database that stores position information indicating the position of each of a plurality of target points to be searched, affiliation area information indicating the area where the target point exists, and attribute information indicating the attributes of the target point.
A point search for searching the target point using a place name information indicating the place name of each of the plurality of areas, a scale information indicating the scale of the area, and an area database storing the area position information indicating the position of the area. It ’s a method,
Search condition acquisition step to receive search condition and
A search step of searching the point database based on the search condition and extracting the target point matching the search condition from the point database is provided.
In the search step, when the search condition includes the place name of the area and the attribute of the target point, and there are a plurality of the areas having the same place name in the area database, the attribute is used. The search priority of a plurality of the areas is set based on the priority setting condition using at least one of the scale of the area and the position of the area, which is a preset condition, and the search priority is high. A point search method for searching for the target point that matches the search condition by giving priority to the target point having the affiliation area information corresponding to the area. A point database that stores position information indicating the position of each of a plurality of target points to be searched, affiliation area information indicating the area where the target point exists, and attribute information indicating the attributes of the target point.
A function for searching the target point using a place name information indicating each place name of the plurality of areas, a scale information indicating the scale of the area, and an area database storing area position information indicating the position of the area. It is a point search program that can be realized on a computer.
Search condition acquisition function to receive search conditions and
A computer is realized with a search function that searches the point database based on the search conditions and extracts the target points that match the search conditions from the point database.
In the search function, when the search condition includes the place name of the area and the attribute of the target point, and the area having the same place name exists in the area database more than once, the search function corresponds to the attribute. The search priority of a plurality of the areas is set based on the priority setting condition using at least one of the scale of the area and the position of the area, which is a preset condition, and the search priority is high. A point search program that searches for the target point that matches the search condition by giving priority to the target point having the affiliation area information corresponding to the area.

Images