JP2009277005A - Meeting place candidate retrieval system, meeting place candidate retrieval method, and meeting place candidate retrieval program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a meeting place candidate retrieval system for adding probability of presence of both persons, and the time when the probability changes to each candidate and presenting it to a user. <P>SOLUTION: This meeting place candidate retrieval system is provided with a meeting place candidate calculation means for, on the basis of the combination of a plurality of individual past traveling routes for meeting including a time and its use frequency acquired from a past route storage means which stores the plurality of past traveling routes and its use frequency, calculating the candidates of the meeting places and time of a plurality of persons and its execution probability. <P>COPYRIGHT: (C)2010,JPO&INPIT

Description

  The present invention relates to a technical field such as a system and a method for calculating candidates for a meeting place and time of a plurality of persons who are to meet.

  With the spread of information and communication technologies including telephones, it has become possible to easily decide how to meet people. It is possible to immediately consult a meeting method even when using a telephone while staying at a remote place.

However, in areas such as urban areas where movement by rail and other transportation is common, the range of human behavior is complex and there are many choices of meeting places, so information is shared before discussing meeting places by telephone etc. Technical assistance such as is required. For example, Patent Document 1 proposes a system in which the range of action of two waiting trains is stored daily as the frequency of use of a station, and a station that is common to both parties and used frequently is presented as a meeting place. If this is used, it will be possible to consult with two parties after narrowing down the meeting place to some extent.
JP 2003-242376 A

  However, in the system disclosed in Patent Document 1, the meeting place is determined from the past movement history of each individual person, but the meeting time is not determined. Instead, it is exemplified that the goods are delivered using lockers at each station. However, this is not sufficient when it is desired to meet for some reason as well as delivery of goods. If it is possible to narrow down the meeting place and time at the same time, if you can predict the travel route including the time by using information such as the typical travel route and time, schedule, etc. of each person extracted from the past travel route Seem.

  However, there are the following problems in performing the movement route prediction including this time.

  First, there are a number of patterns in the past route, and the travel route cannot be uniquely determined without additional information.

  Secondly, the schedule is not always input enough, and it cannot be said that the travel route is uniquely determined by the past route estimation alone.

  Thirdly, if the movement route is not uniquely determined, when waiting for a plurality of people, waiting candidates corresponding to the ambiguity of the individual movement route candidates are generated.

  Fourthly, it may be possible to simply exclude the time zone that may have multiple paths from the verification, but it is possible to expect an unreasonable situation that can be met early. For example, if two people who use the same station once every two days decide the meeting place in this way, that station will be excluded from the candidates.

  The present invention has been made in view of the above-mentioned problems and the like. The purpose of the present invention is to determine possible meeting places and time candidates in order to assist in deciding where to meet as soon as possible. Can be presented to the user in the order in which they are early, and for each candidate, the probability of both of them being present, and the time when it changes will be presented to the user. It is an object of the present invention to provide a meeting place candidate search system, a meeting place candidate search method, and a meeting place candidate search program.

  In order to solve the above-mentioned problem, the invention according to claim 1 is characterized in that a plurality of persons who perform waiting obtained from a past route holding means that holds a plurality of past movement routes of an individual including the time of use together with the frequency of use thereof. The present invention is characterized by comprising waiting candidate calculation means for calculating the candidates for the meeting place and time of the plurality of persons and the execution probability thereof based on the combination of the past movement route and the use frequency.

  According to the present invention, since the execution probability is calculated in addition to the candidates for the meeting place and time of a plurality of persons, it is possible to present to the user how much both of them are there for each candidate. It becomes possible.

  According to a second aspect of the present invention, in the meeting place candidate search system according to the first aspect, the meeting candidate calculation unit specifies a place that coincides at the same time on the past movement route of the plurality of persons. The specified location and its time are used as candidates for the meeting place and time of the plurality of persons, and the total number moved to the candidate time in the past is divided by the use frequency of the movement route having the location as the candidate. The ratio is calculated for each of the plurality of persons as the execution probability of the candidate.

  The invention according to claim 3 further comprises probability change specifying means for specifying when the execution probability of the candidate for the meeting place and the time changes in the meeting place candidate search system according to claim 1 or 2. It is characterized by.

  According to the present invention, it is possible to add to the user the time when the both change in addition to the probability of both being there, and to present it to the user.

  According to a fourth aspect of the present invention, in the waiting place candidate search system according to the first or second aspect, the waiting place and time candidate calculated by the waiting candidate calculating means and information indicating the execution probability are stored in the waiting place. It is further characterized by further comprising information presenting means for presenting to a person who performs the above.

  Here, as a method of presenting to the person who performs the meeting, for example, displaying the information on a communication terminal used by the person, outputting the information from the communication terminal by voice, or the like. Can be mentioned. As a result, the user of the communication terminal can quickly grasp the probability that both are present for each candidate.

  According to a fifth aspect of the present invention, in the waiting place candidate search system according to the third aspect, when the waiting place and time candidate calculated by the waiting candidate calculating means and its execution probability change together with the execution probability. It is further characterized by further comprising information presenting means for presenting information indicating whether to perform to the person performing the meeting.

  Thereby, the user of the communication terminal can quickly grasp at what time it changes in addition to the probability of both being there.

  The invention described in claim 6 is the meeting place candidate search system according to any one of claims 1 to 5, wherein the current day route holding means for holding the moving route of the individual meeting date including the time includes the corresponding day. Past route search means for obtaining a matching past travel route by acquiring a travel route of the corresponding day and collating the travel route of the day with the past travel route obtained from the past route holding means. The waiting candidate calculation means calculates the waiting place and time candidates of the plurality of persons and the execution probability thereof using the past travel route searched by the past route search means and the frequency of use thereof. And

  According to the present invention, the moving route on the current day, which is a halfway route generated as a result of the movement of the individual already on the meeting date, is compared with the past moving route, the matching past moving route is searched, Since it is configured to calculate the candidates for the meeting place and time of the plurality of people and the execution probability using the past movement route and the frequency of use thereof, not only can it be narrowed down to the waiting time after the time of moving on the meeting day. , More predictive predicted routes can be narrowed down.

  According to a seventh aspect of the present invention, in the meeting place candidate search system according to any one of the first to fifth aspects, the schedule is indicated from a schedule holding means for holding information indicating an individual schedule including the time. It further comprises past route search means for acquiring information, comparing the information indicating the schedule with the past movement route acquired from the past route holding means, and searching for a suitable past movement route, The waiting candidate calculating means calculates the waiting place and time candidates of the plurality of persons and the execution probability thereof using the past moving route searched by the past route searching means and the frequency of use thereof. .

  According to the present invention, the personal schedule and the past movement route are collated, the matching past movement route is searched, and the meeting of the plurality of persons is performed using the past movement route and the frequency of use thereof. Since the location and time candidates and their execution probabilities are calculated, it is possible to narrow down predicted routes that are candidates that match the schedule.

  According to an eighth aspect of the present invention, in the meeting place candidate search system according to the sixth aspect, the past route search means indicates the schedule from schedule holding means for holding information indicating an individual schedule including time. Information is acquired, the information indicating the schedule and the moving route of the day are collated with the past moving route acquired from the past route holding means, and the matching past moving route is searched. And

  The invention according to claim 9 is a meeting place candidate search method performed by a computer, the step of acquiring a past movement route of a plurality of persons including a time and a use frequency thereof, and the past of the plurality of persons Calculating a candidate for the meeting place and time of the plurality of persons and an execution probability thereof based on a combination of a movement route and the use frequency.

  The invention of the waiting place candidate search program according to claim 10 is for a plurality of persons who wait for a computer to be acquired from past route holding means for holding a plurality of past movement routes of individuals including the time of use together with the frequency of use. Based on the combination of the past travel route and the use frequency, the function is made to calculate the candidate meeting place and time candidates and the execution probability thereof.

  According to the present invention, since the execution probability is calculated in addition to at least a plurality of meeting places and time candidates, the probability that both are present is presented to the user for each candidate. It becomes possible. In addition, it goes without saying that the probability of meeting can be accurately estimated by determining the moving route of today as the time is later in the day. However, there is no help for it to wait. Therefore, the present invention pays attention to the fact that the time for causing the change can be calculated only from the past movement route, not the current movement route, and by displaying it, it is possible to provide an indication for waiting.

  Hereinafter, the best embodiment of the present invention will be described in detail with reference to the drawings. The embodiment described below is an embodiment when the meeting place candidate search system, the meeting place candidate search method, and the meeting place candidate search program according to the present invention are applied to the meeting place candidate providing system. is there.

  First, the configuration of the meeting place candidate providing system according to the present embodiment will be described with reference to FIG.

  FIG. 1 is a diagram illustrating a schematic configuration example of a meeting place candidate providing system according to the present embodiment. In the example of FIG. 1, for convenience of explanation, a configuration for providing information such as a meeting place of two users, time candidates and execution probabilities thereof is shown.

  As shown in FIG. 1, the meeting place candidate providing system S according to the present embodiment includes schedule acquisition means A0, B0, position / time acquisition means A1, B1, date and time designation means A2, B2, person designation means A3, B3, Waiting place / time candidate display means (an example of information presenting means in the present invention) A4, B4, today's midway route holding buffer (an example of the current day route holding means in the present invention) A5, B5, past route adding means (in the present invention) An example of probability change specifying means) A6, B6, past route holding means A7, B7, past route search (search) means A8, B8, schedule holding means A9, B9, predicted route holding buffers A10, B10, and meeting place / time Candidate calculation means (an example of waiting candidate calculation means in the present invention) 11 is provided.

  Here, the schedule acquisition means A0, the position / time acquisition means A1, the date / time specification means A2, the person specification means A3, and the meeting place / time candidate display means A4 are used (carried) by the user A as an individual. Terminal A is provided. On the other hand, the schedule acquisition means B0, the position / time acquisition means B1, the date / time specification means B2, the person specification means B3, and the meeting place / time candidate display means B4 are portable terminals used (carried) by the user B as an individual. B is provided. The schedule acquisition means A0, B0, date and time designation means A2, B2, person designation means A3, B3, and meeting place / time candidate display means A4, B4 are provided in a personal computer that can communicate with an information processing server to be described later. May be.

  The mobile terminal A and the mobile terminal B are communication terminals such as a mobile phone, a PDA (Personal Digital Assistant), or a personal computer, for example, a CPU having a calculation function, a memory for storing various data and programs (for example, ROM, RAM , Hard disk, etc.), GPS receiver that receives navigation radio waves output from GPS (Global Positioning System) satellites and measures the current position (longitude and latitude) based on the received signal, timer unit with clock function, user An operation unit that receives an operation instruction from the mobile phone, a display unit that displays various information, a communication unit for connecting to the Internet, a mobile communication network, and the like. The schedule acquisition means A0, B0, the position / time acquisition means A1, B1, the date / time specification means A2, B2, the person specification means A3, B3, and the meeting place / time candidate display means A4, B4 are the mobile terminal A and mobile This is realized by the CPU provided in the terminal B executing a predetermined program. In addition, the mobile terminal A and the mobile terminal B can perform data communication with each other via, for example, the Internet or a mobile communication network. Furthermore, each of the mobile terminal A and the mobile terminal B is, for example, the Internet. It is possible to perform data communication by connecting to an information processing server via a mobile communication network or the like.

  On the other hand, today's midway route holding buffers A5 and B5, past route adding means A6 and B6, past route holding means A7 and B7, past route searching means A8 and B8, schedule holding means A9 and B9, predicted route holding buffers A10 and B10 The waiting place / time candidate calculation means 11 is provided in an information processing server that performs data communication with the mobile terminal A and the mobile terminal B via the Internet, a mobile communication network, or the like. Such an information processing server includes, for example, a server computer, a CPU having an arithmetic function, a memory (for example, ROM, RAM, hard disk, etc.) for storing various data and programs, a clock unit having a clock function, and the Internet and mobile communication. A communication unit for connecting to a network or the like is provided. The past route adding means A6, B6, the past route searching means A8, B8, and the waiting place / time candidate calculating means 11 are configured such that the CPU provided in the information processing server has a predetermined program (the waiting place candidate searching program of the present invention). It is realized by executing (including). In addition, today's midway route holding buffers A5 and B5, past route holding means A7 and B7, schedule holding means A9 and B9, and predicted route holding buffers A10 and B10 are used by predetermined storage areas of the memory provided in the information processing server. To be realized.

  Note that today's midway route holding buffer A5, past route adding means A6, past route holding means A7, past route searching means A8, schedule holding means A9, and predicted route holding buffer A10 can communicate with mobile terminal A or mobile terminal A. Provided in a personal computer, today's midway route holding buffer B5, past route adding means B6, past route holding means B7, past route searching means B8, schedule holding means B9, and predicted route holding buffer B10 are either portable terminal B or portable A personal computer that can communicate with the terminal B may be provided. Furthermore, the meeting place / time candidate calculation means 11 may be configured to be provided in either the mobile terminal A or the mobile terminal B.

  Next, an outline of the function of each means will be described with reference to FIG. In this description, the schedule acquisition means A0, the position / time acquisition means A1, the date / time specification means A2, the person specification means A3, the meeting place / time candidate display means A4 on the portable terminal A (user A) side, The functions of the halfway route holding buffer A5, the past route adding unit A6, the past route holding unit A7, the past route searching unit A8, the schedule holding unit A9, and the predicted route holding buffer A10 will be described as a representative. Schedule acquisition means B0, position / time acquisition means B1, date / time designation means B2, person designation means B3, meeting place / time candidate display means B4, today's midway route holding buffer B5, past route addition means B6, The functions of the past route holding unit B7, the past route searching unit B8, the schedule holding unit B9, and the predicted route holding buffer B10 are the same as those of the portable terminal A side. That.

  The schedule acquisition unit A0 is information that indicates the schedule (schedule) of the user A including the time, which is input in advance by the user A and stored in the memory (for example, the start date / time, the end date / time, and the contents of the schedule). And the information indicating the acquired schedule is output to the schedule holding means A9 (for example, output via the Internet or a mobile communication network).

  The position / time acquisition unit A1 acquires the current position of the user A from the GPS receiving unit, repeatedly acquires the acquisition time (date and time) from the time measuring unit, and repeatedly acquires the acquired current position and information indicating the time in the past path. The data is output to the adding means A6 (for example, output via the Internet or a mobile communication network).

  The output of the information indicating the schedule, the information indicating the current position and the time may be configured such that the portable terminal A periodically accesses the information processing server, or is used. It may be configured such that the user A accesses the information processing server by pressing the transmission button on the operation unit of the portable terminal A.

  When the user A uses the system S, the date / time specifying means A2 receives from the user A designation of a date and time zone to be waited for via the operation unit, and indicates the date and time zone. Information is output to the meeting place / time candidate calculation means 11 (for example, output via the Internet or a mobile communication network).

  When the user A uses the system S, the person specifying means A3 receives from the user A the specification of the target person (for example, the user B) to be waited for via the operation unit. The information indicating the person (for example, the name and ID of the subject person) is output to the meeting place / time candidate calculation means 11.

  For example, today's midway route holding buffer A5 starts its operation since the contents are erased at the beginning of the day, and holds the position obtained from the past route adding means A6 in time series with the time. The moving route (consisting of a plurality of points corresponding to the above positions) of the corresponding day from, for example, the morning of the user A's meeting date (today) including (date and time) is held.

  The past route holding means A7 holds a plurality of travel routes of the user A in the past day (routes including the time (date and time) at each point, hereinafter referred to as “past route”) together with the frequency of use (repetition frequency). It is like that.

  The use frequency is a numerical value indicating the degree of use of the travel route (for example, the use frequency when a travel route is used for 3 days is “3”).

  The past route adding means A6 adds, for example, the daily travel route held in chronological order in today's midway route holding buffer A5 to the contents of the past route holding means A7 at the end of the day, The usage frequency of the past route (the past route held in the past route holding means A7) that matches the one-day travel route held in time series in the intermediate route holding buffer A5 is increased by one. Further, the past route adding means A6 divides a plurality of past routes in the past route holding means A7 into time intervals in which the overlap does not change.

  Here, specific processing (operation) of the past route adding means A6 will be described with reference to FIGS.

