JP2009047502A - Route search system, route search server, terminal device, and route search method - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To guide a route for participating efficiently in two or more of events having the same quality which is held at a plurality of places, in a plurality of time zones. <P>SOLUTION: A route search system 10 has network data 35 for route search, a route search means 33, an event participation plan sequence generating means 331, and event data 39 having a place to be held and the holding time of each event. When it is connected to the network data 35 for the route search as the place to be held of the event having positional information and an event virtual node connected to the holding place and which does not have positional information, with the desired spot set as the starting place, and route search is requested by designating a plurality of specific events, the event participation plan sequence generating means 331 generates the participation plan sequence of designated events, and the route search means 33 uses the desired spot as the starting place, and searches for the guide route, by using each pertinent event virtual node successively as a destination in accordance with the sequence generated by the event participation plan sequence generating means 331. <P>COPYRIGHT: (C)2009,JPO&INPIT

Description

In the present invention, for example, when events of the same quality are held in a plurality of places and a plurality of time zones, such as movie screening, at least of the above-mentioned multi-events using walking and transportation. The present invention relates to a route search system that searches for a guide route such as an optimum route or a candidate route for participating in two or more.
In the route search system as described above, the present invention provides an event venue node in which each event is held as an event venue node having position information, and an event is an event virtual node having no location information. The event venue node and the event virtual node are connected by a link based on the event holding time, and a route search from a desired departure place is requested by specifying a plurality of specific events from the event. In this case, a participation plan permutation of the corresponding event is created, and a guide route is searched with the corresponding event virtual node as a destination in accordance with the permutation, and the route search is performed to guide the corresponding event and the place of the event. It is about the system.

  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. It has a time database and data that makes the traffic network a database based on this. 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) or a domain name for specifying a location where information to be downloaded exists is input to the terminal device and specified by the address. The information distribution server (information site) is accessed to download desired information.

  The route search data in the navigation system for route search, route guidance, etc. using the transportation means, as well as the road network data in the in-vehicle navigation system and the pedestrian navigation system, each station on the traffic route as a node, In addition to data obtained by networking stations as two-way links, 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. It is a traffic network route search method that searches 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.

  If you use a route search system that combines walking and transportation, users can walk from their desired departure location (for example, home) to the nearest nearby station and travel to the nearest station for the destination (for example, movie theater). It is possible to obtain as a guide route the result of comprehensively searching each optimum route, which moves by an institution and further moves on foot from the nearest station to the destination (cinema). By the way, when a movie theater is a destination, it is natural to watch movies.

A system that generally provides information related to events such as movies is disclosed as a “server device” in, for example, the following Patent Document 3 (Japanese Patent Laid-Open No. 2001-325514). The server device disclosed in Patent Document 3 is capable of distributing movie introduction information of a screening movie in a desired area or genre, receives area information transmitted from a mobile terminal device, and receives this area information. Is sent to the mobile terminal device.

  And the information which shows one of the movie titles of the said list information transmitted from the portable terminal device is received, and the movie introduction information of the movie of the movie title indicated by this received information is transmitted to the portable terminal device. Has been. As a result, the user can receive distribution of movie introduction information in a desired area from the server device.

  In the case of watching a movie, in the case of the latest movie just released, the same movie is shown in a plurality of movie theaters. In this case, the screening time is not the same in all movie theaters, and the upper floor time is generally different for each movie theater. Therefore, when performing a route search using a route search system with a movie theater as the destination, the user must not only specify the movie theater as the destination but also arrive at the destination with the movie start time in mind. It is necessary to request a route search on the condition of time.

