JP4113909B1 - Route search system, route search server, and route search method - Google Patents

Abstract

A plurality of selectable destinations having time zones suitable for different visits are searched for a destination that can move from a departure place and can stay the longest in the most suitable time zone and its route.
A route is generated by generating a network in which a plurality of destinations are each a destination node having position information, an event target is a destination virtual node, and the destination virtual node and the destination node are connected by a destination virtual link. Connect to the search network data (S103). When selecting a destination virtual node and performing a route search, the recommended time zone at the destination node to which the destination virtual node is connected is extracted, and the departure time and arrival time of the destination virtual link are set as the end time of the recommended time zone. To find the optimal route. The departure time of the destination virtual link is replaced with the estimated arrival time at the destination node obtained by the search, and the time between the arrival time set for the destination virtual link and the arrival time at the destination node is calculated (S106).
[Selection] Figure 11

Description

  The present invention relates to a route search system that searches for an optimum route from a desired departure point to a destination, and in particular, to execute homogeneous events at a plurality of locations (points) such as carp fishing. However, the recommended time zone suitable for execution of the event differs depending on the location, and when executing an event where the stay time varies depending on the arrival time at the location, it is possible to arrive at the recommended time zone suitable for execution of the event The present invention relates to a route search system in which a location (point) that can be reached at a recommended location and a longer stay time can be extracted and a guide route to the location is searched. .

  2. Description of the Related Art Conventionally, navigation devices and navigation systems that guide a user by searching for a route from a desired departure point to a destination using map data and road data are known. Such navigation devices and navigation systems are known. As a car navigation device that is installed in an automobile and guides the route to the driver, a communication type that uses a mobile phone as a navigation terminal to send a route search request to the route search server, receives the result, and receives route guidance Navigation systems have been put to practical use.

  In particular, the communication-type navigation system is a system that uses a mobile terminal such as a mobile phone as a navigation terminal, and is also used as a navigation system for pedestrians. As a navigation system for pedestrians, it is preferable to add a route guidance function including transportation, and in addition to searching and guidance for walking routes, the route search server accumulates routes and operation time data of transportation, There is also a navigation system having a function of guiding a route from a desired departure station to a desired destination station (boarding candidate train) in addition to searching for a walking route and guidance. There is also a traffic guidance system that receives and displays information such as routes, timetables of transportation facilities, and trains that can be boarded from an information distribution server without searching for walking routes.

  A general navigation device, a route search device and a route search method used in a communication navigation system are disclosed in, for example, the following Patent Document 1 (Japanese Patent Laid-Open No. 2001-165681). This navigation system is configured to send information on a departure point and a destination from a portable navigation terminal to an information distribution server, and the information distribution server searches and guides a route that matches a search condition from road network and traffic network data. Has been. As the search condition, there are means for moving from the departure place to the destination, for example, walking, automobile, combined use of railroad and walking, and the route is searched as one of the search conditions.

  The information distribution server has roads (routes) of map data as nodes and nodes as the positions of inflection points, links connecting the nodes as links, and cost information (distance and required time) of all links as a database. ing. Then, the information distribution server sequentially searches for a link from the departure node to the destination node with reference to the database, and traces the node and link with the smallest cost information of the link as a guide route. The shortest route can be guided to the portable navigation terminal. As such a route search method, a method called label determination method or Dijkstra method is used. Patent Document 1 also discloses a route search method using this Dijkstra method.

  A route search system that searches for routes that use transportation is a database of operation time data of each transportation based on route search conditions such as departure date, departure location, destination, arrival time specified by the user. A time database and a database in which a traffic network is converted into a database are provided. Then, referring to these databases, each available means of transportation (individual trains and route buses) connecting the departure point and destination, including connections (transfers), is sequentially traced to meet the route search conditions. It is configured to present one or a plurality of candidates for a guide route (departure station, destination station, route, train, etc.). As route search conditions, it is generally possible to specify conditions such as required time, number of transfers, and fares.

  In addition, as a system for conducting searches and guidance related to transportation facilities, a terminal device such as a mobile phone is connected to an information distribution server for guiding route information and timetable information of transportation facilities, and a desired departure station, departure time, destination station, etc. There is also provided a guidance system that can specify information, receive information on routes, trains, trains and other transportation means that can be boarded, and display them on a terminal device. In general, when such use is performed from a terminal device, address information such as a URL (Uniform Resource Locator) and a domain name for specifying a location where information to be downloaded exists is input to the terminal device, and the address information is used. A configuration is adopted in which desired information is downloaded by accessing an identified information distribution server (information site).

  The route search data in the navigation system for route search and route guidance using the transportation system is the same as the road network data in the in-vehicle navigation system and the pedestrian navigation system. In addition to data networked as a two-way link, the operation time and required time of each link are added as link cost data for each means of transportation operated on each traffic route. Furthermore, there is a system in which fare data is added and the fare of the searched guide route is guided together.

  Therefore, the guidance route data distributed to the terminal device includes a route search condition specified by the user, such as a route route from the departure point to the destination, and buses, trains, trains, and times that guide the ride, and the operation. A timetable or a so-called station pasted timetable posted at a station is processed as it is or into a format such as display data that can be displayed on a necessary part, and distributed to the terminal device. The terminal device can check the route and the transportation means to be boarded by displaying the guidance route data, the operation timetable, or the station pasted timetable.

  A route search method for performing a route search using a transportation facility is disclosed as a traffic network route search method in, for example, the following Patent Document 2 (Japanese Patent Laid-Open No. 2000-258184). The traffic network route search method disclosed in Patent Document 2 expresses a traffic network from a starting point to a destination point by using a node as a point and a link between points as a link. This is a method of searching under conditions.

  In this method, as the route from the departure point and destination point to the transportation station to be used, the straight distance from the departure point and destination point to the transportation station to be used, and from the destination point to the transportation station to be used. The average distance is calculated using latitude and longitude information as a variable, the average cost is calculated using the linear distance as a variable, the stations of all the transportation facilities included in the cost range specified by the average cost are determined, and the walking route The total walking network is expressed by incorporating the obtained walking route into the traffic network route of the transportation system, and the search is performed under the cost condition obtained by the label determination method using a computer.

  There are cases where facilities and places that are set as destinations by users are limited in available time zones. For example, in a shop or restaurant, the business hours are often fixed, and even if you search for the route to the store or restaurant and guide the route, you can visit the store or restaurant outside the business hours. Will not be available.

  As an invention for solving such problems, for example, the following patent document 3 (Japanese Patent Laid-Open No. 2004-5502), patent document 4 (Japanese Patent Laid-Open No. 2002-98539), and the following patent document 5 (2005-315660). There is an invention of an information providing server and a navigation device disclosed in Japanese Laid-Open Patent Publication (Kokai).

  The invention of the information providing server disclosed in Patent Document 3 includes business information transmitted from a store terminal installed in each store together with store information including at least one of the store name, the nearest station, and the location of the store. A database is stored that stores one or more of time, last order time, average stay time of customers, and waiting time. In addition, the travel time is calculated based on the distance from the specific point to the store, and the added value of the average stay time and waiting time is compared with the time that becomes the search condition to extract stores that can be used within the time. It is comprised so that it may perform.

  The invention of the navigation device disclosed in Patent Document 4 searches for a destination candidate based on a user instruction and displays a list. In addition, the facility information of each destination candidate includes information on business hours. The estimated arrival time from the current location to the destination candidate facility is calculated, and whether the expected arrival time is within business hours. And the result is displayed.

  In the invention of the navigation apparatus disclosed in Patent Document 5, a destination and an alternative destination corresponding to each of the destinations are registered in advance in association with conditions such as business hours. Then, in the route guidance from the current location to the destination, determine whether the destination is within the allowable range of business hours, and if it is outside the allowable range, the alternative purpose within the allowable range of business hours It is configured to propose the ground.

  According to the navigation apparatus as disclosed in Patent Documents 3 to 5, it is possible to search for a route that arrives at the facility at a time when the target facility can be used and to guide the user to the user.

  On the other hand, when a user sets a desired destination, facilities or points (points) for participating in events such as concerts, movies, and sports, or for performing events such as sports and fishing, are used as destinations. Sometimes set. Even if a facility or place for such an event is set as a destination, it is possible to search for an optimum route or a candidate route to the destination from a home or work place as a starting point as in general destination setting. it can.

  By the way, in such an event, there is an event in which any one of a plurality of facilities and places can be selected and participated and executed, not necessarily one specific place. For example, taking a movie as an example, a specific movie title will be screened at a plurality of movie theaters at the time of opening, and the content will be the same regardless of which movie theater is viewed, so that it can participate in a quality event. In this case, the user may select a movie theater located at the most convenient place from the departure place and watch a desired movie title.

  By the way, since the movie start time and show time differ depending on the movie theater, simply guiding the optimal route to the movie theater where the desired movie title is shown will lead to the start of the movie title you want to watch. There is a waiting time. Even if the route to the movie theater is not the shortest, the desired movie title may be watched earliest.

  A route search system for efficiently selecting and participating in a plurality of facilities and homogeneous events executed at different times, such as watching movie titles, is configured as follows. be able to. In other words, using the concept of network data for route search using transportation, the location of each event is set as an event venue node having position information, and the event (movie title for each screening) does not have position information. Connect to the event venue node where the event is held as the target virtual node, connect the event venue node and the target virtual node with a link based on the event holding time, and route the event venue node to the traffic network data The problem can be solved by connecting to the search network data and performing a route search.

  The concept of such route search will be described. FIG. 13 schematically shows a state in which the movie theater TA and the movie theater TB, which are event venue nodes, are connected to the route search network data. In FIG. 13, a solid line TR indicates a traffic route section, a dotted line RD indicates a walking section (road section), reference symbols TA and TB indicate movie theaters A and B, which are event venue nodes, and ST indicates each station on the traffic route. Indicates. Since the locations of movie theater A and movie theater B are specified by latitude and longitude, they can be connected to a node of the nearest station ST by a road section (walking section) indicated by a dotted line. Although there are many other event venue nodes, FIG. 13 representatively shows only movie theater A and movie theater B.

  Here, the movie title shown at each movie theater (event venue node) is the target virtual node, and the movie theater is linked to the movie title showing time (start time, end time) as the departure time and arrival time of the train. By connecting the (event venue node) and the movie title (target virtual node), it is possible to search for a route to the virtual node of the desired movie title, including the route search using transportation.

