JP2008151570A - Navigation system, route searching server, route searching method, and terminal device - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To guide a plurality of routes including a recommended route and a detouring route so that a destination can be reached at a prescribed time by using the detouring route, even when an impassable section is generated. <P>SOLUTION: A navigation system 10 is equipped with a route searching means 34 for searching for a plurality of candidate routes capable of reaching a set destination at a set time after starting from a set starting place, a candidate route grouping means 35, and a detouring route searching means 36. The candidate route grouping means 35 groups candidate routes having the same starting direction from a starting spot or a changing spot, and the detouring route searching means 36 searches for each candidate route again based on network data by using a starting time of the K-th candidate route set beforehand relative to each candidate route group, determines a candidate route having the earliest starting time as the recommended route, and outputs other candidate routes as detouring routes. <P>COPYRIGHT: (C)2008,JPO&INPIT

Description

  The present invention relates to a navigation system that searches for and guides an optimal route and a candidate route from routes from an arbitrary departure place to a destination using walking, automobiles, or public transportation, and in particular, a public system. Include a detour route as a recommended route so that you can use the detour route to reach your destination at a specified time even if a section that cannot be reached due to an accident or failure occurs. The present invention relates to a navigation system, a route search server, a route search method, and a terminal device that can search and guide a plurality of routes.

  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 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.

  A navigation system that searches for routes using transportation in addition to walking routes is disclosed, for example, in Patent Document 2 (Japanese Patent Laid-Open No. 2000-258184). The navigation system 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. A traffic network route searching method to be searched is used.

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

  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.

  When guiding a recommended route using a transportation facility, there is also a demand for guidance on what time the current position should depart in order to leave the current position and arrive at the destination at a desired time. In such requests, for example, the current location is the current location, the recommended location that can leave the current location at the latest time and return to the home (destination) at the last train and the time to leave the workplace There is also a so-called “last train search” request for guidance on (time to leave the office for getting on or connecting to the last train).

  For example, the following Patent Document 3 (Japanese Patent Application Laid-Open No. 2003-58663) and Patents describe a navigation system that guides by what time the current position should depart in order to arrive at a certain target station at a certain time. It is disclosed in Document 4 (Japanese Patent Laid-Open No. 2003-254777).

  The transfer guidance service providing system disclosed in Patent Document 3 is a system that guides the user when to depart from the current position in order to use the last train. The user's portable terminal is a GPS receiver or the like The present position detecting means is provided, and the transfer guide information is searched using the obtained position information. The Web server that provides the transfer guidance service calculates the travel time from the current position of the mobile terminal to the departure station using the position information, and takes the specified train in consideration of the calculated travel time In order to do so, the user is provided with an indication as to what time the current position must depart. Due to such a configuration, the user can get on the target train without being late for the last train or the like or spending a wasteful waiting time.

  In addition, the movement information notification system disclosed in Patent Document 4 is a system that automatically performs a notification service of the time to leave the current location in order to arrive at a certain time at a certain destination station. Based on the current location of the user obtained using the externally connected GPS system, the nearest station near the current location of the user is checked, and the user information database is used from the nearest station using the externally connected station search system. The route to the destination station registered in advance and its timetable list are searched. Then, based on the searched timetable list, the time to depart from the current location to arrive at a certain time at a certain destination station is calculated, and the route to the destination station and the time to depart are determined according to the notification desired time It is configured to notify automatically.

JP 2001-165681 A (FIGS. 1 and 2) JP 2000-258184 A (FIGS. 3 and 4) Japanese Patent Laying-Open No. 2003-58663 (FIGS. 2 and 3) JP2003-254777A (FIGS. 1 and 3)

  In a search for a route that leaves a desired departure place and reaches a destination at a predetermined time (arrival time designation search), as in the movement information notification system disclosed in Patent Document 3, the result of the route search is as follows: The optimum route and the candidate route are shown, and for each route, it is shown what time the departure place should be departed from.

  However, with such a guidance method, if any accident or trouble occurs in the guided optimum route or candidate route, there is a possibility that the destination cannot be reached at the scheduled time. In particular, when attending an event that cannot be late, for example, when attending a meeting with a customer, or when the destination is an airport on board an aircraft, if the destination cannot be reached at a predetermined time, a serious result may be caused.

  In such a case, it is common to set route search conditions with a margin for the arrival time at the destination and receive route guidance. However, it is safe to have a margin for the set arrival time. There is a problem that it is left to the judgment of the user and the degree of safety is uncertain. That is, in the past, since the allowance was relied upon depending on the intuition of the user, there was a case where a departure time that was delayed when a detour was originally selected was selected. In addition, there is a problem that the user only has to search a plurality of recommended routes to determine whether there is a route that can be detoured when there is a problem with the guided route.

  As a result of various studies by the inventor of the present application to solve the above-mentioned problems, a plurality of routes that can be detoured are a plurality of routes having the same departure direction from the departure station (the same first route or the same first route). Since there are multiple routes that can arrive at the same destination at a predetermined time, in the route search, a plurality of candidate routes that depart from the departure station and can arrive at the destination at a predetermined time are searched. Then, based on the departure time of the candidate route that leaves the departure station earliest within the preset margin range, the candidate route that can arrive at the destination at a predetermined time is re-searched, and the departure time The present invention has been completed by conceiving that the above-mentioned problems can be solved if the recommended route and the detour route are guided in an early order.

  That is, the present invention aims to solve the above problems, and in a navigation system that searches and guides a route from an arbitrary departure point to a destination by using public transportation, there are inaccessible sections. A navigation system, a route search server, a route search method, and a terminal capable of guiding a plurality of recommended routes including a detour route so as to be able to arrive at a destination at a predetermined time using the detour route even if it occurs The object is to provide an apparatus.

