JP2016148881A - Information processing device, information processing method and program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To solve the problem in which conventionally, an attractive spot cannot be proposed.SOLUTION: An attractive spot can be proposed by an information processing device that comprises: a map information storage unit that can store map information having more than one spot information having a spot identifier and spot location information on a spot; a spot attractiveness level information storage unit that can store a level of dynamic attractiveness for each user which is a level of attractiveness of the spot different depending upon the user for each of more than one spot; a departure point reception unit that receives departure point information; a destination information reception unit that receives destination information; a drop-in candidate spot determination unit that determines one or more than two spots that are close in location in such a way that a location condition predetermined from the departure point or destination is satisfied, and more than one spot great in level of dynamic attractiveness for each user in such a way that a predetermined attractiveness-level condition is satisfied; and a spot relevant information output unit that outputs spot relevant information on more than one spot determined by the drop-in candidate spot determination unit.SELECTED DRAWING: Figure 1

Description

  The present invention relates to an information processing apparatus and the like that recommends a spot on a detour.

  Conventionally, there has been a technique for searching for detour facilities (see, for example, Patent Document 1). This technique is a detour facility search device for searching for detour facilities in a target area, a point designation unit for designating a movement start point and a destination point, information associated with the movement start point, and the destination point An extension degree variable setting unit that variably sets the extension degree of the target area in a direction substantially perpendicular to a straight line connecting the movement start point and the destination point, and the movement start point, A detour facility search apparatus comprising: a target area setting unit that sets the target area based on the destination point and the degree of expansion.

  Conventionally, there has been a technique for presenting a user with a route to stop at a spot that the user may be interested in (see, for example, Patent Document 2). This technology is an in-vehicle navigation device that is mounted on a vehicle and is connected to an external server device in which spot information related to recommended stop spots is registered as needed, and performs route guidance. The spot information is acquired from the server device via a communication network, and a doorway guidance route to the destination of route guidance is presented from a current vehicle position via a recommended stop spot corresponding to the spot information.

JP2013-137238A (first page, FIG. 1 etc.) JP 2010-210339 A (first page, FIG. 1 etc.)

  However, in the prior art, an attractive spot could not be proposed.

  The information processing apparatus according to the first aspect of the present invention includes a map information storage unit capable of storing map information having one or more spot information having a spot identifier for identifying a spot and spot position information indicating the position of the spot; A spot attractiveness information storage unit that can store, for each of one or more spots, a user-specific dynamic attractiveness that is an attractiveness of a spot that changes depending on the user, and a departure indicating a departure place The departure point reception unit that receives the destination information, the destination reception unit that receives the destination information indicating the destination, and the location indicated by the departure point information or the destination indicated by the destination information are close enough to satisfy a predetermined position condition. A detour candidate spot that determines one or more spots that are one or two or more spots, and that have a dynamic attractiveness per user that satisfies a predetermined attractiveness degree. And preparative determination unit, an information processing apparatus for and a spot related information outputting section detour candidate spot determining section outputs a spot related information about one or more spots were determined.

  With this configuration, an attractive spot can be proposed.

  Further, in the information processing apparatus according to the second invention, in contrast to the first invention, the spot attractiveness information storage unit includes one or more spots that dynamically change the dynamic attractiveness per user, the spot identifier, and the spot. One or more spot attractiveness information having a dynamic attribute value is stored, and further includes a user information storage unit capable of storing one or more dynamically changing one or more user dynamic attribute values of the user. The per-user dynamic attractiveness is an information processing apparatus that is a value calculated using one or more spot dynamic attribute values and one or more user dynamic attribute values.

  With this configuration, a truly attractive spot can be proposed.

  In addition, the information processing apparatus according to the third aspect of the invention relates to one or more spots among the one or more spots determined by the detour candidate spot determination unit using the map information with respect to the first or second aspect. As a relay point, a route search unit that acquires route information and cost for specifying one or more routes from a departure point indicated by departure point information to a destination indicated by destination information, and one or more acquired by the route search unit Each user's dynamic attractiveness acquisition unit for acquiring the dynamic attractiveness for each user corresponding to the spot of one or more relay points on each route information from the spot attractiveness information storage unit, and one or more acquired by the route search unit A virtual cost calculation unit that calculates a virtual cost that becomes smaller as the degree of dynamic attractiveness for each user corresponding to each route information is larger than the cost corresponding to each route information. Output section is temporary An information processing apparatus that outputs spot related information related to one or more spots that are relay points of a route indicated by one or more pieces of route information using a virtual cost corresponding to one or more pieces of route information calculated by a cost calculation unit. is there.

  With this configuration, a truly attractive spot can be proposed.

  In addition, the information processing apparatus according to the fourth aspect of the present invention, in contrast to the third aspect, includes one or more pieces of route information acquired by the route search unit using one or more virtual costs calculated by the virtual cost calculation unit. A route narrowing unit that obtains one or more pieces of route information that are part of the route information, and the spot related information output unit includes a virtual cost corresponding to each of the one or more pieces of route information obtained by the route narrowing unit. Is used to output spot related information relating to one or more spots that are relay points of the route indicated by one or more pieces of route information.

  With such a configuration, a truly attractive spot can be effectively proposed.

  In the information processing apparatus according to the fifth aspect of the present invention, the dynamic attractiveness for each user includes the spot specificity for the user, and the specificity is determined by the user. It is an information processing apparatus that is a value that decreases when a visit is made.

  With this configuration, a truly attractive spot can be proposed on the route to the destination.

  The information processing apparatus according to the sixth aspect of the present invention is a visit information receiving unit for receiving visit information indicating that the user has visited a spot, which is information having a spot identifier with respect to the fifth aspect, and visit information. When the reception unit receives the visit information, the new user's dynamic attractiveness of the spot is calculated so as to reduce the dynamic attractiveness of each user who is paired with the spot identifier included in the visit information. The information processing apparatus further includes a calculation unit.

  With this configuration, a truly attractive spot can be proposed.

  Further, in the information processing apparatus according to the seventh aspect of the invention, in contrast to the second aspect, the spot attractiveness information storage unit has 1 dynamic attractiveness per user, a spot identifier, and one or more attribute values of spots. The above-described spot attractiveness information is stored, and the user information storage unit stores user information having one or more attribute values of the user, including user preference information related to the user's preference for the spot, A search result acquisition unit that performs a Web search and acquires a search result, and a context information acquisition unit that acquires one or more context information among day, time, and weather, and performs a Web search and performs each of the one or more A user evaluation information search unit that acquires user evaluation information related to user evaluation corresponding to the spot identifier, one or more attribute values of the spot, one or more attribute values of the user, a user A spot attractiveness is further provided with a dynamic attractiveness calculating unit for each user that calculates the dynamic attractiveness for each user of each of the one or more spots using the good information, the search result, the one or more context information, and the user evaluation information. The per-user dynamic attraction included in one or more pieces of spot attraction information in the degree information storage unit is an information processing apparatus that is the per-user dynamic attraction calculated by the per-user dynamic attraction calculation unit.

  With this configuration, a truly attractive spot can be proposed.

  Further, in the information processing apparatus according to the eighth aspect of the invention, in contrast to the seventh aspect of the invention, the user-specific dynamic attractiveness calculation unit calculates the user interest degree for the spot using the user preference information. A means for calculating the freshness of each spot using the means, a freshness calculating means for calculating the freshness of the spot using the search result, and one or more context information and the attribute value of each spot. Using the calculation means, the specificity calculation means for calculating the spot specificity for the user using the user attribute value and the spot attribute value, and one or more user evaluation information acquired by the user evaluation information search unit A spot evaluation value calculating means for calculating a spot evaluation value which is an evaluation value of one or more spots, one or more attribute values of the user, and one or more attribute values corresponding to the one or more spots It uses two or more means among the user matching degree calculation means for calculating the user matching degree that is the degree of matching between the spot and the user, and the user interest level, freshness level, ability display level, specificity level The information processing apparatus includes a per-user dynamic attraction calculation unit that calculates a per-user dynamic attraction for each spot using two or more values among the spot evaluation value and the user matching degree.

  With this configuration, a truly attractive spot can be proposed.

  Further, the information processing apparatus according to the ninth aspect of the present invention is a route from the departure point indicated by the departure point information to the destination indicated by the destination information with respect to any one of the first to eighth aspects, and has the highest cost. The route search unit further acquires route information of a small route, or the route search unit is a route from the departure point indicated by the departure point information to the destination indicated by the destination information, and indicates the route with the lowest cost. The minimum cost route information is also acquired, and the spot related information output unit includes a required time of a route passing through one or more spots determined by the detour candidate spot determining unit and a required time of the route indicated by the minimum cost route information An information processing apparatus that outputs related information.

  With such a configuration, information on a truly attractive spot can be presented in an easily understandable manner.

  Further, in the information processing apparatus according to the tenth aspect of the invention, in contrast to the first aspect, the spot attractiveness information storage unit is configured so that the attractiveness of a spot that dynamically changes for each user and for each of one or more spots And stores the dynamic attractiveness of each user, which is the attractiveness of the spot that varies depending on the user, the departure place receiving unit receives departure place information from the terminal device, and the destination receiving unit receives from the terminal device. The spot-related information output unit is an information processing device that receives destination information and a user identifier for identifying the user, and transmits the spot-related information to the terminal device.

  With this configuration, an attractive spot can be proposed.

  The information processing apparatus according to the present invention can propose attractive spots.

Block diagram of information processing apparatus 1 according to Embodiment 1 The flowchart explaining the operation | movement which the information processing apparatus 1 outputs spot relevant information. Flowchart explaining the detour candidate spot determination process Flowchart explaining the virtual cost calculation process Flowchart explaining the same-user dynamic attractiveness calculation processing Flow chart explaining the user interest level acquisition process Flow chart explaining the freshness acquisition process Flow chart for explaining the ability level acquisition process Flowchart explaining the same specificity acquisition processing Flowchart for explaining the spot evaluation value acquisition process Flowchart explaining the same user match level acquisition process Figure showing the question related information management table Figure showing the initial interest level management table Figure showing the same spot usage count management table Figure showing the usage count management table by category The figure which shows the example of the screen which inputs the reply information to the question The figure which shows the same way candidate information management table The figure which shows the output example of the spot related information The figure which shows the output example of the spot related information Block diagram of the information system Overview of the computer system Block diagram of the computer system

  Hereinafter, embodiments of an information processing apparatus and the like will be described with reference to the drawings. In addition, since the component which attached | subjected the same code | symbol in embodiment performs the same operation | movement, description may be abbreviate | omitted again.