JP 2001-165681 A JP 2000-258184 A JP 20045502 A JP 2002-98539 A JP 2005-315660 A

  In the prior arts such as the above Patent Documents 3 to 5, for store information holding information on location and business hours, a route search is performed after designating a current location or an arbitrary departure location, and movement from the store location and current location is performed. The arrival time to the store and the business hours are compared from the required time, and the average stay time is taken into consideration to determine whether or not the business hours are in time.

  However, for example, when the business hours of individual stores are different, it is not possible to set a condition for searching for a store that can stay for the longest time in time. Even if you reach your destination the earliest, there is no point in staying at that destination for a short time, and you can stay longer even if you spend more time traveling to your destination and the arrival time is slower. The destination must be searchable.

  In addition, in the case of homogeneous events that are executed in different time zones at different locations such as watching movies as described above, the start time and end time of the event are fixed, and the stay time during the event execution is also fixed. Yes. Therefore, the route search can be performed using the network data as shown in FIG. However, among events that are preferably executed in different recommended time zones at different locations, there are events in which the start time and end time of the recommended time zone suitable for event execution differ depending on the location. In such an event, the staying time in the recommended time zone during the event execution differs depending on the place.

  A specific example of such an event is carp fishing. For events such as carp fishing, there is a time zone suitable for fishing between low tide and high tide, and the start time and end time of this time zone differ depending on the location. Although fishing itself can be enjoyed even if it is not in the recommended time zone, great results cannot be expected if the recommended time zone is exceeded. Therefore, for users who enjoy fishing, it is the most important condition for selecting a destination that the expected arrival time to the event execution place (a point suitable for fishing) is in time for the end time of the recommended time zone. Even if the travel time is long, the fact that a longer staying time can be obtained within the range of the above-mentioned time zone is also an important factor for destination selection.

  The present invention has been made to solve the above problems, and is most suitable for moving from a departure place among a plurality of selectable destinations each having a time zone suitable for different visits. It is an object of the present invention to provide a route search system capable of searching and guiding a destination that can stay for the longest time and its route.

In order to solve the above-mentioned problem, the invention according to claim 1 of the present application is
A route search system for setting a desired departure point and searching for a route to the plurality of destinations that execute a plurality of destinations and an event that is preferably executed at a plurality of recommended time zones different for each destination. There,
The route search system includes a route search network database storing route search network data for searching a route, a route search means, a network data editing means, and an event storing data related to a recommended time zone of the event. A data database and a network in which each of the plurality of destinations is a destination node having position information, a target for executing the event is a destination virtual node, and the destination virtual node and the destination node are connected by a destination virtual link. A destination virtual node setting means to generate, a destination virtual link setting means, and a stay time calculating means,
When the destination virtual node is selected, the destination virtual link setting means extracts a recommended time zone at the destination node to which the destination virtual node is connected with reference to the event data database, and the destination virtual link is connected. that the departure time and the arrival time to the destination virtual node of the destination node, set using the end time of the recommended time zone at the destination node of the target virtual link is connected,
The network data editing means connects a destination virtual node connected to the destination virtual link set by the destination virtual link setting means to the network data for route search.
The route search means searches for an optimum route from the departure place to the destination virtual node, calculates an estimated arrival time at the destination node,
The stay time calculating means replaces the departure time of the destination virtual link with the expected arrival time, and sets the time between the departure time and the arrival time set by the destination virtual link setting means to stay at the destination node. It is calculated as time, and the estimated arrival time and stay time are guided together with the route to the destination.

The invention according to claim 2 of the present application is
A route search system for setting a desired departure point and searching for a route to the plurality of destinations that execute a plurality of destinations and an event that is preferably executed at a plurality of recommended time zones different for each destination. There,
The route search system includes a route search network database storing route search network data for searching a route, a route search means, a network data editing means, and an event storing data related to a recommended time zone of the event. A data database and a network in which each of the plurality of destinations is a destination node having position information, a target for executing the event is a destination virtual node, and the destination virtual node and the destination node are connected by a destination virtual link. A destination virtual node setting means to generate, a destination virtual link setting means, and a stay time calculating means,
When the destination virtual node is selected, the destination virtual link setting means extracts a recommended time zone at the destination node to which the destination virtual node is connected with reference to the event data database, and the destination virtual link is connected. that the departure time and the arrival time to the destination virtual node of the destination node, set using the end time of the recommended time zone at the destination node of the target virtual link is connected,
The network data editing means connects a destination virtual node connected to the destination virtual link set by the destination virtual link setting means to the network data for route search.
The route search means searches for an optimum route from the departure place to the destination virtual node, calculates an estimated arrival time at the destination node,
The stay time calculating means replaces the departure time of the destination virtual link with the expected arrival time, and sets the time between the departure time and the arrival time set by the destination virtual link setting means to stay at the destination node. Calculated as time as the first route search result,
The network data editing means excludes the target virtual link used when obtaining the first route search result from the route search network data,
The route search means searches for the optimum route to the remaining destination virtual node using the route search network data from which the destination virtual link is excluded by the network data editing means as a second route, and the stay time calculation means Is compared with the stay time of the first route search result, and when the stay time of the second route is longer than the stay time of the first route search result, the second route is It is characterized by guiding as a route search result.

  The invention according to claim 3 of the present application is the invention according to claim 1 or 2, wherein the target virtual node is connected to a category virtual node that does not have position information corresponding to a type of the target object for executing the event. The category virtual node and the destination virtual node are connected by a link having a fixed link cost, and a route search is performed using the category virtual node as a destination.

  The invention according to claim 4 of the present application is the invention according to claim 1 or 2, wherein the stay time calculation means is configured such that the estimated arrival time at the destination is a start time of the recommended time zone at the destination node. If it is earlier than, the departure time set for the destination virtual link is replaced with the start time of the recommended time zone, and between the departure time and the arrival time set by the destination virtual link setting means The time is calculated as a stay time at the destination node.

The invention according to claim 5 of the present application is the invention according to claim 2, wherein the route search system includes display means for displaying a route searched by the route search means, and a route search result displayed on the display means is predetermined. If it becomes few, the route searching means is characterized in that ends the processing of the route search.

In the invention according to claim 6 of the present application, in the invention according to claim 2, a route search using the target virtual link connected to the target virtual node is repeatedly performed, and there is no link reaching the target virtual node . In this case, the route search process is terminated.

The invention according to claim 7 of the present application is
A route search server that searches for routes to a plurality of destinations by setting desired departure points and executing events that are preferably executed at a plurality of destinations and a plurality of recommended time zones that differ for each destination. There,
The route search server includes a route search network database storing route search network data for searching a route, a route search means, a network data editing means, and an event storing data related to the recommended time zone of the event. A data database and a network in which each of the plurality of destinations is a destination node having position information, a target for executing the event is a destination virtual node, and the destination virtual node and the destination node are connected by a destination virtual link. A destination virtual node setting means to generate, a destination virtual link setting means, and a stay time calculating means,
When the destination virtual node is selected, the destination virtual link setting means extracts a recommended time zone at the destination node to which the destination virtual node is connected with reference to the event data database, and the destination virtual link is connected. that the departure time and the arrival time to the destination virtual node of the destination node, set using the end time of the recommended time zone at the destination node of the target virtual link is connected,
The network data editing means connects a destination virtual node connected to the destination virtual link set by the destination virtual link setting means to the network data for route search.
The route search means searches for an optimum route from the departure place to the destination virtual node, calculates an estimated arrival time at the destination node,
The stay time calculating means replaces the departure time of the destination virtual link with the expected arrival time, and sets the time between the departure time and the arrival time set by the destination virtual link setting means to stay at the destination node. It is calculated as time, and the estimated arrival time and stay time are guided together with the route to the destination.