In order to solve the above-mentioned problem, the invention according to claim 1 of the present application is
Route search means for searching for a guide route including a route using a transportation facility from a departure point to a destination with reference to network data for route search, and a guide route for storing guide route data searched by the route search means In a navigation system comprising storage means and display means for displaying the guidance route,
The navigation system includes a route search unit that searches a plurality of candidate routes that can depart from a set departure point and arrive at a set destination at a set time, a candidate route grouping unit, and a detour route search unit; With
The candidate route grouping unit groups candidate routes having the same departure direction from a departure point or a transfer point, and the detour route searching unit uses a preset departure time of the Kth candidate route for the candidate route group. Each candidate route is searched again based on the network data, and the candidate route with the earliest departure time is set as a recommended route and the other candidate routes are output as detour routes.

  The invention according to claim 2 of the present application is the navigation system according to claim 1, wherein the detour route search means uses the preset departure time of the Kth candidate route for each candidate route group. When a route is searched again based on the network data, a plurality of routes are searched again based on the network data on condition that the set departure time of the Kth candidate route and the destination and arrival time at the destination are used as conditions. It is characterized by.

  The invention according to claim 3 of the present application is the navigation system according to claim 1 or claim 2, wherein the detour route searching means uses a preset departure time of the Kth candidate route for the candidate route group. When the candidate routes are searched again based on the network data, the restriction conditions regarding the transportation facility to be used, which are set together with the departure point, the destination, and the arrival time at the destination, are relaxed with respect to the transportation facility to be used. It is characterized by performing a search.

The invention according to claim 4 of the present application is
In a route search server that is connected via a network to a terminal device that sets a desired starting point and destination, and that searches for a plurality of candidate routes between two set points based on a request from the terminal device,
The route search server refers to network data for route search, and includes a plurality of candidate routes including routes using a transportation facility that can depart from a set departure point and arrive at a set destination at a set time. A route search means for searching for, a candidate route grouping means, and a detour route search means,
The candidate route grouping means groups candidate routes having the same departure direction from the departure point or transfer point, and the detour route searching means uses the set departure time of the Kth candidate route for the candidate route group. Each candidate route is searched again based on the network data, and the candidate route with the earliest departure time is set as a recommended route and the other candidate routes are output as detour routes.

  The invention according to claim 5 of the present application is the route search server according to claim 4, wherein the detour route search means uses the preset departure time of the Kth candidate route for each of the candidate route groups. When a candidate route is searched again based on the network data, a plurality of routes are searched again based on the network data on condition that the set departure time of the Kth candidate route and the destination and arrival time at the destination are used as conditions. It is characterized by that.

  The invention according to claim 6 of the present application is the route search server according to claim 4 or claim 5, wherein the detour route search means calculates a departure time of a preset Kth candidate route for the candidate route group. When the candidate routes are searched again based on the network data, the restriction conditions regarding the transportation facility to be used, which are set together with the departure place, the destination, and the arrival time at the destination, are relaxed. A route search is performed.

The invention according to claim 7 of the present application is
A route search method in a route search server that is connected via a network to a terminal device that sets a desired starting point and destination and searches for a plurality of candidate routes between two set points based on a request from the terminal device In
The route search server refers to network data for route search, and includes a plurality of candidate routes including routes using a transportation facility that can depart from a set departure point and arrive at a set destination at a set time. A route search means for searching for, a candidate route grouping means, and a detour route search means,
The candidate route grouping unit groups candidate routes having the same departure direction from the departure point or transfer point, and the detour route searching unit determines the departure time of the set Kth candidate route for the candidate route group. A detour route search step for re-searching each candidate route based on the network data using the candidate route with the earliest departure time as a recommended route and outputting other candidate routes as detour routes. To do.

  The invention according to claim 8 of the present application is the route search method according to claim 7, wherein the detour route search step uses the preset departure time of the Kth candidate route for each of the candidate route groups. When a candidate route is searched again based on the network data, a plurality of routes are searched again based on the network data on condition that the set departure time of the Kth candidate route and the destination and arrival time at the destination are used as conditions. Including processing.

  The invention according to claim 9 of the present application is the route search method according to claim 7 or claim 8, wherein the detour route search step uses a preset departure time of the Kth candidate route for the candidate route group. When the candidate routes are searched again based on the network data, the restriction conditions regarding the transportation facility to be used, which are set together with the departure place, the destination, and the arrival time at the destination, are relaxed. It includes a process for performing a route search.