JP 2001-165681 A (FIGS. 1 and 2) JP 2000-258184 A (FIGS. 4 and 7) JP 2001-325514 A (FIGS. 1 and 6)

  As described above, in the case of watching a movie, in the case of the latest movie just released, the same movie is shown in a plurality of movie theaters. In this case, the screening time is not the same in all movie theaters, and generally the screening time is different for each movie theater. Therefore, when performing a route search using a route search system with a movie theater as the destination, the user must not only specify the movie theater as the destination but also arrive at the destination with the movie start time in mind. time must request a route search condition to the server apparatus as disclosed in Patent Document 3 is intended to provide information on movies, select which cinema to watch a movie of interest There is a problem that the user has to decide what kind of route is to be taken to the movie theater.

  Further, in the route search system disclosed in Patent Document 2, an optimal route and a plurality of selectable routes that reach the node by using the physical location of the movie theater as a node and walking to the node using the transportation system can be selected. Although it is possible to search for a candidate route, there is a basic problem that a route search in consideration of the movie showing time cannot be performed. For this reason, in order to compare and examine the route to a plurality of movie theaters in the vicinity where the same movie is to be screened, it is necessary to individually search the route for each movie theater as a destination.

  When searching for a route to a movie theater using a route search system that uses both foot and transportation, the movie theater receives the guidance of the optimum route to the movie theater set as the destination as a result of the route search. Even if I go to, I often experience that the screening is already full and I can't enter. In that case, the same movie may be shown in another movie theater in the vicinity, and there may be vacant seats in that movie theater. In such a case, the route search system disclosed in Patent Document 2 has a problem in that it is necessary to set a plurality of movie theaters as destinations and search each route as described above.

  Such a problem is not limited to watching a movie, but for participating in one of the multi-events using walking and transportation when events of the same quality are held in multiple places and multiple time zones. This is a problem that commonly occurs when searching for a route. For example, there are facilities that provide services of almost the same quality at multiple locations, such as beauty salons, hospitals, restaurants, etc., and the time zone for providing services can be determined by reservation, and unreserved free time zones are stored in the database A similar problem arises in route search for receiving a service that has been realized.

  The search for the optimal route for participating in one of these events is that each event is held as an event venue node having location information, and the event is held as an event virtual node without location information. Connected to the event venue node, connected between the event venue node and the event virtual node by a link based on the event holding time, and connected to the network data for route search including the traffic network data. This can be solved by searching for a route from a desired departure place to an event virtual node to which participation is desired.

  However, some users may have a request to efficiently participate in multiple events on the same day. For example, there are a plurality of interested movie titles, and it is desired to efficiently select and watch movie theaters showing them within one day. In such a case, even if a route search as described above is performed, there is no guarantee that an efficient optimal solution will be provided.

  This is because the movie theaters to be shown for each movie title and the show time are different, and even if the movie title you want to watch at the same movie theater is shown, there is a waiting time of about 2 hours before the movie title you want to watch. This is because it may occur. If the waiting time can be reduced even after moving to another movie theater, a desired movie title can be viewed efficiently.

  In this specification, a case where events and services of the same quality are held in a plurality of places and a plurality of time zones as described above is referred to as a “multi-event”, and the present invention uses walking and transportation. The present invention provides a route search system capable of searching and guiding an optimum route, a candidate route, etc. for participating in at least two of multi-events.

  The inventor of the present application has conducted various studies in order to solve the above-described problems, and as a result, the event is held as an event venue node having position information, and the event is held as an event virtual node having no position information. Connect to the event venue node, connect the event venue node and the event virtual node with multiple links based on different event times, and specify multiple specific events from the event to make a desired departure When a route search from the ground is requested, a pertinent event participation plan permutation is created, and a guide route is searched sequentially with each event virtual node as a destination according to the permutation, and the corresponding event and the location of the event are determined. The present invention has been completed by conceiving that the above problems can be solved if guidance is provided.

  That is, the present invention easily searches for a route for efficiently participating in at least two of the same quality events held in a plurality of places and a plurality of time zones without setting a plurality of places. It is an object of the present invention to provide a route search system, a route search server, a terminal device, and a route search method that can be guided.

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 place and searching for a route for participating in a homogeneous event held at multiple locations and at multiple times,
The route search system includes route search network data for searching a route using walking and transportation, route search means, network data editing means, event data including event location and time. And event participation plan permutation creation means,
The network data editing means connects the event location to the route search network data as an event venue node having position information, registers the event as an event virtual node having no position information, Connect from the venue node to the event virtual node with multiple links based on different event times,
When a plurality of specific events are designated from the events,
The event participation plan permutation creation means creates a participation plan permutation of the designated event, and the route search means applies according to the permutation created by the event participation permutation creation means starting from a desired point. A guide route is sequentially searched using event virtual nodes as destinations, and a corresponding event and a place where the event is held are guided.

  The invention according to claim 2 of the present application is the route search system according to claim 1, wherein the route search system sorts the guide route data searched by the route search means according to the permutation according to a specified sort condition. It is characterized by guiding.

  The invention according to claim 3 of the present application is characterized in that in the route search system according to claim 1, the event venue is a movie theater, and the event is a movie title to be shown in the movie theater.

The invention according to claim 4 of the present application is
A route search server that is connected via a network to a terminal device that sets a desired departure place and searches for routes for participating in homogeneous events held at a plurality of places and a plurality of time zones,
The route search server includes route search network data for searching a route using walking and transport, route search means, network data editing means, event data including the event location and time. And event participation plan permutation creation means,
The network data editing means connects the event holding location to the route search network data as an event venue node having position information, registers the event as an event virtual node having no position information, Connect from the venue node to the event virtual node with multiple links based on different event times,
When a plurality of specific events are designated from the events,
The event participation plan permutation creation means creates a participation plan permutation of the designated event, and the route search means applies according to the permutation created by the event participation permutation creation means starting from a desired point. A route search server characterized in that a guide route is sequentially searched using event virtual nodes as destinations, and a corresponding event and a place where the event is held are guided.

  The invention according to claim 5 of the present application is the route search server according to claim 4, wherein the route search server uses the sorting condition specified by the terminal device for the data of the guide route searched by the route search means according to the permutation. It is characterized by sorting and guiding according to.

  The invention according to claim 6 of the present application is characterized in that, in the route search server according to claim 4, the event venue is a movie theater, and the event is a movie title shown in the movie theater.

The invention according to claim 7 of the present application is
A terminal device that is connected via a network to a route search server that searches for routes for participating in homogeneous events held in a plurality of places and a plurality of time zones, and sets a desired departure place,
The route search server includes route search network data for searching a route using walking and transport, route search means, network data editing means, event data including the event location and time. And event participation plan permutation creation means,
The network data editing means connects the event location to the route search network data as an event venue node having position information, registers the event as an event virtual node having no position information, Connect from the venue node to the event virtual node with multiple links based on different event times,
When a plurality of specific events are designated from the events,
The event participation plan permutation creation means creates a participation plan permutation of the designated event, and the route search means applies according to the permutation created by the event participation permutation creation means starting from a desired point. A route search server that sequentially searches for a guide route using event virtual nodes as destinations, and guides a corresponding event and a place where the event is held,
The terminal device includes means for designating at least two or more events desired to participate among the events.