The invention according to claim 8 of the present application is
A route search server that searches for routes to a plurality of destinations by setting desired departure points and executing events that are preferably executed at a plurality of destinations and a plurality of recommended time zones that differ for each destination. There,
The route search server includes a route search network database storing route search network data for searching a route, a route search means, a network data editing means, and an event storing data related to the recommended time zone of the event. A data database and a network in which each of the plurality of destinations is a destination node having position information, a target for executing the event is a destination virtual node, and the destination virtual node and the destination node are connected by a destination virtual link. A destination virtual node setting means to generate, a destination virtual link setting means, and a stay time calculating means,
When the destination virtual node is selected, the destination virtual link setting means extracts a recommended time zone at the destination node to which the destination virtual node is connected with reference to the event data database, and the destination virtual link is connected. that the departure time and the arrival time to the destination virtual node of the destination node, set using the end time of the recommended time zone at the destination node of the target virtual link is connected,
The network data editing means connects a destination virtual node connected to the destination virtual link set by the destination virtual link setting means to the network data for route search.
The route search means searches for an optimum route from the departure place to the destination virtual node, calculates an estimated arrival time at the destination node,
The stay time calculating means replaces the departure time of the destination virtual link with the expected arrival time, and sets the time between the departure time and the arrival time set by the destination virtual link setting means to stay at the destination node. Calculated as time as the first route search result,
The network data editing means excludes the target virtual link used when obtaining the first route search result from the route search network data,
The route search means searches for the optimum route to the remaining destination virtual node using the route search network data from which the destination virtual link is excluded by the network data editing means as a second route, and the stay time calculation means Is compared with the stay time of the first route search result, and when the stay time of the second route is longer than the stay time of the first route search result, the second route is It is characterized by guiding as a route search result.

  The invention according to claim 9 of the present application is the invention according to claim 7 or claim 8, wherein the target virtual node is connected to a category virtual node that does not have position information corresponding to a type of a target object for executing the event. The category virtual node and the destination virtual node are connected by a link having a fixed link cost, and a route search is performed using the category virtual node as a destination.

  The invention according to claim 10 of the present application is the invention according to claim 7 or claim 8, wherein the stay time calculation means is configured such that the estimated arrival time at the destination is a start time of the recommended time zone at the destination node. If it is earlier than, the departure time set for the destination virtual link is replaced with the start time of the recommended time zone, and between the departure time and the arrival time set by the destination virtual link setting means The time is calculated as a stay time at the destination node.

The invention according to claim 11 of the present application is the invention according to claim 8, wherein the route search system includes display means for displaying the route searched by the route search means, and the route search result displayed on the display means is predetermined. If it becomes few, the route searching means is characterized in that ends the processing of the route search.

The invention according to claim 12 of the present application is the invention according to claim 8, wherein the route search using the target virtual link connected to the target virtual node is repeatedly performed, and there is no link reaching the target virtual node . In this case, the route search process is terminated.

The invention according to claim 13 of the present application is
In a route search server for setting a desired departure point and searching for a route to the plurality of destinations that execute a plurality of destinations and an event that is preferably executed in a plurality of recommended time zones different for each destination A route search method,
The route search server includes a route search network database storing route search network data for searching a route, a route search means, a network data editing means, and an event storing data related to the recommended time zone of the event. A data database and a network in which each of the plurality of destinations is a destination node having position information, a target for executing the event is a destination virtual node, and the destination virtual node and the destination node are connected by a destination virtual link. A destination virtual node setting means to generate, a destination virtual link setting means, and a stay time calculating means,
When the destination virtual node is selected, the destination virtual link setting means extracts a recommended time zone at the destination node to which the destination virtual node is connected with reference to the event data database, and the destination virtual link is connected. comprising the steps of: the departure time and the arrival time to the destination virtual node of the destination node, set by using the ending time of the recommended time zone at the destination node of the target virtual link is connected to that,
The network data editing means connecting a destination virtual node connected to the destination virtual link set by the destination virtual link setting means to the network data for route search;
The route search means searches for an optimum route from the departure place to the destination virtual node, and calculates an expected arrival time at the destination node;
The stay time calculating means replaces the departure time of the destination virtual link with the expected arrival time, and sets the time between the departure time and the arrival time set by the destination virtual link setting means to stay at the destination node. Calculating the time, and guiding the estimated arrival time and the stay time together with the route to the destination.

The invention according to claim 14 of the present application is
In a route search server for setting a desired departure point and searching for a route to the plurality of destinations that execute a plurality of destinations and an event that is preferably executed in a plurality of recommended time zones different for each destination A route search method,
The route search server includes a route search network database storing route search network data for searching a route, a route search means, a network data editing means, and an event storing data related to the recommended time zone of the event. A data database and a network in which each of the plurality of destinations is a destination node having position information, a target for executing the event is a destination virtual node, and the destination virtual node and the destination node are connected by a destination virtual link. A destination virtual node setting means to generate, a destination virtual link setting means, and a stay time calculating means,
When the destination virtual node is selected, the destination virtual link setting means extracts a recommended time zone at the destination node to which the destination virtual node is connected with reference to the event data database, and the destination virtual link is connected. comprising the steps of: the departure time and the arrival time to the destination virtual node of the destination node, set by using the ending time of the recommended time zone at the destination node of the target virtual link is connected to that,
The network data editing means connecting a destination virtual node connected to the destination virtual link set by the destination virtual link setting means to the network data for route search;
The route search means searches for an optimum route from the departure place to the destination virtual node, and calculates an expected arrival time at the destination node;
The stay time calculating means replaces the departure time of the destination virtual link with the expected arrival time, and sets the time between the departure time and the arrival time set by the destination virtual link setting means to stay at the destination node. Calculating the time as a first route search result;
The network data editing means, excluding the target virtual link used when obtaining the first route search result from the route search network data;
The route search means searches for the optimum route to the remaining destination virtual node using the route search network data from which the destination virtual link is excluded by the network data editing means as a second route, and the stay time calculation means Is compared with the stay time of the first route search result, and when the stay time of the second route is longer than the stay time of the first route search result, the second route is And guiding as a route search result.

  The invention according to claim 15 of the present application is the invention according to claim 13 or claim 14, wherein the target virtual node is connected to a category virtual node that does not have position information corresponding to a type of target object for executing the event. The category virtual node and the destination virtual node are connected by a link having a fixed link cost, and a route search is performed using the category virtual node as a destination.

  The invention according to claim 16 of the present application is the invention according to claim 13 or claim 14, wherein the stay time calculation means is configured such that the estimated arrival time at the destination is a start time of the recommended time zone at the destination node. If it is earlier than, the departure time set for the destination virtual link is replaced with the start time of the recommended time zone, and between the departure time and the arrival time set by the destination virtual link setting means The time is calculated as a stay time at the destination node.

The invention according to claim 17 of the present application is the invention according to claim 14, wherein the route search system includes display means for displaying the route searched by the route search means, and the route search result displayed on the display means is predetermined. If it becomes few, serial route searching means is characterized in that ends the processing of the route search.

The invention according to claim 18 of the present application is the invention according to claim 14, wherein the route search using the target virtual link connected to the target virtual node is repeatedly performed, and there is no link reaching the target virtual node . In this case, the route search process is terminated.

In the invention according to claim 1, a plurality of destinations are set as destination nodes each having position information, a target target for executing the event is set as a target virtual node, and the destination virtual node and the destination node are connected to the destination virtual link When connecting to the route search network data by creating a network connected in step, selecting the destination virtual node and searching for the route, the recommended time zone at the destination node to which the destination virtual node is connected is extracted and the destination virtual link is extracted. The departure time of the destination node connected to the destination node and the arrival time at the destination virtual node are set using the end time of the recommended time zone at the destination node to which the destination virtual link is connected to search for the optimum route . Then, the departure time of the destination virtual link is replaced with the estimated arrival time at the destination node obtained by the search, and the time between the arrival time set by the destination virtual link setting means is calculated as the stay time at the destination node. .

  According to such a configuration, a route to the destination virtual node whose arrival time from the departure point to the destination node is in time for the end time of the recommended time zone is searched, and the expected arrival time at the destination node in this route is determined as the destination. If it is replaced with the departure time of the virtual link, the stay time at the destination node can be calculated from the difference from the arrival time of the destination virtual link. Therefore, at the destination node, an event such as fishing is performed within the recommended time zone. It will be possible to guide the stay time that can be executed. That is, it is possible to guide the destination that can arrive the earliest in time for the end time of the recommended time zone at the destination.

In the invention according to claim 2, the route searched in the claim 1 is a first route, the target virtual link used when obtaining the first route search result is excluded from the route search network data,
The route search means searches for the optimum route to the remaining destination virtual node using the route search network data from which the destination virtual link is excluded by the network data editing means as a second route, and the stay time calculation means Is compared with the stay time of the first route search result, and when the stay time of the second route is longer than the stay time of the first route search result, the second route is Guide as route search results.

  According to such a configuration, the arrival time at the destination is delayed with respect to the first route, but the stay time within the recommended time zone at the destination can be set longer than that of the first route. It will be possible to guide the route that can be.

  In the invention according to claim 3, in the invention according to claim 1 or claim 2, the target virtual node is connected to a category virtual node that does not have position information according to the type of the target object that executes the event, The category virtual node and the destination virtual node are connected by a link having a fixed link cost, and a route search is performed using the category virtual node as a destination.

  According to such a configuration, since the category is divided for each feature of the target of the event, for example, the fish that is the target of the event that is fishing, a network in which the target virtual node and the category virtual node are connected by a link is used. By selecting a virtual node, it becomes possible to search for a destination node corresponding to the type of fish that is the target of event execution.

  In the invention according to claim 4, in the invention according to claim 1 or claim 2, the stay time calculation means is configured such that the estimated arrival time at the destination is greater than the start time of the recommended time zone at the destination node. If it is before, the departure time set for the destination virtual link is replaced with the start time of the recommended time zone, and the time between the departure time and the arrival time set by the destination virtual link setting means is Calculated as stay time at the destination node.

  According to such a configuration, since the departure time set for the destination virtual link is replaced with the estimated arrival time at the destination node, even if the destination node arrives before the start time of the recommended time zone, The staying time at can be calculated.

