Travel plan proposal method and travel plan proposal device
The method addresses the challenge of congestion in travel planning by predicting congestion levels and generating alternative travel plans, ensuring feasible and efficient itineraries for users visiting multiple tourist spots.
Patent Information
- Application Number
- JP2022099613
- Authority / Receiving Office
- JP · JP
- Patent Type
- Patents
- Current Assignee / Owner
- Filing Date
- 2022-06-21
- Publication Date
- 2025-05-27
- Estimated Expiration
- 2042-06-21
AI Technical Summary
Existing travel planning systems do not adequately account for congestion levels at tourist destinations, leading to potential schedule disruptions when traveling to multiple spots.
A method and apparatus that propose a travel plan by acquiring user schedule information, predicting congestion levels at tourist spots and the travel area, and generating alternative plans if initial plans are unfeasible due to congestion.
This approach allows for the generation of feasible travel plans that consider congestion levels, enabling users to adjust their itineraries and avoid prolonged stays at congested destinations.
Smart Images

Figure 0007683551000001 
Figure 0007683551000002 
Figure 0007683551000003
Abstract
Description
Technical Field
[0001] The present disclosure relates to a method and apparatus for proposing to a user a travel plan for visiting at least three tourist spots using a mobile object.
Background Art
[0002] Japanese Patent Application Laid-Open No. 9-204475 discloses an apparatus for generating a travel plan for a user. When schedule information such as a travel destination (scenic spot, rest facility, accommodation facility, etc.), travel departure date and time, departure place, and return place is input into this conventional apparatus, it searches for a basic stay time corresponding to the destination. The basic stay time is set in advance as the optimal time for using the destination. The conventional apparatus formulates a schedule by combining this basic stay time with the travel time required for moving on the route from the departure place to the destination and the route from the destination to the return place, and creates a travel plan.
Prior Art Documents
Patent Documents
[0003]
Patent Document 1
Summary of the Invention
Problems to be Solved by the Invention
[0004] In the above conventional apparatus, information on items for complementing the travel plan is considered. This complementing item includes information on past traffic congestion tendencies and traffic regulations. Therefore, according to this complementary information, it is expected that the accuracy of the travel time when staying at the destination using a mobile object will be improved. However, this complementing item does not include the congestion level of the destination. Therefore, in the travel plan created by the above conventional apparatus, when the congestion level of the destination is high on the travel day, the actual stay time may be longer than the basic stay time.
[0005] In particular, when traveling around multiple tourist spots on the planned travel date using a moving body, if the actual stay time at a certain tourist spot becomes long, it may be necessary to adjust the schedule, such as shortening the stay time at the tourist spot that is next on the itinerary after this tourist spot. Therefore, when traveling around multiple tourist spots, it is desirable to create a travel plan (i.e., a travel-around plan) that takes into account the congestion levels of these tourist spots.
[0006] One object of the present disclosure is to provide a technology capable of proposing an appropriate travel plan to a user who wishes to travel around multiple tourist spots on the planned travel date using a moving body.
Means for Solving the Problems
[0007] The first aspect of the present disclosure is a method for proposing a travel-around plan for tourist spots to a user, and has the following features. The method includes: a step of acquiring the user's travel-around schedule information including information on the locations of at least three tourist spots, information on the stay time at each of the at least three tourist spots, and information on the travel-around time zone for traveling around the at least three tourist spots; a step of setting a travel-around area including the at least three tourist spots based on the information on each location; a step of predicting the congestion levels of the at least three tourist spots and the congestion level of the travel-around area; a step of determining whether a candidate for a travel-around plan for traveling around the at least three tourist spots by moving using a moving body can be generated based on the information on each stay time, the information on the travel-around time zone, the congestion level of each of the at least three tourist spots, and the congestion level of the travel-around area; a step of generating a candidate for an alternative travel-around plan in which a part of the at least three tourist spots is changed to another tourist spot located outside the travel-around area when it is determined that a candidate for the travel-around plan cannot be generated; and includes.
[0008] The second aspect of the present disclosure is a method for proposing a travel plan for tourist attractions, which has the following features. The method includes a step of obtaining the travel schedule information of the user, including information on the location of each of at least three tourist attractions, information on the stay time at each of the at least three tourist attractions, information on the travel time zone for touring the at least three tourist attractions, and the order of visits to the at least three tourist attractions; a step of setting a travel area including the at least three tourist attractions based on the location information; a step of predicting the congestion level of each of the at least three tourist attractions and the congestion level of the travel area; a step of determining whether a travel plan candidate for visiting the at least three tourist attractions in the order of visits can be generated by moving using a moving body based on the stay time information, the travel time zone information, the congestion level of each of the at least three tourist attractions, and the congestion level of the travel area; a step of generating a candidate for an alternative travel plan in which the order of visits to the at least three tourist attractions is changed when it is determined that the candidate for the travel plan cannot be generated; and includes.
[0009] The third aspect of the present disclosure is an apparatus for proposing a travel plan for tourist attractions, which has the following features. The apparatus includes a processor. The processor performs a process of obtaining the travel schedule information of the user, including information on the location of each of at least three tourist attractions, information on the stay time at each of the at least three tourist attractions, and information on the travel time zone for touring the at least three tourist attractions; performs a process of setting a travel area including the at least three tourist attractions based on the location information; performs a process of predicting the congestion level of each of the at least three tourist attractions and the congestion level of the travel area; A process for determining whether a candidate for a tour plan to visit at least three tourist attractions by moving using a moving body can be generated based on the information on each of the residence times, the information on the tour time zone, the congestion level of each of the at least three tourist attractions, and the congestion level of the tour area. When it is determined that a candidate for the tour plan cannot be generated, a process for generating a candidate for an alternative tour plan in which a part of the at least three tourist attractions is changed to another tourist attraction located outside the tour area. It is configured to perform.
[0010] A fourth aspect of the present disclosure is an apparatus for proposing a tour plan for tourist attractions to a user, and has the following features. The apparatus includes a processor. The processor A process for acquiring the user's tour schedule information including the information on the location of each of at least three tourist attractions, the information on the residence time at each of the at least three tourist attractions, the information on the tour time zone for touring the at least three tourist attractions, and the visiting order for visiting the at least three tourist attractions. A process for setting a tour area including the at least three tourist attractions based on the information on each location. A process for predicting the congestion level of each of the at least three tourist attractions and the congestion level of the tour area. A process for determining whether a candidate for a tour plan to visit the at least three tourist attractions in the visiting order according to the moving using a moving body can be generated based on the information on each residence time, the information on the tour time zone, the congestion level of each of the at least three tourist attractions, and the congestion level of the tour area. When it is determined that a candidate for the tour plan cannot be generated, a process for generating a candidate for an alternative tour plan in which the visiting order for visiting the at least three tourist attractions is changed. It is configured to perform.
Advantages of the Invention
[0011] According to the first or third aspect, when proposing a tour plan for at least three tourist attractions, it is possible to generate candidates for the tour plan by considering not only the congestion levels of individual tourist attractions but also the congestion level of the tour area in which these tourist attractions are included. Also, when it is not possible to generate candidates for the tour plan, it is possible to generate candidates for an alternative tour plan in which some of the tourist attractions are changed to other tourist attractions existing outside the tour area before the change. Therefore, it becomes possible to propose candidates for the tour plan or the alternative tour plan to the user who desires the tour plan.
[0012] According to the second or fourth aspect, when information on the order of visits to tourist attractions is included in the tour schedule information, it is possible to generate candidates for the tour plan by considering not only the congestion levels of individual tourist attractions but also the congestion level of the tour area in which these tourist attractions are included. Also, when it is not possible to generate candidates for the tour plan, it is possible to generate candidates for an alternative tour plan in which the order of visits is changed. Therefore, the same effect as that of the first or third aspect can be obtained.
Brief Description of the Drawings
[0013]
Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8
Figure 9
Figure 10
Figure 11
Mode for Carrying Out the Invention
[0014] Hereinafter, with reference to the drawings, a travel plan proposal method and a proposal apparatus according to embodiments of the present disclosure will be described. Note that the proposal method according to the embodiments is realized by computer processing performed by a server which is the proposal apparatus according to the embodiments. Also, in each figure, the same or corresponding parts are denoted by the same reference numerals to simplify or omit the description thereof.
[0015] 1. Overview 1-1. Tourism Services FIG. 1 is a diagram for explaining the overview of the embodiment. The proposal method according to the embodiment is implemented as part of tourism services. The tourism services include, for example, a service of renting a moving body as a means of transportation at a tourist destination, and a service of proposing a plan to visit at least one tourist spot within the tourist destination using this moving body. Examples of tourist spots include scenic spots and tourist facilities scattered in the tourist destination. Tourist spots include not only spots directly related to tourism but also spots indirectly related to tourism (for example, rest spots such as restaurants, and shopping spots such as souvenir shops).
[0016] In an embodiment, attention is paid to a tourism service that proposes a plan to visit at least three tourist spots within a tourist destination. Figure 1 depicts a user US1 who uses the tourism service. User US1 plans to visit at least three tourist spots within a certain tourist destination using a moving vehicle VH1 owned or rented by himself / herself. The configuration of the moving vehicle VH1 in the present disclosure is not particularly limited, but it is desirable to have a configuration for autonomous driving. In the example shown in Figure 1, it is planned to visit three tourist spots SP1 to SP3 during a certain time period TZ (for example, 10:00 - 16:00) on the tour day, and this user US1 hopes to receive a plan to visit these tourist spots proposed by a service provider.
[0017] User US1, who hopes to receive a proposal for a plan to visit tourist spots SP1 to SP3, operates, for example, the user terminal 20 to send tour schedule information TUR to the server 10. In the example shown in Figure 1, the tour schedule information TUR includes information on tourist spots SP1 to SP3, information on the stay times ST1 to ST3 at these tourist spots, and information on the day (tour day) and time period TZ (hereinafter also referred to as "tour time period TZ_TUR") for visiting these tourist spots.
[0018] The information on tourist spots SP1 to SP3 is not particularly limited as long as the server 10 can identify these tourist spots, and may be identified by a name, abbreviation, common name, etc., or may be identified by a position on a map. The information on the stay times ST1 to ST3 may or may not be specified by user US1. In the latter case, for example, the average stay times of tourists at tourist spots SP1 to SP3 are set as the stay times ST1 to ST3, respectively. The tour time period TZ_TUR for visiting tourist spots SP1 to SP3 is, for example, the time period during which user US1 stays in the tourist destination. The tour time period TZ_TUR may or may not be specified by user US1. In the latter case, for example, the tour time period TZ_TUR is specified based on alternative information (for example, information on time divisions such as morning and afternoon, information on the rental time of the moving vehicle VH1).
[0019] 1-2. Features of the Embodiment 1-2-1. Generation of Candidates for Itinerary Plans In the embodiment, based on the itinerary schedule information TUR, candidates C_PLN for an itinerary plan PLN that tours tourist spots SP1 to SP3 are generated. FIGS. 2 and 3 are diagrams for explaining the outline of the method for generating the candidates C_PLN. When generating the candidates C_PLN, first, a tour area AR_TUR is set. As shown in FIG. 2, the tour area AR_TUR is set so that all of the tourist spots SP1 to SP3 are located inside it. The setting of the tour area AR_TUR is performed, for example, based on the location information of each of the tourist spots SP1 to SP3.
[0020] When the tour area AR_TUR is set, other tourist spots other than the tourist spots SP1 to SP3 existing inside the tour area AR_TUR are identified. The identification of other tourist spots is performed based on the position information of the boundary of the tour area AR_TUR and the location information of each of the other tourist spots. In FIG. 2, tourist spots SP4 and SP5 are depicted. Tourist spot SP4 is an example of other tourist spots existing inside the tour area AR_TUR. Tourist spot SP5 is an example of other tourist spots existing outside the tour area AR_TUR. The one that corresponds to the other tourist spots identified when the tour area AR_TUR is set is tourist spot SP4.
[0021] When the tourist spots existing inside the tour area AR_TUR (that is, tourist spots SP1 to SP4) are identified, the congestion levels CON_SP1 to CON_SP4 of these tourist spots are predicted. The congestion levels CON_SP1 to CON_SP4 are calculated, for example, for each of a plurality of preset time intervals (Time Slot). The plurality of time intervals are set by dividing the tour time zone TZ_TUR for touring tourist spots SP1 to SP3 with a time width of several tens of minutes to several hours (for example, 30 minutes to 2 hours). These time intervals may all have the same time width, or some or all of them may have different time widths.
[0022] The congestion levels CON_SP1 to CON_SP4 are calculated based on the visit schedule information VST for at least one of the tourist spots SP1 to SP4 by the user US2i (i ≥ 1). The user US2i is, for example, another user who uses the same tourism service as the tourism service used by the user US1. The user US2i has a plan to visit at least one of the tourist spots SP1 to SP4 on the travel day of the user US1. The means of transportation of the user US2i is, for example, a moving body VHi owned or rented by himself / herself, or another moving body (e.g., a taxi).
[0023] The visit schedule information VST includes the same information as the travel schedule information TUR of the user US1. That is, the visit schedule information VST includes information on at least one of the tourist spots SP1 to SP4 that the user US2i plans to visit and information on the time zone for the user US2i to visit this tourist spot.
[0024] Note that the visit schedule information VST used for calculating the congestion levels CON_SP1 to CON_SP4 is limited to that which has already been generated at the time of generating the candidate C_PLN. That is, the visit schedule information VST generated by a request from the user US2i after the generation of the candidate C_PLN or the visit schedule information VST whose part has been modified by a request from the user US2i after the generation of the candidate C_PLN is not used for calculating the congestion levels CON_SP1 to CON_SP4 and, of course, is not considered for the generation of the candidate C_PLN either.
[0025] In the embodiment, in addition to the congestion levels CON_SP1 to CON_SP4, the congestion level CON_AR_TUR of the travel area AR_TUR is also predicted. Similar to the congestion levels CON_SP1 to CON_SP4, the congestion level CON_AR_TUR is calculated for each of a plurality of preset time intervals. The congestion level CON_AR_TUR is also calculated based on the visit schedule information VST, similar to the congestion levels CON_SP1 to CON_SP4.
[0026] When the congestion levels CON_SP1 to CON_SP4 and the congestion level CON_AR_TUR are predicted, it is determined whether the conditions are met for setting the time zones (hereinafter referred to as "visit time zone TZ_SP1", "visit time zone TZ_SP2", "visit time zone TZ_SP3", etc.) to visit tourist spots SP1 to SP3 respectively based on these congestion levels. This determination is made, for example, by whether all of the following conditions C1 to C4 are satisfied. Condition C1: There is a time segment (spot time segment) in which the congestion levels CON_SP1 to CON_SP3 are below the threshold value (spot threshold value) for each of the tourist spots SP1 to SP3. Condition C2: When Condition C1 is satisfied, the spot time segments when the congestion level is below the spot threshold value do not overlap with each other in the tourist spots SP1 to SP3. Condition C3: There is a time segment (area time segment) in which the congestion level CON_AR_TUR is below the threshold value (area threshold value). Condition C4: When Conditions C2 and C3 are satisfied, all of the non-overlapping spot time segments in the tourist spots SP1 to SP3 are included in the area time segment when the congestion level is below the area threshold value.
[0027] When it is determined that the conditions for setting the visit time zones TZ_SP1, TZ_SP2, and TZ_SP3 are met, these visit time zones are set based on the spot time segments of the tourist spots SP1 to SP3, the stay times ST1 to ST3, and the tour time zone TZ_TUR when Condition C4 is satisfied. If the preset spot time segment is longer than the stay times ST1 to ST3, these visit time zones are set within the preset spot time segment. On the other hand, if the preset spot time segment is shorter than the stay times ST1 to ST3, these visit time zones are set by combining two or more spot time segments.
[0028] If the visit time zones TZ_SP1, TZ_SP2, and TZ_SP3 are set, the order (visit order) of visiting these tourist spots can be specified. Also, if the visit time zones TZ_SP1, TZ_SP2, and TZ_SP3 are set, from the information on the time zones (for example, visit time zones TZ_SP1 and TZ_SP2) for visiting two tourist spots (for example, tourist spots SP1 and SP2) arranged in the visit order, the time interval that can be used for moving between these tourist spots can be calculated.
[0029] Also, if the order of visiting tourist spots SP1 to SP3 is specified, the time required for moving between tourist spots SP1 to SP3 by the moving body VH1 can also be calculated. FIG. 3 is a diagram showing a list of routes RT between tourist spots SP1 to SP3. For example, consider the case of visiting tourist spots in the visit order of tourist spots SP1, SP2, and SP3. In this case, the time required for the moving body VH1 to move along routes RT12 and RT23 is calculated. The time required for moving along routes RT12 and RT23 is calculated, for example, assuming that the moving body VH1 travels along these routes at the legal speed.
[0030] In the embodiment, the time interval that can be used for moving between two tourist spots arranged in the visit order is compared with the time required for the moving body VH1 to move between these tourist spots. The fact that the former is longer than the latter means that the two tourist spots can be visited in the visit order. On the contrary, the fact that the former is shorter than the latter means that the two tourist spots cannot be visited in the visit order.
[0031] By performing such a comparison, when it is confirmed that tourist spots SP1 to SP3 can be visited in the visit order, a candidate C_PLN is generated. This candidate C_PLN includes the information on the visit time zones TZ_SP1, TZ_SP2, and TZ_SP3.
[0032] 1-2-2. Generation of Candidates for Alternative Itineraries By the way, if the conditions (i.e., conditions C1 to C4) for setting the visit time zones TZ_SP1, TZ_SP2, and TZ_SP3 are not met, these visit time zones cannot be set. Therefore, in this case, the candidate C_PLN cannot be generated. Also, even if these visit time zones are set, it may be found that, as a result of the comparison of the travel times described above, it is not possible to visit the tourist spots SP1 to SP3 in the order of visit. In this case as well, the candidate C_PLN cannot be generated.
[0033] Therefore, in the embodiment, when the candidate C_PLN cannot be generated, a candidate C_REP for the alternative itinerary REP is generated. FIG. 4 is a diagram for explaining an outline of a method for generating the candidate C_REP. When generating the candidate C_REP, some of the tourist spots SP1 to SP3 used for generating the candidate C_PLN are replaced with other tourist spots existing outside the tour area AR_TUR. In the example shown in FIG. 4, the tourist spot SP2 is replaced with the tourist spot SP5.
[0034] If some of the tourist spots SP1 to SP3 are simply replaced with other tourist spots, it is also conceivable to replace the tourist spot SP2 with the tourist spot SP4 (i.e., another tourist spot existing inside the tour area AR_TUR). However, if there is no time period in which the congestion level CON_AR_TUR is below the threshold value (area threshold value) (see condition C3), it may not be possible to set the spot time period even if it is replaced with another tourist spot existing inside the tour area AR_TUR. This is because the fact that there is no time period in which the congestion level CON_AR_TUR is below the threshold value means that the inside of the tour area AR_TUR remains crowded.
[0035] Therefore, in the embodiment, when generating the candidate C_REP, some of the tourist spots SP1 to SP3 are replaced with other tourist spots existing outside the surrounding area AR_TUR. When the replacement of the tourist spots is performed, the surrounding area AR_TUR is changed. The surrounding area AR_REP shown in FIG. 4 is set such that all of the tourist spots SP1, SP3, and SP5 are located inside it.
[0036] The method for generating the candidate C_REP after setting the surrounding area AR_REP is basically the same as that of the candidate C_REP described with reference to FIGS. 2 and 3. The generation of the candidate C_REP is repeatedly performed while continuously changing the surrounding area AR_REP until the candidate C_REP is generated. As already described, the tourist spots include not only the spots directly related to tourism but also the spots indirectly related to tourism. Therefore, when the tourist spot before the change is a spot directly related to tourism, it is desirable that the tourist spot after the change is also the same type of spot. When the tourist spot before the change is a spot indirectly related to tourism, it is desirable that the tourist spot after the change is also the same type of spot.
[0037] It is desirable that the tourist spot after the change has a lower popularity than the one before the change. If it is a tourist spot with low popularity, the probability of generating the candidate C_REP increases. In addition to this, it becomes possible to activate the tourist spot with low popularity and, as a result, to activate the entire tourist area including this tourist spot.
[0038] Thus, according to the embodiment, when proposing a plan to tour at least three tourist spots within a tourist destination, candidate C_PLN can be generated by considering not only the congestion levels of individual tourist spots but also the congestion level of the tour area in which these tourist spots are located. Also, according to the embodiment, when candidate C_PLN cannot be generated, candidate C_REP can be generated by replacing a part of the tourist spots with other tourist spots existing outside the original tour area. Therefore, it becomes possible to propose candidate C_PLN or candidate C_REP to user US1.
[0039] 1-3. Another generation example of a tour plan candidate (hereinafter, also referred to as the "second generation example"). Hereinafter, the example described with reference to FIGS. 1 to 4 is also referred to as the "first generation example". In the first generation example, it is assumed that the tour schedule information TUR used for generating candidate C_PLN (or candidate C_REP) includes information on tourist spots SP1 to SP3, information on the stay times ST1 to ST3 at these tourist spots, and information on the dates and time zones for touring these tourist spots. Hereinafter, a method for generating candidate C_PLN when information on the order of visiting (visit order) these tourist spots is added to this information will be described.
[0040] FIGS. 5 and 6 are diagrams for explaining an outline of another method for generating candidate C_PLN. The outline shown in FIG. 5 is basically the same as that shown in FIG. 1. However, in the example shown in FIG. 5, information on the visit order OD_TUR for visiting tourist spots SP1 to SP3 is added to the tour schedule information TUR. The visit order OD_TUR is in the order of tourist spots SP1, SP2, and SP3. The setting of the visit order OD_TUR is performed by user US1. The information on the visit order OD_TUR is transmitted from user terminal 20 to server 10 together with the tour schedule information TUR other than this information (for example, information on tourist spots SP1 to SP3).
[0041] As shown in FIG. 6, in the second generation example, first, a tour area AR_TUR is set. When the tour area AR_TUR is set, other tourist attractions other than the tourist attractions SP1 to SP3 existing inside the tour area AR_TUR are specified. Further, when the tourist attractions existing inside the tour area AR_TUR (that is, tourist attractions SP1 to SP4) are specified, the congestion levels CON_SP1 to CON_SP4 of these tourist attractions and the congestion level CON_AR_TUR of the tour area AR_TUR are predicted. Up to this point, the same processing as in the first example is performed.
[0042] When the congestion levels CON_SP1 to CON_SP4 and the congestion level CON_AR_TUR are predicted, it is determined whether the conditions are met for setting the time zones (that is, visit time zones TZ_SP1, TZ_SP2, and TZ_SP3) to visit the tourist attractions SP1 to SP3 in the order of visit OD_TUR based on these congestion levels. This determination is made, for example, by whether all of the following conditions C5 to C9 are satisfied. Condition C5: There is a time segment (spot time segment) in which the congestion levels CON_SP1 to CON_SP3 are below the threshold value (spot threshold value) for each of the tourist attractions SP1 to SP3. Condition C6: When condition C5 is satisfied, the spot time segments when the congestion level is below the spot threshold value do not overlap with each other in the tourist attractions SP1 to SP3. Condition C7: When condition C6 is satisfied, the spot time segments when the congestion level is below the spot threshold value can be arranged in the order of visit OD_TUR. Condition C8: There is a time segment (area time segment) in which the congestion level CON_AR_TUR is below the threshold value (area threshold value). Condition C9: When conditions C7 and C8 are satisfied, all of the spot time segments arranged in the order of visit OD_TUR are included in the area time segment when the congestion level is below the area threshold value.
[0043] Note that the above condition C5 is the same as the above condition C1, the above condition C8 is the same as the above condition C3, and the above condition C6 is substantially the same as the above condition C2.
[0044] When it is determined that the conditions are met for setting the time zones for visiting tourist spots SP1 to SP3 according to the visit order OD_TUR, based on the spot time divisions of tourist spots SP1 to SP3, the stay times ST1 to ST3, and the tour time zone TZ_TUR when condition C9 is satisfied, these visit time zones are set. Note that the adjustment of the length of the visit time zone according to the magnitude relationship between the stay times ST1 to ST3 and the lengths of the preset spot time divisions is the same as in the first generation example.
[0045] Once the time zones for visiting tourist spots SP1 to SP3 according to the visit order OD_TUR are set, the time required to move between tourist spots SP1 to SP3 in this visit order OD_TUR is calculated. Different from the first generation example, in the second generation example, the information of the visit order OD_TUR is set by the user US1. Therefore, once the time zones for visiting tourist spots SP1 to SP3 according to the visit order OD_TUR are set, the time intervals available for moving between these tourist spots can be calculated from the information of the time zones (for example, visit time zones TZ_SP1 and TZ_SP2) for visiting two tourist spots (for example, tourist spots SP1 and SP2) arranged in the visit order OD_TUR.
[0046] Similar to the first generation example, in the second generation example, the time required to move between tourist spots SP1 to SP3 by the moving body VH1 is calculated. Furthermore, the time interval available for moving between two tourist spots arranged in the visit order and the time required to move between these tourist spots by the moving body VH1 are compared. The fact that the former is longer than the latter means that it is possible to visit two tourist spots according to the visit order OD_TUR. On the contrary, the fact that the former is shorter than the latter means that it is not possible to visit two tourist spots according to the visit order OD_TUR.
[0047] When it is confirmed that such a comparison allows visiting tourist spots SP1 to SP3 according to the visit order OD_TUR, a candidate C_PLN is generated. This candidate C_PLN includes information on the time zones for visiting tourist spots SP1 to SP3 according to the visit order OD_TUR.
[0048] 1-4. Another Generation of Candidates for Alternative Itinerary Plans Situations where the candidate C_PLN described in the first generation example cannot be generated can also occur in the second generation example. Therefore, as in the first generation example, in the second generation example, when the candidate C_PLN cannot be generated, a candidate C_REP for the alternative itinerary plan REP is generated. Fig. 7 is a diagram explaining the outline of another generation method for the candidate C_REP. In the example shown in Fig. 7, the information on the visit order OD_TUR is changed. The changed visit order OD_REP is in the order of tourist spots SP1, SP3, and SP2.
[0049] Unlike the first generation example, in the second generation example, based on the information included in the itinerary plan information TUR with the information on the visit order OD_TUR added, it is determined whether the conditions for setting the visit time zones TZ_SP1, TZ_SP2, and TZ_SP3 are met. That is, in the second generation example, there is more information constituting the itinerary plan information TUR compared to the first generation example, and this may prevent the above conditions from being satisfied. In this regard, by changing the visit order OD_TUR, it is expected that the possibility of the above conditions being met increases.
[0050] The method for generating the candidate C_REP based on the itinerary plan information TUR including the visit order OD_REP is basically the same as that of the candidate C_REP described with reference to Figs. 5 and 6. The generation of the candidate C_REP is repeated while continuously changing the visit order OD_REP until the candidate C_REP is generated.
[0051] Thus, according to the second generation example, even when the information on the visit order OD_TUR is added to the itinerary plan information TUR, it is possible to obtain the same effect as the first generation example.
[0052] Hereinafter, embodiments will be described in detail.
[0053] 2. Proposal Device for Itinerary Plan 2-1. Configuration Example FIG. 8 is a diagram showing a configuration example of a server 10 which is a proposal device according to an embodiment. The configuration example shown in FIG. 8 includes an information processing device 11, a visit plan DB (database) 12, and a map DB 13.
[0054] The information processing device 11 is a computer for processing various kinds of information related to the management of an itinerary plan PLN, such as the generation of candidate C_PLN and candidate C_REP, and the proposal of these candidates to a user US1. The information processing device 11 is also a computer for processing various kinds of information related to the management of these mobile bodies when the mobile body VHi (or mobile body VHj) is a rental car. The information processing device 11 typically includes at least one processor and at least one memory. The processor includes a CPU (Central Processing Unit). The memory is a volatile memory such as a DDR memory, and performs the deployment of various programs used by the processor and the temporary storage of various kinds of information.
[0055] Function blocks of the information processing device 11 related to the management of the itinerary plan PLN are depicted in FIG. 8. In the example shown in FIG. 8, the information processing device 11 includes an information acquisition unit 14, a plan request determination unit 15, a plan generation unit 16, and a plan proposal unit 17. Note that each function of these blocks is realized by the processor of the information processing device 11 executing various programs stored in the memory of the information processing device 11.
[0056] The information acquisition unit 14 acquires various information transmitted from the user terminal of the tourism service (for example, the user terminal 20 of user US1). The various information transmitted from the user terminal 20 includes information necessary for the management of the tourism service represented by the user's ID information. The various information also includes information necessary for the generation of the travel plan PLN (or the alternative travel plan REP), the proposal of its candidates, and the registration of the travel plan PLN (or the alternative travel plan REP), such as the travel schedule information TUR and the approval or non-approval information for the candidate C_REP.
[0057] When receiving the travel schedule information TUR, the information acquisition unit 14 transmits the travel schedule information TUR to the plan request determination unit 15. When receiving the approval information for the candidate C_REP, the information acquisition unit 14 transmits this approval information to the plan proposal unit 17. When receiving the non-approval information for the candidate C_REP, the information acquisition unit 14 transmits this non-approval information to the plan request determination unit 15.
[0058] When receiving the travel schedule information TUR, the information acquisition unit 14 also accesses the visit plan DB12 and the map DB13, refers to the information constituting the travel schedule information TUR, and extracts specific information from these databases. Specifically, the information acquisition unit 14 refers to the information on the travel date included in the travel schedule information TUR, and extracts the visit plan information VST on this travel date from the visit plan DB12. The information acquisition unit 14 also refers to the information on the tourist spot included in the travel schedule information TUR, and extracts the map information MAP around this tourist spot from the map DB13. The information acquisition unit 14 transmits the extracted information to the plan generation unit 16.
[0059] The plan request determination unit 15 determines whether it is necessary to generate the travel plan PLN based on the information constituting the travel schedule information TUR received from the information acquisition unit 14. For example, when the total number of tourist spots included in the travel schedule information TUR is 3 or more, and the days of visiting these tourist spots are the same day, it is determined that it is necessary to generate the travel plan PLN. When it is determined that it is necessary to generate the travel plan PLN, the plan request determination unit 15 transmits a generation command to the plan generation unit 16.
[0060] Based on the non - permission information for the candidate C_REP received from the information acquisition unit 14, the plan requirement determination unit 15 also determines whether it is necessary to generate an alternative tour plan REP. In principle, when non - permission information is received, it is determined that it is necessary to generate an alternative tour plan REP. When it is determined that it is necessary to generate an alternative tour plan REP, the plan requirement determination unit 15 sends a generation command to the plan generation unit 16.
[0061] When the plan generation unit 16 receives a generation command from the plan requirement determination unit 15, it generates a candidate C_PLN for the tour plan PLN or a candidate C_REP for the alternative tour plan REP using the information received from the information acquisition unit 14. The plan generation unit 16 sends the candidate C_PLN or C_REP to the plan proposal unit 17.
[0062] Here, an example of generating the candidate C_PLN will be described with reference to FIGS. 9 and 10. FIG. 9 is an example of the visit schedule information VST registered in the visit plan DB12. FIG. 9 shows a list of the visit schedule information VST of the user US2x (x≥i) scheduled on the same day as the tour day. In the example shown in FIG. 9, the visit schedule information VST includes information on the number of people in the group N, information on the tourist spot SPy (y≥4), and information on the time zone for visiting these tourist spots. That is, the information shown in FIG. 9 corresponds to a list of the visit schedule information VST on the tour day extracted from the visit plan DB12.
[0063] Based on the information on the tourist spots included in the tour schedule information TUR, the plan generation unit 16 sets the tour area AR_TUR. Then, from the visit schedule information VST, the information corresponding to the tourist spots existing inside the tour area AR_TUR is extracted. Looking back at the example described with reference to FIGS. 1 - 4, the information extracted as the tourist spots existing inside the tour area AR_TUR is the information on the tourist spots SP1 - SP4.
[0064] Once information is extracted from the visit schedule information VST, the congestion levels of the extracted tourist spots are predicted respectively. Figure 10 shows an example of the congestion level of a tourist spot. In the example shown in Figure 10, the three-level congestion levels (L, M, H) of the tourist spot are calculated for each time segment TS. The congestion level is a percentage calculated based on the capacity C of the tourist spot and the total number of people visiting this tourist spot, and is represented in three levels: low (for example, less than 30%), medium (for example, 30% - 60%) and high (60% or more).
[0065] Once information is extracted from the visit schedule information VST, in addition, the congestion level of the surrounding area AR_TUR including the extracted tourist spot is also predicted. This congestion level is a percentage calculated based on the total capacity ΣC of the surrounding area AR_TUR and the total number of people visiting this surrounding area AR_TUR, and is represented in three levels: low, medium and high. Similar to the congestion level of the tourist spot, the congestion level of the surrounding area AR_TUR is calculated for each time segment TS. If the surrounding area AR_REP is set, the congestion level of the surrounding area AR_REP is calculated by the same method as the calculation method of the congestion level of the surrounding area AR_TUR.
[0066] When the congestion levels CON_SP1 - CON_SP4 and the congestion level CON_AR_TUR are predicted, the planning generation unit 16 determines whether the conditions for setting the time zones for visiting the tourist spots included in the tour schedule information TUR are met based on these congestion levels. This determination example is made based on the combination of the above-mentioned conditions C1 - C4 or the combination of conditions C5 - C9. Looking back at the example described with reference to Figures 1 - 4, the tourist spots included in the tour schedule information TUR are tourist spots SP1 - SP3. Therefore, it is determined whether the conditions for setting the visit time zones TZ_SP1, TZ_SP2 and TZ_SP3 are met.
[0067] When it is determined that the conditions are met for setting the time zones for visiting each of the tourist attractions included in the travel plan information TUR, the plan generation unit 16 calculates the time intervals available for traveling between these tourist attractions from the information on the time zones for visiting two tourist attractions arranged in the visit order. In addition, the plan generation unit 16 calculates the time required to move between these tourist attractions by a moving body. Then, the plan generation unit 16 makes a comparison between the two and determines whether it is possible to visit the tourist attractions included in the travel plan information TUR in the order of visit.
[0068] By performing the above processing, the plan generation unit 16 generates a candidate C_PLN. If a candidate C_PLN is not generated, the plan generation unit 16 changes some of the tourist attractions included in the travel plan information TUR to other tourist attractions existing outside the travel area AR_TUR. Then, the plan generation unit 16 generates a candidate C_PLN (the first generation example). When the travel plan information TUR includes the visit order OD_TUR information, the plan generation unit 16 changes the visit order OD_TUR to generate a candidate C_PLN (the second generation example).
[0069] The plan proposal unit 17 transmits the candidate C_PLN or C_REP received from the plan generation unit 16 to the user terminal that has transmitted the travel plan information TUR. After transmitting the candidate C_PLN, the plan proposal unit 17 registers the information on the visit time zones of the tourist attractions included in the candidate C_PLN in the visit plan DB12. When transmitting the candidate C_REP, after receiving the approval information for this candidate C_REP from the information acquisition unit 14, the plan proposal unit 17 registers the information on the visit time zones of the tourist attractions included in the candidate C_REP in the visit plan DB12.
[0070] 2-2. Information Processing Example FIG. 11 is a flowchart showing the flow of processing particularly relevant to the embodiment among the processing by the information processing apparatus 11 (processor). The routine shown in FIG. 11 is repeatedly executed, for example, at a predetermined cycle.
[0071] In the routine shown in FIG. 11, first, it is determined whether there is a request to generate a tour plan PLN (step S11). For example, when the total number of tourist spots included in the tour schedule information TUR is 3 or more and the days to visit these tourist spots are the same day, it is determined that it is necessary to generate a tour plan PLN. If the determination result in step S11 is negative, the processing of the routine ends.
[0072] If the determination result in step S11 is positive, visit schedule information VST is extracted (step S12). The extracted visit schedule information VST is for the tour date included in the tour schedule information TUR.
[0073] Subsequent to the processing in step S12, it is determined whether a candidate C_PLN can be generated (step S13). In the processing of step S13, specifically, a tour area AR_TUR is set, and based on the information of this tour area AR_TUR and the visit schedule information VST extracted in the processing of step S12, information corresponding to tourist spots existing inside the tour area AR_TUR is extracted. Then, the congestion level of each of the extracted tourist spots and the congestion level of the tour area AR_TUR are calculated.
[0074] In the processing of step S13, it is also determined whether the conditions are met for setting the time zones for visiting each of the tourist spots included in the tour schedule information TUR based on the congestion level of each of the extracted tourist spots and the congestion level of the tour area AR_TUR. If this determination result is positive, from the information on the time zones for visiting two tourist spots arranged in the visit order, the time interval that can be used for moving between these tourist spots is calculated. In addition, the time required to move between these tourist spots by a moving body is calculated.
[0075] In the process of step S13, furthermore, the time interval that can be used for moving between two tourist attractions is compared with the required time between these tourist attractions. And if the former is longer than the latter, it is determined that the candidate C_PLN can be generated. On the other hand, if the former is shorter than the latter, it is determined that the candidate C_PLN cannot be generated. Also, if it is determined that the conditions for setting the time zones for visiting each of the tourist attractions included in the itinerary plan information TUR are not met, it is determined that the candidate C_PLN cannot be generated.
[0076] If the determination result of step S13 is affirmative, the candidate C_PLN is generated and transmitted (step S14). The transmission destination of the candidate C_PLN is the user terminal that transmitted the itinerary plan information TUR. Following the process of step S14, the information included in the candidate C_PLN is registered in the visit plan DB12 (step S15). The information included in the candidate C_PLN includes at least the information of three tourist attractions and the information of the time zones for visiting each of these tourist attractions.
[0077] If the determination result of step S13 is negative, the candidate C_REP is generated and transmitted (step S16). The transmission destination of the candidate C_REP is the same as that of the candidate C_PLN. Following the process of step S14, it is determined whether or not the permission information for the candidate C_REP has been received (step S17). If the determination result of step S17 is negative, the process of step S16 is performed again.
[0078] If the determination result of step S17 is affirmative, the information included in the candidate C_REP is registered in the visit plan DB12 (step S18). The information included in the candidate C_REP includes at least the information of three tourist attractions and the information of the time zones for visiting each of these tourist attractions.
[0079] 3. Effects According to the embodiments described above, when proposing a plan to tour at least three tourist spots within a tourist destination, candidate C_PLN can be generated by considering not only the congestion levels of individual tourist spots but also the congestion level of the tour area in which these tourist spots are included. Also, according to the embodiments, when candidate C_PLN cannot be generated, candidate C_REP can be generated by changing some of the tourist spots to other tourist spots existing outside the original tour area (first generation example). Or, candidate C_REP can be generated by changing the order of visiting the tourist spots (OD_TUR) (second generation example). Therefore, it becomes possible to propose candidate C_PLN or candidate C_REP to a user who desires a tour plan PLN.
Explanation of Signs
[0080] 10 Server 11 Information Processing Device 12 Visit Plan DB 13 Map DB 20 User Terminal AR_TUR, AR_REP Tour Area CON_SP1, CON_SP2, CON_SP3, CON_AR_TUR Congestion Level C_PLN, C_REP Candidate OD_TUR, OD_REP Visit Order PLN Tour Plan REP Alternative Tour Plan ST1~ST3 Stay Time SP1~SP5 Tourist Spot TUR Tour Schedule Information TZ Tour Time Zone US1 User US21~US2i Another User VH1, VH21~VH2i Mobile Body VST Visit Scheduled Information
Claims
A method for causing a computer to propose a tour plan to a user who uses tourism services at a tourist destination, the tour plan being to tour a plurality of tourist spots within the tourist destination by moving using a mobile body, acquiring, from the user terminal of the user, the user's tour schedule information including information on the locations of at least three tourist spots within the tourist destination, information on the stay time at each of the at least three tourist spots, and information on the tour time zone for touring the at least three tourist spots; setting a tour area including the at least three tourist spots based on the location information; predicting the congestion level of each of the at least three tourist spots and the congestion level of the tour area; determining whether it is possible to generate a candidate for a tour plan to tour the at least three tourist spots by moving using a mobile body based on the information on the stay time, the information on the tour time zone, the congestion level of each of the at least three tourist spots, and the congestion level of the tour area; when it is determined that a candidate for the tour plan can be generated, generating the candidate for the tour plan and transmitting the generated candidate for the tour plan to the user terminal that is the source of the tour schedule information; when it is determined that a candidate for the tour plan cannot be generated, generating a candidate for an alternative tour plan in which a part of the at least three tourist spots is changed to another tourist spot located outside the tour area; when the candidate for the alternative tour plan is generated, transmitting the generated candidate for the alternative tour plan to the user terminal that is the source of the tour schedule information; including the step of predicting the congestion level is acquiring the visit schedule information of another user who uses tourism services at the tourist destination and exists inside the tour area on the day belonging to the tour time zone, where the visit schedule information of the other user is information that has already been generated at the time of generating the candidate for the tour plan or the alternative tour plan, and includes information on the location of the at least one tourist spot and information on the visit time zone to the at least one tourist spot. Based on the information on the visiting time zones of the at least one tourist attraction, calculating the congestion levels of the at least one tourist attraction and the congestion level of the surrounding area for each preset time period; including; In the step of determining whether a candidate for the tour plan can be generated, Based on the information on each staying time, the information on the tour time zones, and the congestion levels of the at least one tourist attraction and the surrounding area calculated for each time period, it is determined whether time periods for visiting each of the at least three tourist attractions can be set; If it is determined that time periods for visiting each of the at least three tourist attractions cannot be set, it is determined that a candidate for the tour plan cannot be generated; A method for proposing a tour plan.
2. In the step of determining whether a candidate for the tour plan can be generated, further, If it is determined that time periods for visiting each of the at least three tourist attractions can be set, the time required for moving between the at least three tourist attractions using the moving body is calculated; Based on the time periods for visiting each of the at least three tourist attractions and the time required for moving between the at least three tourist attractions, it is determined whether it is possible to tour the at least three tourist attractions within the tour time zones; If it is determined that it is not possible to tour the at least three tourist attractions within the tour time zones, it is determined that a candidate for the tour plan cannot be generated; The method for proposing a tour plan according to Claim 1.
3. A method for causing a computer to propose a tour plan for a user who uses tourism services at a tourist destination to tour a plurality of tourist attractions within the tourist destination by moving using a moving body, Obtaining the user's tour schedule information including the information on the locations of each of the at least three tourist attractions within the tourist destination, the information on each staying time at the at least three tourist attractions, the information on the tour time zones for touring the at least three tourist attractions, and the visiting order for visiting the at least three tourist attractions, from the user's user terminal; Setting a surrounding area including the at least three tourist attractions based on the information on each location; Predicting the congestion level of each of the at least three tourist attractions and the congestion level of the surrounding area; Based on the information of each stay time, the information of the sightseeing time zone, the congestion levels of each of the at least three tourist attractions, and the congestion level of the sightseeing area, determine whether it is possible to generate a candidate for a sightseeing plan in which the at least three tourist attractions are visited in the order of visit by moving using a moving body. When it is determined that a candidate for the sightseeing plan can be generated, generate the candidate for the sightseeing plan and transmit the generated candidate for the sightseeing plan to the user terminal that is the source of the sightseeing schedule information. When it is determined that a candidate for the sightseeing plan cannot be generated, generate a candidate for an alternative sightseeing plan in which the order of visiting the at least three tourist attractions is changed. When a candidate for the alternative sightseeing plan is generated, transmit the generated candidate for the alternative sightseeing plan to the user terminal that is the source of the sightseeing schedule information. including The step of predicting the congestion level is a step of obtaining visit schedule information of another user who is another user using a sightseeing service at the tourist destination and exists inside the sightseeing area on a day belonging to the sightseeing time zone, where the visit schedule information of the other user is information that has already been generated at the time of generating the candidate for the sightseeing plan or the alternative sightseeing plan, and includes information on the location of the at least one tourist attraction and information on the time zone for visiting the at least one tourist attraction. Based on the information on the time zone for visiting the at least one tourist attraction, calculate the congestion levels of the at least one tourist attraction and the congestion level of the sightseeing area for each preset time segment. including In the step of determining whether a candidate for the sightseeing plan can be generated Based on the information of each stay time, the information of the sightseeing time zone, and the congestion levels of the at least one tourist attraction and the sightseeing area calculated for each time segment, determine whether it is possible to set a time segment for visiting each of the at least three tourist attractions in the order of visit. When it is determined that it is not possible to set a time segment for visiting each of the at least three tourist attractions in the order of visit, it is determined that a candidate for the sightseeing plan cannot be generated. A method for proposing a sightseeing plan.
4. In the step of determining whether a candidate for the sightseeing plan can be generated, further When it is determined that time intervals for visiting each of the at least three tourist spots in the order of visit can be set, the time required for moving between the at least three tourist spots using the mobile body is calculated. Based on the time intervals for visiting each of the at least three tourist spots in the order of visit and the time required for moving between the at least three tourist spots, it is determined whether it is possible to visit the at least three tourist spots in the order of visit during the tour time zone. When it is determined that it is not possible to visit the at least three tourist spots in the order of visit during the tour time zone, it is determined that a candidate for the tour plan cannot be generated. The method for proposing a tour plan according to claim 3.
5. An apparatus for proposing a tour plan for a user who uses a tourism service at a tourist destination to tour a plurality of tourist spots within the tourist destination by moving using a mobile body, including a processor, The processor, acquires, from the user terminal of the user, the user's tour schedule information including information on the locations of each of at least three tourist spots within the tourist destination, information on the stay time at each of the at least three tourist spots, and information on the tour time zone for touring the at least three tourist spots; sets a tour area including the at least three tourist spots based on the location information; predicts the congestion level of each of the at least three tourist spots and the congestion level of the tour area; determines whether a candidate for a tour plan for touring the at least three tourist spots by moving using a mobile body can be generated based on the information on the stay time, the information on the tour time zone, the congestion level of the at least three tourist spots, and the congestion level of the tour area; when it is determined that a candidate for the tour plan can be generated, generates the candidate for the tour plan and transmits the generated candidate for the tour plan to the user terminal that is the source of the tour schedule information; when it is determined that a candidate for the tour plan cannot be generated, generates a candidate for an alternative tour plan in which a part of the at least three tourist spots is changed to another tourist spot located outside the tour area; when the candidate for the alternative tour plan is generated, transmits the candidate for the alternative tour plan to the user terminal that is the source of the tour schedule information; is configured to perform the above. The process of predicting the degree of congestion is a process of obtaining visit schedule information of another user who uses tourism services at the tourist destination and exists inside the tour area on a day belonging to the tour time zone, where the visit schedule information of the other user is information that has already been generated when generating candidates for the tour plan or the alternative tour plan, and includes information on the location of the at least one tourist spot and information on the time zone for visiting the at least one tourist spot a process of calculating the degree of congestion of the at least one tourist spot and the degree of congestion of the tour area for each preset time period based on the information on the time zone for visiting the at least one tourist spot and includes In the process of determining whether a candidate for the tour plan can be generated, based on the information on each stay time, the information on the tour time zone, and the degree of congestion of the at least one tourist spot and the tour area calculated for each time period, it is determined whether a time period for visiting each of the at least three tourist spots can be set If it is determined that a time period for visiting each of the at least three tourist spots cannot be set, it is determined that a candidate for the tour plan cannot be generated A tour plan proposal device. **Claim 6**: An apparatus for proposing a tour plan for a user who uses tourism services at a tourist destination to tour a plurality of tourist spots within the tourist destination by moving using a moving body, including a processor, wherein the processor obtains from the user terminal of the user the tour schedule information of the user, including information on the location of each of at least three tourist spots within the tourist destination, information on the stay time at each of the at least three tourist spots, information on the tour time zone for touring the at least three tourist spots, and the order of visits to the at least three tourist spots sets a tour area including the at least three tourist spots based on the information on each location predicts the degree of congestion of each of the at least three tourist spots and the degree of congestion of the tour area A process of determining whether it is possible to generate a candidate for a tour plan in which at least three tourist spots are visited in the order of visit by moving using a moving body based on the information on each stay time, the information on the tour time zone, the congestion level of each of the at least three tourist spots, and the congestion level of the tour area. When it is determined that a candidate for the tour plan can be generated, a process of generating the candidate for the tour plan and transmitting the generated candidate for the tour plan to the user terminal that is the source of the tour schedule information. When it is determined that a candidate for the tour plan cannot be generated, a process of generating a candidate for an alternative tour plan in which the order of visiting the at least three tourist spots is changed. When a candidate for the alternative tour plan is generated, a process of transmitting the generated candidate for the alternative tour plan to the user terminal that is the source of the tour schedule information. It is configured to perform The process of predicting the congestion level A process of obtaining visit schedule information of another user who is another user using a tourism service at the tourist destination and exists inside the tour area on a day belonging to the tour time zone, where the visit schedule information of the other user is information that has already been generated at the time of generating the candidate for the tour plan or the alternative tour plan, and includes information on the location of the at least one tourist spot and information on the time zone for visiting the at least one tourist spot. A process of calculating the congestion level of the at least one tourist spot and the congestion level of the tour area for each preset time period based on the information on the time zone for visiting the at least one tourist spot. including In the process of determining whether a candidate for the tour plan can be generated, Based on the information on each stay time, the information on the tour time zone, and the congestion levels of the at least one tourist spot and the tour area calculated for each time period, it is determined whether a time period for visiting each of the at least three tourist spots in the order of visit can be set. When it is determined that a time period for visiting each of the at least three tourist spots in the order of visit cannot be set, it is determined that a candidate for the tour plan cannot be generated. A tour plan proposal device.
Citation Information
Patent Citations
Scenic area route guide plan-based mathematical method
CN107764277A
Travel plan generation device
JP1997204475A
Travel schedule providing system
JP2002197150A
Dynamic state management server, dynamic state management method, and dynamic state management program
JP2019074986A
Information processing device, information processing method, and information processing program
JP2021196796A