The invention according to claim 8 of the present application is the terminal device according to claim 7,
The terminal device includes means for designating a sorting condition for sorting data of guide routes searched by the route search means according to the permutation.

The invention according to claim 9 of the present application is
A route search method in a route search system for setting a desired departure place and searching for a route for participating in a homogeneous event held in a plurality of places and a plurality of time zones,
The route search system includes event data including route search network data for searching a route using walking and transportation, route search means, network data editing means, event location and time. And event participation plan permutation creation means,
The network data editing means connects the event holding location to the route search network data as an event venue node having position information, registers the event as an event virtual node having no position information, Connecting from the venue node to the event virtual node with multiple links based on different event times;
When a plurality of specific events are designated from the events,
The event participation plan permutation creating means creating a participation plan permutation of the designated event;
The route search means having a desired point as a departure point, and according to the permutation created by the event participation permutation creation means, the corresponding event virtual nodes are sequentially searched for a guidance route, and a corresponding event And the location of the event is guided.

  The invention according to claim 10 of the present application is the route search method according to claim 9, wherein the route search method sorts the data of the guide route searched by the route search means according to the permutation according to a specified sort condition. And a process of guiding the user.

  According to an eleventh aspect of the present invention, in the route search method according to the ninth aspect, the event venue is a movie theater, and the event is a movie title to be screened in the movie theater.

In the invention according to claim 1, the event location is connected to the route search network data as an event venue node having position information, the event is registered as an event virtual node having no position information, When the event venue node is connected to the event virtual node by a plurality of links based on different event times, and when a plurality of specific events are designated from the events,
The event participation plan permutation creation means creates a participation plan permutation of the designated event, and the route search means starts from a desired point and corresponds to the event according to the permutation created by the event participation permutation creation means. The guide route is sequentially searched using the virtual nodes as destinations, and the corresponding event and the place where the event is held are guided.

  According to such a configuration, when events of the same quality are held in a plurality of places and a plurality of time zones, at least two or more of the multi-events as described above using walking and transportation are used. An efficient guide route for participation can be provided.

  According to a second aspect of the present invention, in the route search system according to the first aspect, the route search system converts the guidance route data searched by the route search means according to the permutation according to a sorting condition specified by the terminal device. Sort and guide.

  According to such a configuration, when events of the same quality are held in a plurality of places and a plurality of time zones, at least two or more of the multi-events as described above using walking and transportation are used. It is possible to provide an efficient guide route for participation, and a user can select a desired guide route based on a guide route according to a desired condition, for example, time, fare, etc. .

  In the invention according to claim 3, in the route search system according to claim 1, the event venue is a movie theater, and the event is a movie title to be screened in the movie theater.

  According to such a configuration, when watching a desired plurality of movies among a plurality of movie theaters and movies shown in a plurality of time zones, the plurality of movies are viewed using walking and transportation. Can provide an efficient guide route, and the user can plan to watch the desired movie efficiently and within a limited time in a movie theater.

  Further, in the inventions according to claims 4 to 6, it is possible to provide route search servers constituting the route search systems according to claims 1 to 3, respectively, and inventions according to claims 7 and 8. Can provide a terminal device constituting the route search system according to claims 1 and 2, respectively. In the inventions according to claims 9 to 11, it is possible to provide a route search method in the route search system according to claims 1 to 3, respectively.

  Hereinafter, specific examples of the present invention will be described in detail with reference to examples and drawings. However, the embodiment shown 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 the route search systems of other embodiments included in the range.

  As shown in FIG. 1, a route search system 10 according to an embodiment of the present invention includes a terminal device 20 using a portable terminal such as a mobile phone, a PDA, or a music player, and a route search server 30 including a network 12 such as the Internet. It is configured to be connected via. 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 as traffic network data, a plurality of locations, and a plurality of times. An event data database (DB3) storing data related to homogeneous events held in the belt and a database (DB4) storing map data for display are provided. Event data can be acquired from the information distribution server 50 via a network. The configuration 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. The route search system 10 according to the embodiment of the present invention includes a terminal device 20 that communicates via a network 12 such as the Internet, a route search server 30, and an information distribution server 50 as shown in the block diagram of FIG. It is configured.

  The terminal device 20 sets a route search condition 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 performs road network data 36 and traffic network data 37 according to the route search condition. The optimum route is searched with reference to the route search network data 35, and the optimum route is edited into guide route data and distributed to the terminal device 20.

  The route search server 30 includes road network data 36 including map data for route search in navigation for pedestrians and car navigation for automobiles, and traffic network data 37 for searching for route sections using transportation. Is stored in the route search network data 35 (database), and the above-described event data 39 is stored in the database.

  In the present embodiment, a movie will be described as a specific example as a homogeneous event held in a plurality of places and a plurality of time zones. 2. Description of the Related Art Conventionally, a person who wants to watch a movie uses the system disclosed in the above-mentioned Patent Document 1 to select an area (movie theater location), genre (movie category), and watching time zone to watch a movie. And received a map of the movie theater showing the movie. In other words, the information that has been published in movie magazines and the like has been obtained from the mobile terminal as the latest information.

  Especially in urban areas, popular movies are closed at many movie theaters, screened in multiple movie theaters in the same area, and even if there are full seats in one area, there are vacant seats in the nearby area. It's hard. In addition, since the movie start time varies depending on the movie theater, considering the time required for the route to the movie theater, etc., there are so many options that it is difficult to make the optimum choice for yourself.

  In particular, when there is a request to participate in multiple events efficiently on the same day, for example, there are multiple movie titles that interest you, and you can efficiently select a movie theater that shows them in one day. If you want to appreciate it, it will be difficult to select the most appropriate one. This is because the movie theaters to be shown for each movie title and the show time are different, and even if the movie title you want to watch at the same movie theater is shown, there is a waiting time of about 2 hours before the movie title you want to watch. This is because it may occur. If the waiting time can be reduced even after moving to another movie theater, a desired movie title can be viewed efficiently.

  Therefore, first, in the present invention, a start time and an end time are determined as in a movie performance in a movie theater, and a plurality of events held in a plurality of places and a plurality of time zones, for example, at least 2 It is configured so that a route search when participating in two or more events can be easily performed. For this reason, data relating to movie screening is stored in the event data 39.

  Data accumulated in the event data 39 is collected from the information distribution server 50 according to the data configuration shown in FIG. In other words, the location of the event, in the case of a movie, the location information (latitude / longitude) for each movie theater, the title of the movie (event title) shown in each movie theater, the movie category, and the duration of the movie are accumulated. Each event (movie screening) screened multiple times with the screening time being separated at the movie theater is assigned an identification code (event ID) as an individual event, and the screening start time and end time are recorded. Each event is given a link number based on the start time and end time of the screening.

  In FIG. 3, the location of movie theater A (Theater A) is (X1 · Y1) in latitude and longitude, the movie to be screened is movie 1 (Movie 1 is category Romance), and event IDs A101 to A101 A104 is screened four times according to the start time to the end time in FIG. The position of the movie theater B (Theater B) is latitude and longitude (X2 · Y2), the movie to be shown is the same movie 1 as the movie theater A (Movie 1 is category Romance), and the event ID is B101. -B104 four times, according to each start time-end time of FIG.

  Movie theater A and movie theater B where movie 1 is shown are event venue nodes having location information (latitude / longitude). If connected to network data for route search, movie theater A or movie theater B is a destination. Can be searched. Then, a movie to be screened in each movie theater is defined as an event virtual node, and an event venue node with a plurality of different links (see link L-AM1 etc. in FIG. 3) based on the screening time zone (start time, end time) , The event virtual node corresponds to a transportation station, and each link can be handled in the same manner as a train having a movie theater A or movie theater B as an event venue node.

  Here, the difference from the traffic network is that the event virtual node does not have position information like a train station. Then, the event venue node and the event virtual node are connected by a plurality of links (see link L-AM1 etc. in FIG. 3) based on different holding times. This indicates that, as described above, the link connecting the event venue node and the event virtual node can be defined in the same manner as a train having the event venue as a departure station and the event virtual node as a destination station. In the present invention, the event virtual node having no position information means a node that does not require position information, and even if some position information is attached, the position information is not used. Any event virtual node having substantially no position information may be used.

  The network data editing means 38 is designated as described above with reference to the event data 39 when a desired departure place is designated from the terminal device 20 and a movie as an event is selected and a route search request is made. The location of the movie (event) (movie theater A or movie theater B) is connected to the route search network data 35 as an event venue node having position information, and each event is an event virtual node having no position information. The event search node 33 is designated by referring to the edited network data for route search, and the route search means 33 is specified by referring to the edited network data for route search. The guide route that is the best for watching a movie or some candidate routes that include the best guide route It is possible to search Te.

  With this configuration, when a desired departure place and a specific event are specified, the route search server 30 participates in the event by performing a route search using the event virtual node of the corresponding event as a destination. It is possible to search for the optimum route for the operation. Such a route search method has been previously filed by the present applicant as international patent application PCT / JP2006 / 31275. However, when participating in a plurality of events, it is difficult to obtain an optimal solution as described above even if such a route search method is adopted.