In the invention according to claim 5, in the invention according to claim 2, the route search system includes display means for displaying the route searched by the route search means, and the route search result displayed on the display means is a predetermined number. when it becomes, the route search means ends the process of the route search. According to such a configuration, a predetermined number of candidate routes can be guided to complete the route search, and the user can select a desired destination from the candidate routes.

In the invention according to claim 6, in the invention according to claim 2, the route search system repeatedly performs route search using the target virtual link connected to the target virtual node, and reaches the target destination virtual node. When there is no more, the route search process is terminated. According to such a configuration, it is possible to know the expected arrival time of the destination node connected to the link that reaches the destination virtual node selected by the user, and the stay time within the recommended time zone.

  In the inventions according to claims 7 to 12, it is possible to provide route search servers constituting the route search system according to claims 1 to 6, respectively. In the inventions according to claims 13 to 18, it is possible to provide route search methods for realizing the route search servers according to claims 7 to 12, respectively.

  Hereinafter, specific examples of the present invention will be described in detail with reference to examples and drawings. However, the embodiment described below exemplifies a route search system for embodying the technical idea of the present invention, and is not intended to identify the present invention as this route search system. The present invention is equally applicable to route search systems of other embodiments included in the scope of claims.

  As shown in FIG. 1, a route search system 10 according to an embodiment of the present invention includes a mobile terminal device 20 using a portable terminal such as a mobile phone, a PDA, or a music player, and a route search server 30 in a network such as the Internet. 12 is configured to be connected through 12. In this embodiment, the route search system 10 that provides a communication type route search and guidance route will be described as a specific example. However, the present invention is not limited to this, and the present invention can be applied to a stand-alone type route search system. Applicable.

  The route search server 30 includes a database (DB1) that stores road network data for route search, a database (DB2) that stores traffic network data based on timetable data, and different recommended time zones at different locations. The database includes an event database (DB3) that stores data of events that are preferably executed, and a database (DB4) that stores map data for display.

  Hereinafter, in the description of the embodiments of the present invention, a case of fishing such as carp fishing will be described as a specific example as an example of an event that is preferably executed at a plurality of different locations in different recommended time zones. When the event is fishing, the event data is data of the start time and end time of the recommended time zone at the fishing spot of each point calculated based on the daily tide table. The tide table may be stored as event data, and the recommended time zone may be calculated each time. Details of the event data will be described later.

  FIG. 2 is a block diagram showing a detailed configuration of the route search system 10 according to the embodiment of the present invention. A route search system 10 according to an embodiment of the present invention includes a mobile terminal device 20 that communicates via a network 12 such as the Internet and a route search server 30 as shown in the block diagram of FIG. .

  The mobile terminal device 20 is a terminal such as a mobile phone that can receive a navigation service, and includes a control unit 201, a communication unit 21, a GPS reception unit 22, a processing request unit 23, a distribution data storage unit 24, a display unit 25, and an operation. Input means 26 and the like are provided. The operation input unit 26 includes a target event setting unit 261 for setting a target event. Specifically, the target event setting means 261 includes character input keys, cursor keys for selecting setting items on the menu screen displayed on the display screen of the display means 25, etc., and the user executes fishing as an event. If desired, a target virtual node (to be described later) is set (selected) using the target event setting means 261.

  On the other hand, the route search server 30 includes a control unit 301, a communication unit 31, a distribution data editing unit 32, an alternative route search control unit 33, a map database 34, a route search network database 35, an event data database 36, and a network data editing unit 37. , Destination virtual node setting means 371, destination virtual link setting means 372, stay time calculation means 373, processing request storage means 38, route search means 39, and the like.

  The mobile terminal device 20 sets route search conditions such as a departure point and a destination to the route search server 30 and transmits a route search request. The route search server 30 sends a route search, POI search, or map distribution from the mobile terminal device 20. Is temporarily stored in the processing request storage means 38. If the request is a route search request, the route search means 39 searches the route search network database 35 for an optimum route or a recommended route (guide route).

The searched guidance route data is edited into distribution data for the portable terminal device 20 by the distribution data editing means 32 and distributed to the portable terminal device 20. Further, map data including the guide route is read from the map database 34 and distributed to the mobile terminal device 20.

  FIG. 3 is a schematic diagram showing a plurality of destinations (fishing grounds) when fishing is executed as an event. In FIG. 3, reference symbol ST is a starting point, OP1 indicating fishing ground 1 is Naka (Ibaraki Prefecture), OP2 indicating fishing ground 2 is Choshi Port (Chiba Prefecture), OP3 indicating fishing ground 3 is Kamogawa (Chiba Prefecture), fishing ground 4 OP4 indicating “Manazuru Misaki” (Kanagawa Prefecture) is a point for fishing. In a normal route search, a specific destination, for example, a fishing ground OP1 Naka, is set to search for a route that can be reached in the shortest time from the departure point. As a result, it was possible to know the shortest route to the destination, the required time, and the arrival time.

  However, as will be described later, fishing is roughly determined by the place and day as a time zone suitable for catching fish. Therefore, if the arrival time at the fishing spot OP1 set as the destination is set so as to fall within the time zone suitable for fishing and the route search condition is designated for arrival time, the departure time of the guide route and the departure point ST Will be guided. In this case, it is assumed that the user knows a time zone suitable for fishing at the point of fishing. If you want to compare the route, departure time, and stay time (time for fishing in a suitable time zone) for multiple destinations, set the destination and arrival time in order and search the route and compare the results It took time and effort to do.

  In the route search system according to the present embodiment, the recommended time zone (start time and end time) suitable for fishing for each fishing point (destination) and date, or the tide from which the recommended time zone is calculated. Table data is prepared as a database, multiple fishing spots can be used as candidate destinations, and you can arrive at the fishing spot during the recommended time zone at each fishing spot, and stay longer in the recommended time zone In this way, the destination where the fishing event can be executed is searched and guided.

  In general, what is said to be the most suitable time zone for fishing is the vicinity of sunrise / sunset time called “Mazume”, and the time zone called “time when tides move faster”. Here, this time is set as the most suitable time zone for fishing. Though there is a difference in the way of thinking of time, three times from the seven minutes (7/10) of the time from low tide to high tide that occurs before the high tide to the high tide to the high tide that comes after that. The minute (3/10) is raised to 7 minutes and expressed as 3 minutes, which is called time. Since the change in the tide level depends on the position and date, the timing differs depending on the day depending on the fishing spot.

  For example, the tide table at each point on the day (date) of the fishing grounds OP1 to OP4 (Naka to Manazuru Cape) shown in FIG. 3 is as shown in FIG. If it is Naka of fishing ground OP1, it turns out that the high tide of this day is 0:49 and 15:01. From there, it can be predicted that the Naka time of fishing ground OP1 is from 23:20 on the previous day to 3:00 on the day and from 12:55 to 16:40 on the day. Similarly, fishing time can be calculated for each of other fishing grounds. FIG. 5 shows the result of calculating the time (recommended time zone) at each fishing spot OP1 to OP4 based on the tide table of FIG.

  The event data database 36 stores recommended time zone data for each date of each point of fishing including each fishing ground shown in FIG. The event data database 36 may store a tide table for each date of each fishing point including each fishing spot shown in FIG. 4 and calculate and use the time when searching for a route.

  Next, a concept of a route search for searching and guiding a destination that can stay at a predetermined time zone for a long time using a plurality of fishing spots as candidates using such event data will be described. First, the concept of route search using network data of roads and transportation will be described. The route search network database 35 stores road network data (DB1) for route search of automobiles and walking sections, and traffic network data (DB2) for route search using transportation facilities.

  The road network data (DB1) for route search is configured as follows. For example, when the road is composed of roads A, B, and C as shown in FIG. 6, the end points, intersections, and bending points of the roads A, B, and C are used as nodes, and the roads connecting the nodes are directed links. Link cost data with node data (node latitude / longitude), link data (link number) and link cost of each link (link distance or time required to travel the link) as data Composed.

  That is, in FIG. 6, Nn (◯ mark) and Nm (◎ mark) indicate nodes, and Nm (◎ mark) indicates a road intersection. Directional links connecting the nodes are indicated by arrow lines (solid line, dotted line, two-dot chain line). As for the links, there are links facing in the upward and downward directions of the road, but in FIG. 6, only the links in the direction of the arrows are shown for the sake of simplicity.

  When route search is performed using such road network data as a route search database, links linked from the starting node to the destination node are traced to accumulate the link cost, thereby minimizing the accumulated link cost. Search and guide the route. That is, in FIG. 6, when a route search is performed with the departure point as the node AX and the destination as the node CY, the road travels from the node AX to the road A, turns right at the second intersection, enters the road C, and reaches the node CY. The link cost is accumulated sequentially. Then, a route that minimizes the cumulative link cost is searched for and guided.

  Although other routes from the node AX to the node CY are not shown in FIG. 6, there are actually other such routes, so that a plurality of routes that can be reached from the node AX to the node CY are displayed. A search is performed in the same manner, and a route with the lowest link cost is determined as the optimum route. This method is performed by, for example, a known method called the Dijkstra method.

  On the other hand, the traffic network data (DB2) for route search of transportation facilities is configured as follows. For example, as shown in FIG. 7, in the case of traffic routes A, B, and C, each station (each airport on an aircraft route) provided on each traffic route A, B, and C is used as a node, and the nodes are connected. A section is represented by a directional link, and node data (latitude / longitude) and link data (link number) are network data. In FIG. 7, Nn (◯ mark) and Nm (◎ mark) indicate nodes, Nm (◎ mark) indicates a transit point (such as a transfer station) on a traffic route, and a directional link connecting each node. It is indicated by an arrow line (solid line, dotted line, two-dot chain line). As links, there are links facing in the upward and downward directions of the traffic route. In FIG. 7, only the links in the direction of the arrows are shown for the sake of simplicity.

  However, the traffic network basically has a different link cost compared to the road network. In other words, in the road network, the link cost is fixed and static. However, in the traffic network, as shown in FIG. 7, trains and airplanes (hereinafter referred to as individual trains and airplanes) that operate traffic routes are used. A plurality of means of transportation). The time of departure from one node and the time of arrival at the next node are determined for each means of transportation (specified by timetable data and operation data), and individual routes do not necessarily link to adjacent nodes. There is a case. This is the case, for example, with express trains and trains that stop at each station. In such a case, a plurality of different links exist on the same traffic route, and the required time between nodes may differ depending on the transportation means.

  In the transportation network illustrated in FIG. 7, a plurality of transportation means (routes) Aa to Ac... Exist on the same link of the transportation route A, and a plurality of transportation means (routes) Ca to Cc. Will do. Therefore, in the transportation operation network, each node, link, and link cost data has a data amount proportional to the total number of transportation means (routes such as individual airplanes and trains).

  In order to search for a route from a certain departure point to a certain destination using such traffic network data, all the means of transportation that can be used (ride) when arriving from the departure point to the destination are searched. It is necessary to specify the means of transportation that matches the search conditions.

  For example, in FIG. 7, when performing a route search with the departure point as a node AX of the traffic route A and specifying a certain departure time and using the node CY of the traffic route C as the destination, the route operates on the traffic route A. Of the transportation means Aa to Ac..., All transportation means after the departure time are sequentially selected as the departure route. Based on the arrival time at the transit node on the transit route C, among all the transit means Ca to Cc... Operating on the transit route C, all combinations of transit means after the time that can be boarded at the transit node. The total time required for each route, the number of transfers, and the like are guided.

  Here, since the fishing grounds OP1 to OP4 are geographical specific positions represented by latitude and longitude as position information, they can be nodes of destinations having position information. This node is called a destination node. Moreover, since the recommended time zones suitable for fishing at the fishing spots OP1 to OP4 are time periods having different start times and end times, the fishing event is the target virtual node, and the destination node and the target virtual node Connect with a virtual link.

  The destination virtual node setting means 371 creates a destination node, a destination virtual node, and a destination virtual link in advance as network data for route search for a fishing event, as will be described later. It is connected to the network data of the route search network database at the time of route search using fishing as an event.