The invention according to claim 10 of the present application is
Route search means for searching for a plurality of candidate routes including routes using a transportation facility that refers to network data for route search and can arrive at a set destination after leaving a set departure point And candidate route grouping means and detour route searching means,
The candidate route grouping means groups candidate routes having the same departure direction from the departure point or transfer point, and the detour route searching means uses the set departure time of the Kth candidate route for the candidate route group. A terminal device connected via a network to a route search server that searches each candidate route again based on the network data, outputs a candidate route with the earliest departure time as a recommended route, and outputs other candidate routes as a detour route. There,
The terminal device includes an operation input unit that sets at least a search for a detour route, a departure place, a destination, and a time to arrive at the destination as route search conditions.

  According to an eleventh aspect of the present invention, in the terminal device according to the tenth aspect, the terminal device includes display means, and displays the information indicating the recommended route and the information indicating the detour route for each candidate route group. It is characterized by displaying on a means.

  In the invention according to claim 1, the navigation system includes a route search means for searching for a plurality of candidate routes that can depart from a set departure point and arrive at a set destination at a set time, and candidate route grouping And a detour route search means, wherein the candidate route grouping means groups candidate routes having the same departure direction from the departure point or transfer point, and the detour route search means is preset for the candidate route group. Each candidate route is searched again based on the network data using the departure time of the Kth candidate route, and the candidate route with the earliest departure time is set as a recommended route and the other candidate routes are output as detour routes.

  According to such a configuration, it is possible to guide a recommended route that leaves the departure station earliest and a detour route that leaves the departure station afterwards for each route group having the same departure direction at the departure station and transfer station. Even if some trouble occurs while moving according to the recommended route guided according to the set margin, it is possible to change to the guided detour route and arrive at the destination by a predetermined time.

  In the invention according to claim 2, in the invention according to claim 1, the detour route search means determines each candidate route for the candidate route group using a preset departure time of the Kth candidate route. When searching again based on the network data, a plurality of routes are searched again based on the network data on the condition that the departure time of the set Kth candidate route and the destination and arrival time at the destination are used as conditions.

  According to such a configuration, for each route group having the same departure direction at the departure station and the transfer station, the departure time of the Kth candidate route set in advance is used as a route based on the departure time of the departure place. Since a route satisfying the arrival time at the destination is searched, it is possible to guide a recommended route that leaves the departure station earliest and a detour route that leaves the departure station thereafter.

  In the invention according to claim 3, in the invention according to claim 1 or claim 2, the detour route search means uses the departure time of the Kth candidate route set in advance for the candidate route group. When searching for each candidate route again based on the network data, the route search is performed by relaxing the restriction conditions regarding the transportation facility to be used, which are set together with the departure point, the destination, and the arrival time at the destination. Do.

  According to such a configuration, for each route group having the same departure direction at the departure station and the transfer station, the departure time of the Kth candidate route set in advance is used as a route based on the departure time of the departure place. Therefore, when searching for a route satisfying the arrival time at the destination, the route search is performed by relaxing the restriction conditions related to transportation, so that the range of the detour route to be searched can be expanded. Therefore, since the recommended route that departs from the departure station first and the detour route that departs from the departure station after that can be guided, the user has some trouble while moving according to the recommended route that is guided according to the set margin. Even if it occurs, it is possible to expand the alternative route options that can reach the destination by a predetermined time.

  In the invention according to claims 4 to 6, it is possible to provide a route search server constituting the navigation system according to claims 1 to 3, respectively. In the inventions according to claims 7 to 9, the route search method in the route search server according to claims 4 to 6, respectively, can be provided. In the inventions according to claims 10 and 11, respectively. Can provide a terminal device constituting the navigation system according to claims 1 to 3.

  Hereinafter, specific examples of the present invention will be described in detail with reference to examples and drawings. However, the embodiments shown below illustrate a navigation system for embodying the technical idea of the present invention, and are not intended to specify the present invention for this navigation system. The present invention can be equally applied to navigation systems of other embodiments included in the scope.

  As shown in FIG. 1, a navigation 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 on a network 12 such as the Internet. It is configured to be connected via. In this embodiment, the navigation 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 an application for realizing the present invention is installed. For example, it can be applied to a stand-alone navigation device. In the present invention, since the search using the traffic network data based on the timetable of the transportation system is also performed, it is preferable to configure as a server-client type navigation system using the mobile phone as a terminal and always using the latest timetable data. is there.

  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, and each train of a transportation facility. It includes a timetable based on the service schedule, a timetable / fare data database (DB3) that stores fares, and a database (DB4) that stores map data for display. The timetable / fare data can be acquired from the information distribution server 50 via the network.