FIG. 2 is a flowchart showing the process up to the middle of the past route holding means A6, and FIG. 3 is a flowchart showing the continuation of the process of the past route holding means A6 shown in FIG.
FIG. 4 is a diagram showing the positional relationship between points (milestones) 1 to 7. FIG. 5 is a diagram illustrating an example of storing the past routes of the users A and B at a time before the start time of the day.

  First, the process of FIG. 2 is started at the time of the start of the day (for example, at 6:00 in the morning, simultaneously with the system startup), and the past route adding means A6 has a current time of n (any one between 1 and 24). (Natural number) Wait until the time / time acquisition means A1 repeatedly reads the time until time 0 minutes or n: 30 (step S1), and when the time is left, the time is determined as the current time. In the following description of this flowchart, the current time refers to the current time determined at this time.

  Next, the past route adding means A6 checks whether or not the current time is the time of the end of the day. If it is the time of the end of the day (step S2: YES), the process goes to step S9. (Step S2: NO), the process proceeds to Step S3. The end time of the day is an arbitrary time within 24 hours from the start time of the day. For example, the start time of the day may be 5:00 am and the end time of the day may be 2:00 am the next day.

  In step S3, the past route adding means A6 acquires the current position from the position / time acquisition means A1, and the current position is a specified point (landmark) (in this example, “1” to “7” in FIG. 4). If it is not, it is identified as “moving”.

  Next, the past route adding means A6 stores the point identified in step S3 or moving in the storage location corresponding to the current time in today's midway route holding buffer A5 (step S4).

  Next, the past route adding unit A6 selects one past route not recorded as “mismatch” from the past route holding unit A7 (step S5).

  Next, the past route adding means A6 determines the point identified in step S3 ("1" to "7" or "moving") and the point corresponding to the current time on the past route selected in step S5. Are compared (step S6). If they match (step S6: match), the process proceeds to step S8. If they do not match (step S6: mismatch), the process proceeds to step S7.

  In step S7, the past route adding means A6 records “mismatch” in association with the past route in the past route holding means A7 selected in step S5 (that is, the past route is marked with “mismatch” ( Information).

  On the other hand, in step S8, the past route adding means A6 checks whether all past routes that are not recorded as “mismatch” among the past routes in the past route holding means A7 have been processed in step S5. If there is something (step S8: NO), the process returns to step S5, and if all are processed (step S8: YES), the process returns to step S1.

  On the other hand, in step S9, the past route adding means A6 checks whether or not a past route that is not recorded as “mismatch” remains in the past route holding means A7, and remains (that is, a past that matches the current travel route). If the route remains), the frequency of use is increased by 1. Otherwise, the travel route in today's midway route holding buffer A5 is acquired, and the acquired travel route is stored in the past route holding means A7. It adds as usage frequency 1.