If you want to search for a guide route for viewing 4 movie titles in 20 movie theaters, there are only 20 ⁴ = 160,000 in the order of movie theaters. Obviously, it becomes difficult to search for a guidance route. Moreover, in the city center of Tokyo, the actual number of movie theaters is larger, and route searching becomes more difficult.

  In the present invention, the route search server 30 is provided with event participation plan permutation creation means 331, and when a plurality of events desired to participate are specified in addition to the departure place, the participation plan permutation of the corresponding event is created. The route search server is configured to search the guide route using the corresponding event virtual nodes as destinations sequentially according to the permutation created by the event participation plan permutation creating means 331, and to guide the relevant event and the place where the event is held.

The permutation created by the event participation plan permutation creation means 331 is as follows.
For example, when there are two movie titles M1 and M2 that the user desires to participate in, there are two permutations created by the event participation plan permutation creating means 331: [M1 → M2, M2 → M1].
When there are three movie titles M1, M2, and M3 that are desired to participate, the permutation created by the event participation plan permutation creating means 331 is 3! = 6 ways.
Similarly, when there are four movie titles desired to participate, the permutation created by the event participation plan permutation creation means 331 is 4! = 24 ways.

If you look at four desired movie titles, the permutation increases as expected, but it is still limited to 24.
In addition, as a special combination, if you want to see two of the specific categories to which the movie title belongs, for example, select two from the “Romance” category for movie titles that fall into the Romance category. For example, if there are 6 works of “Romance” being shown at that time, 6 × 5 = 30 are selected in consideration of the order. (Here, the mode of watching the same movie twice is excluded).

  The route search server 30 searches for a guide route using the corresponding event virtual node as a destination in accordance with the permutation created by the event participation plan permutation creation means 331 as described above. For example, when there are two movie titles M1 and M2 that are desired to be participated, the permutations created by the event participation plan permutation creating means 331 are two types [M1 → M2, M2 → M1] as described above. It is.

  The route search means 33 first searches for the guide route of the first permutation [M1 → M2]. That is, first, the event virtual node is set to M1, and the guide route from the departure place to the event virtual node M1 is searched once. Thereafter, the route from the movie theater node to the event virtual node M2 to which the event virtual node M1 obtained in the previous route search is connected is searched once. As a result, a guide route from the departure place → the event virtual node M1 → M2 is searched.

  Next, the route search means 33 searches for the next permutation [M2 → M1] guide route. This search is the same as the guide route search of the permutation [M1 → M2]. First, the event virtual node is set to M2, and the guide route from the departure point to M2 is searched once. Thereafter, the route from the movie theater node to the event virtual node M1 to which the event virtual node M2 obtained in the previous route search is connected is searched once. As a result, a guide route from the departure place → the event virtual node M2 → M1 is searched.

  In this way, by searching for the guide route with the corresponding event virtual node as the destination sequentially according to the permutation, the guide route of the event virtual node M1 → M2 and the event virtual node M2 are searched in a total of four guide route searches. → It is possible to search for two types of routes including the M1 guide route. The user can select one of the routes based on the guide route.

  Even when watching 4 movie titles a day, the number of searches is 24 ways x 4 = 96 times, and this is the practical upper limit from the number of movie shows and the show time per title. Search processing is possible.