(Embodiment 1)
In the present embodiment, an information processing device that proposes a spot that detours to a user by using the dynamic attractiveness of each spot, which is the attractiveness of a spot that varies dynamically depending on the user. explain.

  In the present embodiment, each user's dynamic attractiveness is one or two types of spot dynamic attribute values, spot static attribute values, user dynamic attribute values, and user static attribute values. It is calculated using the above attribute values.

  Further, in the present embodiment, an information processing apparatus capable of outputting one or more routes taking into account arrival time or distance to a destination and one or more spots of detour candidates will be described.

  Further, in the present embodiment, X peripheral spots are acquired, one or more routes having the X peripheral spots as relay points are searched, the cost of each of the one or more routes is acquired, and each user dynamically An information processing apparatus that corrects the cost of each of one or more routes using the attractiveness degree and outputs Y spot information with the highest virtual cost using the corrected virtual cost will be described.

  Further, in the present embodiment, an information processing apparatus that includes the user's dynamic attractiveness including the spot's specificity for the user and reduces the specificity of the visited spot using the visit history of the user's spot will be described. .

  Further, in the present embodiment, the user's dynamic attractiveness is set as the user interest degree for the spot, the freshness of the spot, the ability of the spot, the specificity of the spot for the user, the spot evaluation value of the spot, the spot and the user An information processing apparatus that uses two or more degrees (appropriately referred to as “characteristic values”) of the degree of coincidence that is the degree of coincidence with the information processing apparatus will be described. Details of each characteristic value will be described later.

  Furthermore, in the present embodiment, an information processing apparatus that outputs an increase time for each detour spot compared to the shortest route will be described.

  FIG. 1 is a block diagram of an information processing apparatus 1 in the present embodiment.

  The information processing apparatus 1 includes a storage unit 11, a reception unit 12, a processing unit 13, and an output unit 14.

  The storage unit 11 includes a map information storage unit 111, a user information storage unit 112, and a spot attractiveness information storage unit 113.

  The reception unit 12 includes a departure point reception unit 121, a destination reception unit 122, and a visit information reception unit 123.

  The processing unit 13 includes a detour candidate spot determination unit 131, a route search unit 132, a user-specific dynamic attractiveness acquisition unit 133, a virtual cost calculation unit 134, a route narrowing unit 135, a search result acquisition unit 136, and a context information acquisition unit 137. , A user evaluation information search unit 138, and a dynamic attractiveness calculation unit 139 for each user.

    The user-specific dynamic attractiveness calculating unit 139 includes a user interest level calculating unit 1391, a freshness level calculating unit 1392, an ability display level calculating unit 1393, a specificity level calculating unit 1394, a spot evaluation value calculating unit 1395, and a user matching level calculating unit 1396. , And a dynamic attractiveness calculating means 1397 for each user. The user-specific dynamic attractiveness calculating unit 139 includes a user interest level calculating unit 1391, a freshness level calculating unit 1392, an ability display level calculating unit 1393, a specificity level calculating unit 1394, a spot evaluation value calculating unit 1395, and a user matching level calculating unit 1396. Among these, one or more means are provided.

  The output unit 14 includes a spot related information output unit 141.

  The storage unit 11 can store various types of information. The various information includes, for example, map information, user information, spot attractiveness information, one or more pieces of question information, which will be described later. The question information is information constituting a question to the user.

  The map information storage unit 111 can store map information. Map information is information relating to a map. The map information has one or more spot information. The spot information includes a spot identifier for identifying the spot and spot position information indicating the position of the spot. A spot may be called a point. A spot is, for example, a store such as a spot, a scenic spot, a park, or a restaurant. The spot identifier may be information that identifies a spot, such as a spot name or ID. The spot position information is usually (latitude, longitude), but may be any information that can identify the position, such as relative coordinate information (x, y) on the map. Maps include, for example, topographic maps, topographic maps, geological maps, land use maps, housing maps, route maps, road maps, guide maps, aerial photographs and satellite photographs that can understand topographical features, roads, etc. Etc. are filled in. The map information includes, for example, map image information. The image information is, for example, raster data or vector data. When the image information is raster data, the map information may have image information corresponding to a plurality of scales. The image information corresponding to a plurality of scales includes, for example, image information with a large scale, medium-scale image information, and image information with a small scale for the same area. The map information may be obtained by dividing the map into tiles. The map information may be in the KIWI format used in car navigation. The data format of map information is not limited.

  The user information storage unit 112 can store user information. The user information has one or more attribute values of the user. Preferably, the one or more attribute values include one or more user dynamic attribute values that change dynamically. The user dynamic attribute value is, for example, user preference information related to the user's preference for spots. The user preference information is, for example, a category identifier that identifies a category of a spot of interest. The user dynamic attribute value is, for example, a spot identifier of one or more visited spots. The user dynamic attribute value is, for example, a set of a spot identifier and the number of visits (number of uses). The user dynamic attribute value is, for example, a set of a category identifier of a category of one or more spots visited and the number of times of visiting the spot of the category (number of uses). The one or more attribute values may include a user static one or more user static attribute values. The user static attribute value is, for example, sex, age, address, hometown, occupation, and the like. The user preference information is, for example, information indicating whether or not there is an interest in a spot category. The user preference information is, for example, information indicating whether or not the spot category is disliked. User preference information is information which has the frequency | count that one or more each spot visited, for example. That is, the user preference information includes, for example, one or more sets of a spot identifier for identifying a spot and the number of times of stoppage.

  The spot attractiveness information storage unit 113 can store the dynamic attractiveness for each user for each of one or more spots. The dynamic attractiveness for each user is an attractiveness of a spot that dynamically changes, and is an attractiveness of a spot that varies depending on the user.

  The spot attractiveness information storage unit 113 may store one or more pieces of spot attractiveness information. The spot attractiveness information includes a dynamic attractiveness for each user, a spot identifier, and one or more attribute values of the spot. The spot attractiveness information may have a freshness expiration date indicating the expiration date of the freshness of the spot and a category identifier indicating the category of the spot. Further, the one or more attribute values of the spot are one or more attribute values of the spot identified by the spot identifier. Further, it is preferable that one or more attribute values of the spot have spot dynamic attribute values that dynamically change the spot. The spot dynamic attribute value is, for example, a spot freshness, a spot user evaluation value, and the like, which will be described later. The one or more attribute values of the spot include, for example, a static spot static attribute value of the spot. The spot static attribute value is, for example, a spot category. The spot static attribute value may be, for example, a weather suitable for the spot (for example, “sunny”), a business time zone (for example, “10: 00-22: 00”), a time zone suitable for the spot (for example, lunch time) Time zone, dinner time zone, etc.), a season suitable for the spot (for example, “summer”), and the like.

  The spot attractiveness information storage unit 113 stores the dynamic attractiveness of each spot, which is the attractiveness of the spot that dynamically changes for each user and for each of the one or more spots. It may be stored. That is, the spot attractiveness information storage unit 113 may store per-user dynamic attractiveness for each of a plurality of users for each spot.

  Here, the dynamic attractiveness level for each user may be a value indicating a degree that the attractiveness of a spot that varies depending on the user is small.

  The per-user dynamic attractiveness is preferably a value calculated using one or more spot dynamic attribute values and one or more user dynamic attribute values.

  The dynamic attractiveness for each user is preferably a value calculated using the spot specificity for the user. The spot specificity is preferably a value that decreases when the user visits the spot. However, a visit to a spot does not necessarily reduce the specificity of the spot. The specificity may be improved by information such as starting a new event at one spot.

  The spot attractiveness information storage unit 113 may store a freshness expiration date for each spot category. That is, the spot attractiveness information storage unit 113 may store one or more sets of category identifiers and freshness expiration dates.

  The receiving unit 12 receives instructions, information, and the like. The instructions, information, and the like are, for example, departure point information indicating a departure point, destination information indicating a destination, answer information, visit information described later, travel time information, and the like. The answer information is information indicating an answer to the question. The question is, for example, a question for determining a spot where the user is interested or not interested. The question is, for example, a question for determining a spot category in which the user is interested or a spot category in which the user is not interested. The question may be a question that asks a category of a spot that the user is interested in, or a category of a spot that the user is not interested in. The question may be, for example, a question asking about a category of a spot that the user dislikes. The question is output using the question information described above. The travel time information is information on the time required for travel desired by the user. The travel time information is a time desired by the user, for example, a time from the departure from the current location to the return to the current location.

  The instructions, information, and the like are, for example, one or more pieces of question information constituting one or more questions for acquiring user preference information described later.

  The input means such as instructions and information may be anything such as a numeric keypad, keyboard, mouse or menu screen. The accepting unit 12 can be realized by a device driver for input means such as a numeric keypad or a keyboard, control software for a menu screen, and the like.

  The departure place reception unit 121 receives departure place information indicating the departure place. The departure point information may be position information indicating the current position, a spot identifier, or the like. The departure point reception unit 121 may be realized by a GPS receiver. There can be various means for acquiring position information indicating the current position, and it does not matter.

  The departure point reception unit 121 may receive departure point information from the terminal device.

  Accepting here means accepting information input from input devices such as a keyboard, mouse, touch panel, receiving information sent via a wired or wireless communication line, recording on an optical disc, magnetic disc, semiconductor memory, etc. It is a concept including reception of information read from a medium. In addition, reception means acquisition of a current position by a GPS receiver, reception from a terminal device (not shown), and the like. Furthermore, the terminal device is, for example, a so-called smartphone, mobile phone, mobile terminal, personal computer, notebook computer, tablet terminal, or the like.

  The destination reception unit 122 receives destination information indicating a destination. The destination receiving unit 122 may receive destination information indicating the current position. When the destination receiving unit 122 receives destination information indicating the current position, a route starting from the current position and returning to the current position is searched.

  The destination receiving unit 122 may receive destination information and a user identifier for identifying the user from the terminal device.

  Visit information reception part 123 receives visit information. The visit information is information having a spot identifier and is information indicating that the user has visited the spot. Here, the visit information reception part 123 usually acquires visit information automatically. When it is detected that the processing unit 13 stops at the spot and receives an instruction to turn off the engine of the moving object, the visit information receiving unit 123 acquires the visit information. For example, when the processing unit 13 detects staying around the spot identified by the spot identifier for a time equal to or longer than a threshold, the visit information receiving unit 123 acquires the visit information. For example, the visit information reception part 123 receives the visit information which shows the spot visited from the user. In addition, a mobile body is a motor vehicle, a bicycle, a motorbike, an electric bicycle with an assist etc., for example, The kind is not ask | required.

  The processing unit 13 performs various processes. The various processes include, for example, a detour candidate spot determination unit 131, a route search unit 132, a user-specific dynamic attractiveness acquisition unit 133, a virtual cost calculation unit 134, a route narrowing unit 135, a search result acquisition unit 136, and context information. This is processing performed by the acquisition unit 137, the user evaluation information search unit 138, and the dynamic attractiveness calculation unit 139 for each user.

  The detour candidate spot determining unit 131 is one or two or more spots that are close enough to satisfy a predetermined position from the starting point indicated by the starting point information or the destination indicated by the destination information, and the predetermined attractiveness condition is set. One or more spots having a larger dynamic attractiveness for each user are determined as they are satisfied. The position condition is a condition related to the position of the spot of the detour candidate. The attractiveness condition is a condition related to the dynamic attractiveness for each user.

  The detour candidate spot determination unit 131 is, for example, a spot of X (X is a natural number of 1 or more) that is close enough to satisfy a predetermined position condition from the departure point indicated by the departure point information or the destination indicated by the destination information. The spot of X whose dynamic attractiveness for each user is larger as the determined attractiveness condition is satisfied is determined.

  In addition, “closer enough to satisfy a predetermined location condition” means a distance within a threshold from the departure point, a distance within a threshold from the destination, a distance within a threshold from each point on the route from the departure point to the destination, The time required for returning from the route from the place to the destination is within a threshold, within a predetermined area including the departure place and the destination, within one or more prefectures including the departure place and the destination.

  Further, “closer enough to satisfy a predetermined position condition” means that if the distance from the starting point to the destination is X, it is a range centered on an intermediate point and has a diameter X + α (for example, X * 1.2). ) In the circle.

  There is no limitation on the process in which the detour candidate spot determining unit 131 determines a spot “close enough to satisfy a predetermined position condition”. Any spot around the route from the departure point indicated by the departure point information to the destination indicated by the destination information may be used. The peripheral threshold value may be large or small.

  Further, “the dynamic attractiveness per user is larger as the predetermined attractiveness condition is satisfied” is, for example, “dynamic attractiveness per user is greater than or equal to a threshold”, “dynamic attractiveness per user is greater than the threshold “Spots with top N dynamic attractiveness per user”. The attractiveness condition is usually a condition for narrowing down to some spots, but may be a condition that all spots can be extracted.

  Further, “determining a spot” may be a process of acquiring a spot identifier and acquiring information regarding one or more spots associated with the spot information.

  The route search unit 132 uses the map information to set one or more spots among the one or more spots determined by the detour candidate spot determination unit 131 as relay points, and the destination information indicates from the departure point indicated by the departure point information. Route information for specifying one or more routes to the destination and cost are acquired. Note that “one or more spots as relay points” means that two or more relay points may exist in the route indicated by one route information.

  Moreover, the algorithm by which the route search part 132 searches for a route does not ask | require. The route search unit 132 searches for a route by, for example, the Dijkstra method or the A * algorithm.

  The route search unit 132 is usually a route from the departure point indicated by the departure point information to the destination indicated by the destination information, and it is preferable that the route information of the route with the lowest cost is acquired 4.

  The per-user dynamic attractiveness acquisition unit 133 displays the per-user dynamic attractiveness corresponding to the spot of one or more relay points on the one or more pieces of route information acquired by the route search unit 132, as the spot attractiveness information storage unit 113. Get from. The per-user dynamic attractiveness acquisition unit 133 may calculate the per-user dynamic attractiveness calculated in real time. Even in such a case, since the dynamic attractiveness for each user is once accumulated in the spot attractiveness information storage unit 113, it may be considered that the dynamic attractiveness for each user is acquired from the spot attractiveness information storage unit 113. . The per-user dynamic attraction calculated in real time is usually the per-user dynamic attraction calculated after destination information is received.

  The virtual cost calculation unit 134 uses the cost corresponding to each of the one or more pieces of route information acquired by the route search unit 132 and one or more dynamic attractiveness levels for each user corresponding to each piece of route information. The virtual cost corresponding to each path information is calculated. It can be said that the virtual cost is a cost obtained by correcting a cost corresponding to one or more pieces of route information acquired by the route search unit 132. Further, the cost corresponding to one or more pieces of route information is the cost of one or more whole routes.

  That is, the virtual cost calculation unit 134 does not normally correct only the cost for the edge of the road where the spot exists using the dynamic attractiveness for each user, but is the cost acquired by the route search unit 132, The overall cost is corrected using the dynamic attractiveness for each user.

  More specifically, normally, the virtual cost calculation unit 134 has a greater dynamic attractiveness for each user corresponding to each route information than the cost corresponding to each of the one or more pieces of route information acquired by the route search unit 132. The virtual cost is calculated so as to become smaller.

  The virtual cost calculation unit 134 calculates a virtual cost using, for example, a function “f (cost, dynamic attractiveness for each user)”. Here, the function f is usually an increasing function with the cost as a parameter, and a decreasing function with the dynamic attractiveness for each user as a parameter. Here, it can be said that the smaller the cost and the virtual cost, the easier the route is to be selected.

  It goes without saying that the per-user dynamic attractiveness used by the virtual cost calculating unit 134 is the per-user dynamic attractiveness acquired by the per-user dynamic attractiveness acquiring unit 133.

  The route narrowing unit 135 uses one or more virtual costs calculated by the virtual cost calculation unit 134 to use one or more routes that are part of the route information among the one or more route information acquired by the route search unit 132. Get information.

  The route narrowing unit 135 may, for example, select some Y (Y <X) routes from the X route information acquired by the route search unit 132 in ascending order of the X virtual costs calculated by the virtual cost calculation unit 134. Get information. For example, the route narrowing unit 135 acquires the route information of Y in ascending order of the virtual cost. X and Y are natural numbers of 1 or more.

  The search result acquisition unit 136 performs a Web search using the spot identifier and acquires the search result. The search results are, for example, the number of spot identifier searches, the number of spot identifier searches, and the date of writing of a document including the spot identifier. Web search is a known technique. Further, since the processing of the search result acquisition unit 136 can be performed by a known technique, a detailed description is omitted.

  The context information acquisition unit 137 acquires one or more context information among day, time, and weather. The context information acquisition unit 137 acquires one or more context information from a clock (not shown) or a server device (not shown). Since the process of the context information acquisition unit 137 can be performed by a known technique, detailed description thereof is omitted.

  The user evaluation information search unit 138 performs Web search and acquires user evaluation information related to user evaluation corresponding to one or more spot identifiers. The user evaluation information search unit 138, for example, performs a Web search using a spot identifier as a key, and is a sentence including the spot identifier. For example, the evaluation term (for example, “good”, “bad”, “beautiful”, “interesting”, “no use”, etc.) Get a sentence containing Then, the user evaluation information search unit 138 acquires, for example, the total number of sentences with a positive evaluation and the total number of sentences with a negative evaluation. For example, the user evaluation information is the total number of sentences with a positive evaluation and the total number of sentences with a negative evaluation. Since the process of the user evaluation information search unit 138 can also be performed by a known technique, a detailed description is omitted.

  The per-user dynamic attractiveness calculating unit 139 calculates the per-user dynamic attractiveness of the spot.

  The per-user dynamic attraction calculation unit 139 acquires the per-user dynamic attraction using, for example, one or more dynamic attribute values of the spot and one or more attribute values of the user.

  It is preferable that the per-user dynamic attractiveness calculating unit 139 obtains the per-user dynamic attractiveness using one or more dynamic attribute values of the spot and one or more dynamic attribute values of the user.

  For example, when the visit information reception unit 123 receives the visit information, the user-specific dynamic attractiveness calculation unit 139 reduces the dynamic attractiveness of each user to be paired with the spot identifier included in the visit information. It is preferable to calculate a new per-user dynamic attractiveness.

  The dynamic attractiveness calculation unit 139 for each user uses, for example, one or more attribute values of a spot, one or more attribute values of a user, user preference information, search results, one or more context information, and user evaluation information. It is preferable to calculate the dynamic attractiveness for each user of one or more spots.

  Also, the per-user dynamic attraction calculation unit 139 calculates the per-user dynamic attraction using, for example, one or more characteristic values. The characteristic values are, for example, user interest level, freshness level, ability display level, specificity, spot evaluation value, and user match level described later. In addition, it is preferable that the per-user dynamic attractiveness calculating unit 139 calculates the per-user dynamic attractiveness using two or more characteristic values including specificity. It is preferable that the per-user dynamic attractiveness calculating unit 139 calculates the per-user dynamic attractiveness using an increasing function having specificity as a parameter. The user-specific dynamic attractiveness calculation unit 139 uses a function that increases a user's interest level, freshness level, ability level, spot evaluation value, and user match level as a parameter, and uses an increase function for each user. It is preferable to calculate the attractiveness.

  The user interest level calculation unit 1391 calculates the user interest level for the spot using the user preference information. User preference information is stored in the user information storage unit 112, for example.

  Also, the user interest level calculation means 1391 normally calculates the user interest level for the spot category using the user preference information. In this case, the user interest degree with respect to the spot is the user interest degree with respect to the category of the spot.

  In addition, the user interest level calculating unit 1391 sets the initial interest level of a category using, for example, the “interested category and uninterested category” information received by the receiving unit 12 at the time of user registration.