By such processing, the past route holding means A7 is maintained so that there is only one past route that is not recorded as “mismatch” at this time even if it remains.
Thereafter, all “mismatch” records in the past route holding means A7 are erased (step S10), and the operation of the day ends. As a result, data corresponding to one usage frequency per day is added to the past route holding means A7.

  Next, following the above process, as shown in FIG. 3, a dividing process for dividing a plurality of past routes in the past route holding means A7 into time intervals in which the overlap does not change is executed.

  The processing of FIG. 3 will be described with reference to FIG.

  Here, FIG. 5 shows an example of data held in today's midway route holding buffers A5 and B5 and past route holding means A7 and B7 before reaching the start time of the day. Yes. The fact that user A and user B's today's route is blank indicates that the contents of today's halfway route buffers A5 and B5 are empty at the beginning of the day. Further, FIG. 5 shows that the past route holding means A7 uses the three past routes of the past route 1 to 3 of the user A respectively in the usage frequency (in the example of the figure, simply described as “frequency”) 4, 6, 8 And the past route holding means B7 indicates that the three past routes 1 to 3 of the user B are stored as frequencies 8, 20, and 3, respectively. Numerical values “1” to “7” illustrated in FIG. 5 represent points, and the positional relationship corresponds to the points “1” to “7” illustrated in FIG. 4, for example.

  The time interval dividing process performed by the past route adding unit A6 is performed by simultaneously examining a plurality of past routes in the past route holding unit A7 in time order.

  First, the past route adding means A6 sets the time pointer to the start time of the day (step S11). In the example of FIG. 5, the time is set to 7:00 at this time.

  Next, the past route adding means A6 checks the past route overlap at the time pointed to by the time pointer, and creates a set of different routes (step S12). In the example of FIG. 5, the past route 1, the past route 2, and the past route 3 all point to the point 4 at 7:00, and the number of different routes is 1, and the past routes 1, 2, and 3 pointing to the point 4 are grouped. ,It turns out that.

  Next, the past route adding means A6 checks the overlap of past routes at the time next to the time pointed by the time pointer, and similarly creates a set of routes (step S13). In the example of FIG. 5, it corresponds to 7:30 minutes. In this case, the number of routes is two, and the contents are a group of past routes 1 and 2 pointing to the point 5 and a past route 3 pointing to the point 4. is there.

  Next, the past route adding means A6 compares the sets of different routes, which are the processing results of step S12 and step S13 (step S14), and if the sets are different (step S14: mismatch), the process goes to step S15. If they are the same (step S14: match), the process proceeds to step S16.

  In step S15, the past route adding means A6 puts a mark for dividing the time interval between the time indicated by the time pointer and the next time (division immediately after the time indicated by the time pointer). In the example of FIG. 5, the alternate long and short dash line between 7:00 and 7:30 in the user A's past route corresponds to this. That is, a mark is placed between the times when the overlap changes, thereby creating a time interval in which the overlap does not change, and the time when the execution probability described later changes is specified.

  In step S16, the past route adding means A6 advances the time pointer to the next. In the example so far, it is advanced from 7:00 to 7:30.

  Next, the past route adding means A6 compares the time pointer with the time at the end of the day (step S17). As a result of the comparison, if the time pointer is not larger than the end time of the day (that is, if the time pointer is before the end time of the day) (step S17: NO), the process returns to step S11, and the time continues. A process of searching for the division position of the section is performed. On the other hand, when the time pointer is larger than the time at the end of the day (step S17: YES), a series of processes in the day of the past route adding means A6 is completed.

  When such processing is performed by the past route adding means A6 and B6, the section is divided at the location indicated by the alternate long and short dash line in FIG.

  Next, the past route search means A8 receives the appointment date and time zone designation from the meeting place / time candidate calculation means 11 and starts the operation. For example, if the waiting date is today, the past route search means A8 is attached when the past route addition means A6 does not match the today's moving route held in today's midway route holding buffer A5 by the “disagreement”. A past route not marked with "" is acquired from the past route holding means A7, and only the specified time zone portion is transferred to the predicted route holding buffer A10. On the other hand, if the queuing date is not today (that is, after tomorrow), the past route search means A8 performs processing on the assumption that no “mismatch” mark is given to any past route. That is, at this time, the usage frequency of each past route and the division information of the time interval held in the past route holding means A7 are also transferred to the predicted route holding buffer A10.

  In addition, the implementation which records in the prediction path | route holding | maintenance buffer A10 using the information which specifies the data position like a pointer with respect to the data in the past path | route holding means A7 or URL may be sufficient. In this case, the waiting place / time candidate calculating means 11 is implemented so as to acquire data in the past route holding means A7 as necessary when data is read from the predicted route holding buffer A10.

  The schedule holding means A9 holds information indicating the schedule of the user A obtained from the schedule acquisition means A0 for each schedule. When the information indicating the schedule for today is held in the schedule holding means A9, the past route search means A8 acquires the information indicating the schedule for today, and the information indicating the schedule is stored in the past path holding means A7. A matching past route is searched by collating with a past route acquired from. That is, a past route that matches the current travel route and matches the current schedule is searched from all the past routes in the past route holding means A7. This makes it possible to narrow down the predicted routes that are candidates that also match the schedule.