The purpose virtual link, the train departure time of the start time and end time of the recommended time zone in the traffic network, to resemble the arrival time, the start time of the recommended time zone, the destination node the departure departure time, the recommended time zone This is a link in which the end time is the arrival time at the destination virtual node. When the destination virtual node is selected for the route search, the destination virtual link setting means 372 extracts the time of the day from the tide table or time data stored in the event data database 36, and sets the start time of the recommended time zone, The departure time leaving the destination node and the end time of the recommended time zone are set to the arrival time arriving at the destination virtual node, and the network data editing means 37 sets the destination virtual link and the destination virtual node in the route search network database 35. Connect to network data to search for routes.

  The route search is performed in the following procedure. First, a route search is performed as a link with a link cost of 0, which uses the departure time and arrival time of the destination virtual link as the end time of the recommended time zone at the destination node to which the destination virtual link is connected. As a result, a destination virtual node whose arrival time from the departure point to the destination node is in time for the end time of the recommended time zone is searched for as the first route. Next, the estimated arrival time at the destination node in the searched first route is replaced with the departure time of the destination virtual link, and the stay time at the destination node is calculated from the difference from the arrival time of the destination virtual link. Thereby, in the destination node, it is possible to guide the stay time during which fishing can be performed within the recommended time zone. The replacement of the departure time of the target virtual link here is for calculating the staying time, and the time data of the target virtual link in the route search network data created in advance for the fishing event is temporarily stored. This is a process that replaces automatically, and includes a process that directly calculates the stay time.

  Next, in order to guide the destination node with the longest stay time, the alternative route search control means 33 removes the destination virtual link used in the first route from the route search network data, and The search procedure is repeated, and the procedure for obtaining a route search result is repeated when the calculated stay time is longer than the first route. As a result, it is possible to guide a route having the destination node that can take the longest stay time within the recommended time zone within the destination node as the destination.

  This concept is shown in FIG. Fishing grounds OP1 to OP4 indicate the fishing grounds shown in FIG. The fishing spots OP1 to OP4 are set as destination nodes in the route search network data. From each destination node, a fish that is an object of fishing as an event is set as a destination virtual node, and the destination nodes OP1 to OP4 are connected by destination virtual links L-1A to L-4C. If the destination node and the destination virtual node are connected by the destination virtual link in this way, it is not necessary to search for a route for all fishing grounds (destination nodes), and an efficient route search is possible. become.

  Here, as shown in FIG. 5, at each fishing spot OP1 to OP4, there are two times in a day to visit, so two destination virtual links connected to the destination node are set, and this is changed to each fishing spot. Connect to each of OP1 to OP4, and generate network data with the end time of each time as the departure time and arrival time of each target virtual link. FIG. 9 is a schematic diagram showing two destination virtual links connected from the destination virtual node of fish A to the destination node OP1.

  As shown in FIG. 9, a fishing ground OP1 (destination node) and a destination virtual node (fish A) are connected by a destination virtual link L-1A-1 and a destination virtual link L-1A-2. Since the timing at the fishing spot OP1 is the time zone shown in FIG. 5 (start time 23:20, end time 3:00), the destination virtual link L-1A-1 indicates the departure time and arrival time of the destination virtual node. This is a link with a match end time (3:00).