FIG. 2 is a block diagram showing a detailed configuration of the navigation system 10 according to the embodiment of the present invention. A navigation system 10 according to an 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. Has been.
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 38, traffic network data according to the route search condition. 39, the optimum route or a plurality of candidate routes are searched for, and the data of the optimum route or the plurality of candidate routes is distributed to the terminal device 20.

  The terminal device 20 includes a control unit 21, a communication unit 22, a GPS reception unit 23, a display unit 24, a guide storage unit 25, a setting condition storage unit 26, and an operation input unit 27. Although not shown, the control unit 21 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 means 22 is a communication interface for transmitting and receiving communication data with the route search server 30 and the like via the network 12. The GPS receiving means 23 includes a GPS receiver, receives and processes GPS satellite signals, and measures the current position (latitude / longitude) of the terminal device 20.

  The operation input means 27 includes a key, a dial, and the like, and is used for input operations for operating the terminal device 20, input operations such as a departure place and a destination, and the like. The display means 24 comprises a liquid crystal display panel or the like, and is used for displaying route data distributed from the route search server 30 and displaying a map. The display means 24 displays a menu screen and operates the terminal device 20 by operating the terminal device 20 on the menu screen. Accordingly, the display unit 24 also functions as an operation input unit for operating the terminal device 20.

  The setting condition storage means 26 sets other route search conditions using the departure point, the destination, or the current position of the terminal device 20 measured by the GPS receiving means 23, which are input using the operation input means 27, as the departure place. The route search request is transmitted to the route search server 30 based on the stored information.

  The guidance storage unit 25 stores guidance route data, map data, guidance, and the like, which are route search results distributed from the route search server 30, and these data are read from the guidance storage unit 25 as necessary. And displayed on the display means 24. Generally, a current position mark is displayed by overlaying a guide route and a mark indicating the current position of the terminal device 20 on a map of a certain scale and a certain range including the current position of the terminal device 20 measured by the GPS receiving means 23. Display so that it is in the center of the screen.

  Since the current position information (latitude / longitude information) measured by receiving the GPS satellite signal by the GPS receiving means 23 includes an error, if the current position deviates from the guide route, the current position is displayed on the guide route. A route matching process for correcting to a map and a map matching process for matching 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.

  When a request for a bypass route search according to the present invention is transmitted to the route search server 30, a route search condition input menu screen to be described later is displayed on the display means 24, and a route search condition is selected by selecting a bypass route search. To do. In the detour route search, the destination arrival time and the margin (how much margin is expected for the departure time at the departure point) are essential setting items.

  On the other hand, the route search server 30 includes control means 31, guidance data editing means 32, communication means 33, route search means 34, candidate route grouping means 35, detour route search means 36, map data 37, road network data 38, traffic network. Data 39 is provided. Although not shown, the control means 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 means 33 is a communication interface for transmitting and receiving communication data with the terminal device 20 and the like via the network 12. The guide data editing unit 32 edits the guide route data, the map data for display, and the guidance data searched by the route search unit 33 and the detour route search unit 36 and distributes them to the terminal device 20.

  The route search means 34 refers to the road network data 38 and the traffic network data 39 in accordance with the route search conditions transmitted from the terminal device 20, and the optimum route or candidate from the starting point to the destination specified by the route search conditions. The route is searched and route data is transmitted to the terminal device 20. The optimum route is a route that minimizes the route cost (distance and required time) from the starting point to the destination, and the candidate route is a route that guides a predetermined number of routes including the optimum route in order of route cost. is there.

  In the route search conditions, you can set the date and time to depart from the departure place, set the date and time to arrive at the destination, and request route search including routes using transportation facilities In such a case, it is possible to set conditions that restrict the means of transportation such as whether or not an aircraft is used, whether or not a paid express train is used or whether or not a green car is used, and whether or not a Shinkansen is used.

  The candidate route grouping unit 35 and the detour route searching unit 36 search for a detour route according to the procedure described later when a request for a detour route is received from the terminal device 20, and give priority to a recommended route that departs from the earliest time. A guide route is output, and a route that departs at a later time is output as a detour route.

  Next, a search for a detour route in the route search system 10 according to the embodiment of the present invention described above will be described. Prior to the search for a detour route, a search condition for a detour route is set in the terminal device 20. FIG. 3 is a diagram showing a configuration of a condition setting screen for setting route search conditions.

  As shown in FIG. 3, the condition setting screen 301 includes a departure point input field 302, a destination input field 303, a time condition input field 304, a detour route search setting field 306, a margin setting field 307, and a search start button 308. Is provided. When requesting a bypass route search to the route search server 30, a check indicated by reference numeral 305 is put in a check box of “Yes” in the bypass route search setting field 306. When the “No” check box in the bypass route search setting field 306 is checked, a normal route search is requested.

  The starting point and destination are set by inputting an address, a telephone number, a station name, a station name such as a building name, a latitude / longitude, or the like in the starting point input field 302 and the destination input field 303. That is, in this input field, free word input is possible in principle, but it can be set by an address, a telephone number, a POI (Point of Interest) name, or the like. Further, by operating the pull-down button, it is possible to call and set the route search history and registered points registered in the terminal device 20 so far.

  In the time condition input field 304, time conditions such as departure date and time and destination arrival date and time are entered. When the detour route search is designated, it is essential to set the destination arrival time in the time condition input field 304. If this input is not made, an error is displayed. In addition, when the detour route search is set, it is essential to set a desired margin from the display of the margin setting field 307. If this setting is not present, an error is displayed. When necessary condition setting is completed and the search start button 308 is operated, a bypass route search request is transmitted from the terminal device 20 to the route search server 30.

  The margin is set for how much allowance to arrive at the destination at the set arrival time even if there is some trouble on the way. For example, it is most secure if you arrive at your destination the day before you should arrive. The same applies to a route using public transportation, and in the present invention, candidate routes obtained by performing a normal route search specifying an arrival time (a plurality of candidate routes satisfying the arrival time condition) The time to depart from the departure place is set as early as possible. In the present embodiment, the departure times of candidate routes are sorted in order of time, and the number of candidate routes up to which the candidate routes are expected as a margin is set. This will be described in detail later with a specific example.

  Prior to the description of the detour route search according to the embodiment of the present invention, a normal route search in the navigation system 10 will be described. The road network data 38 for route search in the navigation system 10 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 (◯ 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. 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 routes from the node AX to the node CY are not shown in FIG. 4, there are actually other such routes, so 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 39 for route search of the transportation facility 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 (○ 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 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 the 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.

  Next, a detour route search procedure according to an embodiment of the present invention will be described. In the following description, the search condition for the detour route is that the nearest station (departure station) of the departure point is A station, the nearest station (destination station) of the destination is F station, and should arrive at the destination station (F station). Assume that the time is specified. First, the route searching means 34 searches for a plurality of candidate routes by performing a route search with a normal destination arrival time designation. In this route search, all candidate routes that can depart from station A and arrive at station F at a specified time are searched. Theoretically, a large number of candidate routes are searched, but a method of starting from station A, which is the departure station, on the day of the route search, or a candidate route up to the 30th place as a candidate route to be processed next, etc. Can be used to search for a realistic detour route.

  Next, the candidate route grouping unit 35 groups the candidate routes searched by the route searching unit 34. The grouping criterion is to group routes with the same departure direction from station A. Further, when there is a transfer station on the candidate route, a route that departs from the transfer station in the same direction is set as a group. Since it is a condition that a route that can be a detour route is a route that departs in the same direction from the departure station or the transfer station, the candidate routes are grouped based on such a criterion. This is because if it is not a route that departs in the same direction, it is impossible to move to another route after leaving a certain route due to some obstacle.

  6 and 7 are schematic views showing an example in which a plurality of candidate routes from A station to F station searched by the route searching means 34 are grouped. In FIG. 6, candidate route RT1 and candidate route RT3 having the same departure direction from station A to station B are grouped. In FIG. 7, candidate route RT2 having the same departure direction from station A to station D is grouped. And the candidate route RT4 is grouped. For example, if it is found that the operation between the station B and the station C is interrupted between the departure from the station A on the candidate route RT1 and the arrival at the station B, the candidate route RT3 serving as a detour route at the station B Can move on.

  Similarly, in FIG. 7, if it is found that the operation between E station and F station has been interrupted between departure from A station on candidate route RT2 and arrival at E station, D station or E station Can move to the candidate route RT4 as a detour route. Since each candidate route RT1 to RT4 is a route that can arrive at the target station F at the designated time, even if such a transfer is made, it can arrive at the F station at the designated time. In order to enable such a transfer, the recommended route needs to be the route with the earliest departure time among the candidate routes that depart from station A.

  That is, in FIG. 6, the departure time at which candidate route RT1 departs from station A needs to be earlier than the departure time at which candidate route RT3 departs from station A. Otherwise, after leaving A station on candidate route RT1, even if it turns out that the operation between B station and C station was interrupted before arriving at B station, Cannot move to the candidate route RT3. In this way, it is necessary to distinguish and guide the recommended route and the detour route in consideration of the time relationship between the departure times of the candidate routes. The same applies to the case of FIG.

  That is, in FIG. 6, when the departure time at which candidate route RT1 departs from station A is earlier than the departure time at which candidate route RT3 departs from station A, candidate route RT1 is the recommended route and candidate route RT3 is detoured. It is a route. Conversely, when the departure time at which candidate route RT1 departs from station A is later than the departure time at which candidate route RT3 departs from station A, candidate route RT3 is the recommended route and candidate route RT1 is the detour route. . Therefore, the recommended route may not be the optimum route in a general navigation system. The recommended route is the route that departs from station A earliest and is a detour route to station F, but has a high probability of becoming a candidate route with many options for changing to another candidate route. The same applies to the candidate routes grouped as shown in FIG.

  In this embodiment, for each candidate route group of FIGS. 6 and 7 grouped by the candidate route grouping means 35, the detour route searching means 36 distinguishes the recommended route and the detour route by the following procedure. That is, the detour route search means 36 performs route search for each candidate route in the candidate route group again with reference to the traffic network data using the departure time of the predetermined Kth candidate route among the group candidate routes. (1) A candidate route with the earliest departure time at the departure station is preferentially output as a recommended route, and (2) a route with a later departure time is output as a detour route.

  Here, “K” of the predetermined Kth candidate route is determined based on the margin set in the detour route search condition. In other words, the margin is to set how much time to leave in order to arrive at the target station at the specified time, and can be specified in units of time, but in this embodiment, The numerical value of the margin 307 on the route search condition setting screen shown in FIG. 3 is selected. This numerical value indicates the number of candidate routes with the earliest departure time, starting from the route with the latest departure time, among the candidate routes included in the candidate route group that has been grouped by detour, as the target of the detour route and the recommended route. It means to do.

  In FIG. 6 and FIG. 7, two candidate routes are grouped, but in reality, there are many candidate routes, and in order from the candidate route with the latest departure time (optimal route) It is determined from the viewpoint of going back to obtain a detour route, that is, how many detour routes are prepared. Normally, K is set to about “3”. However, when the distance between the departure point and the destination is far, the value of K may be increased.

  Next, the detour route search means 36 is the Kth among the grouped candidate routes, that is, the Kth ranking as the optimum route, and the candidate route of that group is the Kth from the latest departure time. Is the route of interest. Then, referring to the departure time of the route of interest, the route search is performed again from the departure time to the same destination in the same departure direction. This detour route search is a route search based on the departure time reference, and after the departure time of the Kth candidate route, a route that satisfies the initial arrival time condition that is the first route search condition is re-searched. is there. Each route obtained as a search result of the detour route is sorted in order of early departure time.

  As a result of the sorting, as described above, the route having the earliest departure time is set as the recommended route, and the route having the subsequent departure time is set as the detour route. That is, in FIG. 6, when the departure time at which candidate route RT1 departs from station A is earlier than the departure time at which candidate route RT3 departs from station A, candidate route RT1 is the recommended route and candidate route RT3 is detoured. It is a route. The same applies when there are candidate routes other than RT1 and RT3. The candidate route that departs from the departure station earliest is the recommended route, and the other candidate routes are the detour routes.

  The detour route search means 36 performs a similar detour route search for the other group candidate routes grouped by the candidate route grouping means 35. In the candidate routes shown in FIG. If the candidate route RT4 is earlier than the departure time leaving the station A, the candidate route RT2 is the recommended route and the candidate route RT4 is the detour route.

  In FIG. 6, if another candidate route (operation schedule) is not found particularly when re-searching for a detour route based on the departure time of candidate route RT3, candidate routes RT3 and RT1 remain as routes, In this case, if the candidate route RT3 has an early departure time, this route becomes the recommended route, and the candidate route RT1 is output as a detour route from station B.

  This combination is effective in a scenario of starting at the detour route RT1 and arriving at the F station on the recommended route RT3 before the B station → C station → F station is disconnected due to a failure. If it is found that there is a failure between the B station, the E station, and the F station on the recommended route RT3, the route can be switched to the detour route RT1 at the B station. The loss of both paths is stochastically lower, resulting in a plan that is resistant to failure.

  The same applies to FIG. 7, and in this candidate route group, candidate route RT2 is a normal optimum route, but candidate route RT4 also exists. Candidate route RT4 is a route that is not normally selected, but nevertheless does not pass the same route more than once, so it is a possible route for route search. Even in this candidate route group, even if a failure occurs between E station → F station, leaving candidate route RT4 as a recommended route, there is still room to detour from E station → B station → C station → F station. ing. (If there is no obstacle between E station → F station, if it is a train that can go straight from D station → E station → F station, displaying it so that it can be understood is suitable for determining the detour)

  As described above, according to the detour route search according to the present invention, for each route group having the same departure direction at the departure station or transfer station, the recommended route that departs from the departure station first and the detour route that departs from the departure station thereafter. Therefore, even if a failure occurs while moving according to the recommended route guided according to the set margin, the user can change to the guided detour route and reach the destination by a predetermined time. You will be able to arrive.

  In addition, for each route group having the same departure direction at the departure station or transfer station, the departure time of the Kth candidate route set in advance is used as a route based on the departure time of the departure place and Since a route satisfying the arrival time is searched, a recommended route that leaves the departure station earliest and a detour route that leaves the departure station after that can be guided.

  Furthermore, for each route group having the same departure direction at the departure station or transfer station, the route is based on the departure time of the departure place using the preset departure time of the Kth candidate route, and the route to the destination When searching for a route that satisfies the arrival time, if the route search is performed while relaxing the restrictions on transportation, the range of the detour route to be searched can be expanded. Therefore, since the recommended route that departs from the departure station first and the detour route that departs from the departure station after that can be guided, the user has some trouble while moving according to the recommended route that is guided according to the set margin. Even if it occurs, it is possible to expand the alternative route options that can reach the destination by a predetermined time.

  The results of the detour route search are output like a display screen as shown in FIG. On the display screen 401, there is a display of “ON” in the bypass route search display column 402, and in the route display column 403, the recommended route, the bypass route 1, and the bypass route 2 are classified by departure direction (by grouped candidate route). The route guidance is displayed as follows. In the message field 404, comments regarding map display and detour route transfer guidance are displayed, and it is possible to display a map and receive transfer guidance when a circumstance using the detour route occurs.

  Next, a detour route search procedure according to the embodiment of the present invention will be described with reference to the flowchart shown in FIG. First, in the process of step S101, the route search server 30 receives a route search request based on the route search condition set using the input screen shown in FIG. When receiving the route search request, the route search server 30 determines whether the request is a bypass route search in the process of step S102.

  In the determination process of step S102, when the route search request is not a bypass route search but a normal route search request, the process proceeds to step S107, a normal route search is executed, and the process ends. If the route search request is a detour route search request, the process proceeds to step S103. As a detour route search condition, first, it is necessary to search for arrival time at the destination, and then it is checked that the transportation condition is included in the search condition. When only the vehicle route search is performed, the processing is shifted to the normal route search because it is not compatible with the present invention.

  In the process of step 103, the route search means performs a normal route search specifying arrival time at the destination. In this route search, not only the optimum route search but also a plurality of candidate routes are searched. Normally, it is common to obtain the third route to the fifth route, but the present invention seeks as many candidate routes as possible. The route search method can be performed, for example, by the method disclosed in Patent Document 2, and the route search for arrival time designation can be obtained by reversely performing the route search from the arrival side.

  Next, in the process of step S104, the candidate route grouping means 35 groups the candidate routes searched in step S103. The candidate routes to be grouped are grouped candidate routes having the same departure direction. Here, the meaning that the departure directions are the same means that, in a narrow sense, the first use route from the departure station is the same, but in a broad sense, the first use station from the departure place can be the same route. . In particular, in the route search system disclosed in Patent Document 2, a plurality of surrounding stations can serve as departure stations. Therefore, grouping may be performed for each station first.

  Next, for each grouped candidate route, the detour route searching means selects the candidate route of interest according to the margin and performs the following route search in the process of step S105. As described above, the candidate route of interest is the Kth candidate route in one candidate route group. The K-th route is the K-th candidate route from the one with the highest rank as the optimum route and the group having the latest departure time.

  Then, referring to the departure time of the route of interest, the route search is performed again from the departure time to the same destination in the same departure direction. This detour route search is a route search based on the departure time reference, and after the departure time of the Kth candidate route, a route that satisfies the initial arrival time condition that is the first route search condition is re-searched. is there.

  Next, the detour route search means 36 sorts the routes re-searched as described above in order of early departure time in the process of step S106, and outputs a recommended route and a detour route. For the routes sorted in order of departure time, as described above, the route having the earliest departure time is set as the recommended route, and the route having the subsequent departure time is output as the detour route, and the processing is terminated. For example, in FIG. 6, when the departure time at which candidate route RT1 departs from station A is earlier than the departure time at which candidate route RT3 departs from station A, candidate route RT1 is the recommended route and candidate route RT3 is detoured. It is a route.

  Of the routes in the candidate route group obtained in this way, the recommended route (optimum route) is a route that can be detoured to the route that departs thereafter, so that the optimum route in the group is output as a route that takes the detour into consideration. And it is good to put a display at the point where it branches as a detour route. Alternatively, a hyperlink may be added to the route data so that the detour route can be referred to by a link operation and displayed.

  Note that in the detour route search in step S105, when the route search for the candidate route group is performed again, an option that relaxes the use restriction of the transportation facility may be added. For example, even if the setting “Don't use paid express” is normally valid, re-searching for each grouped candidate route group invalidates the setting, and offers many possibilities of recoverable routes. May be.

  In the grouping of candidate routes, the group was divided for each initial departure direction, but the route after the transfer point in the middle was searched by the same rule, and the possible routes were further subdivided, and the extracted route A re-search may be performed from the earliest departure time to form a detour route group that can be branched.

  The detour route search according to the present invention cannot provide a complete solution (route guidance) that is not delayed with respect to the time of arrival at the destination. It is possible to provide a detour route that can be recovered in advance by means of a mobile navigation system, a PC site transfer guidance service, or the like.

1 is a system configuration diagram showing a configuration of a navigation system according to an embodiment of the present invention. It is a block diagram which shows the detailed structure of the navigation system concerning the Example of this invention. It is a figure which shows an example of the condition setting screen which sets the conditions of a detour route search. 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 example of the grouped candidate path | route for demonstrating the concept of the procedure of a detour path | route search. It is a schematic diagram which shows the example of the other candidate path | route grouped for demonstrating the concept of the procedure of a detour path | route search. It is a figure which shows an example of the display screen which guides the result of a detour route search. It is a flowchart which shows the operation | movement procedure of the route search server 30 in a detour route search.

Explanation of symbols

DESCRIPTION OF SYMBOLS 10 ... Navigation system 12 ... Network 20 ... Terminal device 21 ... Control means 22 ... Communication means 23 ... GPS reception means 24 ... Display means 25 Guide storage means 26 Setting condition storage means 27 Operation input means 30 Route search server 31 Control means 32 Guide data editing means 33 ... Communication means 34 ... Route search means 35 ... Candidate route grouping means 36 ... Detour route search means 37 ... Map data 38 ... Road network data 39 ...・ Transport network data

Claims (11)

Route search means for searching for a guide route including a route using a transportation facility from a departure point to a destination with reference to network data for route search, and a guide route for storing guide route data searched by the route search means In a navigation system comprising storage means and display means for displaying the guidance route,
The navigation system includes a route search unit that searches a plurality of candidate routes that can depart from a set departure point and arrive at a set destination at a set time, a candidate route grouping unit, and a detour route search unit; With
The candidate route grouping means groups candidate routes having the same departure direction from the departure point or transfer point, and the detour route searching means uses the set departure time of the Kth candidate route for the candidate route group. A navigation system, wherein each candidate route is searched again based on the network data, and the candidate route with the earliest departure time is set as a recommended route and the other candidate routes are output as detour routes.   The detour route searching means searches the candidate route group for each candidate route again based on the network data using a preset departure time of the Kth candidate route, and sets the Kth candidate set. The navigation system according to claim 1, wherein a plurality of routes are searched again based on the network data on the condition of a departure time of the route and the destination and arrival time at the destination.   The detour route searching means uses the departure time of the Kth candidate route set in advance for the candidate route group to search each candidate route again based on the network data. The navigation system according to claim 1 or 2, wherein a route search is performed by relaxing a restriction condition regarding a transportation facility to be used, which is set together with a destination, a destination, and an arrival time at the destination. In a route search server that is connected via a network to a terminal device that sets a desired starting point and destination, and that searches for a plurality of candidate routes between two set points based on a request from the terminal device,
The route search server refers to network data for route search, and includes a plurality of candidate routes including routes using a transportation facility that can depart from a set departure point and arrive at a set destination at a set time. A route search means for searching for, a candidate route grouping means, and a detour route search means,
The candidate route grouping means groups candidate routes having the same departure direction from the departure point or transfer point, and the detour route searching means uses the set departure time of the Kth candidate route for the candidate route group. A route search server that searches each candidate route again based on the network data, outputs a candidate route with the earliest departure time as a recommended route, and outputs another candidate route as a detour route.   The detour route searching means searches the candidate route group for each candidate route again based on the network data using a preset departure time of the Kth candidate route, and sets the Kth candidate set. 5. The route search server according to claim 4, wherein a plurality of routes are searched again based on the network data on the condition of a departure time of the route, the destination, and an arrival time at the destination.   The detour route searching means uses the departure time of the Kth candidate route set in advance for the candidate route group to search each candidate route again based on the network data. 6. The route search server according to claim 4, wherein the route search is performed by relaxing a restriction condition regarding a transportation facility to be used, which is set together with the place, the destination, and the arrival time at the destination. A route search method in a route search server that is connected via a network to a terminal device that sets a desired starting point and destination and searches for a plurality of candidate routes between two set points based on a request from the terminal device In
The route search server refers to network data for route search, and includes a plurality of candidate routes including routes using a transportation facility that can depart from a set departure point and arrive at a set destination at a set time. A route search means for searching for, a candidate route grouping means, and a detour route search means,
The candidate route grouping unit groups candidate routes having the same departure direction from the departure point or transfer point, and the detour route searching unit determines the departure time of the set Kth candidate route for the candidate route group. A detour route search step for re-searching each candidate route based on the network data using the candidate route with the earliest departure time as a recommended route and outputting other candidate routes as detour routes. Route search method.   The detour route search step is configured to search for each candidate route again based on the network data using a preset departure time of the Kth candidate route for the candidate route group. The route search method according to claim 7, further comprising a process of searching for a plurality of routes based on the network data again on the condition of a departure time of the route, the destination, and an arrival time at the destination.   The detour route search step uses the departure time of the Kth candidate route set in advance for the candidate route group to search for each candidate route again based on the network data. 9. The route search according to claim 7 or 8, further comprising a route search process that relaxes a restriction condition relating to a destination, a destination, and an arrival time at the destination, and a restriction condition relating to a transportation system to be used. Method. Route search means for searching for a plurality of candidate routes including routes using a transportation facility that refers to network data for route search and can arrive at a set destination after leaving a set departure point And candidate route grouping means and detour route searching means,
The candidate route grouping means groups candidate routes having the same departure direction from the departure point or transfer point, and the detour route searching means uses the set departure time of the Kth candidate route for the candidate route group. A terminal device connected via a network to a route search server that searches each candidate route again based on the network data, outputs a candidate route with the earliest departure time as a recommended route, and outputs other candidate routes as a detour route. There,
The terminal device comprises an operation input means for setting, as route search conditions, at least a search for a detour route, a departure place, a destination, and a time to arrive at the destination.   The terminal device according to claim 10, wherein the terminal device includes a display unit, and displays information indicating the recommended route and information indicating a detour route on the display unit for each candidate route group.

Images