All the past routes discovered by the search are transferred to the predicted route holding buffer A10 and held, that is, copied. Note that if the queuing date is not today and information indicating the schedule for today is not held, the above collation is not performed, and all past routes held in the past route holding means A7 are held as predicted routes. It is copied to the buffer A10.
The meeting place / time candidate calculating means 11 receives, for example, the designation of the person to be waited output from the person specifying means A3 and the waiting date and time zone specification output from the date and time specifying means A2, and uses the specified designation. The waiting date and time zone designation is transmitted to the past route search means A8 on the user A side and the past route search means B8 on the user B side who is the waiting target.

  As a result, the waiting place / time candidate calculation means 11 calculates the predicted routes and the usage frequencies of the user A obtained in the predicted route holding buffer A10 and the user B obtained in the predicted route holding buffer B10. In addition, division information into time intervals is acquired.

  Next, the meeting place / time candidate calculation means 11 narrows down when the users A and B are at the same place (point). That is, the meeting place / time candidate calculation means 11 has the same time (interpreted as a time zone having a certain zone (for example, 30 minutes) on the past routes of the users A and B). The location that matches is identified by the above, and the identified location and the time are set as candidates for the meeting place and time of the users A and B. Then, the waiting place / time candidate calculating means 11 is the ratio of how many times the place has been in the place in the past (time) in relation to the waiting place and time (place + time) candidates. (That is, the ratio obtained by dividing the total number of movements at the time determined as the candidate in the past by the frequency of use of the past route having the position as the candidate) is calculated for each of the users A and B. The execution probabilities of the users A and B with respect to the candidates are set as the execution probabilities. Further, for each candidate of the place and time, the product of the execution probabilities of the users A and B is set as the “probability that two people can meet” at the place and time.

  In other words, the meeting place / time candidate calculation means 11 obtains the past route (predicted route) and the use frequency of a plurality of people (user A and user B in this example) who are waiting from the predicted route holding buffers A10 and B10. Then, based on the combination of the past route and the usage frequency of the plurality of persons, the candidates for the meeting place and time (date and time) of the plurality of persons and the execution probability thereof are calculated.

  The meeting place / time candidate display means A4 receives the “probability to meet” and the execution probabilities of the users A and B for each of the above place and time candidates from the meeting place / time candidate calculation means 11, together with the time and position. In addition to displaying one line on the screen, the division information for the time interval copied to the predicted path holding buffers A10 and B10 is read, and the divided time is also displayed using one line. These two types of lines are not distinguished and are arranged on the screen in descending order of time. As a result, the number of lines displayed on the screen is the sum of the number of location and time candidates and the division information into time sections.

  The above "division information into time intervals" is where the user's past route overlap changes at that time, and when it actually reaches that time, the action of the day is confirmed and the execution probability can change. High nature.

  Next, more specific operation examples of the meeting place / time candidate calculation unit 11 and the past route search unit A8 will be described with reference to FIGS.

  FIG. 7 is a diagram illustrating an example of saving the past routes of the users A and B and the travel route of the day at 10:30 on the same day as FIG. 5, and FIG. It is a figure showing the preservation | save example of the user A and B's past path | route at the time of 0:00 and the movement path | route of the day. That is, FIGS. 7 and 9 show examples of data held in today's midway route holding buffers A5 and B5 and past route holding means A7 and B7 on the same day as FIG.

  FIG. 6 is a diagram showing a screen presented to the user by the present configuration example at the time of FIG. 5, and FIG. 8 represents a screen presented to the user by the present configuration example at the time of FIG. 7. FIG. 10 is a diagram illustrating a screen presented to the user according to the present configuration example at the time of FIG. 9.

  For the sake of simplicity, in this example, it is assumed that no schedule is stored in the schedule holding means A9. Further, it is assumed that the date / time designating means A2 inputs that there is no today / time zone designation as the waiting date / time.

  First, as shown in FIG. 5, no data is stored in today's midway route holding buffers A5 and B5 before the above-mentioned day start time. The past route holding means A7 and B7 hold three different routes, respectively, and the frequency of use through the route in the past is also recorded.

  Now, in the state of FIG. 5, the user A makes a designation that no time zone is designated during the day and a designation that he / she wants to wait for the user B to the date designation means A2 and the person designation means A3. Suppose.

  The meeting place / time candidate calculation means 11 receives these designations, and the meeting date is the current time in the past route search means A8 of the user A and the past route search means B8 of the user B who is the waiting target. Prompt action on the condition that no belt is specified. In response to this, since the past route search means A8, B8 contains nothing in today's midway route holding buffers A5, B5, all the data included in the past route holding means A7 shown in FIG. That is, the past route 1, the past route 2, and the past route 3 of the user A are copied to the predicted route holding buffer A10 together with the usage frequencies 4, 6, and 10, and all the data included in the past route holding means B7 That is, the user B's past route 1, past route 2, and past route 3 are copied to the predicted route holding buffer B10 together with the frequencies 8, 20, and 3 thereof. At this time, the division information of the time section as shown by the dashed line in FIG. 5 is also copied.

  Note that, as described above, only information that specifies data such as pointers and URLs for data in the past route holding means A7 and A8 may be recorded in the predicted route holding buffers A10 and A10.

  Next, the meeting place / time candidate calculation means 11 narrows down when the users A and B are in the same place, and for each of them, the ratio of how many times the place has been in the place in the total time moved in that time in the past. Calculate and use as execution probability.

  In the example of FIG. 5, the points stored in the hatched fields are candidates for the meeting place. Among these, for example, the user A at the point 2 at 10:30 moves 4 + 6 + 10 = 20 times (that is, the total number of moved) at that time, and 10 times (that is, the usage frequency of the past route 3). Since only at point 2, the execution probability (simply described as “probability” in the example in the figure) is 10/20 = 50% (the ratio obtained by dividing the above total number by the above use frequency). 8 / 31≈26%.

  As another calculation example, the user A at the point 6 from 15:00 to 17:30 was (6 + 10) / 20 = 80% because he was at the point 6 on the past route 2 and the past route 3. For user B, since he was at point 6 only in the past route 2, 20 / 31≈65%.

  In this way, the calculation is performed for all the hatched fields shown in FIG. 5, and the result is obtained together with the division information of the time interval as shown by the dashed line in FIG. Is transmitted to the meeting place / time candidate display means A4 for display on the mobile terminal of the user A.

  The meeting place / time candidate display means A4 receives the result of processing the data of FIG. 5 by the meeting place / time candidate calculation means 11 as described above, and displays a screen as shown in FIG. To do.

  Next, it is assumed that the time has passed until 10:30 on the same day, and the contents of the route holding buffers A5 and B5 on the current day have changed as shown in FIGS. To do. Since it is the same day, the contents of the past route holding means A7, B7 are the same in FIG. 5 and FIG.

  In this state, it is assumed that the user A similarly designates the date and time designation means A2 and the person designation means 3 that there is no time zone designation during the day and the designation that the user B wants to wait.

  The past route search means A8, B8, among the past route holding means A7, B7 shown in FIG. 7, the past route that is not marked as “mismatch”, that is, the past route 1, the past route 2 of the user A, The usage frequency 4 and 6 are copied to the predicted route holding buffer A10, and the user B's past route 2 and past route 3 are copied to the predicted route holding buffer B10 together with the usage frequencies 20 and 3.

  The meeting place / time candidate calculation means 11 and the meeting place / time candidate display means A4 operate in the same manner as described above, and display a screen as shown in FIG.

  FIG. 8 shows that the execution probability changes within 11:00, that is, within 30 minutes from the present. Actually, it is assumed that the contents of today's midway route holding buffers A5 and B5 change as shown in FIG. 7 to FIG. 9 as the users A and B move their actions until 11:00.

  In this state, it is also assumed that the user A has also made a specification that the date / time specifying means A2 and the person specifying means 3 do not specify a time zone and wants to wait for the user B during the day. . Then, the meeting place / time candidate display means A4 and the like operate in the same manner as described above, and display a screen as shown in FIG.