Similarly, since the other destination virtual link L-1A-2 is the second time zone (start time 12:55, end time 16:40, the destination virtual link L-1A-2 This is a link with the departure time and arrival time of the virtual node as the end time (16:40) of time.The purpose virtual links L-1A-1, L-1A-2 and the destination virtual node (fish A) Connect to the ground node OP1 and connect to the route search network data to perform a route search with the destination virtual node as the destination.
This means that the fish (target virtual node) is connected from each fishing ground (destination node) by a link having a link cost value of “0”. Here, the link costs of the links from the fishing spots OP 1 to OP 4 to the target virtual nodes A to C need only be logically equal, and need not necessarily be “0”.

  By the way, a category virtual node may also be given to a category indicating characteristics of fish to be fished, and a category virtual link may be connected from a fish belonging to each category (target virtual node) to a category virtual node corresponding to the category. . The reason for doing this is because the characteristics such as the season differ depending on the type of fish. For example, fishing time and fishing ground are different for each fish. For example, there are fish such as the season when the season is winter and the season when the season is summer. Some fish prefer the topography where the seabed is sandy, while others prefer the topography where the seabed is rocky. Some fish are active during the day and some are active at night or at dawn.

  If the purpose can be set by using such a category representing fish characteristics as a virtual node, the purpose setting and route search according to the fish characteristics can be performed appropriately and efficiently. Therefore, in this embodiment, for example, as shown in FIG. 8, the month in which the event is to be executed is prepared as a category C1 “Moon is seasoned fish” by gathering particularly fish in season. To do. When fish A corresponds to this, the category virtual link L-AC1 is connected from the target virtual node of fish A to the category virtual node of category C1. This is also a one-way link to the category, and the link cost of this part is determined to be a cost of 0 or a constant value so that there is no difference.

  As shown in FIG. 8, there are various fish such as fish A, fish B, and fish C, which are selected by the user of the portable terminal device 20 as fishing targets, and category C1 is selected according to the characteristics of each fish. And C2 and connected by category virtual links. Fishing locations OP1 to OP4 that are destinations are the fishing locations illustrated in FIG. Then, the destination nodes are fishing grounds OP1 to OP4, the fish A to fish C that are the objects of fishing as an event are the destination virtual nodes, and the destination virtual links L-1A to the destination virtual nodes are connected to each destination node. Connect with L4C.

  In FIG. 8, the reason why the destination virtual links are not connected to all combinations of the fishing grounds OP1 to OP4 as the destination nodes and the fishes A to C as the destination virtual nodes is as follows. This is because the suitable fishing spot is different. Referring to FIG. 8, when fish C is the destination virtual node, the destination virtual link L-1C is connected to the destination node OP1, and the destination virtual link L-4C is connected to the destination node OP4. As described above, the target virtual link connecting the destination node and the target virtual node for each fish category can be narrowed down to only necessary ones, and the route search process can be efficiently advanced.

  Returning to the conceptual diagram of the destination node shown in FIG. 3 again, a specific example of the route search according to the present embodiment will be described. In this embodiment, the route search is performed when fishing is performed at some fishing spot with the current location S as the departure location ST. If the location of the current location S is acquired by GPS or the like and the fish to be fished is fish C, the fishing grounds OP1 to OP4 are not set for the purpose as in general route search, and the object to be fished (fish C ) Is set as the target virtual node and a route search is performed. Here, the current location S is set to Tokyo and Kanda. Further, as a route search condition, it is assumed that the present location S departs at time 13:00 and heads for the destination by car.

  First, as shown in FIG. 8, since the links connected to the target virtual node fish C are L-1C and L-4C (shown by solid lines), the object having position information on the route search is used. The destination, that is, the destination node, is the fishing ground OP1 where the destination virtual node C and the destination virtual link L-1C are connected, and Cape Manazuru of the destination virtual node C and the destination virtual link L-4C fishing ground OP4.

  In the case of a general route search system, the optimum route to the fishing locations OP1 and OP4, which are destinations, is searched with reference to road network data. For example, if the required time from the current location S (departure point ST) to the fishing spot OP1 is 2 hours and 2 minutes and the required time from the current location S to the fishing spot OP4 is 2 hours and 17 minutes, the shortest route is the fishing spot OP1 with a short required time. No Naka will be guided.

  On the other hand, in the route search system 10 according to the present embodiment, the destination virtual nodes (fish C) connected to the road network at the destination nodes (OP1, OP4) by the destination virtual links L-1C, 1-4C. ) Is added, and a route search with the destination virtual node (fish C) as the destination is performed. Destination virtual links L-1C and L-4C each having a required time of 0 (departure time and arrival time being the end time) are connected from the fishing grounds OP1 and OP4 to the destination virtual node (fish C). ing.

  Since the required time from the departure place ST to the fishing spot OP1 (destination node) is 2 hours and 2 minutes, it can be seen that the estimated arrival time at the fishing spot OP1 is 15:02. Referring to the event data (recommended time zone data) shown in FIG. 5, since the timing end time of fishing ground OP1 is 16:40, it can be seen that this estimated arrival time is in time for the timing end time. Let the route be the first route. If the time end time is not met, this route search result is not displayed. Then, a route to another destination node in time for the time end time is searched.

  Next, the estimated arrival time of the first route to the fishing spot OP1 searched as described above is compared with the time start time of the fishing spot OP1. Since the timing start time of fishing ground OP1 is 12:55, it can be seen that 15:02 of the estimated arrival time is after the timing start time. In this case, the departure time of the destination virtual link L-1C set from the fishing spot OP1 (destination node) to the destination virtual node (fish C) is replaced with 15:02 which is the expected arrival time.

  Then, the timetable set for the destination virtual link L-1C is set to start at 15:02 and arrive at 16:40. Between this departure time (15:02) and arrival time (16:40), that is, the required time 1:38 of the target virtual link L-1C, fishing can be performed between the time of arrival at the fishing spot OP1. It will be time. This is because the departure time 15:02 is the expected arrival time at the fishing spot OP1, and the arrival time 16:40 is the end time for the fishing spot OP1.

  On the other hand, when the estimated arrival time at the fishing spot OP1 is earlier than the time start time, the departure time of the time target virtual link L-1C is replaced with the time start time (15:01) at the fishing spot OP1. . Fishing can be started even if it is not in time if it has arrived at the fishing spot, so the user is notified of the arrival time, the time in time, and the like together with the expected arrival time.

  The first route searched in this way is a route that allows fishing even when there is even a little in the time zone when arriving at the fishing ground the earliest when performing a fishing event for the fish C. It means that. The route search result obtained in this way is defined as a first route search result (first route).

  Next, the destination virtual link L-1C corresponding to the first route search result is removed from the route search network, and the route search is performed again. When the stay time within the time zone (fishing time within the time range) is obtained, the stay time is compared with the first route search result. If the time that can be fished during the time is longer than the result of the first route search, this means that the arrival time is late but the time that can be fished during the time is long, so this Displayed as the second route search result (second route).

  FIG. 10 shows a comparison table between the first route and the second route described above. As shown in FIG. 10, the first route search result is a route having the fishing spot OP1 as the destination node, and the time (recommended time zone) at the fishing spot OP as the destination node is 12:55 to 16:40. is there. The estimated arrival time at the fishing spot OP1 is 15:02, and the fishing time (event execution time) within the time (recommended time) range is 1:38.

  On the other hand, the second route search result is a route having the fishing spot OP4 as the destination node, and the time (recommended time zone) at the fishing spot OP as the destination node is 14:01 to 17:52. The estimated arrival time at the fishing spot OP4 is 15:17, and the fishing time (event execution time) within the range of time (recommended time zone) is 2:35.

  As can be seen from this result, in the second route search result in which the destination is the fishing spot OP4, the time for fishing in the time is 2:35 from the time point of the fishing spot OP4. It can be seen that fishing can be performed within the recommended time zone 57 minutes longer than the search result. Therefore, users who can arrive before the end time of the time and can stay for a longer time within the recommended time (time) range (can perform fishing as an event) are used by the user. Can be guided to.

  In the second route search result, if the time during which fishing is possible is shorter than the first route search result, the result of this route search is not displayed. Then, the target virtual link L4-C used in this route search is removed and the route search is performed again. This route search is repeated, and if there is no link reaching the target destination virtual node (fish C), the route search ends. Alternatively, the route search may be terminated when a predetermined number of route search results to be displayed are obtained.

  In the second route, when the arrival time at the fishing spot OP4 is before the start time of the recommended time zone (time), the time start time is also guided. Fishing can be started even if it is not in time if it has arrived at the fishing spot, so the user is notified of the arrival time, the time in time, and the like together with the expected arrival time.

  In the above example, the example in which the link cost of the target virtual link is set to “0” (example in which the end time of the time is the departure time and the arrival time of the link) has been described. The staying time for fishing during the time desired by the user may be set in advance as the link cost. In this case, since the time information of the end of time is set for each destination virtual node connected to the fishing ground that is the destination node, the time obtained by subtracting the time desired by the user is set as the departure time of the destination virtual node. And the time end time may be set as the arrival time.

  According to the time condition of the destination virtual link set in this way, a route search in time for the departure time may be performed as the time condition from the fishing spot (destination node) to the destination virtual node. As a result of this route search, the predicted arrival time at the fishing spot (destination node) is rewritten to the departure time of the destination virtual link connecting the destination virtual node from the fishing spot. The required time of the target virtual link obtained from here can be displayed as the stay time during which the user can fish at the fishing spot.

  The procedure of the route search process according to the present embodiment described above will be described with reference to the flowcharts shown in FIGS. FIG. 11 is a flowchart showing a procedure for searching for a route that can reach the destination in the recommended time zone and can execute the event within the recommended time zone, and FIG. 12 arrives at the destination in the recommended time zone. It is a flowchart which shows the procedure which searches for the path | route which can be performed for the longest within the range of a recommendation time slot | zone which is possible.

  First, the portable terminal device 20 selects a fish (for example, fish C in FIG. 8) to be a fishing target as an event in step S101. When the route search server 30 receives the information of the fish C to be fished from the portable terminal device 20, the target virtual node (fish C) is specified, and in step S102, the target virtual link setting means 372 is the event data database. With reference to the tide table or time data stored in 36, the departure time and the target time of each target virtual link are set to the time end time at the destination node to which the target virtual link is connected (FIG. 9). reference).

  The network data editing unit 37 connects the target virtual node and the target virtual link set by the target virtual link setting unit 372 as described above to the route search network database 35 (step S103). Next, the route search means 39 performs a route search for the target virtual node in the process of step S104, and when the route search result is obtained, calculates the estimated arrival time at the destination node (see FIG. 10). .

  Next, in step S105, the route search means 39 compares the estimated arrival time at the destination node with the departure time of the destination virtual link connecting the destination node and the destination virtual node, and the estimated arrival time is determined from the departure time. Determine whether it is before. When the determination result is “YES”, it can be seen that the arrival at the destination node is before the end of the time, so that the time is within the recommended time zone of the destination. In that case, the process proceeds to step S106, and the stay time calculation means 373 replaces the departure time of the destination virtual link with the estimated arrival time at the destination node, and calculates the time between the departure time and the arrival time of the destination virtual link. Calculated as stay time. This stay time indicates a time during which a fishing event can be executed within a time zone that is a recommended time zone at the destination node.

  The route search means 39 uses this route as the first route search result in the processing of step S107, guides the first route search result in the processing of step S108, and ends the processing. As shown in FIG. 10, the contents of the guidance include the estimated arrival time, time and stay time at the destination node (fishing time within the time range) as well as the guide route from the departure point to the destination. Etc.

  On the other hand, if the determination result in the determination process of step S105 is “NO”, the arrival at the destination node is after the end of the time, so that it is not in time for the time that is the recommended time zone of the destination. Therefore, it cannot be a recommended route. Therefore, the route search means 39 proceeds to step S109, searches for other candidate routes, and if there are other candidate routes, returns to the determination processing of step S105. If there is no other candidate route, the route search is terminated with no corresponding route.

  A route (first route) that can arrive at the destination node before the end of the time is searched by the processing of FIG. However, this first route is the route that can arrive at the destination node before the end of the recommended time zone and can reach the earliest and can fish in the time zone, but it is the most within the range of the recommended time zone. It is not always a long-fishing route. In order to search for such a destination node, the process shown in FIG. 12 is performed following the process of FIG.

  First, the network data editing means 37 removes the target virtual link used when obtaining the first route search result searched in the process of FIG. 11 from the network data connection of the route search network database 35 (step S201). Thereafter, the route search means 39 performs a route search with the destination virtual node as the destination, obtains the second route, and calculates the estimated arrival time at the destination node in the second route (step S202).

  Next, in step S203, the route search means 39 compares the estimated arrival time at the destination node with the departure time of the destination virtual link connecting the destination node and the destination virtual node, and the estimated arrival time is determined as the departure time. Determine whether it is earlier. When the determination result is “YES”, it can be seen that the arrival at the destination node is before the end of the time, so that the time is within the recommended time zone of the destination. In this case, the process proceeds to step S204, where the stay time calculation means 373 replaces the departure time of the destination virtual link with the estimated arrival time at the destination node, and calculates the time between the departure time and the arrival time of the destination virtual link. Calculated as stay time.

  In the determination process of step S205, the route search means 39 determines whether the stay time is longer (longer) than the stay time of the first route. When the determination result is “YES”, the stay time of the current route is longer than the stay time of the first route, the first route is discarded or saved, and a new second route is selected as the route search result. . In step S207, the second route is guided as a search result, and the process ends.

  If the determination result in step S203 is “NO”, or if the determination result in step S205 is “NO”, the process in the route search means 39 proceeds to step S208. Whether there is a candidate route is searched, and if there are other candidate routes, the process returns to the determination processing in step S203. If there is no other candidate route, the route search is terminated with no corresponding route.

  If, in the route search result, the estimated arrival time at the destination node is before the time start time, the time start time may be displayed as the route search result. According to such a route search, a fishing spot that can secure time for fishing during the time desired by the user can be displayed as a route search result. If there is no fishing spot that can arrive at a time at which fishing can be ensured during the time desired by the user, a message to that effect is displayed. Here, it is assumed that the time during which fishing is possible can be set only at the upper limit of the time zone of time.

  11 and the procedure of FIG. 12, “Arrival early and start fishing early, but the optimal time zone for fishing is short” and “Late arrival and fishing start time is delayed However, it is possible to guide the user on the two route search results of the fishing spot, which is the best time zone for fishing.

  In the procedure shown in FIG. 12, the second route is guided as a route search result when the stay time in the second route is longer than the stay time in the recommended time zone at the destination node in the first route. If the same procedure as in FIG. 11 and FIG. 12 is repeated for a predetermined number of target virtual nodes and target virtual links, the route search process is terminated, and the route data obtained during that time is saved. In addition, the candidate routes may be guided in descending order of stay time. In addition, when all the routes using the destination virtual link connected to the destination virtual node are searched, the route search process is terminated, and the route data obtained during that time is searched in order of arrival time at the destination node or destination node. You may make it sort and guide in order with the long stay time in.

  As described above in detail, according to the route search system according to the present invention, the optimum time zone for fishing differs depending on the place and place, such as fishing, and the time zone for further fishing. When there is no need to be from the beginning to the end, prepare a destination virtual node set for the fish and a link from the fishing ground that is the destination node to the destination virtual node (target virtual link), and go to the destination node In addition to the shortest route required, it is possible to search for a route for a destination node that can stay longer in a time zone optimal for fishing at the destination node.

  The present invention can execute a homogeneous event at a plurality of locations, but when executing an event having a different time zone or duration suitable for the execution of the event depending on the location, a time suitable for the event execution The present invention can be applied to a case where a place that can reach the belt or a place that can reach the belt and can stay for a longer duration is extracted and a guide route to the place is searched.