The user interest level calculating unit 1391 calculates the user interest level for the spot using, for example, the following Equation 1.

In Equation 1, I _i is a degree of interest of a certain user for the spot i. The spot i is assumed to belong to the category k.

S _k is 0 when the user preference information in the user information storage unit 112 includes “information indicating that the category k belongs to a category that the user dislikes”, and otherwise (if the category k is disliked) 1 if it belongs to no category). C _k is the initial degree of interest. In other words, C _k is a value indicating whether or not the category of interest is selected at the time of user registration, and is 1 if the user preference information includes “information indicating that category k is of interest to the user”. , “0” when “information indicating that category k is not of interest to the user” is included.

C _t is the total number of categories having an initial interest level of “1”. It is assumed that the user has selected at least one category as an interesting category. V _k is the number of times (the number of times of use) that stopped at a detour spot belonging to category k when using the system. The user interest level calculation unit 1391 is information included in the user preference information, and calculates the total number of times one or more spots to which the category k belongs (the total number of times the category k is used). V _t is the total number of dropped in the spot (the number of times of use of the spot). The user interest level calculation unit 1391 is information included in the user preference information, and calculates the total number of times all spots have visited.

Α is a weighting coefficient and takes a value of 0 <α <1. Accordingly, if the value of S _k is 1, I _i becomes “α <I _i <1”, and the minimum value of I _i can be set by α.

The freshness calculation means 1392 calculates the freshness (F _i ) for the spot using the search result acquired by the search result acquisition unit 136.

In Equation 2, D _k is the freshness expiration date of the spot belonging to category k. The freshness expiration date is information regarding the expiration date of the freshness of the spot. The freshness expiration date is usually determined for each category, but may be determined for each spot. That is, each spot attractiveness information in the spot attractiveness information storage unit 113 may hold a freshness expiration date.

In Formula 2, d _i represents the number of days that have elapsed since the spot i was newly established (or the number of days that have elapsed since the date when the freshness has appeared due to a trend). d _i takes a value of 0 <d _i <1. β is a weighting coefficient and takes a value of 0 <β <1. Thus, the minimum value of F _i is set by beta.

When the search result acquired by the search result acquisition unit 136 includes one or more spot identifiers of the spot i, the freshness calculating unit 1392 includes, for example, the date when the information including the spot identifier of the spot i is first described, and the current And the number of days (d _i ) since the spot i was newly established is obtained from the difference between the two days. In this case, it is assumed that the date when the information including the spot identifier of the spot i is described for the first time is the date when the spot i is newly established.

In addition, the freshness calculation unit 1392 acquires, from the search result acquired by the search result acquisition unit 136, the day when the number of cases including the spot identifier of one or more spots i is equal to or greater than the threshold as the day when the freshness appears due to the epidemic. To do. Then, the freshness degree calculation unit 1392 acquires the current day. Next, the freshness degree calculation unit 1392 obtains the number of days (d _i ) since the spot i was newly established from the difference between the two days.

Then, the freshness degree calculation unit 1392 obtains the freshness validity period (D _k ) corresponding to the spot or the category of the spot from the spot attractiveness information storage unit 113.

Next, the freshness calculating means 1392 substitutes the elapsed days (d _i ), the freshness expiration date (D _k ), and a predetermined β into Equation 2 to calculate the freshness (F _i ).

  The ability display degree calculation means 1393 calculates the ability display degree of each spot using one or more context information and the attribute value of each spot. Here, the ability level of the spot is a degree indicating whether or not the spot functions effectively. The level of ability varies depending on context information (time, weather, season, etc.). For example, in the case of an open cafe, the value is highest on a sunny day with good weather, and the value is reduced on a rainy day or a cold day. In the case of restaurants, the value is high during mealtimes.

  The ability level calculation means 1393 acquires one or more attribute values (for example, weather suitable for the spot, business hours, and time suitable for the spot) from the spot attractiveness information storage unit 113. It should be noted that the ability level calculating means 1393 may acquire one or more attribute values corresponding to the category identifier corresponding to the spot i (for example, weather suitable for the spot, business hours, and time suitable for the spot). good.

  Then, the ability level calculation means 1393 determines whether or not the acquired one or more attribute values match the context information corresponding to each attribute value. Then, the ability performance calculating means 1393 calculates the performance performance of the spot i, for example, by an increasing function using the number of matching context information as a parameter. The context information is information acquired by the context information acquisition unit 137. The ability level calculation means 1393 acquires the degree of match between the acquired one or more attribute values and the context information corresponding to each attribute value, and calculates the level of ability of the spot i using the one or more levels of match. You may do it. For example, the ability level calculation means 1393 has a match degree “2” when the context information is “clear”, a match degree “1” when the context information is “cloudy”, and a match when the context information is “rain”. The degree “0” may be acquired.

For example, the ability level calculating means 1393 calculates the capability level (A _i ) for the spot i based on the following Equation 2. However, this spot i shall belong to the category k.

In Equation 3, k is a category. C is one or more context information of the target user. In other words, the ability level calculation means 1393 determines the level of ability level (A _i ) based on the attribute value of the category k of the spot and the context information of the target user.

  The specificity calculation unit 1394 calculates the specificity of the spot for the user using the one or more attribute values of the user and the one or more attribute values of the spot.

  The specificity is information indicating how specific the target spot is for the user. For example, it is assumed that user A's hometown is Osaka, user B's hometown is Aichi, and users A and B are currently in Nagoya. When it is desired to recommend a certain chicken wing chain store to two people, the specificity of the spot is low for the user B living in Aichi Prefecture. However, for the user A, the specificity of the spot is high. That is, the specificity varies depending on the user even in the same spot.

The specificity calculation means 1394 calculates the spot specificity (U _i ) according to the following formula 4, for example.

  In Equation 4, i is one or more attribute values of the spot, and u is one or more attribute values of the user. The one or more attribute values of the spot may be one or more attribute values of the spot category.

  The specificity calculation unit 1394 acquires, for example, one or more attribute values (for example, a spot address) of the spot i from the spot attractiveness information storage unit 113. Further, the specificity calculation unit 1394 acquires one or more attribute values (for example, “birthplace” and “address”) of the user from the user information storage unit 112. Then, the specificity calculating unit 1394 uses the one or more attribute values of the spot i and one or more attribute values of the user corresponding to the attribute values to determine two attribute values in advance. Determine if there is a relationship. Then, the specificity calculating unit 1394 acquires the number of sets of two attribute values that are not in a predetermined relationship. Next, the specificity calculation means 1394 calculates the spot specificity by an increasing function using the number of the sets as a parameter. Note that “not in a predetermined relationship” means, for example, that the address of the spot i is different from the prefecture where the user is born, the prefecture where the address of the spot i is different from the prefecture of the user's address, or the like.

  For example, the specificity calculation unit 1394 calculates the specificity by “specificity = number of attribute values not in a predetermined relationship / number of compared attribute values”.

  For example, the specificity uses a residence-based parameter and an experience-based parameter. The residence-based parameters are the address of spot i and the address or / and hometown of user u. It is preferable that all the spots i have parameters that constitute the specificity for each prefecture.

  The experience-based parameter is information (for example, 0 or 1) indicating whether or not the user u has visited the spot i.

For example, the specificity calculation means 1394 multiplies the value unique _p (i, u) acquired from the residence-based parameter by the value (Exp (i, u)) based on the experience-based parameter, for example. Calculate the degree. In this case, for example, if the user u has visited the spot i, the specificity of the spot i is “0”. Also, for example, if the user u has visited the spot i, the value acquired from the residence-based parameter is multiplied by a predetermined value (γ) “for example, 0.1” to obtain the specificity. To be a small value.

  The spot evaluation value calculation unit 1395 calculates a spot evaluation value that is an evaluation value of one or more spots, using the one or more user evaluation information acquired by the user evaluation information search unit 138. The spot evaluation value calculation unit 1395 calculates a spot evaluation value based on information such as a user review on the Web, for example. It can be said that the evaluation value of the spot is an objective evaluation value of the spot.

The spot evaluation value calculation unit 1395 calculates a spot evaluation value (R _i ) based on the following formula 5, for example.

In Equation 5, E _p (i) is a positive evaluation number for the spot i, and E _n (i) is a negative evaluation number for the spot i. Further, E _t (i) is the total number of evaluations for Spot i, for example, “E _t (i) = E _p (i) + E _n (i)”. Note that E _t (i) is the number of opinions expressed for the spot i, and may include the number of neutral opinions.

That is, the spot evaluation value calculation unit 1395 has a positive evaluation number “E _p (i)” for the spot i included in one or more user evaluation information acquired by the user evaluation information search unit 138 and a negative evaluation number for the spot i. “E _n (i)” and the total evaluation number “E _n (i)” for the spot i are acquired. Then, the spot evaluation value calculation unit 1395 substitutes “E _p (i)”, “E _n (i)”, and “E _t (i)” into Equation 5 to calculate the spot evaluation value (R _i ).

The value of the spot evaluation value (R _i ) approaches 1 if there are many positive evaluations, and the value of the spot evaluation value (R _i ) approaches 0 if there are many negative evaluations.

  The user matching degree calculation unit 1396 calculates a user matching degree that is a degree of matching between the spot and the user.

  The user matching degree with respect to a spot is a matching degree between the user's preference estimated from user characteristics such as gender, age, and residence, and the spot. For example, “Yokai Watch” and “Children” are considered to have a high degree of match. In the case of a nail salon, it can be considered that the degree of agreement with young women is mainly high. By using the user matching degree, it is possible to prevent the recommendation of a mismatched detour spot.

  As a method for calculating the user match level, for example, an attribute value of a user having a high match level is set for each spot, and a match level of a user who deviates greatly is set low.