Comparing FIG. 10 and FIG. 8, it can be seen that the meeting place having a high execution probability has changed from the point 6 to the points 2 and 5. This is because the route of User B's today is fixed at 11:00, and the route that has not been determined as the past route 2 or the past route 3 is determined as the past route 3. Prior to 11:00, user B's past route 2 and past route 3 are the same, and at 11:00, it cannot be established at the same time. The cause of such a change is due to the combination of the past routes of the user B, and the division information of the time section indicated by the one-dot broken line is obtained by extracting such time. .
As described above, according to the above embodiment, since the execution probability is calculated in addition to the candidates for the meeting place and time of a plurality of people, the probability that both are present is used for each candidate. Can be presented to a person. In other words, the meeting place predicted (predicted) from the movement path of each individual in the past can be presented to the user with a simple expression of its feasibility (execution probability). It is possible to realize efficient information presentation for determining the meeting place and time, such as searching for a certain schedule even at the latest.

  In addition, it is configured to add to the user what time it will change in addition to how much they are there, and to show the user, so to determine the meeting place and time, Judgment can be made such as withholding judgment until. In the above embodiment, it is better to use this means again after waiting until 11:00 based on the information that the probability changes at 11:00, rather than considering the meeting place using this means at 10:30. It is possible to get an accurate guess of the meeting point. If there is no information that the probability changes at 11:00, it is necessary to make a judgment at 10:30.

  In general, it is obvious that the probability of meeting can be accurately estimated by determining the moving route of the day as the time is later in the day. However, there is no help for it to wait. Therefore, the present invention pays attention to the fact that the time for causing the change can be calculated only from the past movement route, not the current movement route, and displays it.

  In the above embodiment, the case where the two users A and B meet is described as an example. However, the present invention can be similarly applied to the case where the three users wait.