1 is a system configuration diagram illustrating a configuration of a route search system according to an embodiment of the present invention. It is a block diagram which shows the detailed structure of the route search system concerning the Example of this invention. It is a schematic diagram which shows the several destination (fishing field) in the case of performing fishing as an event. It is a figure which shows an example of the event data accumulate | stored in an event data database, and is a figure which shows the tide data in each fishing ground. It is a figure which shows an example of the event data accumulate | stored in an event data database, and is a figure which shows the data of the recommended time slot | zone (time) in each fishing spot. It is a schematic diagram which shows the concept of the data of a road network. It is a schematic diagram which shows the concept of the data of a traffic network. FIG. 4 is a schematic diagram for explaining a concept of connecting each fishing ground shown in FIG. 3 as a destination node and connecting a fish, which is an object of execution of fishing as an event, as a virtual destination node by a destination virtual link. It is a figure for demonstrating the destination virtual link which connects the destination node and the destination virtual node. It is a figure for demonstrating the result of the route search by the route search system concerning the Example of this invention. 6 is a flowchart showing a procedure for searching for a route that can reach a destination in a recommended time zone, is within the recommended time zone, and can execute an event in the route search system according to the embodiment of the present invention. 7 is a flowchart illustrating a procedure for searching for a route that can reach a destination in a recommended time zone and that can execute an event for the longest time within the recommended time zone in the route search system according to the embodiment of the present invention. It is a figure which shows the concept of the route search for participating in one of the homogeneous events held in several different places.

Explanation of symbols

DESCRIPTION OF SYMBOLS 10 ... Route search system 12 ... Network 20 ... Mobile terminal device 201 ... Control means 21 ... Communication means 22 ... GPS reception means 23 ... Processing request Means 24 ... Distribution data storage means 25 ... Display means 26 ... Operation input means 261 ... Target event setting means 30 ... Route search server 301 ... Control means 31 ... ··· Communication means 32 ··· Distribution data editing means 33 ··· Alternative route search control means 34 ··· Map database 35 ··· Network database 36 for route search ··· Event data database 37 ··· ... Network data editing means 371 ... Target virtual node setting means 372 ... Target virtual link setting means 373 ... Stay time calculation means 38 ... Process request憶 means 39 ... route search means

Claims (18)