For example, the user coincidence calculation unit 1396 calculates the user coincidence (M _i ) between the spot i and the user based on Equation 6 below.

  In Equation 6, i is one or more attribute values of the spot, and u is one or more attribute values of the user. At this time, the user match degree is usually calculated without considering the user's preference and considering only the demographic information. In addition, demographic information is information which comprises user information, for example, sex, age, the area where they live, income, occupation, educational background, family composition, etc.

  The per-user dynamic attractiveness calculating means 1397 uses a value of 2 or more among the user interest level, freshness level, ability display level, specificity, spot evaluation value, and user match level to dynamically change each spot for each user. Calculate the attractiveness.

  The per-user dynamic attractiveness calculating means 1397 preferably calculates the per-user dynamic attractiveness of each spot using two or more characteristic values including specificity.

  For example, the per-user dynamic attractiveness calculating means 1397 calculates the per-user dynamic attractiveness (Serendipity (i)) of the spot i for a certain user based on the following Expression 7, for example.

  The per-user dynamic attractiveness calculating means 1397 may calculate the per-user dynamic attractiveness (Serendipity (i)) of the spot i by the sum of two or more characteristic values, or two or more characteristic values. You may calculate by the weighted sum. Further, the per-user dynamic attractiveness calculating means 1397 may calculate the per-user dynamic attractiveness (Serendipity (i)) of the spot i by an average value of N (N is 2 or more) characteristic values. .

  The per-user dynamic attractiveness calculating means 1397 preferably calculates the per-user dynamic attractiveness by an increasing function using two or more characteristic values as parameters.

  The output unit 14 outputs various information. The various information is, for example, spot related information described later.

  Here, output refers to display on a display, projection using a projector, printing with a printer, sound output, transmission to an external device, storage in a recording medium, and output to other processing devices or other programs. It is a concept that includes delivery of processing results.

  The spot related information output unit 141 outputs spot related information related to one or more spots determined by the detour candidate spot determining unit 131. Needless to say, the output mode of the spot related information is not limited.

  The spot related information output unit 141 relates to one or more spots that are relay points of the route indicated by the one or more pieces of route information using the virtual cost corresponding to the one or more pieces of route information calculated by the virtual cost calculation unit 134. Spot related information may be output.

  The spot related information output unit 141 relates to one or more spots that are relay points of the route indicated by the one or more pieces of route information using the virtual cost corresponding to the one or more pieces of route information acquired by the route narrowing unit 135. Spot related information may be output.

  The spot related information output unit 141 outputs spot related information including the required time of the route passing through one or more spots determined by the detour candidate spot determining unit 131 and the required time of the route indicated by the minimum cost route information. Also good.

  The spot related information output unit 141 may output spot related information having map information. In such a case, information on one or more spots determined by the detour candidate spot determining unit 131 or information on one or more spots corresponding to the one or more pieces of route information acquired by the route narrowing unit 135 is output on the map. .

  The spot related information output unit 141 may transmit the spot related information to the terminal device 2 described later.

  Here, the spot-related information includes, for example, a spot identifier, route information of a route having a spot as a relay point, a dynamic per-user attractiveness of the spot (degree of serendipity), and one or more determined by the detour candidate spot determining unit 131 Information including the required time of the route passing through the spot and the required time of the route indicated by the minimum cost route information. The spot related information may include map information including a spot and map information including a route including the spot.

  The one or more spots determined by the detour candidate spot determining unit 131 may be some of the one or more spots determined by the detour candidate spot determining unit 131. Further, the one or more spots determined by the detour candidate spot determining unit 131 may be spots on the route indicated by the one or more pieces of route information acquired by the route narrowing unit 135.

  The storage unit 11, the map information storage unit 111, the user information storage unit 112, and the spot attractiveness information storage unit 113 are preferably non-volatile recording media, but can also be realized by volatile recording media.

  The process in which information is stored in the storage unit 11 or the like is not limited. For example, information may be stored in the storage unit 11 or the like via a recording medium, information transmitted via a communication line or the like may be stored in the storage unit 11 or the like, Alternatively, information input via the input device may be stored in the storage unit 11 or the like.

  The reception unit 12 can be realized by a departure point reception unit 121, a destination reception unit 122, and a visit information reception unit 123 by a device driver of input means such as a keyboard, control software for a menu screen, or the like.

  Processing unit 13, detour candidate spot determination unit 131, route search unit 132, dynamic attractiveness acquisition unit 133 for each user, virtual cost calculation unit 134, route narrowing unit 135, search result acquisition unit 136, context information acquisition unit 137, User evaluation information search unit 138, user-specific dynamic attractiveness calculation unit 139, user interest level calculation unit 1391, freshness calculation unit 1392, ability display level calculation unit 1393, specificity calculation unit 1394, spot evaluation value calculation unit 1395, The user matching degree calculating unit 1396 and the per-user dynamic attractiveness calculating unit 1397 can be usually realized by an MPU, a memory, or the like. The processing procedure of the processing unit 13 or the like is usually realized by software, and the software is recorded on a recording medium such as a ROM. However, it may be realized by hardware (dedicated circuit).

  The output unit 14 and the spot related information output unit 141 may or may not include an output device such as a display or a speaker. The output unit 14 and the like can be realized by output device driver software, or output device driver software and an output device.

  Next, an operation in which the information processing apparatus 1 outputs the spot related information will be described using the flowchart of FIG.

  (Step S201) The receiving unit 12 determines whether destination information or the like has been received. If destination information or the like is received, the process goes to step S202. If destination information or the like is not received, the process goes to step S208. Note that the destination information or the like may be only destination information or destination information and departure point information. The reception unit 12 may receive travel time information. Further, the receiving unit 12 may receive the current position as destination information.

  (Step S202) The departure point reception unit 121 acquires the current position.

  (Step S203) The route search unit 132 searches for a route starting from the current position acquired in Step S202 and ending at the destination indicated by the destination information received in Step S201. Alternatively, the route search unit 132 may search for a route having the departure point indicated by the departure point information received in step S201 as the start point and the destination point indicated by the destination information received in step S201 as the end point. The route search unit 132 may search for a route that starts at the current position and ends at the current position and can return within the time indicated by the travel time information.

  (Step S204) The detour candidate spot determining unit 131 determines a detour candidate spot. Such a detour candidate spot determination process will be described with reference to the flowchart of FIG.

  (Step S205) The virtual cost calculation unit 134 calculates a virtual cost for each of one or more detour candidate spots determined in step S204. The virtual cost calculation process will be described with reference to the flowchart of FIG.

  (Step S206) The spot related information output unit 141 acquires spot related information using the virtual costs of one or more detour candidate spots acquired in step S205.

  (Step S207) The spot related information output unit 141 outputs the spot related information acquired in step S206. The process returns to step S201.

  (Step S208) The receiving unit 12 determines whether or not one or more answer information for the output question has been received. If one or more answer information for the question is accepted, the process goes to step S209, and if one or more answer information for the question is not accepted, the process goes to step S210. Although not shown in the flowchart, it is assumed that the question information is normally output before the answer information is received.

  (Step S209) The user interest level calculation means 1391 acquires the initial interest level of each category using the one or more answer information received in Step S208, and accumulates it in the storage unit 11 or the spot attractiveness information storage unit 113. To do. The process returns to step S201. Note that the initial interest level of each category is usually stored in pairs with the category identifier. Further, the processing unit 13 may acquire a category identifier of a category that is disliked by using one or more pieces of answer information received in step S208 and accumulate the same in the storage unit 11.

  (Step S210) The visit information receiving unit 123 determines whether or not the visit information has been received. If the visit information is accepted, the process goes to step S211. If the visit information is not accepted, the process returns to step S201.

  The visit information usually has a spot identifier. Moreover, the visit information reception part 123 may receive the visit information input from the user, and may automatically acquire the visit information indicating that the user has used the spot. For example, when it is determined that the mobile body has arrived at the destination indicated by the set destination information, the visit information reception unit 123 acquires the visit information having a spot identifier that is the destination information. For example, when the destination information is received, the visit information reception unit 123 acquires the visit information having the destination information. In addition, the visit information receiving unit 123 may acquire a spot identifier corresponding to the current position when the engine of the moving body is turned off, and configure visit information having the spot identifier.

  (Step S211) The processing unit 13 acquires a spot identifier of the used spot.

  (Step S212) The processing unit 13 acquires a category identifier paired with the spot identifier from the spot attractiveness information storage unit 113 or the map information storage unit 111.

  (Step S213) The processing unit 13 increments the use count corresponding to the spot identifier of the used spot by one.

  (Step S214) The processing unit 13 increments the use count corresponding to the category identifier corresponding to the used spot by one. The process returns to step S201.

  In the flowchart of FIG. 2, the process is terminated by powering off or a process termination interrupt.

  In addition, when the spot visit information is received in steps S210 to S214 in the flowchart of FIG. 2, the processing unit 13 may simply accumulate the spot identifier or the spot identifier and the use time in the storage unit 11. . If the spot identifiers of the used spots are accumulated, the number of uses corresponding to the spot identifier and the number of uses corresponding to the category identifier can be obtained at any time.

  Next, the detour candidate spot determination process in step S204 will be described using the flowchart of FIG.

  (Step S301) The detour candidate spot determining unit 131 substitutes 1 for a counter i.

  (Step S302) The detour candidate spot determining unit 131 determines whether or not the i-th point exists on the route searched in step S203. If the i-th point exists, go to step S303, and if the i-th point does not exist, go to step S305.

  (Step S303) The detour candidate spot determining unit 131 determines that the distance to the i-th point on the route (a spatial distance or a temporal distance) is within a threshold (may be smaller than the threshold). The spot identifier of one or more spots is acquired using the position information of each spot. Note that this spot is a spot for which a spot identifier has not been acquired.

  (Step S304) The detour candidate spot determining unit 131 increments the counter i by one. The process returns to step S302.

  (Step S305) The detour candidate spot determining unit 131 substitutes 1 for the counter j.

  (Step S306) The detour candidate spot determining unit 131 determines whether or not the j-th spot is present among the spots corresponding to the spot identifier acquired in Step S303. If the j-th spot exists, the process goes to step S307, and if the j-th spot does not exist, the process goes to step S309.

  (Step S307) The per-user dynamic attractiveness acquisition unit 133 calculates the per-user dynamic attractiveness corresponding to the j-th spot. The dynamic attractiveness calculation process for each user will be described with reference to the flowchart of FIG.

  (Step S308) The counter j is incremented by one. The process returns to step S306.

  (Step S309) The detour candidate spot determination unit 131 acquires spot identifiers of X spots having the highest dynamic attractiveness for each user. Return to upper process.

  Note that in step S306 in the flowchart of FIG. 3, spots are narrowed down to X cases with the highest dynamic attractiveness for each user (X is a natural number of 1 or more), but such narrowing may not be performed.

  Next, the virtual cost calculation process in step S205 will be described with reference to the flowchart of FIG.

  (Step S401) The virtual cost calculation unit 134 substitutes 1 for a counter i.

  (Step S402) The virtual cost calculation unit 134 determines whether there is a spot identifier of the spot of the i-th detour candidate. When the spot identifier of the i-th spot exists, the process goes to step S403, and when the spot identifier of the i-th spot does not exist, the process goes to step S407.

  (Step S403) The virtual cost calculation unit 134 acquires the dynamic attractiveness for each user of the i-th spot. Note that the virtual cost calculation unit 134 usually acquires the dynamic attractiveness for each user already calculated and stored in the buffer. However, the per-user dynamic attraction calculation unit 139 may calculate the per-user dynamic attraction for the i-th spot.

  (Step S404) The route searching unit 132 searches for a route having the i-th spot as a relay point, and acquires route information and the cost of the entire route. Note that this route may be a route having the current position acquired in step S202 as a start point, the i-th spot as a relay point, and the destination indicated by the destination information received in step S201 as an end point. The route may start from the departure point indicated by the departure point information received in step S201, the i-th spot as a relay point, and the destination point indicated by the destination information received in step S201. .

  In addition, this route may be a route starting from the current location, starting from the i-th spot as a relay point, and ending at the current location, and returning within the time indicated by the accepted travel time information. That is, in such a case, the route search unit 132 searches for a route having the i-th spot as a relay point and the current location as an end point, and acquires a required time on the route. Then, only when the required time is shorter than the time indicated by the accepted travel time information, the route information of the route and the cost of the entire route are acquired. In such a case, there may be a case where route information having the i-th spot as a relay point is not acquired.

  (Step S <b> 405) The virtual cost calculation unit 134 obtains the spot identifier of the i-th spot, the dynamic attractiveness for each user of the i-th spot, route information, and cost information (may be referred to as detour candidate information). Temporarily accumulates in a buffer (not shown).

  (Step S406) The virtual cost calculation unit 134 increments the counter i by 1. The process returns to step S402.

  (Step S407) The virtual cost calculation unit 134 merges the detour candidate information having the same route information among detour candidate information temporarily stored in a buffer (not shown). Here, for example, the merging process includes two detour candidate information “spot identifier: S1, dynamic attractiveness for each user: A1, route information: R1, cost: C1” and “spot identifier: S2, dynamic for each user”. When attractiveness: A2, route information: R1, cost: C1 is present, one detour candidate information “spot identifier: S1, S2, dynamic attractiveness for each user: A1, A2, route information: R1, cost: C1 ”is acquired. That is, the spot identifier and the dynamic attractiveness for each user have as many as the number of merged sets.

  (Step S408) The virtual cost calculation unit 134 substitutes 1 for the counter j.

  (Step S409) The virtual cost calculation unit 134 determines whether or not the jth detour candidate information exists. If the jth detour candidate information is present, the procedure goes to step S410. If the jth detour candidate information is not present, the procedure proceeds to step S412.

  (Step S410) The virtual cost calculation unit 134 calculates the virtual cost for the jth side trip candidate information using the cost of the jth side trip candidate information and the dynamic attractiveness for each user. The virtual cost calculation unit 134 is an increasing function that uses the cost of the jth detour candidate information as a parameter, and calculates a virtual cost using a decreasing function that uses the dynamic attractiveness for each user as a parameter.

  (Step S411) The virtual cost calculation unit 134 increments the counter j by 1. The process returns to step S409.

  (Step S <b> 412) The route narrowing unit 135 determines Y detour candidate information having a higher virtual cost. Return to upper process.

  In step S412 of the flowchart of FIG. 4, the detour candidates are narrowed down to Y cases with the highest virtual cost (Y is a natural number of 1 or more), but such narrowing may not be performed.

  Next, the dynamic attractiveness calculation process for each user in step S307 will be described using the flowchart of FIG.

  (Step S501) The user interest level calculation unit 1391 acquires the user interest level of the spot of interest. The user interest level acquisition process will be described with reference to the flowchart of FIG.

  (Step S502) The freshness calculating means 1392 acquires the freshness of the spot of interest. The freshness acquisition process will be described with reference to the flowchart of FIG.

  (Step S503) The ability level calculation means 1393 acquires the level of ability level of the spot of interest. The ability level acquisition process will be described with reference to the flowchart of FIG.

  (Step S504) The specificity calculation unit 1394 acquires the specificity of the spot of interest. Specificity acquisition processing will be described with reference to the flowchart of FIG.

  (Step S505) The spot evaluation value calculation means 1395 acquires the spot evaluation value of the spot of interest. The spot evaluation value acquisition process will be described with reference to the flowchart of FIG.

  (Step S506) The user coincidence degree calculation means 1396 acquires the user coincidence degree of the spot of interest. The user matching degree acquisition process will be described with reference to the flowchart of FIG.

  (Step S507) The per-user dynamic attractiveness calculating means 1397 calculates the per-user dynamic attractiveness using two or more values among the user interest degree, freshness, specificity, spot evaluation value, and user matching degree. To do. It is preferable that the per-user dynamic attractiveness calculating means 1397 calculates the per-user dynamic attractiveness using the specificity and one or more other values.

  Next, the user interest level acquisition processing in step S501 will be described using the flowchart of FIG.

  (Step S601) The user interest level calculation unit 1391 acquires the category identifier of the spot of interest from the spot attractiveness information storage unit 113.