The guide routes are searched as described above, and the search results are displayed by sorting them according to the specified conditions such as those with a short required time and those with a small fare.
If the movie theater entrance fee is also treated as a fare, the total cost can be displayed. (Charges may vary from movie to movie and from movie theater to movie theater. Since there is a virtual link for each movie shown in each movie theater, a link cost can be assigned.)
If no guidance route is found, there are too many movie titles to be watched or the departure is too late, and this is displayed to prompt the user to re-enter the conditions.

  Next, route search network data to which the event venue node and event virtual node are connected will be described. The road network data 36 for route search in navigation for pedestrians and car navigation for automobiles is configured as follows. For example, when the road is composed of roads A, B, and C as shown in FIG. 4, 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. 4, Nn and Nm indicate nodes, and Nm 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. 4, 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. 4, when the 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 along the road A, turns right at the second intersection, enters the road C, and reaches the node CY. The link cost is accumulated sequentially, and a route that minimizes the accumulated link cost is searched for and guided.

  Although other paths from the node AX to the node CY are not shown in FIG. 4, in reality there are other such paths, so a possible path from the node AX to the node CY is similarly searched. Of these routes, the 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 37 for route search of the transportation system is configured as follows. For example, as shown in FIG. 5, 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 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. 5, Nn and Nm indicate nodes, Nm indicates a transit point (transfer station, etc.) of a traffic route, and a directional link connecting each node is indicated by an arrow line (solid line, dotted line, two-dot chain line). Show. As for the links, there are links facing in the upward and downward directions of the traffic route, but in FIG. 5, 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, but in the traffic network, as shown in FIG. 5, trains and airplanes (hereinafter referred to as individual trains and airplanes) that operate the traffic route. 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. 5, 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, unlike a simple road network, the transportation network of a transportation facility has a data amount proportional to the total number of transportation means (routes such as individual airplanes and trains). For this reason, the data of the traffic network becomes a huge amount of data compared to the data amount of the road network. Accordingly, much time is required for route search accordingly.

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. 5, when performing a route search in which the departure point is a node AX of the traffic route A and a specific departure time is designated and the node CY of the traffic route C is 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.

  Therefore, if the event venue node and the event virtual node described above are connected to the route search network data 35, a desired departure place is set, and an event (movie 1 or movie 2) to be participated in is specified, the corresponding Using the event virtual node as a destination, the route search means 33 can search for a route in the same manner as a normal route search. Then, it searches for an optimum route and several candidate routes that arrive at the destination at the desired time (to finish watching the movie) as a guide route, and can guide the event venue node to which the corresponding event virtual node is connected. It becomes like this.

  When the user specifies a plurality of events that he / she wants to participate in, as described above, based on the permutation created by the event participation plan permutation creation means, the corresponding event virtual nodes are sequentially searched for the internal route as the destination, Guide the event and the location of the event. For example, as described above, when there are two movie titles M1 and M2 that are desired to participate, a search is made once at the departure place → event virtual node M1, and then the movie theater node of M1 → event virtual node M2 Search once, then M2 as the event virtual node, search once at departure point → M2, and then search once at M21 cinema node → event virtual node M1, for a total of four guide route searches Can search for two types of routes.

  The route search server 30 includes a control unit 31, a route guide unit 32, a communication unit 34, and the like, as in a general route search server. Although not shown, the control unit 31 is a microprocessor having a RAM, a ROM, and a processor, and controls the operation of each unit by a control program stored in the ROM. The communication unit 34 is a communication interface for transmitting / receiving communication data to / from the terminal device 20 via the network 12. The route guidance means 32 edits the guidance route data searched by the route search means 33, map data for display, guidance data, and the like, and distributes them to the terminal device 20.

  On the other hand, the terminal device 20 includes a control unit 21, a communication unit 22, a positioning unit 23, a display unit 24, a guide route data storage unit 25, a distribution request editing unit 26, and an operation / input unit 27. Although not shown, the control unit 31 is a microprocessor having a RAM, a ROM, and a processor, and controls the operation of each unit by a control program stored in the ROM. The positioning means 23 includes a GPS receiver, receives and processes GPS satellite signals, and measures the current position (latitude / longitude) of the navigation terminal device 20.

  The communication means 22 includes a wireless communication unit and communicates with the route search server 30. The operation / input means 27 includes a key, a dial, and the like, and is used as an input function for operating the terminal device 20, a departure place, a destination, and the like. The display means 24 is composed of a liquid crystal display panel or the like, and is used for displaying a guide route of the guide route data distributed from the route search server 30 and a map. The display unit 24 also functions as an input unit for displaying the menu screen and operating the terminal device 20.

  The distribution request editing unit 26 uses the starting point, the destination, or the current position of the navigation terminal device 20 measured by the positioning unit 23, which is input by using the operation / input unit 27, as the starting point, based on these information. Thus, a route search request to be transmitted to the route search server 30 is created. When requesting a route search for participating in an event such as a movie to the route search server 30, the user can select a desired departure place from the operation / input means 27 or from the menu screen displayed on the display means 24. A movie title to be viewed (a plurality of movie titles when viewing a plurality of movie titles) and a desired date and time (desired date, departure time, movie end time, etc.) are designated.

  As will be described later, when the route search server 30 has a function of connecting a category virtual node indicating a movie category to the route search network data 35, as described later, the operation / input means 27, Alternatively, a category of a movie to be viewed is specified using a menu screen displayed on the display unit 24, one or more movie titles are selected from movie titles belonging to the category, and transmitted to the route search server 30. You can also edit the route search request.

  The guide route data storage means 25 stores guide route data, map data, guidance, etc., which are route search results distributed from the route search server 30, and these data are guided route data storage means as required. 25, and is displayed on the display means 24. In general, a guide route and a mark indicating the current position of the navigation terminal device 20 are superimposed on a map of a certain scale and a certain range including the current position of the navigation terminal device 20 measured by the positioning means 23. The current position mark is displayed at the center of the display screen.

  Since the current position information (latitude / longitude information) measured by receiving the GPS satellite signal by the positioning means 23 includes an error, if the current position deviates from the guide route, the current position is placed on the guide route. A route matching process to be corrected and a map matching process to match a road on the map are performed. If voice guidance (for example, a voice message such as “This is a 300m intersection. Turn left”) is added to the guidance route data distributed from the route search server 30 via a speaker. Play and output voice messages to guide users.

  Next, the network data editing method and route search method in the route search system 10 according to the embodiment of the present invention described above will be described in detail. In the following example, for example, a route search for viewing a desired movie earliest from the current location (home) will be described.

  In the route search server 30, a movie theater is registered with position information as event point of interest 39 (POI: Point of Interest) information. Such POI information may be collected from various information distribution servers 50 and stored separately from the event data 39 as POI data. If a database that stores POI information is provided, a POI search service can be provided. In addition, since the event data 39 guides the performance of the movie, the screening schedule of each movie theater is also stored as data (see FIG. 3).

  FIG. 6 is a diagram schematically showing a state in which movie theaters A and B, which are event venue nodes, are connected to the route search network data 35. In FIG. 6, 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. 6 shows only movie theater A and movie theater B as representatives.

  FIG. 7 is a schematic diagram showing a concept of connecting a movie work held at an event venue node TA, TB (movie theater A, movie theater B) or the like as an event to the event venue node. For ease of understanding, FIG. 7 is a diagram expressed using network data corresponding to the route search network data 35 of FIG. As the event, for example, there are a movie M1, a movie M2, and a movie M3, and event virtual nodes M1 to M3 are given to each. This virtual node is included in the route search network, but does not have location information (appropriate location information may be attached, but it is not used for route search). In addition, a link is connected to the event virtual node from the movie theater being shown.

  The link connects the event venue node and the event virtual node, and is connected by a plurality of different links for each time zone (start time and end time) in which the movie M1 is shown. In FIG. 7, in order to facilitate understanding, the link connecting movie 1 (event virtual node) shown at movie theater TA (event venue node) is shown at link L-AM1 and movie theater TB (event venue node). Only the link L-BM1 is shown as a link connecting the movie 1 (event virtual node) to be played (see FIG. 3 for other links). These links are one-way links and extend from the cinema to the movie. These links are associated with timetables (holding time zones), and the timetable includes movie start time and end time. As shown in FIG. 3, this timetable is data in the same format as the train timetable.