A route search system for setting a desired departure point and searching for a route to the plurality of destinations that execute a plurality of destinations and an event that is preferably executed at a plurality of recommended time zones different for each destination. There,
The route search system includes a route search network database storing route search network data for searching a route, a route search means, a network data editing means, and an event storing data related to a recommended time zone of the event. A data database and a network in which each of the plurality of destinations is a destination node having position information, a target for executing the event is a destination virtual node, and the destination virtual node and the destination node are connected by a destination virtual link. A destination virtual node setting means to generate, a destination virtual link setting means, and a stay time calculating means,
When the destination virtual node is selected, the destination virtual link setting means extracts a recommended time zone at the destination node to which the destination virtual node is connected with reference to the event data database, and the destination virtual link is connected. that the departure time and the arrival time to the destination virtual node of the destination node, set using the end time of the recommended time zone at the destination node of the target virtual link is connected,
The network data editing means connects a destination virtual node connected to the destination virtual link set by the destination virtual link setting means to the network data for route search.
The route search means searches for an optimum route from the departure place to the destination virtual node, calculates an estimated arrival time at the destination node,
The stay time calculating means replaces the departure time of the destination virtual link with the expected arrival time, and sets the time between the departure time and the arrival time set by the destination virtual link setting means to stay at the destination node. A route search system characterized in that it calculates as time and guides the estimated arrival time and stay time together with the route to the destination. A route search system for setting a desired departure point and searching for a route to the plurality of destinations that execute a plurality of destinations and an event that is preferably executed at a plurality of recommended time zones different for each destination. There,
The route search system includes a route search network database storing route search network data for searching a route, a route search means, a network data editing means, and an event storing data related to a recommended time zone of the event. A data database and a network in which each of the plurality of destinations is a destination node having position information, a target for executing the event is a destination virtual node, and the destination virtual node and the destination node are connected by a destination virtual link. A destination virtual node setting means to generate, a destination virtual link setting means, and a stay time calculating means,
When the destination virtual node is selected, the destination virtual link setting means extracts a recommended time zone at the destination node to which the destination virtual node is connected with reference to the event data database, and the destination virtual link is connected. that the departure time and the arrival time to the destination virtual node of the destination node, set using the end time of the recommended time zone at the destination node of the target virtual link is connected,
The network data editing means connects a destination virtual node connected to the destination virtual link set by the destination virtual link setting means to the network data for route search.
The route search means searches for an optimum route from the departure place to the destination virtual node, calculates an estimated arrival time at the destination node,
The stay time calculating means replaces the departure time of the destination virtual link with the expected arrival time, and sets the time between the departure time and the arrival time set by the destination virtual link setting means to stay at the destination node. Calculated as time as the first route search result,
The network data editing means excludes the target virtual link used when obtaining the first route search result from the route search network data,
The route search means searches for the optimum route to the remaining destination virtual node using the route search network data from which the destination virtual link is excluded by the network data editing means as a second route, and the stay time calculation means Is compared with the stay time of the first route search result, and when the stay time of the second route is longer than the stay time of the first route search result, the second route is A route search system characterized by guiding as a route search result.   The target virtual node is connected to a category virtual node that does not have position information according to the type of target target that executes the event, and a link cost with a constant cost is set between the category virtual node and the target virtual node. The route search system according to claim 1, wherein a route search is performed using the category virtual node as a destination.   When the estimated arrival time at the destination is before the start time of the recommended time zone at the destination node, the stay time calculating means determines the departure time set for the destination virtual link as the recommended time. The time of the time zone is replaced, and the time between the departure time and the arrival time set by the destination virtual link setting means is calculated as a stay time at the destination node. Item 3. The route search system according to Item 2. The route search system comprises display means for displaying a route to the route search means has searched, if the display route search results to display unit becomes a predetermined number, said route search means ends the process of the route search The route search system according to claim 2, wherein: The route search processing is repeatedly performed when the route search using the target virtual link connected to the target virtual node is repeated, and when there is no link reaching the target destination virtual node. The described route search system. A route search server that searches for routes to a plurality of destinations by setting desired departure points and executing events that are preferably executed at a plurality of destinations and a plurality of recommended time zones that differ for each destination. There,
The route search server includes a route search network database storing route search network data for searching a route, a route search means, a network data editing means, and an event storing data related to the recommended time zone of the event. A data database and a network in which each of the plurality of destinations is a destination node having position information, a target for executing the event is a destination virtual node, and the destination virtual node and the destination node are connected by a destination virtual link. A destination virtual node setting means to generate, a destination virtual link setting means, and a stay time calculating means,
When the destination virtual node is selected, the destination virtual link setting means extracts a recommended time zone at the destination node to which the destination virtual node is connected with reference to the event data database, and the destination virtual link is connected. that the departure time and the arrival time to the destination virtual node of the destination node, set using the end time of the recommended time zone at the destination node of the target virtual link is connected,
The network data editing means connects a destination virtual node connected to the destination virtual link set by the destination virtual link setting means to the network data for route search.
The route search means searches for an optimum route from the departure place to the destination virtual node, calculates an estimated arrival time at the destination node,
The stay time calculating means replaces the departure time of the destination virtual link with the expected arrival time, and sets the time between the departure time and the arrival time set by the destination virtual link setting means to stay at the destination node. A route search server that calculates time and guides an estimated arrival time and a stay time together with a route to the destination. A route search server that searches for routes to a plurality of destinations by setting desired departure points and executing events that are preferably executed at a plurality of destinations and a plurality of recommended time zones that differ for each destination. There,
The route search server includes a route search network database storing route search network data for searching a route, a route search means, a network data editing means, and an event storing data related to the recommended time zone of the event. A data database and a network in which each of the plurality of destinations is a destination node having position information, a target for executing the event is a destination virtual node, and the destination virtual node and the destination node are connected by a destination virtual link. A destination virtual node setting means to generate, a destination virtual link setting means, and a stay time calculating means,
When the destination virtual node is selected, the destination virtual link setting means extracts a recommended time zone at the destination node to which the destination virtual node is connected with reference to the event data database, and the destination virtual link is connected. that the departure time and the arrival time to the destination virtual node of the destination node, set using the end time of the recommended time zone at the destination node of the target virtual link is connected,
The network data editing means connects a destination virtual node connected to the destination virtual link set by the destination virtual link setting means to the network data for route search.
The route search means searches for an optimum route from the departure place to the destination virtual node, calculates an estimated arrival time at the destination node,
The stay time calculating means replaces the departure time of the destination virtual link with the expected arrival time, and sets the time between the departure time and the arrival time set by the destination virtual link setting means to stay at the destination node. Calculated as time as the first route search result,
The network data editing means excludes the target virtual link used when obtaining the first route search result from the route search network data,
The route search means searches for the optimum route to the remaining destination virtual node using the route search network data from which the destination virtual link is excluded by the network data editing means as a second route, and the stay time calculation means Is compared with the stay time of the first route search result, and when the stay time of the second route is longer than the stay time of the first route search result, the second route is A route search server characterized by guiding as a route search result.   The target virtual node is connected to a category virtual node that does not have position information according to the type of target target that executes the event, and a link cost with a constant cost is set between the category virtual node and the target virtual node. The route search server according to claim 7, wherein the route search server is connected by a link having a category and searches for a route with the category virtual node as a destination.   When the estimated arrival time at the destination is before the start time of the recommended time zone at the destination node, the stay time calculating means determines the departure time set for the destination virtual link as the recommended time. 8. A time zone start time is substituted, and a time between the departure time and the arrival time set by the destination virtual link setting means is calculated as a stay time at the destination node. Item 9. The route search server according to Item 8. The route search system comprises display means for displaying a route to the route search means has searched, if the display route search results to display unit becomes a predetermined number, said route search means ends the process of the route search The route search server according to claim 8. 9. The route search process is repeatedly performed when a route search using a target virtual link connected to the target virtual node is repeated, and when there is no link reaching the target virtual node , the route search processing is terminated. The described route search server. In a route search server for setting a desired departure point and searching for a route to the plurality of destinations that execute a plurality of destinations and an event that is preferably executed in a plurality of recommended time zones different for each destination A route search method,
The route search server includes a route search network database storing route search network data for searching a route, a route search means, a network data editing means, and an event storing data related to the recommended time zone of the event. A data database and a network in which each of the plurality of destinations is a destination node having position information, a target for executing the event is a destination virtual node, and the destination virtual node and the destination node are connected by a destination virtual link. A destination virtual node setting means to generate, a destination virtual link setting means, and a stay time calculating means,
When the destination virtual node is selected, the destination virtual link setting means extracts a recommended time zone at the destination node to which the destination virtual node is connected with reference to the event data database, and the destination virtual link is connected. comprising the steps of: the departure time and the arrival time to the destination virtual node of the destination node, set by using the ending time of the recommended time zone at the destination node of the target virtual link is connected to that,
The network data editing means connecting a destination virtual node connected to the destination virtual link set by the destination virtual link setting means to the network data for route search;
The route search means searches for an optimum route from the departure place to the destination virtual node, and calculates an expected arrival time at the destination node;
The stay time calculating means replaces the departure time of the destination virtual link with the expected arrival time, and sets the time between the departure time and the arrival time set by the destination virtual link setting means to stay at the destination node. Calculating a time, and guiding a predicted arrival time and a stay time together with a route to the destination. In a route search server for setting a desired departure point and searching for a route to the plurality of destinations that execute a plurality of destinations and an event that is preferably executed in a plurality of recommended time zones different for each destination A route search method,
The route search server includes a route search network database storing route search network data for searching a route, a route search means, a network data editing means, and an event storing data related to the recommended time zone of the event. A data database and a network in which each of the plurality of destinations is a destination node having position information, a target for executing the event is a destination virtual node, and the destination virtual node and the destination node are connected by a destination virtual link. A destination virtual node setting means to generate, a destination virtual link setting means, and a stay time calculating means,
When the destination virtual node is selected, the destination virtual link setting means extracts a recommended time zone at the destination node to which the destination virtual node is connected with reference to the event data database, and the destination virtual link is connected. comprising the steps of: the departure time and the arrival time to the destination virtual node of the destination node, set by using the ending time of the recommended time zone at the destination node of the target virtual link is connected to that,
The network data editing means connecting a destination virtual node connected to the destination virtual link set by the destination virtual link setting means to the network data for route search;
The route search means searches for an optimum route from the departure place to the destination virtual node, and calculates an expected arrival time at the destination node;
The stay time calculating means replaces the departure time of the destination virtual link with the expected arrival time, and sets the time between the departure time and the arrival time set by the destination virtual link setting means to stay at the destination node. Calculating the time as a first route search result;
The network data editing means, excluding the target virtual link used when obtaining the first route search result from the route search network data;
The route search means searches for the optimum route to the remaining destination virtual node using the route search network data from which the destination virtual link is excluded by the network data editing means as a second route, and the stay time calculation means Is compared with the stay time of the first route search result, and when the stay time of the second route is longer than the stay time of the first route search result, the second route is And a step of guiding as a route search result.   The target virtual node is connected to a category virtual node that does not have position information according to the type of target target that executes the event, and a link cost with a constant cost is set between the category virtual node and the target virtual node. The route search method according to claim 13 or 14, wherein a route search is performed using the category virtual node as a destination.   When the estimated arrival time at the destination is before the start time of the recommended time zone at the destination node, the stay time calculating means determines the departure time set for the destination virtual link as the recommended time. The time between the departure time and the arrival time set by the destination virtual link setting means is calculated as the staying time at the destination node by replacing with the start time of the time zone. Item 15. A route search method according to Item 14. The route search system comprises display means for displaying a route to the route search means has searched, if the display route search results to display unit becomes a predetermined number, said route search means ends the process of the route search The route search method according to claim 14, wherein: 15. The route search process is repeatedly performed when a route search using a destination virtual link connected to the destination virtual node is repeated, and when there is no link reaching the destination destination virtual node. The described route search method.

Images