(Step S602) The user interest level calculation means 1391 acquires the initial interest level corresponding to the category identifier acquired in Step S601 from the spot attractiveness information storage unit 113. In addition, it is preferable that the user interest degree calculation unit 1391 obtains information (S _{k in} Equation 1) indicating whether or not the category corresponding to the category identifier obtained in step S601 is disliked.

  (Step S603) The user interest level calculation unit 1391 acquires the number of uses corresponding to the category identifier acquired in Step S601 from the spot attractiveness information storage unit 113.

  (Step S <b> 604) The user interest level calculation unit 1391 acquires the total number of uses, which is the total number of uses of all categories, from the spot attractiveness information storage unit 113.

(Step S605) The user interest level calculation unit 1391 uses, for example, the initial interest level, information indicating whether or not the category is disliked (S _k ), the usage count corresponding to the category identifier, and the total usage count. Calculate the degree of interest. Return to upper process. Note that the user interest level calculation unit 1391 calculates the user interest level using, for example, Equation 1.

  Next, the freshness acquisition process of step S502 will be described using the flowchart of FIG.

  (Step S701) The search result acquisition unit 136 searches using the spot name of the spot of interest as a key. Here, the search result acquisition unit 136 normally performs a Web search and acquires the search result.

  (Step S <b> 702) The search result acquisition unit 136 acquires the date on which the spot attracted attention from the search result. Note that the search result acquisition unit 136 acquires, for example, the description date of documents, blogs, articles, and the like included in the search result, and acquires the number of descriptions (number of articles, etc.) for each date. And the search result acquisition part 136 acquires the day when the number of description (number of articles etc.) exceeded the threshold value for the first time as the day when the spot attracted attention, for example.

  (Step S703) The freshness degree calculation means 1392 acquires today's date.

  (Step S704) The freshness degree calculation means 1392 acquires the number of days that have elapsed from the day of attention acquired in Step S702 to the present day indicated by today's date acquired in Step S703.

  (Step S705) The freshness degree calculation means 1392 acquires the freshness expiration date corresponding to the spot identifier of the spot of interest or the category identifier of the spot of interest from the storage unit 11 or the spot attractiveness information storage unit 113.

  (Step S706) The freshness calculating means 1392 calculates the freshness using the elapsed days and the freshness expiration date. Return to upper process. The freshness calculating unit 1392 calculates the freshness using, for example, Formula 2.

  Next, the ability level acquisition process in step S503 will be described with reference to the flowchart of FIG.

  (Step S <b> 801) The ability level calculation means 1393 acquires one or more attribute values of the spot of interest and one or more attribute values related to the level of capability level from the spot attractiveness information storage unit 113. It should be noted that the ability level calculation means 1393 holds in advance information indicating what one or more attributes related to the level of skill level are.

  (Step S802) The ability level calculating means 1393 substitutes 1 for a counter i.

  (Step S803) The ability level calculation means 1393 determines whether or not there is an attribute value related to the i-th level of skill level among the attribute values acquired in Step S801.

  (Step S804) The context information acquisition unit 137 acquires context information corresponding to the attribute value related to the i-th ability level.

  (Step S805) The ability level calculation means 1393 determines whether or not the context information acquired in Step S804 matches an attribute value related to the i-th level of skill level. If they match, go to step S806; otherwise, go to step S807.

(Step S806) The ability level calculation means 1393 acquires _a score (S _a (i)) when the context information matches.

(Step S807) The ability level calculation means 1393 acquires _a score (S _a (i)) when the context information does not match.

  (Step S808) The ability level calculating means 1393 increments the counter i by 1. The process returns to step S803.

(Step S809) The ability level calculation means 1393 calculates the level of skill level using one or more scores (S _a (i)) acquired in step S806 and / or step S807. Return to upper process.

  Next, the specificity acquisition process of step S504 will be described with reference to the flowchart of FIG.

  (Step S901) The specificity calculation unit 1394 acquires one or more attribute values related to the specificity from the spot attractiveness information storage unit 113 as one or more attribute values of the spot of interest. Note that the specificity calculation unit 1394 holds in advance information indicating what one or more attributes related to the specificity are.

  (Step S902) The specificity calculating unit 1394 substitutes 1 for the counter i.

  (Step S903) The specificity calculation unit 1394 determines whether or not the i-th attribute value related to the specificity exists among the attribute values acquired in Step S901. If the i-th attribute value exists, the process goes to step S904. If the i-th attribute value does not exist, the process goes to step S907.

  (Step S <b> 904) The specificity calculation unit 1394 acquires the user attribute value corresponding to the i-th attribute value related to the specificity from the user information storage unit 112. The attribute value of the user includes, for example, a residence-based parameter (for example, hometown, address, etc.) and an experience-based parameter (for example, information indicating whether or not a spot has been visited). . Further, the user attribute value is, for example, the number of visits to the spot. The attribute value of the user is information indicating whether or not the spot has been visited, for example.

  (Step S905) The specificity calculation unit 1394 compares the i-th attribute value related to specificity with the attribute value acquired in step S904, and acquires a comparison result.

  (Step S906) The specificity calculating unit 1394 increments the counter i by 1. The process returns to step S803.

  (Step S907) Specificity calculation means 1394 calculates specificity using one or more comparison results acquired in step S905. Return to upper process.

  In the flowchart of FIG. 9, the specificity calculating unit 1394 acquires information indicating the number of times the user has visited the spot or whether or not the spot has been visited. In some cases, it is preferable to calculate by reducing the specificity.

  Next, the spot evaluation value acquisition processing in step S505 will be described using the flowchart of FIG.

  (Step S1001) The user evaluation information search unit 138 performs a Web search using the spot name of the spot of interest, and acquires the number of positive opinions of the spot.

  (Step S1002) The user evaluation information search unit 138 performs a Web search using the spot name of the spot of interest, and acquires the number of negative opinions of the spot.

  (Step S1003) The user evaluation information search unit 138 acquires the number of opinions for the spot. Note that the user evaluation information search unit 138 may perform a Web search using the spot name of the spot of interest and acquire the number of opinions regarding the spot, or the number of positive opinions of the spot and the negative of the spot. The number of opinions with respect to the spot may be calculated by adding to the number of various opinions.

  (Step S1004) The spot evaluation value calculation means 1395 calculates a spot evaluation value using the number of positive opinions of the spot, the number of negative opinions of the spot, and the number of opinions of the spot. Return to upper process. Note that the spot evaluation value calculation unit 1395 calculates the spot evaluation value using, for example, Equation 5.

  Next, the user matching degree acquisition processing in step S506 will be described with reference to the flowchart of FIG.

  (Step S1101) The user coincidence degree calculating means 1396 acquires one or more attribute values related to the user coincidence degree for the spot of interest from the spot attractiveness information storage unit 113 or the map information storage unit 111.

  (Step S1102) The user coincidence degree calculating means 1396 substitutes 1 for a counter i.

  (Step S1103) The user coincidence degree calculation means 1396 determines whether or not the i-th attribute value is one or more attribute values acquired in step S1101. If the i-th attribute value exists, the process goes to step S1104. If the i-th attribute value does not exist, the process goes to step S1107.

  (Step S 1104) The user matching degree calculation unit 1396 acquires the user attribute value corresponding to the i-th attribute value from the user information storage unit 112.

  (Step S1105) The user coincidence calculation means 1396 compares two attribute values and obtains a comparison result.

  (Step S1106) The user coincidence degree calculation means 1396 increments the counter i by one. The process returns to step S1103.

  (Step S1107) The user coincidence degree calculating means 1396 calculates the user coincidence degree using one or more comparison results acquired in step S1105. Return to upper process.

  Hereinafter, a specific operation of the information processing apparatus 1 in the present embodiment will be described. Now, the information processing apparatus 1 is a smartphone. The information processing apparatus 1 functions as a so-called walking navigation.

  The storage unit 11 stores a question relation information management table shown in FIG. The question related information management table is a table for managing one or more question related information (records) including question information for acquiring the initial interest degree for each category of the user. The question related information includes “ID”, “question information”, “answer information”, and “related category identifier”. “ID” is information for identifying a record. “Question information” is information constituting a question. “Reply information” indicates a user's answer. “Related category identifier” indicates a category corresponding to “question information”. Then, when the user's answer to the question indicated by “question information” is the answer indicated by “answer information”, the initial interest degree of the category indicated by “related category identifier” is set to “1”. Show. When the user's answer is not the answer indicated by “answer information”, the initial interest level of the category indicated by “related category identifier” is set to “0”.

  Further, the user information storage unit 112 stores an initial interest degree management table having the structure shown in FIG. The initial interest level management table manages one or more records having “ID”, “category identifier”, and “initial interest level” by the number of categories. “ID” is information for identifying a record. The initial interest level of the category identified by “category identifier” is “initial interest level”. Here, for example, the initial interest level may be “1” or “0”.

  Further, the user information storage unit 112 stores a spot-by-spot usage count management table having the structure shown in FIG. The spot usage count management table manages one or more records having “ID”, “spot identifier”, and “use count”. “ID” is information for identifying a record. The number of uses of the spot identified by the “spot identifier” is the “number of uses”.

  Further, the user information storage unit 112 stores a category-specific usage count management table having the structure shown in FIG. The spot usage count management table manages one or more records having “ID”, “category identifier”, and “use count”. “ID” is information for identifying a record. The total number of uses of the spot of the category identified by “Category identifier” is “Use count”.

  In this situation, it is assumed that the user A has installed a walking navigation application that implements the functions of the information processing apparatus 1 on his / her smartphone.

  Then, in order to register the user, the question information is downloaded from a device (not shown), and each question is answered as shown in FIG. It is assumed that the user has pressed the registration button 1601. FIG. 16 is an example of a screen for inputting answer information for a question.

  In addition, it is assumed that the user selects only “game center” as a category of disliked spots on a screen (not shown). That is, this user does not hate other than the category “game center”.

  Next, the reception unit 12 receives one or more pieces of answer information “1: No, 2: Yes, 3: No, 4: Yes, 5: Yes,. Then, the user interest level calculating unit 1391 applies the received one or more answer information to the question relation information management table of FIG. In other words, the user interest level calculation unit 1391 applies the answer information “1: No” to the answer information “Yes” of “ID = 1” in the question relation information management table, and determines that they do not match. Then, the user interest level calculation unit 1391 acquires the initial interest level “0” of the category identifier “clothes shop”. Also, the user interest level calculation unit 1391 applies the answer information “2: Yes” to the answer information “Yes” of “ID = 2” in the question relation information management table, and determines that they match. Then, the user interest level calculating unit 1391 acquires the initial interest level “1” of the category identifier “restaurant”. Similarly, the user interest level calculation unit 1391 obtains the initial interest level “0” of the category identifier “bookstore”, the initial interest level “1” of the category identifier “cafe”, and the initial interest level “1” of the category identifier “park”. get. Then, the user interest level calculation unit 1391 accumulates the initial interest level of each category in the storage unit 11. FIG. 13 shows an initial interest level management table obtained by the above processing.

  Further, the reception unit 12 receives and accumulates “information indicating dislike” for the category “game center”.

  Further, it is assumed that the user A visits a number of spots while using the walking navigation application (information processing apparatus 1) of his / her smartphone while viewing route guidance. And whenever the visit information reception part 123 of the information processing apparatus 1 receives visit information, the process part 13 acquires the spot identifier of the said utilized spot. Then, the processing unit 13 acquires a category identifier paired with the spot identifier from the spot attractiveness information storage unit 113 or the map information storage unit 111. Next, the processing unit 13 increments the use count corresponding to the spot identifier by one. Further, the processing unit 13 increments the use count corresponding to the category identifier corresponding to the used spot by one. It is assumed that the spot usage count management table shown in FIG. 14 is obtained by the above processing. Further, it is assumed that the category-based usage count management table shown in FIG. 15 is obtained by the above processing.

  In the above situation, it is assumed that the user A activates the walking navigation application of his / her smartphone and inputs the destination information “point Z”. Then, the destination receiving unit 122 receives destination information “point Z”. In addition, the departure point reception unit 121 acquires the current position. The departure point information indicating the point of the current position is “point A”.

  Next, the route search unit 132 searches for a route having the acquired current position “point A” as the start point and the destination “point Z” indicated by the destination information as the end point. Here, the route search unit 132 acquires route information indicating the shortest route from “point A” to “point Z”.

  Next, the detour candidate spot determination unit 131 determines detour candidate spots by the following process (the process shown in FIG. 3). That is, the detour candidate spot determining unit 131 acquires one or more points on the acquired route information of the shortest route. Then, the detour candidate spot determining unit 131 determines one or more spots whose distance from one or more points is within a threshold. Here, the detour candidate spot determining unit 131 acquires, for example, one or more spot identifiers of the spot attractiveness information storage unit 113 and acquires position information of each of the one or more spot identifiers from the map information storage unit 111. Then, the detour candidate spot determination unit 131 determines the point on the shortest path information that is the closest point to the position indicated by the position information of each spot identifier. Then, the detour candidate spot determining unit 131 acquires a spot identifier of one or more spots whose distance from the point on the route information of the shortest route is within a threshold.

  Next, the dynamic attractiveness calculation unit for each user 139 calculates the dynamic attractiveness for each user of the spots corresponding to the acquired one or more spot identifiers as follows. Here, a specific calculation example of the dynamic attractiveness for each user of the spot with the spot identifier “Sx” (hereinafter, spot “Sx”) will be described. The category of the spot identifier “Sx” is “cafe” and is an open cafe.