It is a figure which shows the example of an outline structure of the meeting place candidate provision system which concerns on this embodiment. It is a flowchart showing to the middle of the process of past path | route holding means A6. It is a flowchart showing the continuation of the process of the past path | route holding means A6 shown by FIG. It is a figure showing the positional relationship of the point (milestone) 1-7 shown by FIGS. It is a figure showing the example of preservation | save of the past path | route of the user A and B in the time before the start time of the day. It is a figure showing the screen shown to a user by this structural example at the time of FIG. It is a figure showing the preservation | save example of the user A and B's past path | route and the movement path | route of the day at the time of 10:30 on the same day as FIG. It is a figure showing the screen shown to a user by this structural example at the time of FIG. It is a figure showing the preservation | save example of the user A and B's past path | route and the movement path | route of the day at the time of 11:00 on the same day as FIG. It is a figure showing the screen shown to a user by this structural example at the time of FIG.

Explanation of symbols

A0, B0 Schedule acquisition means A1, B1 Position / time acquisition means A2, B2 Date / time specification means A3, B3 Person specification means A4, B4 Waiting place / time candidate display means A5, B5 Today's midway route holding buffer A6, B6 Past route Additional means A7, B7 Past route holding means A8, B8 Past route searching means A9, B9 Schedule holding means A10, B10 Predicted route holding buffer 11 Waiting place / time candidate calculating means A, B Mobile terminal S Waiting place candidate providing system