That is, in contrast to the train timetable, it is expressed as the following timetable that considers the event venue node as the timetable with the departure and arrival stations as the departure and arrival stations.
Movie M1 1st screening 10:00 12:30 movie M1 2nd screening 13:00 15:30 movie M1 3rd screening 16:00 18:30 movie M1 4th screening 19:00 21: 30. If you do this, it will be edited into a transportation network that will get you on the train at the start time of each show in the movie theater and arrive at the movie virtual node when the show ends.

  A category virtual node is also set for the event (movie) category, and a link L-M1R is connected from the event (movie) to the corresponding category. For example, when the category (field) to which the movie M1 as an event belongs is Romance, the link L-M1R is connected from the event virtual node to the category virtual node of “Romance”. FIG. 8 shows this part extracted. This link L-M1R 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. In this case, if the movie 2 also belongs to the same category, the movie 2 is also connected to the category virtual node of “Romance”. In this way, as will be described later, a route search for selecting a category virtual node, that is, a movie category, and selecting and watching a movie of interest can be performed.

  Returning to FIG. 7, the route search in the case where the user wants to watch movie 1 (M1) from the current location S (for example, home) will be described. If movie 1 (M1), route search is performed with the destination as the event virtual node of movie 1 (M1). This route search itself can be performed by the method disclosed in Patent Document 2 and Japanese Patent Application Laid-Open No. 2003-227732 taking into consideration the timetable of the train.

  For example, under the condition that the departure place is at 9:30, the route search result is as shown in FIG. 9, and the movie TA can be watched the fastest (the movie can be finished) is 1 in the movie theater TA. The search result is that the first screening is 10:30. The movie theater TB is close to the departure place, but the above results are obtained when the screening time and travel time are comprehensively considered. Note that this search does not repeat trial and error, but an optimal solution can be obtained by obtaining the optimal route to the destination once according to the conditions. Further, the route search means 33 can search and guide not only the optimum route but also some candidate routes that satisfy the conditions. If the candidate route is guided, the user can consider moving to a movie theater below the second candidate when the movie theater specified by the optimum route is full.