That is, first, the user interest level calculation unit 1391 calculates the user interest level of the spot “Sx” as follows. The user interest level calculation unit 1391 acquires the category identifier (here, “cafe”, for example) of the spot of interest from the spot attractiveness information storage unit 113 or the map information storage unit 111. Next, the user interest level calculation unit 1391 acquires the initial interest level “1” corresponding to the acquired category identifier “cafe” from the initial interest level management table of FIG. 13. Further, the user interest level calculation unit 1391 acquires information “1 (not dislike)” indicating whether or not the user dislikes corresponding to the category identifier “cafe”. The information indicating whether hate or not is S _k of Equation 1.

Next, the user interest level calculating unit 1391 acquires the total number of categories (for example, “10”) of the initial interest level “1” from the initial interest level management table of FIG. Next, the user interest level calculation unit 1391 acquires the usage count “49” corresponding to the acquired category identifier “cafe” from the category-specific usage count management table of FIG. Next, the user interest level calculating unit 1391 acquires the total number of uses (for example, “321”), which is the total number of uses of all categories, from the category-based use number management table of FIG. Then, the user interest level calculating means 1391 has an initial interest level “1”, information “1” indicating whether or not to dislike, a total category number “10” of the initial interest level “1”, and a usage count “10” corresponding to the category identifier. 49 ”and the total number of times of use“ 190 ”are substituted into Equation 1 above, and the degree of user interest (I _i ) is“ I _i = 0.3 × 1 + 0.7 × ((1 + 49) / (10 + 190)) = 0. 475 "is obtained. Here, α in Equation 1 is, for example, “0.3”.

Next, the freshness calculation means 1392 and the like calculate the freshness of the spot “Sx” as follows. First, the search result acquisition unit 136 performs a Web search using the spot “Sx” as a key. Next, the search result acquisition unit 136 acquires the date (for example, “December 1, 2014”) when the spot “Sx” attracted attention from the search result. Next, the freshness calculation unit 1392 Acquire the date “February 1, 2015.” Next, the freshness calculation means 1392 displays the number of days elapsed from the date “December 1, 2014” that received attention to “February 1, 2015”. Next, the freshness calculation means 1392 obtains the freshness expiration date “100 days” corresponding to the spot identifier of the spot of interest or the category identifier of the spot of interest as the spot attractiveness information storage unit 113. Then, the freshness calculation means 1392 uses the elapsed days “62” and the freshness expiration date “100” to set the freshness (F _i ) to “F _i = 1−62 / 100 ×”. (1-0.5 = 0.69 "is calculated. Here, the β in Equation 2, for example," 0.5 ", to.

Next, the ability level calculating means 1393 calculates the capability level of the spot “Sx” as follows. First, the ability level calculation means 1393 is one or more attribute values of the spot “Sx” of interest, and one or more attribute values (here, “weather = sunny”, “temperature> = 15) related to the level of ability level. Degree ”“ season = spring, summer ”) is acquired from the spot attractiveness information storage unit 113. Next, the context information acquisition unit 137 acquires context information “sunny” corresponding to “weather” (weather information on the current current position) from a predetermined Web page. Further, the context information acquisition unit 137 acquires “temperature = 16 degrees” ((temperature information of the current current position) from a predetermined Web page. Further, the context information acquisition unit 137 displays “season = Next, the ability level calculation means 1393 acquires the context information “sunny” that matches the attribute value “weather = sunny” related to the first ability level. In addition, the ability level calculating means 1393 determines that the acquired context information “16 degrees” matches the attribute value “temperature> = 15 degrees” related to the second ability level. Further, the ability level calculating means 1393 determines that the acquired context information “winter” does not match the attribute value “season = spring, summer” related to the second ability level. The volatility calculation unit 1393 acquires a score “2” when the context information matches, and here, the score when the context information matches is the number of matching context information. In addition, the ability achievement level calculation means 1393 obtains a score “1” when the context information does not match.The ability achievement level calculation means 1393 then uses the expression 3 to calculate the ability achievement level “A _i = 2. /(2+1)=0.67 ”Note that, here, the expression 3 is calculated as follows:“ Ability Demonstration = Score when Context Information Matches / (Score when Context Information Matches + Context Information Matches ” The score when not)).

Next, the specificity calculation unit 1394 calculates the specificity of the spot “Sx” as follows. First, the specificity calculation means 1394 is one or more attribute values of the spot “Sx” of interest, and one or more attribute values related to the specificity (here, the address “Sakyo-ku, Kyoto-shi, Kyoto ...”). Is acquired from the spot attractiveness information storage unit 113. Next, the specificity calculation unit 1394 corresponds to the attribute value (address) related to the specificity, and the user attribute value “Birthplace: Iwate Prefecture” “Address”. : Minato-ku, Tokyo ... "is acquired from the user information storage unit 112. Next, the specificity calculation means 1394 acquires the attribute value" Sakyo-ku, Kyoto-shi, Kyoto ... "related to the specificity. The user's attribute value “Birthplace: Iwate Prefecture” is compared, and the comparison result “Not included (or mismatch)” is acquired. Sakyo-ku, Kyoto City ... "and acquired user attributes “Address: Minato-ku, Tokyo ...” is compared, and the comparison result “does not include (or does not match).” The specificity calculation means 1394 determines the address of the spot and the place of origin or address of the user. If the prefecture included in the user's hometown, etc. is the same as the prefecture included in the address of the spot, a comparison result of “include (or match)” is obtained. Then, the specificity calculation unit 1394 uses the acquired comparison result “does not include (or does not match)” to obtain the value “unique _p ” obtained from the residence-based parameter. (I, u) = 2/2 = 1 ”Note that the specificity calculating means 1394 calculates, for example, the value“ unique _p (i, u) ”obtained from the residence-based parameter as the“ comparison result ”. Total / number of attribute values compared " Further, it is assumed that the specificity calculation unit 1394 acquires the use count “0” of the spot “Sx” by using the information in the spot use count management table of FIG. The degree calculation means 1394 obtains the value “Exp (i, u) = 1” based on the experience-based parameter corresponding to the number of uses “0.” Note that the value “Exp (i, u)” based on the experience-based parameter. Is, for example, “1” when the usage count is “0”, “0.3” when “1 <= use count <= 5”, and “0.1” when “6 <= use count”. Then, the specificity calculation means 1394 calculates “specificity (U _i ) = unique _p (i, u) × Exp (i, u) = 1 × 1 = 1”.

Next, the spot evaluation value calculation unit 1395 and the like calculate the spot evaluation value of the spot “Sx” as follows. First, it is assumed that the user evaluation information search unit 138 performs a Web search using the spot name of the spot “Sx” of interest, and acquires the number of positive opinions “80” of the spot. The user evaluation information search unit 138 performs a Web search using the spot name of the spot “Sx” of interest, and acquires the number of negative opinions “20” of the spot. Next, the spot evaluation value calculation unit 1395 applies the number of positive opinions of spots “80” and the number of negative opinions of spots “20” to Equation 5 to calculate a spot evaluation value. The spot evaluation value calculation means 1395 calculates the spot evaluation value “R _i = 1/2 + (80−20) / 2 × (1 + 100) = 0.80”.

Next, the user matching degree calculation unit 1396 calculates the user matching degree of the spot “Sx” as follows. First, the user match degree calculation means 1396 displays one or more attribute values “age: ˜30 years old, gender: female” related to the user match degree for the spot “Sx” of interest, the spot attractiveness information storage unit 113 or Obtained from the map information storage unit 111. Next, the user match degree calculation unit 1396 acquires the attribute value “age: 25 years old, gender: female” of the user A corresponding to one or more attribute values related to the user match degree from the user information storage unit 112. To do. Next, the user match degree calculation means 1396 compares the attribute value “age: ˜30 years old” of the spot with the attribute value “age: 25 years old” of the user A, and acquires the comparison result “match“ 1 ””. . Further, the user matching degree calculating unit 1396 compares the attribute value “sex: female” of the spot with the attribute value “sex: female” of the user A, and acquires the comparison result “match“ 1 ””. Then, the user matching degree calculation unit 1396 applies one or more acquired comparison results ““ 1 ”“ 1 ”” to Equation 6 to calculate the user matching degree. Specifically, the user match level calculation unit 1396 calculates the user match level “M _i = 2/2 = 1”. For example, it is assumed that the user matching degree calculation unit 1396 calculates the user matching degree by “user matching degree M _i = (number of matching attribute values) / number of compared attribute values”.

  Next, the dynamic attractiveness calculating unit 1397 for each user calculates the dynamic attractiveness for each user (Serendipity (i)) of the spot “Sx” for the user A using Equation 7. Specifically, the dynamic attractiveness calculating unit 1397 for each user calculates “Serendipity (Sx) = 0.475 × 0.69 × 0.67 × 1 × 0.80 × 1 = 0.18”, A dynamic attractiveness degree “0.18” for each user of the spot “Sx” is obtained. In the above calculation results, the last three digits after the decimal point are rounded off.

  Similarly to the above process, it is assumed that the dynamic attractiveness calculator for each user 139 calculates the dynamic attractiveness of each spot for each user.

  Next, it is assumed that the detour candidate spot determining unit 131 has acquired spot identifiers of X spots (here, for example, eight spots) having the highest dynamic attractiveness for each user. Here, the detour candidate spot determination unit 131 has acquired eight spot identifiers “restaurant A” “restaurant B” “cafe A” “cafe B” “cafe C” “park A” “park B” “park C”. , And.

  Next, the virtual cost calculation unit 134 calculates a virtual cost for each of the eight detour candidate spots as follows.