Claims (10)

  Based on a combination of the past movement route and the use frequency of a plurality of persons who wait and are acquired from a past route holding means for holding a plurality of individual movement routes including the time of use together with the use frequency. A waiting place candidate search system comprising waiting candidate calculation means for calculating a candidate for a meeting place and time of a person and an execution probability thereof. In the meeting place candidate search system according to claim 1,
The waiting candidate calculation means identifies a location that matches at the same time on the past travel routes of the plurality of people, and uses the specified location and the time as candidates for the meeting location and time of the plurality of people. A ratio obtained by dividing the total number of times moved at the time determined as the candidate by the frequency of use of the moving route having the candidate location is calculated for each of the plurality of persons as the execution probability of the candidate. Meeting place candidate search system. In the meeting place candidate search system according to claim 1 or 2,
A meeting place candidate search system further comprising probability change specifying means for specifying when the execution probability of the meeting place and time candidate changes. In the meeting place candidate search system according to claim 1 or 2,
A meeting place candidate search system further comprising information presenting means for presenting information indicating the waiting place and time candidate calculated by the waiting candidate calculating means and the execution probability to the person performing the waiting. . In the meeting place candidate search system according to claim 3,
Information presenting means for presenting information indicating when the execution probability changes together with the candidate of the meeting place and time calculated by the waiting candidate calculation means and the execution probability thereof to the person performing the waiting A meeting place candidate search system characterized by comprising: In the meeting place candidate search system according to any one of claims 1 to 5,
The travel route of the day is acquired from the current-day route holding means that holds the travel route of the individual on the meeting day including the time, the travel route of the corresponding day, and the past travel route acquired from the past route holding means And a past route search means for searching for a suitable past travel route.
The waiting candidate calculation means calculates the waiting place and time candidates of the plurality of persons and the execution probability thereof using the past travel route searched by the past route search means and the frequency of use thereof. A meeting place candidate search system. In the meeting place candidate search system according to any one of claims 1 to 5,
The information indicating the schedule is acquired from the schedule holding means that holds information indicating the schedule of the individual including the time, and the information indicating the schedule is compared with the past movement route acquired from the past route holding means. And a past route search means for searching for a suitable past movement route,
The waiting candidate calculation means calculates the waiting place and time candidates of the plurality of persons and the execution probability thereof using the past travel route searched by the past route search means and the frequency of use thereof. A meeting place candidate search system. In the meeting place candidate search system according to claim 6,
The past route search means acquires information indicating the schedule from schedule holding means for holding information indicating an individual's schedule including time, information indicating the schedule, the moving route of the day, and the past route holding The meeting place candidate search system characterized by collating with the said past movement path | route acquired from the means, and searching for the said matching past movement path | route. A method of searching for a candidate meeting place performed by a computer,
Obtaining the past travel routes of multiple people including the time and their usage frequency;
Based on the combination of the past movement route and the usage frequency of the plurality of persons, calculating the meeting place and time candidates of the plurality of persons and the execution probability thereof;
A method for searching for a meeting place candidate characterized by comprising: Computer
Based on the combination of the past movement route and the use frequency of a plurality of persons waiting to be acquired from the past route holding means for holding a plurality of individual movement routes including the time of use together with the use frequency. A program for searching for a candidate for a meeting place, which functions to calculate a candidate for a person's meeting place and time and an execution probability thereof.

Images