Also, instead of directly specifying the movie you want to watch, you can also specify it by category.
When the category “Romance” is specified, the optimal route search is performed with the category virtual node of the Romance as the destination. When the category to which the movie 2 belongs is Romance, the movie 2 is also connected to the category virtual node of Romance, so that the movie 2 is selected as the optimum route as shown in FIG. In this way, a movie theater that can be viewed at a desired time zone is searched from a plurality of events (movies) belonging to the selected category, and if the user is interested in the movie, the desired time can be obtained. You will be able to spend time watching movies.

  In the above description, the search is performed under the condition that the movie is desired to be watched earliest. However, the search is performed based on the arrival time at the virtual node, so that the route where the movie ends so as to be closest to the arrival time. You can also find

  In the above description, the route search using the event virtual node of the movie, which is an event, as the destination has been described. That is, the movie theater is a transit point, and the next transit point or final destination may be set ahead of it. In order to cope with such an application, without going to the event virtual node as a starting point, as shown in FIG. Or return to the movie theater TB (event venue node), and search for a route from there to the next destination may be started.

  In the above description, the case where a single movie title is viewed for ease of understanding has been described. However, a route search for viewing a plurality of movie titles in one day can be similarly performed. In this case, the route search method shown in FIG. 10 may be applied. However, since this method implicitly determines the order of one event and the next destination, a suitable solution is obtained for the entire route. Sometimes not.

  For example, there are many users who try to watch a plurality of movies continuously in one day. For such a purpose, even if the second movie M2 is searched after searching for the first movie M1 by the method of FIG. 10, it is not necessarily efficient to see in this order as a whole route. Absent. The route search method shown in FIG. 8 shows a search method in the case of specifying a movie category. In this route search, a route that reaches a category virtual node once is searched. There is also a desire to watch two films from the same category. According to the present invention, such a route search is also possible.

  As described above, first, the event participation plan permutation creation means 331 creates a permutation of the designated event (permutation around the event virtual node), and then the route search means 33 uses this permutation to perform a route search. A route search system that can be processed practically can be provided.

  FIG. 11 is a flowchart showing a procedure of route search processing in the route search system according to the present invention described above. In the terminal device 20, a condition input screen is displayed in the process of step S101, and a date and time condition is input in step S102. Next, in step S103, the departure place is selected, and in step S104, a plurality of desired events (for example, movie titles to be watched) are selected. In step S105, the guide route sorting conditions (for example, the shortest required time or the lowest fare) ).

When the above condition input is completed, the distribution request editing unit 26 of the terminal device 20 edits these input conditions as a route search request and transmits the route search request to the route search server 30.
When the route search server 30 receives the route search request transmitted from the terminal device 20, in the process of step S106, the event participation plan permutation creating means 331 participates in the event from the plurality of events selected in the condition input of step S104. Create a permutation to do

  When the permutation is created, in the process of step S107, the route search means 33 searches the guidance route with each virtual event node as a destination in accordance with the permutation. At this time, as described above, the network data editing means 38 performs the process of connecting the event virtual node corresponding to the event selected as the network data of the route search network data 35.

  In the process of step S108, it is determined whether or not the guide route search has been completed for all of the permutations. If the route search has not been completed for all of the permutations, the process returns to the route search process in step S107. If the route search has been completed for all of the permutations, the guide route searched in the process of step S109 is in accordance with the specified sort condition. Sort.

  When the sorting of the guide routes is completed, the route search server 30 distributes the guide route data to the terminal device 20 in step S110 and ends the process. The terminal device 20 displays the guidance route data distributed from the route search server 30 on the display means 24, and the user selects a desired guidance route from the data.

  As described above in detail, according to the route search system according to the present invention, it is possible to efficiently participate in a plurality of events in a limited time by designating a plurality of desired events. It is possible to search for a simple guide route and guide the user.

  In the present invention, when a homogeneous event is held in a plurality of places and a plurality of time zones, such as movie screening, at least two of the multi-events as described above using walking and transportation. An efficient guide route for participating in the above can be provided. Therefore, for example, it is possible to provide a plan for efficiently viewing a desired movie within a limited time in a movie theater, and in addition to the functions of a general navigation device, this service can be provided at a movie guide site.

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 figure which shows an example of the data structure of the database which accumulate | stores the information (event data) regarding the homogeneous event held in several places and several time slot | zones. 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. It is a schematic diagram which shows the state by which the event hall node was connected to the network data for route search. It is a schematic diagram which shows the concept of the connection of an event hall node and an event virtual node. It is a schematic diagram which shows the concept which connects the category of an event to the event virtual node of an applicable category as a category virtual node. It is a schematic diagram which shows the result of having selected the event and having searched the route | route from the point S of FIG. It is a schematic diagram which shows the concept of the route search which makes an event virtual node a route point, and uses the point which has another real position ahead as the final destination. It is a flowchart which shows the operation | movement procedure of the route search in the route search system concerning the Example of this invention.