First, the virtual cost calculation unit 134 reads out the dynamic attraction “S ₁ = 0.19” for each user of the first spot “Restaurant A”. It is assumed that the user-specific dynamic attractiveness “S ₁ = 0.19” has already been calculated and temporarily stored in a buffer (not shown). Next, the route search unit 132 searches for a route having the current position “point A” as a start point, the spot “restaurant A” as a relay point, and the destination “point Z” as an end point, and route information (for example, ( x ₁₁ , x ₁₂ ,...) and the cost of the entire route (for example, “1831”) Next, the virtual cost calculation unit 134 determines the spot identifier “Restaurant A” and the movement of each spot user. Temporary accumulation of information having a group “1831” of the attractive degree of attractiveness “0.13”, route information (x ₂₁ , x ₂₂ ,.

Further, the virtual cost calculation unit 134 reads out the dynamic attractiveness “S ₂ = 0.13” for each user of the second spot “Restaurant B”. Next, the route search unit 132 searches for a route having the current position “point A” as a start point, the spot “restaurant B” as a relay point, and the destination “point Z” as an end point, and route information (x ₂₁ , x ₂₂ ,...) and the cost “1625” of the entire route. Next, the virtual cost calculation unit 134 sets the spot identifier “Restaurant A”, the dynamic attractiveness of each spot user “0.13”, the route information (x ₂₁ , x ₂₂ ,...), And the cost set “1625”. Is temporarily stored in a buffer (not shown).

Further, the virtual cost calculation unit 134 reads out the dynamic attractiveness “S ₃ = 0.05” for each user of the third spot “cafe A”. Next, the route search unit 132 searches for a route having the current position “point A” as a start point, the spot “cafe A” as a relay point, and the destination “point Z” as an end point, and route information (x ₃₁ , x ₃₂ ,...) and the cost “1395” of the entire route. Next, the virtual cost calculation unit 134 sets the spot identifier “cafe A”, the dynamic attractiveness of each spot user “0.13”, the route information (x ₃₁ , x ₃₂ ,...), And the cost set “1395”. Is temporarily stored in a buffer (not shown).

Further, the virtual cost calculation unit 134 reads out the dynamic attractiveness “S ₄ = 0.18” for each user of the fourth spot “cafe B”. Next, the route search unit 132 searches for a route having the current position “point A” as a start point, the spot “cafe B” as a relay point, and the destination “point Z” as an end point, and route information (for example, ( x ₄₁ , x ₄₂ ,...) and the cost “1721” of the entire route Next, the virtual cost calculation unit 134 acquires the spot identifier “cafe B”, the dynamic attractiveness of each spot user “ 0.18 ”, route information (x ₄₁ , x ₄₂ ,...), And information having the cost set“ 1721 ”are temporarily stored in a buffer (not shown).

Further, the virtual cost calculation unit 134 reads out the dynamic attractiveness “S ₅ = 0.01” for each user of the fifth spot “cafe C”. Next, the route search unit 132 searches for a route having the current position “point A” as a start point, the spot “cafe C” as a relay point, and the destination “point Z” as an end point, and route information (x ₅₁ , x ₅₂ ,...) and the cost “1903” of the entire route. Next, the virtual cost calculation unit 134 sets the spot identifier “cafe C”, the dynamic attractiveness of each spot user “0.01”, the route information (x ₅₁ , x ₅₂ ,...), And the cost set “1903”. Is temporarily stored in a buffer (not shown).

In addition, the virtual cost calculation unit 134 reads out the dynamic attractiveness “S ₅ = 0.02” for each user of the sixth spot “park A”. Next, the route search unit 132 searches for a route having the current position “point A” as a start point, the spot “park A” as a relay point, and the destination “point Z” as an end point, and route information (x ₅₁ , x ₅₂ ,...) and the cost “1903” of the entire route. Here, since the route information (x ₅₁ , x ₅₂ ,...) Is information on a route passing through the fifth spot “cafe C”, the virtual cost calculation unit 134 uses the fifth spot “cafe C”. ”Is added to the information corresponding to“ Spark = 0 ”and the dynamic attractiveness“ S ₅ = 0.02 ”for each user.

Next, the virtual cost calculation unit 134 reads out the dynamic attractiveness “S ₇ = 0.05” for each user of the seventh spot “park B”. Next, the route search unit 132 searches for a route having the current position “point A” as a start point, the spot “park B” as a relay point, and the destination “point Z” as an end point, and route information (x ₆₁ , x ₆₂ ,...) and the cost “2010” of the entire route. Next, the virtual cost calculation unit 134 sets the spot identifier “park B”, the dynamic attractiveness of each spot user “0.05”, the route information (x ₆₁ , x ₆₂ ,...), And the cost set “2010”. Is temporarily stored in a buffer (not shown).

In addition, the virtual cost calculation unit 134 reads out the dynamic attractiveness “S ₅ = 0.10” for each user of the eighth spot “park C”. Next, the route search unit 132 searches for a route having the current position “point A” as a start point, the spot “park C” as a relay point, and the destination “point Z” as an end point, and route information (x ₂₁ , x ₂₂ ,...) and the cost “1625” of the entire route. Here, since the route information (x ₂₁ , x ₂₂ ,...) Is information on the route passing through the second spot “Restaurant B”, the virtual cost calculation unit 134 uses the second spot “Restaurant B”. ”Is added to the information corresponding to“ Spark = C ”and the dynamic charm“ S ₅ = 0.10 ”for each user.

  Through the above processing, a part of the detour candidate information management table shown in FIG. 17 (information excluding virtual costs) is accumulated in the storage unit 11. The detour candidate information management table may store one or more records having “ID”, “spot identifier”, “dynamic attraction per user”, “route information”, “cost”, and “virtual cost”. In FIG. 17, the same route is merged (see “ID = 2” and “ID = 5” in FIG. 17).

  Next, the virtual cost calculation unit 134 calculates a virtual cost for the six routes (departure candidate information) in FIG. 17 using the cost and the dynamic attractiveness for each user. For example, it is assumed that the virtual cost is calculated by the function “virtual cost = cost × (1 / (total of dynamic attractiveness for each user))”. The total of the dynamic attractiveness for each user is the sum of the dynamic attractiveness for each user paired with each of the two or more spot identifiers when one detour candidate information includes two or more spot identifiers.

  That is, for the detour candidate information of “ID = 1” in FIG. 17, the virtual cost calculation unit 134 calculates “virtual cost = 1831 × (1 / 0.19) = 9636”. Further, the virtual cost calculation unit 134 calculates “virtual cost = 1625 × (1 / (0.13 + 0.10)) = 7065” for the detour candidate information with “ID = 2” in FIG. 17. Further, the virtual cost calculation unit 134 calculates “virtual cost = 1395 × (1 / 0.05) = 27900” for the detour candidate information of “ID = 3” in FIG. Further, the virtual cost calculation unit 134 calculates “virtual cost = 1721 × (1 / 0.18) = 9561” for the detour candidate information of “ID = 4” in FIG. 17. Further, the virtual cost calculation unit 134 calculates “virtual cost = 1903 × (1 / (0.01 + 0.02)) = 63433” for the detour candidate information of “ID = 5” in FIG. Further, the virtual cost calculation unit 134 calculates “virtual cost = 2010 × (1 / 0.05) = 40200” for the detour candidate information of “ID = 6” in FIG. Here, the virtual cost calculation unit 134 performs processing so that the virtual cost becomes an integer.

  Next, the route narrowing unit 135 acquires the top three detour candidate information (records of “ID = 2”, “ID = 4”, “ID = 1” in FIG. 17) with the highest virtual cost.

  Next, the spot related information output unit 141 acquires spot related information using the acquired three detour candidate information. Here, for example, it is assumed that the spot related information output unit 141 acquires route information of three detour candidate information, spot information including a spot identifier, map information including route information, and the like.

  Next, the spot related information output unit 141 outputs the acquired spot related information. An output example here is shown in FIG.

  The spot related information output unit 141 may output spot related information as shown in FIG. In the case of such output, the spot related information output unit 141 also uses the required time acquired when the route is searched.

  As mentioned above, according to this Embodiment, an attractive spot can be proposed. Moreover, according to this Embodiment, although it is unexpected for a user, an attractive spot can be proposed.

  In the present embodiment, the information processing apparatus 1 may be a so-called server. The server includes a so-called cloud server and is widely understood.

  In such a case, the reception unit 12, the departure point reception unit 121, the destination reception unit 122, and the visit information reception unit 123 receive various types of information from the terminal device 2. Then, the output unit 14 and the spot related information output unit 141 transmit spot related information and the like to the terminal device 2. Then, the terminal device 2 transmits destination information, departure point information, visit information, and the like to the information processing device 1. Further, the terminal device 2 receives and outputs spot related information from the information processing device 1. FIG. 20 is a block diagram of an information system including the information processing device 1 and the terminal device 2 in such a case.

  20 includes a terminal storage unit 20, a terminal reception unit 21, a terminal processing unit 22, a terminal transmission unit 23, a terminal reception unit 24, and a terminal output unit 25.

  The terminal storage unit 20 can store various types of information. Various types of information include, for example, a user identifier for identifying a user, user information, and the like.

  The terminal reception unit 21 receives destination information and the like. The terminal reception unit 21 can be realized by a device driver for input means such as a touch panel and a keyboard, control software for a menu screen, and the like.

  The terminal processing unit 22 performs various processes. The various processes are processes for acquiring the current position, for example. The various processes are, for example, processes for obtaining visit information. The terminal processing unit 22 can usually be realized by an MPU, a memory, or the like. The processing procedure of the terminal processing unit 22 is usually realized by software, and the software is recorded on a recording medium such as a ROM. However, it may be realized by hardware (dedicated circuit).

  The terminal transmission unit 23 transmits destination information, departure point information, visit information, and the like to the information processing apparatus 1. The terminal transmission unit 23 is usually realized by a wireless or wired communication unit, but may be realized by a broadcasting unit.

  The terminal receiving unit 24 receives spot related information in response to transmission of destination information, departure point information, and the like. The terminal receiving unit 24 is usually realized by a wireless or wired communication means, but may be realized by a means for receiving a broadcast.

  The terminal output unit 25 outputs the spot related information received by the terminal receiving unit 24. The terminal output unit 25 may be considered as including or not including an output device such as a display or a speaker. The terminal output unit 25 can be implemented by output device driver software, or output device driver software and an output device. Here, output refers to display on a display, projection using a projector, printing with a printer, sound output, transmission to an external device, storage in a recording medium, and output to other processing devices or other programs. It is a concept that includes delivery of processing results.

  Furthermore, the processing in the present embodiment may be realized by software. Then, this software may be distributed by software download or the like. Further, this software may be recorded and distributed on a recording medium such as a CD-ROM. This also applies to other embodiments in this specification. Note that the software that implements the information processing apparatus 1 in the present embodiment is the following program. In other words, the computer-accessible recording medium includes a map information storage unit that can store map information including one or more spot information including a spot identifier that identifies a spot and spot position information that indicates the position of the spot, A spot attractiveness information storage unit capable of storing, for each of one or more spots, a dynamic attractiveness level for each user, which is an attractiveness level of a spot that changes depending on the user, The program includes a departure point reception unit for receiving departure point information indicating a departure point, a destination reception unit for receiving destination information indicating a destination, and a departure point or destination information indicated by the departure point information. One or more spots that are close enough to meet a predetermined location from the indicated destination and meet a predetermined attractiveness condition As a spot-related candidate spot determining unit that determines one or more spots having a higher dynamic attractiveness for each user, and a spot-related information output unit that outputs spot-related information related to one or more spots determined by the candidate candidate spot determining unit. It is a program for functioning.

  In the program, the spot attractiveness information storage unit includes one or more spot attractiveness information having a dynamic attractiveness for each user, a spot identifier, and one or more spot dynamic attribute values that dynamically change the spot. The recording medium further includes a user information storage unit that can store one or more dynamically changing user dynamic attribute values of the user, and the dynamic attractiveness per user is A program that causes a computer to function as the value calculated using the one or more spot dynamic attribute values and the one or more user dynamic attribute values is preferable.

  In the above program, the computer may use one or more of the one or more spots determined by the detour candidate spot determining unit using the map information as a relay point, and start from the starting point indicated by the starting point information. A route search unit for acquiring route information and cost specifying one or more routes to the destination indicated by the destination information, and one or more relays on the one or more route information acquired by the route search unit Cost per user corresponding to one or more pieces of route information acquired by the user dynamic attraction acquisition unit for acquiring the user dynamic attractiveness corresponding to a spot of points from the spot attractiveness information storage unit and the route search unit On the other hand, the spot is further functioned as a virtual cost calculation unit that calculates a virtual cost that becomes smaller as the dynamic attractiveness per user corresponding to each of the route information is larger, The continuous information output unit uses a virtual cost corresponding to the one or more pieces of route information calculated by the virtual cost calculation unit, and spots related to one or more spots that are relay points of the route indicated by the one or more pieces of route information It is preferable that the program outputs a related information so that the computer functions.

  In the above program, the computer may be one or more pieces of route information out of one or more route information acquired by the route search unit using one or more virtual costs calculated by the virtual cost calculation unit. The spot-related information output unit further functions as a route narrowing unit that obtains the route information, and uses the virtual cost corresponding to each of the one or more pieces of route information obtained by the route narrowing unit. A program that causes a computer to function as the spot-related information regarding one or more spots that are relay points of the route indicated by each route information is preferable.

  In the above program, the dynamic attractiveness for each user includes a spot specificity for the user, and the specificity is a program that causes the computer to function as a value that decreases when the user visits. It is preferable to be.

  Further, in the above program, the visit information is information having a spot identifier, and the visit information is received when the visit information accepting unit accepts the visit information indicating that the user has visited the spot, and the visit information accepting unit accepts the visit information. The program further causes the computer to function as a dynamic per-user attractiveness calculating unit that calculates a new per-user dynamic attractiveness of the spot so as to reduce the per-user dynamic attractiveness that is paired with the spot identifier that the user has. Is preferred.

  In the program, the spot attractiveness information storage unit stores one or more spot attractiveness information having a dynamic attractiveness for each user, a spot identifier, and one or more attribute values of the spot. The information storage unit stores user information including one or more attribute values of the user, including user preference information related to the user's preference for the spot. The computer performs a Web search using the spot identifier, and the search result. A search result acquisition unit that acquires a user name, a context information acquisition unit that acquires one or more context information among day, time, and weather, and a user who performs a Web search and evaluates a user corresponding to each of the one or more spot identifiers User evaluation information search unit for acquiring evaluation information, one or more attribute values of a spot, one or more attribute values of a user, user preference Using the information, the search result, the one or more context information, and the user evaluation information, further function as a per-user dynamic attraction calculation unit that calculates a per-user dynamic attraction for each of the one or more spots, Assuming that the dynamic attractiveness per user included in each of the one or more pieces of spot attractiveness information in the spot attractiveness information storage unit is the dynamic attractiveness per user calculated by the dynamic attractiveness calculation unit per user, the computer It is preferable that the program is a function that functions.

  In the above program, the dynamic attractiveness calculating unit for each user uses the user preference information to calculate a user interest degree with respect to the spot using the user preference information and a freshness with respect to the spot using the search result. A freshness calculating means for calculating the degree, an ability achievement calculating means for calculating an ability achievement degree of each spot using the one or more context information and the attribute value of each spot, an attribute value of the user and the spot value Using the attribute value, the specificity calculation means for calculating the specificity of the spot for the user, and one or more user evaluation information acquired by the user evaluation information search unit, the evaluation value of one or more spots Spot evaluation value calculating means for calculating a spot evaluation value, one or more attribute values of the user, and one or more attribute values corresponding to one or more spots Using user matching degree calculation means for calculating a user matching degree, which is a degree of matching between a spot and a user, and comprising two or more means, and the user interest level, the freshness level, and the ability display A user-specific dynamic attractiveness calculating means for calculating a dynamic attractiveness per user of each spot using two or more values among the degree, the specificity, the spot evaluation value, and the user matching degree It is preferable that the program is a program that causes a computer to function.

  Further, in the above program, the computer is further caused to function as a route search unit that acquires route information of a route that is the route from the departure point indicated by the departure point information to the destination indicated by the destination information and has the lowest cost. Alternatively, the route search unit is a route from the departure point indicated by the departure point information to the destination indicated by the destination information, and also acquires the minimum cost route information indicating the route with the lowest cost, and the spot related information output unit is , Causing the computer to function as outputting spot related information including a required time of a route passing through one or more spots determined by the detour candidate spot determining unit and a required time of the route indicated by the minimum cost route information It is preferable that it is a program.

  In the above program, the spot attractiveness information storage unit is a user's attractiveness of a spot that dynamically changes for each user and for each of one or more spots, and a user who has a different attractiveness of a spot depending on the user. The departure degree reception unit receives departure point information from a terminal device, and the destination reception unit receives destination information and a user identifier for identifying a user from the terminal device. Preferably, the spot related information output unit is a program that causes a computer to function as transmitting the spot related information to the terminal device.

  FIG. 21 shows the external appearance of a computer that executes the program described in this specification to realize the information processing apparatus 1 and the like according to the various embodiments described above. The above-described embodiments can be realized by computer hardware and a computer program executed thereon. FIG. 21 is an overview diagram of the computer system 300, and FIG. 22 is a block diagram of the system 300.

  In FIG. 21, a computer system 300 includes a computer 301 including a CD-ROM drive, a keyboard 302, a mouse 303, and a monitor 304.

  22, in addition to the CD-ROM drive 3012, the computer 301 includes an MPU 3013, a bus 3014 connected to the MPU 3013 and the CD-ROM drive 3012, a ROM 3015 for storing a program such as a bootup program, and an MPU 3013. And a RAM 3016 for temporarily storing instructions of the application program and providing a temporary storage space, and a hard disk 3017 for storing the application program, the system program, and data. Although not shown here, the computer 301 may further include a network card that provides connection to a LAN.

  A program that causes the computer system 300 to execute the functions of the information processing apparatus 1 and the like of the above-described embodiment may be stored in the CD-ROM 3101, inserted into the CD-ROM drive 3012, and further transferred to the hard disk 3017. . Alternatively, the program may be transmitted to the computer 301 via a network (not shown) and stored in the hard disk 3017. The program is loaded into the RAM 3016 at the time of execution. The program may be loaded directly from the CD-ROM 3101 or the network.

  The program does not necessarily include an operating system (OS) or a third-party program that causes the computer 301 to execute the functions of the information processing apparatus 1 according to the above-described embodiment. The program only needs to include an instruction portion that calls an appropriate function (module) in a controlled manner and obtains a desired result. How the computer system 300 operates is well known and will not be described in detail.

  In the above program, in the step of transmitting information, the step of receiving information, etc., processing performed by hardware, for example, processing performed by a modem or an interface card in the transmission step (only performed by hardware) Processing) is not included.

  Further, the computer that executes the program may be singular or plural. That is, centralized processing may be performed, or distributed processing may be performed.

  Further, in each of the above embodiments, it goes without saying that two or more communication units existing in one apparatus may be physically realized by one medium.

  In each of the above embodiments, each process may be realized by centralized processing by a single device, or may be realized by distributed processing by a plurality of devices.

  The present invention is not limited to the above-described embodiments, and various modifications are possible, and it goes without saying that these are also included in the scope of the present invention.

  As described above, the information processing apparatus according to the present invention has an effect that an attractive spot can be proposed, and is useful as a navigation apparatus or the like.

DESCRIPTION OF SYMBOLS 1 Information processing apparatus 2 Terminal apparatus 11 Storage part 12 Reception part 13 Processing part 14 Output part 20 Terminal storage part 21 Terminal reception part 22 Terminal processing part 23 Terminal transmission part 24 Terminal reception part 25 Terminal output part 111 Map information storage part 112 User Information storage unit 113 Spot attractiveness information storage unit 121 Departure point reception unit 122 Destination reception unit 123 Visit information reception unit 131 Road candidate spot determination unit 132 Route search unit 133 Dynamic attractiveness acquisition unit for each user 134 Virtual cost calculation unit 135 Route refinement unit 136 Search result acquisition unit 137 Context information acquisition unit 138 User evaluation information search unit 139 Dynamic attractiveness calculation unit for each user 141 Spot related information output unit 1391 User interest level calculation unit 1392 Freshness level calculation unit 1393 Calculation means 1394 Specificity calculation means 1395 Spot evaluation value calculating means 1396 User matching degree calculating means 1397 Dynamic attractiveness calculating means for each user

Claims (12)

A map information storage unit capable of storing map information having one or more spot information having a spot identifier for identifying a spot and spot position information indicating the position of the spot;
A spot attractiveness information storage unit capable of storing, for each of the one or more spots, a dynamic attractiveness for each user, which is an attractiveness of a spot that dynamically changes and is an attractiveness of a spot that varies depending on a user;
A departure point reception unit for receiving departure point information indicating the departure point,
A destination reception unit for receiving destination information indicating the destination;
One or two or more spots that are close enough to satisfy a predetermined position condition from a starting point indicated by the starting point information or a destination indicated by the destination information, and are dynamic for each user as a predetermined attractiveness condition is satisfied. A detour candidate spot determining unit that determines one or more spots having a high degree of attractiveness,
An information processing apparatus comprising: a spot related information output unit that outputs spot related information related to one or more spots determined by the detour candidate spot determining unit. The spot attractiveness information storage unit
Storing one or more spot attractiveness information having a dynamic attractiveness per user, a spot identifier, and one or more spot dynamic attribute values dynamically changing the spot;
A user information storage unit capable of storing one or more dynamically changing one or more user dynamic attribute values of the user;
The information processing apparatus according to claim 1, wherein the per-user dynamic attractiveness is a value calculated using the one or more spot dynamic attribute values and the one or more user dynamic attribute values. From the starting point indicated by the starting point information to the destination indicated by the destination information, using one or more spots among the one or more spots determined by the detour candidate spot determining unit using the map information A route search unit for acquiring route information and cost specifying each of the one or more routes,
Dynamic attractiveness acquisition unit for each user that acquires dynamic attractiveness for each user corresponding to the spot of one or more relay points on each of the one or more pieces of route information acquired by the route search unit from the spot attractiveness information storage unit When,
A virtual cost calculation that calculates a virtual cost that becomes smaller as the dynamic attractiveness for each user corresponding to each route information is larger than the cost corresponding to one or more pieces of route information acquired by the route search unit. And further comprising
The spot related information output unit
The spot related information regarding one or more spots that are relay points of the route indicated by the one or more route information is output using a virtual cost corresponding to the one or more route information calculated by the virtual cost calculation unit. The information processing apparatus according to claim 1 or 2. Using one or more virtual costs calculated by the virtual cost calculation unit, route narrowing down that acquires one or more route information, which is a part of the route information, among the one or more route information acquired by the route search unit Further comprising
The spot related information output unit
The spot related information regarding one or more spots which are relay points of the route indicated by the one or more route information is output using a virtual cost corresponding to the one or more route information acquired by the route narrowing unit. Item 4. The information processing device according to Item 3. The information according to any one of claims 1 to 4, wherein the user-specific dynamic attractiveness includes a spot specificity for the user, and the specificity is a value that decreases when the user visits. Processing equipment. A visit information receiving unit that is information having a spot identifier and receives visit information indicating that the user has visited the spot;
For each user who calculates a new per-user dynamic attractiveness of the spot so as to reduce a per-user dynamic attractiveness paired with a spot identifier included in the visit information when the visit information receiving unit receives the visit information The information processing apparatus according to claim 5, further comprising a dynamic attractiveness calculation unit. The spot attractiveness information storage unit
Storing one or more spot attractiveness information having a dynamic attractiveness per user, a spot identifier, and one or more attribute values of the spot;
The user information storage unit
Contains user information having one or more attribute values of the user, including user preference information relating to the user's preference for the spot,
A search result acquisition unit that performs a Web search using a spot identifier and acquires a search result;
A context information acquisition unit that acquires one or more context information among day, time, and weather;
A user evaluation information search unit that performs a Web search and acquires user evaluation information related to user evaluation corresponding to each of the one or more spot identifiers;
1 or more attribute values of a spot, 1 or more attribute values of a user, user preference information, the search result, the one or more context information, and the user evaluation information It further comprises a dynamic attractiveness calculator for each user that calculates the attractiveness,
The dynamic attractiveness for each user included in each of the at least one spot attractiveness information in the spot attractiveness information storage unit is a dynamic attractiveness for each user calculated by the dynamic attractiveness calculation unit for each user. Information processing device. The dynamic attractiveness calculation unit for each user is
User interest degree calculating means for calculating a user interest degree for a spot using the user preference information;
Freshness calculation means for calculating the freshness of the spot using the search result;
Using the one or more context information and the attribute value of each spot, an ability level calculating means for calculating the level of capability of each spot;
Specificity calculation means for calculating the specificity of the spot for the user using the attribute value of the user and the attribute value of the spot;
Spot evaluation value calculating means for calculating a spot evaluation value, which is an evaluation value of each of one or more spots, using one or more user evaluation information acquired by the user evaluation information search unit;
User matching degree calculation means for calculating a user matching degree, which is a degree of matching between a spot and a user, using one or more attribute values of the user and the one or more attribute values corresponding to one or more spots. Of which two or more means are provided,
And each user's dynamic attractiveness of each spot is calculated using two or more values among the user interest level, the freshness level, the ability display level, the specificity level, the spot evaluation value, and the user match level. The information processing apparatus according to claim 7, further comprising a per-user dynamic attractiveness calculating unit for calculating. The route search unit further includes a route search unit that acquires route information of a route that is a route from the departure point indicated by the departure point information to the destination indicated by the destination information and that has the lowest cost. It is the route from the departure point indicated by the information to the destination indicated by the destination information, and also obtains the minimum cost route information indicating the route with the lowest cost,
The spot related information output unit
9. The spot related information including a required time of a route passing through one or more spots determined by the detour candidate spot determining unit and a required time of a route indicated by the minimum cost route information is output. The information processing apparatus according to claim 1. The spot attractiveness information storage unit
For each user and each one or more spots, the attractiveness of the spot that dynamically changes, and the attractiveness of each spot that is different depending on the user is stored,
The departure point reception unit
Receive departure place information from the terminal device,
The destination reception unit
Receiving destination information and a user identifier for identifying the user from the terminal device;
The spot related information output unit
The information processing apparatus according to claim 1, wherein the spot related information is transmitted to the terminal apparatus. The recording medium is
A map information storage unit capable of storing map information having one or more spot information having a spot identifier for identifying a spot and spot position information indicating the position of the spot;
A spot attractiveness information storage unit capable of storing, for each of the one or more spots, the dynamic attractiveness of each spot, which is the attractiveness of the spot that dynamically changes, and the attractiveness of each spot varies depending on the user;
An information processing method realized by a departure point reception unit, a destination reception unit, a detour candidate spot determination unit, and a spot related information output unit,
A departure point reception step in which the departure point reception unit receives departure point information indicating a departure point;
A destination receiving step in which the destination receiving unit receives destination information indicating a destination; and
The detour candidate spot determining unit is one or more spots that are close enough to satisfy a predetermined position from a starting point indicated by the starting point information or a destination indicated by the destination information, and a predetermined attractiveness level. A detour candidate spot determination step for determining one or more spots whose dynamic attractiveness is larger for each user as the condition is satisfied;
An information processing method comprising: the spot related information output unit that outputs spot related information related to one or more spots determined in the detour candidate spot determining step. Computer-accessible recording media
A map information storage unit capable of storing map information having one or more spot information having a spot identifier for identifying a spot and spot position information indicating the position of the spot;
A spot attractiveness information storage unit capable of storing, for each of the one or more spots, the dynamic attractiveness of each spot, which is the attractiveness of the spot that dynamically changes, and the attractiveness of each spot varies depending on the user;
Computer
A departure point reception unit for receiving departure point information indicating the departure point,
A destination reception unit for receiving destination information indicating the destination;
One or two or more spots that are close enough to satisfy a predetermined position condition from a starting point indicated by the starting point information or a destination indicated by the destination information, and are dynamic for each user as a predetermined attractiveness condition is satisfied. A detour candidate spot determining unit that determines one or more spots having a high degree of attractiveness,
A program for functioning as a spot related information output unit that outputs spot related information regarding one or more spots determined by the detour candidate spot determining unit.