Explanation of symbols

10. Navigation system 12 ... Network 20 ... Terminal device 21 ... Control means 22 ... Communication means 23 ... Positioning means 24 ... Display means 25 ... ... guidance route data storage means 26 ... distribution request editing means 27 ... operation / input means 30 ... route search server 31 ... control means 32 ... route guidance means 33 ... Route search means 331 ... Event participation plan permutation creation means 34 ... Communication means 35 ... Route search network data 36 ... Road network data 37 ... Traffic network data 38 ... Network data editing means 39 ... Event data 40 ... Application link means 50 ... Information distribution server

Claims (11)

A route search system for setting a desired departure place and searching for a route for participating in a homogeneous event held at multiple locations and at multiple times,
The route search system includes event data including route search network data for searching a route using walking and transportation, route search means, network data editing means, event location and time. And event participation plan permutation creation means,
The network data editing means connects the event location to the route search network data as an event venue node having position information, registers the event as an event virtual node having no position information, Connect from the venue node to the event virtual node with multiple links based on different event times,
When a plurality of specific events are designated from the events,
The event participation plan permutation creation means creates a participation plan permutation of the designated event, and the route search means applies according to the permutation created by the event participation permutation creation means starting from a desired point. A route search system characterized by searching a guide route sequentially using event virtual nodes as destinations, and guiding a corresponding event and a place where the event is held.   The route search system according to claim 1, wherein the route search system sorts and guides the guidance route data searched by the route search means according to the permutation according to a specified sort condition.   The route search system according to claim 1, wherein the event venue is a movie theater, and the event is a movie title screened in the movie theater. A route search server that is connected via a network to a terminal device that sets a desired departure place and searches for routes for participating in homogeneous events held at a plurality of places and a plurality of time zones,
The route search server includes route search network data for searching a route using foot and transportation, route search means, network data editing means, event data including a place and time of the event. And event participation plan permutation creation means,
The network data editing means connects the event location to the route search network data as an event venue node having position information, registers the event as an event virtual node having no position information, Connect from the venue node to the event virtual node with multiple links based on different event times,
When a plurality of specific events are designated from the events,
The event participation plan permutation creation means creates a participation plan permutation of the designated event, and the route search means applies according to the permutation created by the event participation permutation creation means starting from a desired point. A route search server characterized in that a guide route is sequentially searched using event virtual nodes as destinations, and a corresponding event and a place where the event is held are guided.   5. The route search according to claim 4, wherein the route search server sorts and guides the guidance route data searched by the route search means according to the permutation according to a sorting condition designated by the terminal device. server.   The route search server according to claim 4, wherein the event venue is a movie theater, and the event is a movie title screened in the movie theater. A terminal device that is connected via a network to a route search server that searches for routes for participating in homogeneous events held in a plurality of places and a plurality of time zones, and sets a desired departure place,
The route search server includes route search network data for searching a route using walking and transport, route search means, network data editing means, event data including the event location and time. And event participation plan permutation creation means,
The network data editing means connects the event location to the route search network data as an event venue node having position information, registers the event as an event virtual node having no position information, Connect from the venue node to the event virtual node with multiple links based on different event times,
When a plurality of specific events are designated from the events,
The event participation plan permutation creation means creates a participation plan permutation of the designated event, and the route search means applies according to the permutation created by the event participation permutation creation means starting from a desired point. A route search server that sequentially searches for a guide route using event virtual nodes as destinations, and guides a corresponding event and a place where the event is held,
The terminal device comprises means for designating at least two or more events desired to participate among the events.   8. The terminal device according to claim 7, further comprising means for specifying a sorting condition for sorting data of the guide route searched by the route searching means according to the permutation. A route search method in a route search system for setting a desired departure place and searching for a route for participating in a homogeneous event held in a plurality of places and a plurality of time zones,
The route search system includes event data including route search network data for searching a route using walking and transportation, route search means, network data editing means, event location and time. And event participation plan permutation creation means,
The network data editing means connects the event holding location to the route search network data as an event venue node having position information, registers the event as an event virtual node having no position information, Connecting from the venue node to the event virtual node with multiple links based on different event times;
When a plurality of specific events are designated from the events,
The event participation plan permutation creating means creating a participation plan permutation of the designated event;
The route search means having a desired point as a departure point, and according to the permutation created by the event participation permutation creation means, the corresponding event virtual nodes are sequentially searched for a guidance route, and a corresponding event And a route search method characterized by guiding a place where the event is held.   The route search method according to claim 9, wherein the route search method includes a process of sorting and guiding the data of the guide route searched by the route search means according to the permutation according to a specified sort condition. .   The route search method according to claim 9, wherein the event venue is a movie theater, and the event is a movie title screened in the movie theater.

Images