JP2006292447A - Route search method, navigation system including car travel, route search server, navigation terminal device, and program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To search the optimum route, including travel by a car such as a taxi, in a navigation system which enables route search and route guidance to be performed that combines walking and other means of transportation. <P>SOLUTION: This navigation system 10 is composed by providing a navigation terminal device 20, and a route search server 30 which searches a route from the point of departure to the point of destination under the shortest cost conditions, by representing a traffic network by denoting a point as a node and the section between points as a link, and using traveling time, traveled distance, fare, etc. as costs by the label-deciding method. The search server 30 is provided with an attribute information database 39, on which attribute information representing stations where changes to car travel can be performed is stored, and searches a route, by extracting stations satisfying a predetermined condition of being within a predetermined distance from the point of destination or departure from among the stations of means of transportation, and incorporating the route between the point of destination or departure and a station where a change to car travel can be performed into a traffic network or road network as a car route. <P>COPYRIGHT: (C)2007,JPO&INPIT

Description

  The present invention relates to a navigation system that searches and guides an optimal route by combining a walking route with a transportation system such as a train, and is particularly suitable for a user selection to move a section of a walking route using a taxi or a rental car. The present invention relates to a navigation system including vehicle movement, a route search server, a navigation terminal device, and a route search method.

  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.

  Such a navigation system and route search method are disclosed by the present applicant as “traffic network route search method and apparatus” in the following Patent Document 1 (Japanese Patent Laid-Open No. 2000-258184), for example. This route search navigation system expresses the route from the departure point to the destination point as road network and traffic network data with the point as a node and the link between the points as a link. This is a search for walking section and transportation section.

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

  The concept of the route search method disclosed in Patent Document 1 will be described in detail with reference to the drawings. FIG. 8 is an explanatory diagram for explaining the concept of the route search method disclosed in Patent Document 1. FIG. 8 shows a guide route when a route search between the departure point S and the destination G is performed using data of a general road network and a traffic network. In FIG. 8, as an example of a transportation network route of a transportation facility, a train line (link) is indicated by a bold line, and a station (node) is indicated by a circle (◯) or a double circle (◎). Among the stations on the train line (L1, L2, L3, L4), a mark ◯ indicates a station without a taxi rank, and a mark ◎ indicates a station with a taxi rank.

  When moving from the departure point S to the destination G by walking and using a train, first of all, there are three stations that are within a predetermined distance from the departure point S (for example, 10 km, dotted line portion S1 in the figure) in order of proximity. Stations (ST1, ST2, ST3) are extracted, and the walking route to the station (dashed lines RS1, RS2, RS3 in FIG. 8) is connected to the search train network. Similarly, on the destination G side, three (STG1, STG2, STG3) are extracted from stations within a predetermined distance (for example, 10 km, dotted line portion G1 in FIG. 8), and a walking route (one-dot chain line RG1, RG2 in the figure) is extracted. , RG3) to the search train network. At this stage, it is not yet known which station to use, but if a route search is performed using a known method such as the label determination method (Dijkstra method) using this combined network, the optimal route with the lowest cost is obtained. It is done.

  In the example of FIG. 8, three stations are connected from the departure point S and the destination G. However, if this number is increased, a more optimal solution may be obtained. However, as the number of connections (nodes) from the departure point S and destination G to the transportation operation network increases, the search load also increases, which can be realized depending on the capability of the route search server and the number of accesses to the route search server. It is preferable to increase the range.

JP 2000-258184 A (FIG. 4)

  As described above, a route search combining a train and a walk is realized using the technique disclosed in Patent Document 1 above, and a walk route from a departure point and a destination to a surrounding station is incorporated in a traffic network route. Now, it is possible to search for the optimum route.

  By the way, as a search result, the optimal walking route is usually shown from the station to the departure point and destination, but this walking route is not necessarily the walking section of the departure point and destination from the nearest station, When users do not want to walk too long, they actually use taxis at their discretion. However, the route search navigation system disclosed in Patent Document 1 has a problem to be considered when using a taxi.

  That is, there is a case where the route is not the optimum route guided as a result of the route search. For example, in the above route search, the route from the departure point to the nearest station and the route from the nearest station to the destination are routed on the premise of walking, but depending on the user, from the nearest station to the destination or from the departure point. In some cases, there is a desire to travel by car using a taxi or a rental car instead of walking the route to the nearest station. In such a case, the nearest station searched as a guide route may not always be the optimal station for using a taxi or a rental car. In particular, when a destination such as a tourist destination with unfamiliar geography is used as a destination, many users choose to use a taxi or a rental car as a route from the nearest station to the destination.

  For example, in urban areas, there are many stations where the front of the station is narrow and vehicle entry is prohibited. Also in the countryside, there are stations that have become Hashigami Station due to geographical conditions or do not have a sufficiently wide connecting road. To transfer to a taxi or rental car at such a station, you have to move by yourself or request a nearby car, which requires unexpected time and effort. Even though the above example is extreme, there are many stations without taxi stands or rental car offices. If the walking route is moved by car, the distance range for selecting the nearest station can be widened compared to walking, and the route search, especially the range of the nearest station for transportation, is expanded and provides different guidance routes. can do. However, the route search method of Patent Document 1 has a problem that such a search cannot be performed.

  Furthermore, as another example, there is a case where a route search is performed on the premise of movement at the last train. In this case, the result of the search by the conventional route search method tells the last train to the getting-off station. That is, in the conventional last train search, the last train to the connected station is referred from the train timetable. Therefore, if you connect to a route that says "the last train is early", the departure time will naturally be earlier. For example, in the last train search from Shinjuku to Kawasaki Shinmachi as a train route, taking into account the transfer time of the station on the way, JR Shinjuku departure 21:48 will be the final departure time. However, there may actually be slower trains that run to another station. If you allow taxis, you can expand your options for the last train. However, since most of the conventional last train search methods directly specify the departure station and the arrival station, there is a problem in that it is not possible to perform a last train search to return home including taxi use.

  Also, when using the last train, as in the case described above, there is a possibility that a route with a station where it is difficult to change to a taxi to get off is searched. Especially during the time period after the last train, taxis are concentrated at the station where the taxi stand is located, and it is difficult to take a taxi at other places. In this way, in particular, when changing from a transportation facility to a taxi or a rental car, the problem of whether it is possible to change to a taxi at the station has been considered so far in the conventional route search method as disclosed in Patent Document 1 above. It was never done. If the departure side gets on a taxi, it can reach the station or near the station relatively freely, so it does not become a serious problem as much as the destination side.

  As a result of various studies to solve the above problems, the inventor of the present application has accumulated the presence / absence of a taxi stand or a rental car office as data supplementing the traffic network data as attribute information of each station of the transportation facility. In the route search with the walking route as the car movement, the search range is expanded by a predetermined distance and the station having the taxi stand or the rental car office is extracted from the attribute information of the station, and the route is obtained by temporarily editing the traffic network data. The inventors have conceived that the above problems can be solved if the search is made, and the present invention has been completed.

  That is, the present invention aims to solve the above problems, and in route search by a combination of walking and other transportation, from the departure point to the boarding point of transportation or from the arrival point of transportation to the destination point If you use a taxi or a rental car until the last train, or if you are searching for a late train that arrives at a station with a taxi stand near the destination, An object of the present invention is to provide a navigation system including vehicle movement, a route search server, a navigation terminal device, and a program that enable route search.

In order to solve the above-mentioned problem, the invention according to claim 1 of the present application is
A navigation terminal device that requests a route search including car movement, and a route from the departure point to the destination point is expressed as a traffic network with the point as a node and a link between the points, and it is moved as a cost by a label determination method using a computer A navigation system comprising a route search server for searching under the shortest cost condition using time, travel distance, fare, etc.
The route search server includes an attribute information database that stores attribute information indicating stations that can be transferred to a car.
From the transportation stations, extract the stations that can be switched to the car movement within the specified conditions from the destination or departure point,
It is characterized in that a route search is performed by incorporating, as a vehicle route, between a station that can be switched to automobile movement and a destination or departure point in a traffic network or a road network.

The invention according to claim 2 of the present application is the navigation system according to claim 1,
As the predetermined condition, a station that can be transferred to a car within a predetermined distance from a destination point or a departure point is extracted.

The invention according to claim 3 of the present application is the navigation system according to claim 1,
As the predetermined condition, a station capable of transferring to a predetermined number of car movements is extracted in order from the destination point or the departure point.

The invention according to claim 4 of the present application is the navigation system according to claim 1,
As the predetermined condition, a station that can be transferred to a moving vehicle whose walking route distance from the destination point or departure point is a predetermined distance or more is extracted.

The invention according to claim 5 of the present application is the navigation system according to claim 4,
The predetermined distance is changed according to weather and a user.

The invention according to claim 6 of the present application is
It is equipped with an attribute information database that stores attribute information indicating stations that can be switched to automobile movement, and expresses the traffic network from the starting point to the destination point by using the node as the point and the link between the points as a label using a computer. In the route search method of a traffic network that searches under the shortest cost condition using travel time, travel distance, fare, etc. as costs by the confirmation method,
From the transportation stations, extract the stations that can be switched to the car movement within the specified conditions from the destination or departure point,
A route search method characterized by incorporating a route between a station that can be changed to automobile movement and a destination or departure point into a traffic network or road network as a vehicle route.

The invention according to claim 7 of the present application is the route search method according to claim 6,
As the predetermined condition, a station that can be transferred to a car within a predetermined distance from a destination point or a departure point is extracted.

The invention according to claim 8 of the present application is the route search method according to claim 6,
As the predetermined condition, a station capable of transferring to a predetermined number of car movements is extracted in order from the destination point or the departure point.

The invention according to claim 9 of the present application is the route search method according to claim 6,
As the predetermined condition, a station that can be transferred to a moving vehicle whose walking route distance from the destination point or departure point is a predetermined distance or more is extracted.

The invention according to claim 10 of the present application is the route search method according to claim 9,
The predetermined distance is changed according to weather and a user.

The invention according to claim 11 of the present application is
Express the traffic network from the starting point to the destination point, using the node as the point and the link between the points as the link, and using the computer to determine the cost by the label determination method, using the travel time, travel distance, fare, etc. as the shortest cost condition A route search server to search below,
It has an attribute information database that stores attribute information indicating stations that can be transferred to a car.
From the transportation stations, the stations that can be transferred to the car movement within the specified conditions from the destination point or the departure point are extracted, and the transportation network between the station that can change to the car movement and the destination point or the departure point is an automobile route. Alternatively, the route search is incorporated in a road network.

The invention according to claim 12 of the present application is the route search server according to claim 11,
As the predetermined condition, a station that can be transferred to a car within a predetermined distance from a destination point or a departure point is extracted.

The invention according to claim 13 of the present application is the route search server according to claim 11,
As the predetermined condition, a station capable of transferring to a predetermined number of car movements is extracted in order from the destination point or the departure point.

The invention according to claim 14 of the present application is the route search server according to claim 11,
Further, as the predetermined condition, a station that can be changed to a car movement with a walking distance from a destination point or a departure point being a predetermined distance or more is extracted.

The invention according to claim 15 of the present application is the route search server according to claim 14,
The predetermined distance is changed according to weather and a user.

The invention according to claim 16 of the present application is
It is connected via a network to a navigation terminal device that requests route search including car movement, expresses the traffic network from the starting point to the destination point, using the point as a node and the point-to-point as a link, and labels it using a computer A route search server that searches under the shortest cost conditions using travel time, travel distance, fare, etc. as costs by a deterministic method, and has an attribute information database that stores attribute information indicating stations that can be transferred to car movement To the computers that make up the route search server
A process of extracting a station that can be switched to a car movement within a predetermined condition from a destination point or a departure point among transportation stations;
A program for executing a route search by incorporating a train route between a station that can be transferred to a vehicle and a destination point or a departure point into a traffic network or a road network as a vehicle route.

The invention according to claim 17 of the present application is the program according to claim 16,
In the computer constituting the route search server,
As the predetermined condition, a process of extracting a station that can be transferred to a car within a predetermined distance from the destination or departure point is executed.

The invention according to claim 18 of the present application is the program according to claim 16,
In the computer constituting the route search server,
As the predetermined condition, a process of extracting a station that can be transferred to a predetermined number of car movements in order from the destination point or the departure point is executed.

The invention according to claim 19 of the present application is the program according to claim 16,
In the computer constituting the route search server,
As the predetermined condition, a process of extracting a station that can be transferred to a moving vehicle having a walking route distance from a destination point or a departure point that is a predetermined distance or more is executed.

The invention according to claim 20 of the present application is the program according to claim 19,
The predetermined distance is a process of changing according to weather and a user.

The invention according to claim 21 of the present application is
Express the traffic network from the starting point to the destination point, using the node as the point and the link between the points as the link, and using the computer to determine the cost by the label determination method, using the travel time, travel distance, fare, etc. as the shortest cost condition A route search server for searching below, which includes an attribute information database storing attribute information indicating stations that can be switched to automobile movement, and is within a predetermined condition from a destination or departure point of a transportation station A navigation terminal device connected via a network with a route search server that extracts stations that can be transferred to,
The navigation terminal device includes route search requesting means for requesting a route search including car movement.

The invention according to claim 22 of the present application is the navigation terminal device according to claim 21, wherein the route search requesting unit extracts a station that can be transferred to a car movement within a predetermined distance from a destination or departure point as the predetermined condition. It is characterized by specifying the distance for.

In the invention according to any one of claims 1 to 5, the navigation system includes an attribute information database storing attribute information indicating a station that can be switched to automobile movement, and the route search server includes a destination point of the transportation station. Alternatively, a station that can be switched to car movement within the specified conditions from the starting point is extracted, and the route between the station that can change to car movement and the destination or starting point is incorporated into the traffic network or road network as a car route. To do.
Therefore, the user can request a route search in which the walking section is a car movement such as a taxi or a rental car, and a station that can change to a car movement within the search range expanded compared to the case of walking is searched. It will be included in the route. For this reason, the range of selection can be expanded according to the user's preference, and the last train at a later time can be selected in the last train search.

In the route search method of the invention according to claims 6 to 10, the route search server includes an attribute information database storing attribute information indicating stations that can be switched to automobile movement, and the route search server is a destination point among transportation stations. Alternatively, a station that can be switched to car movement within the specified conditions from the starting point is extracted, and the route between the station that can change to car movement and the destination or starting point is incorporated into the traffic network or road network as a car route. To do.
Therefore, the user can request a route search in which the walking section is a car movement such as a taxi or a rental car, and a station that can change to a car movement within the search range expanded compared to the case of walking is searched. It will be included in the route. For this reason, the range of selection can be expanded according to the user's preference, and the last train at a later time can be selected in the last train search.

  In the inventions according to claims 11 to 15, it is possible to provide a route search server constituting the navigation system according to the inventions of claims 1 to 5, respectively. In the inventions according to claims 16 to 20, it is possible to provide a program for realizing the route search server according to the inventions of claims 11 to 15, respectively.

  In the inventions according to claims 21 and 22, it is possible to provide a navigation terminal device constituting the navigation system according to the inventions of claims 1 and 2, respectively.

  Hereinafter, specific examples of the present invention will be described in detail with reference to examples and drawings. FIG. 1 is a block diagram showing a configuration of a navigation system according to an embodiment of the present invention. FIG. 2 is a schematic diagram for explaining a road network for general route search. FIG. 3 is a schematic diagram for explaining a transportation operation network for general route search. FIG. 4 is a schematic diagram for explaining a guide route when a route search is performed for an unknown tourist destination using network data for search in which station data that can be changed to a taxi is added to the network data for transportation operation. FIG. FIG. 5 is an explanatory diagram of a search condition setting input screen for a navigation application implemented in a mobile phone that is an embodiment of the navigation terminal device in the navigation system according to the embodiment of the present invention. FIG. 6 is a flowchart showing an operation procedure of the route search server in the navigation system according to the embodiment of the present invention. FIG. 7 is a diagram for explaining a guide route when a route search between a departure point and a destination is performed using network data for search in which station data that can be changed to a taxi is added to general transportation network data. FIG.

  As shown in FIG. 1, the navigation system 10 according to the embodiment of the present invention includes a navigation terminal device 20 that communicates via a network 11 such as the Internet, and a route search server 30. The navigation 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 receives road network data and traffic network data according to the route search condition. The optimum route is searched with reference to the route, and the optimum route is edited into guide route data and distributed to the navigation terminal device 20.

  The route search server 30 includes a search road network DB 35 for route search that accumulates road network data (map data) for route search in a pedestrian navigation system and a car navigation system, and operation of transportation facilities such as train routes. A search traffic network DB 38 that stores the network, an attribute information DB 39 that stores stations that can be changed to taxis as attribute information, and network data editing means 37 are provided.

  The road network data accumulated in the search road network DB 35 is composed of node data, link data, and cost (link cost) data of each link. The road network includes, for example, roads as shown in FIG. In the case of roads A, B, and C, the end points, intersections, and inflection points of roads A, B, and C are used as nodes, roads that connect the nodes are represented by directional links, and node data (node latitude / Longitude), link data (link number), and link cost data (link distance or required time to travel the link) of each link as data. Yes.

  That is, in FIG. 2, ◯ and ◎ indicate nodes, and ◎ 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. 2, 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. 2, when a route search is performed with the departure point as the node AX and the destination as the node CY, the road travels from the node AX to the road A, turns right at the second intersection, enters the road C, and reaches the node CY. The link cost is accumulated sequentially, 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. 2, in reality there are other such routes, so a possible route 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.

  The road network data in the in-vehicle navigation system is composed only of roads where cars can pass, and roads for pedestrians such as roads for exclusive use of pedestrians, parks where the entrance of vehicles is prohibited, and walkways in station squares. Network data is not required. On the other hand, in the navigation system for pedestrians, in addition to the road network through which cars can pass, pedestrian roads such as the above-mentioned pedestrian-only roads and the passages in parks and station squares where vehicles are prohibited from entering. Although it is configured to include network data, it does not require network data for roads that are prohibited from walking, such as expressways. In the present embodiment, both network data are stored for automobiles and pedestrians.

  The transportation network data stored in the search traffic network DB 38 is basically composed of node data, link data, and cost (link cost) data for each link in the same way as road network data. However, the transportation cost of the transportation network is basically different from that of the road network.

  That is, in the road network, the link cost is fixed and static. However, in the transportation network, as shown in FIG. 3, trains and airplanes (hereinafter referred to as individual trains and airplanes) that operate the traffic route are used. Each route such as is referred to as transportation means), and the time of departure from a certain node and the time of arrival at the next node are determined for each transportation means (specified by timetable data and operation data) In addition, individual paths may not always link to adjacent nodes. 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. 3, a plurality of transportation means (routes) Aa to Ac... On the same link of the transportation route A, and a plurality of transportation means (routes) Ca to Cc.・ There will be. Therefore, unlike a simple road network, the transportation network of a transportation system has a data amount proportional to the total number of means of transportation (routes of individual aircraft, trains, etc.) for each node, link, and link cost. Compared to the amount of data, the network data has a huge amount of data. 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 transport network data, all the means of transportation that can be used (ride) when arriving from the departure point to the destination are searched. Thus, it is necessary to specify the transportation means that matches the search conditions. For example, in FIG. 3, when performing a route search with the departure point as the node AX of the traffic route A and specifying a certain departure time and the destination of the node CY of the traffic route C, the route operates on the traffic route A. All of the transportation means after the departure time are sequentially selected as the departure route from among the transportation means Aa to Ac, and the transportation route C is operated on the basis of the arrival time at the transit node to the transportation route C. Among all the transportation means Ca to Cc..., All the combinations of transportation means after the time that can be boarded at the transit node are searched and the required time of each route and the number of times of transfer are accumulated and guided.

  In the search attribute information DB 39, node data (latitude and longitude of the node) of the station where the car can be used, such as the presence or absence of a taxi stand or a rental car office, is accumulated as the attribute information of the station. Note that the data stored in the attribute information DB 39 does not necessarily have to be station node data. For example, it may be data in which a pair of a station node number and attribute information is stored.

  In the present embodiment, the network data editing means 37 uses the search road network DB 35 and the search road network DB 35 for data in the attribute information DB 39 when the user of the navigation terminal device 20 requests a route search including an automatic person movement. The data is temporarily added (temporarily edited) to the data in the traffic network DB 38. When a route search is performed in this way, for example, as shown in FIG. 4, even when a route search to an unknown tourist destination is performed, a route that reaches the destination early as a result is selected.

  That is, as shown in FIG. 4, a walking route (R1, R2) is connected from the destination G to at least the stations ST1, ST2. The destination G is 6.1 km (about 74 minutes) from the station ST1 and 7.8 km (about 94 minutes) from the station ST2. The train travel time between the stations ST1 and ST2 is 4 minutes. Since there is a cost difference of 20 minutes in walking time, in the conventional route search, the station ST1 becomes a lower station of the search result.

  However, since the walking route is 6.1 km, the user will use a taxi to go to his destination unless he is hiking. However, in reality, the station ST1 is a small, secluded station with no taxi stand. In addition, there is a case where a person who does not have a public phone and does not have a mobile phone cannot call a taxi. Station ST2 is a large station with a taxi stand. For example, the station corresponding to the station ST1 is Ochiaigawa Station on the Chuo Main Line, and the place that was originally a signal station has become an unmanned station, but the connecting road is also very narrow, and it is an inaccurate station for taxi use. A taxi is always waiting at Nakatsugawa Station, which is adjacent to station ST2. If you get off at station ST1 without knowing it, it will be difficult. If you change to a taxi at station ST2, you can reach your destination as soon as possible.

  As described above, if the route search is performed in consideration of the data of the station where the taxi stand is located, the route of FIG. 4 has a small time cost for the route using the taxi from the station ST2, so a route to get off at the station ST2 is required. Even if it is a shortcut on foot, the route that passes through the station ST1 without a taxi rank is disadvantageous, and is not searched.

  In the system configuration of FIG. 1, the network data editing unit 37 adds the data of the attribute information DB 39 to the data of the search road network DB 35 and the data of the search traffic network DB 38 when searching for a route. However, the network data of the search traffic network DB 38 can be configured by adding the data of the attribute information DB 39 in advance. Even if it comprises in this way, it does not influence a normal route search.

  The route search server 30 includes control means 31, route guidance means 32, display means 33, and communication means 34. The control means 31 is mainly composed of a microprocessor, and includes storage means such as RAM and ROM as in a general computer device, and controls each part by a program stored in these storage means. The communication means 34 is for receiving a route search request from the navigation terminal device 20 and for delivering guide route data as a result of the route search to the navigation terminal device 20, and the display means 33 is for the route search server 30. It is a display unit such as a liquid crystal display unit for performing the monitor display.

  The route guidance means 32 creates guidance route data based on the data of the optimum guidance route searched by the route search means 36 and distributes it to the navigation terminal device 20. In the guide route data, guide points such as a departure point on the guide route searched by the route search means 36, a turning point of the route, an intersection, and a destination are set, and the position coordinates (latitude / longitude) of these guide points are set. , Guidance information related to each guidance point (including guidance information for going straight and turning left and right. The navigation terminal device 20 receives this guidance route data, displays the route, and displays or outputs the guidance at the guidance point by voice. To do.

  On the other hand, the navigation terminal device 20 includes a control unit 21, a communication unit 22, a position detection unit 23, a route search request editing unit 24, a guidance data storage unit 25, and an operation / display unit 26. The position detector 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 / display means 26 includes a key, a dial, a liquid crystal display device, etc., inputs for operating the navigation terminal device 20, inputs such as a departure point and a destination, and guidance of guidance route data distributed from the route search server 30. It is used for displaying routes and maps. The route search request editing unit 24 uses the starting point and destination input using the operation / display unit 26 or the current position of the navigation terminal device 20 measured by the position detecting unit 23 as the starting point. Based on the above, a route search request to be transmitted to the route search server 30 is created.

  The guidance data storage means 25 stores guidance route data, map data, guidance, etc., which are route search results distributed from the route search server 30, and these data are stored as needed from the guidance data storage means 25. It is read out and displayed on the operation / display means 26. 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 position detection means 23. The current position mark is displayed at the center of the display screen. Since the measured position information includes an error, route matching processing is performed to correct the current position on the guide route when the current position is deviated from the guide route. 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.

  FIG. 5 is an explanatory diagram of a search condition setting input screen of a navigation application (navigation application) implemented in a mobile phone that is an example of the navigation terminal device in the navigation system according to the first embodiment of the present invention.

  As shown in FIG. 5, the input screen includes settings of “departure place” and “destination”, and “use date” and “time” for performing a search according to an actual train timetable. The time has a setting of whether it is departure time or arrival time. The “last train” is the route that can delay the departure most, and the “first departure” requires the route that can start the day and reach the destination earliest. When “automatic search” is pressed, a detailed condition starts a search according to a preset condition.

  If you scroll further down, you will find detailed setting items. When “Vehicle + Walk” is selected, the permitted vehicles (airplane, Shinkansen, toll express, taxi, etc.) can be set. When the “use taxi” check box is selected, the present invention will function. In addition, you can set how long the taxi is used. Currently, the initial taxi fare for a taxi is about 2 km, so 2 km is set as the initial value, and depending on the user, 1 km may be selected.

  Even if the distance is not particularly set, the walking speed (described later) may be interlocked such that a person who selects “Skeka” is 3 km or more, and a person who selects “slow” is 1 km or more. Alternatively, if the user's profile is set in a mobile phone (navigation terminal device), the elderly person may be set to use a taxi at 500 m or more. The route search server can also obtain local weather information from the weather server via the Internet, so it automatically sets the lower limit of the usage distance if there is rain, snow, cold waves, extreme heat, or when a forecast is issued. You can also pull it down.

  If you check "Car", this is not a taxi but a car route that uses a rental car from the departure point to the destination. If you check "Walk only", you will search for only walking routes without using transportation. However, there is a limit of up to 10 km, for example.

  “Search criteria” can be selected from “in order of short travel time”, “in order of low fare”, “in order of small number of transfers”, and “in order of few walks (short walking distance)”. The conflicting conditions are appropriately prioritized. For example, when the last train or the first train is designated, the required time is automatically in the order of shortest time.

  “Walking speed” is estimated to be 5 km / h per hour for “standard”, 6 km / h for “sakeka”, and 4 km / h for “slow”, and the time cost of the walking section is estimated.

  Then, when “save setting” is pressed, the setting is stored as a condition for subsequent automatic search. “Start search” is a button for starting the search with the current settings without saving the setting conditions.

  FIG. 6 is a flowchart showing an operation procedure of the route search server in the navigation system according to the embodiment of the present invention. Hereinafter, the operation procedure of the navigation system in the present embodiment will be described with reference to FIG.

  In FIG. 6, when the route search server 30 receives a route search request from the navigation terminal device 20 (mobile phone) in the process of step S100, the route search server 30 performs route search based on the data of the detailed setting items set as the route search conditions. The means 36 determines whether “walk only” is selected as the detailed setting item in the process of step S101.

  In the determination process of step S101, if only walking is not selected, the process proceeds to step S102, and it is determined whether “automobile” is selected as the detailed setting item. If “automobile” is not selected in the determination process in step S102, the process proceeds to step S105, and the network data editing unit 37 applies the present invention as described above to change the station of the traffic network from the departure point and the destination. Until the walk route and taxi route (car movement route) are connected.

  Next, proceeding to the processing of step S106, the route search means 36 performs a multimodal route search of the vehicle and the foot on the traffic network edited in step S105.

  On the other hand, in the determination process of step S101, if the request is for only a walking route, the process proceeds to step S103, and the route search means 36 performs a walking-only route search with reference to the data in the search road network DB 35. Similarly, in the determination process of step S102, if it is a request for an automobile route, the process proceeds to the process of step S104, and the route search means 36 performs route search dedicated to the automobile with reference to the data in the search road network DB 35.

  When the result of the route search by the route search means 36 is obtained by the above processing, the route guide means 32 creates guide route data in the process of step S107, and the navigation terminal device 20 (mobile) via the communication means 34. The route information is transmitted to the telephone), and the processing ends.

  FIG. 7 is a diagram for explaining a guide route when a route search between a departure point and a destination is performed using network data for search in which station data that can be changed to a taxi is added to general transportation network data. FIG.

  As in FIG. 8, in FIG. 7, as an example of a transportation network route of transportation, a train line (link) is indicated by a bold line, and a station (node) is indicated by a circle (◯) or a double circle (◎). ing. Of the stations on the train line, the circles indicate the stations without taxi ranks, and the stations marked with the circles indicate stations with taxi ranks.

  When connecting the route from the departure point S and the destination G to the transportation network, the walking route is connected as shown in FIG. 8. Connect to the traffic network by route. If the station connected by the walking route is a station that can also use a taxi, the taxi route may be connected if the walking route is 2 km (adjustable) or more. In addition, taxis cost a fee but can be moved over long distances, so they may be extracted from stations that are wider than walking (for example, 15 km), or at least three stations may be extracted in order of proximity.

  In FIG. 7, as a result, stations ST10 and ST20 with taxis are newly extracted, and routes (dashed lines R10 and R20 in the figure) are connected. In particular, the station ST20 is a route that is not assumed only by walking, which means that the search range has expanded. If the range is widened, the station ST11 is also extracted.

  If the route search is performed with such a configuration, the station ST10, ST20, or the station ST11 becomes a search target, and it is possible to obtain a final train search result with a delayed departure time by using the station. Become.

As a result, for example, when a user who has a home near a station in Kawasaki Shinmachi performs a final train search from Shinjuku, the following search result is obtained.
From Shinjuku 00:12 Yamanote Line-Shinagawa-Keihin Tohoku Line-Arrival at Kawasaki 00:56
From Kawasaki Station West Exit Taxi 01:01-Arrival at Watada Sannocho, Kawasaki-ku, Kawasaki City 01:10 (2.4km)
Taxi late night charge ¥ 980
From these results, it is possible to extend the stay in Shinjuku for 2 hours and 24 minutes compared to the conventional search in which Kawasaki Shinmachi was chosen as the stop station.

  As described above in detail, according to the navigation system according to the present invention, in the navigation system for pedestrians that enables route search and route guidance by a combination of a walking route and other transportation means, within a predetermined condition Therefore, it is possible to provide a navigation system that can appropriately search and guide a route using a taxi.

  If the route network for the last train search is improved, the link data of the stations that can be transferred from the destination point to the taxi within the specified conditions from the transportation stations as mentioned above will increase. The number of opportunities to search for a route from the starting point or the destination increases, so the convenience of the navigation system according to the present invention is effective.

  In the above-described embodiment, an example in which the distance between a station that can be switched to automobile movement and a destination point or a departure point is incorporated in the traffic network data as an automobile movement route is described. However, the route of the transportation facility is incorporated in the road network. A search may be made using data of the traffic network, and a route between the destination or departure point and the station may be searched using the road network data.

  Since the present invention is centered on a route search method, the present invention is not limited to the embodiment, and may be executed by a navigation application of a mobile phone or when a route search service is provided at a site connected to the Internet by a personal computer. May be.

It is a block diagram which shows the structure of the navigation system concerning the Example of this invention. It is a schematic diagram for demonstrating the road network for a general route search. It is a schematic diagram for demonstrating the transport system operation network for a general route search. It is a schematic diagram for demonstrating the guidance route | root at the time of carrying out the route search which makes the destination a strange tourist destination using the network data for a search which added the station data which can transfer to a taxi to transportation system network data. It is explanatory drawing of the search condition setting input screen of the navigation application implemented with the mobile telephone which is one Example of the navigation terminal device in the navigation system concerning the Example of this invention. It is a flowchart which shows the operation | movement procedure of the route search server in the navigation system concerning the Example of this invention. It is a schematic diagram for explaining the guide route when searching for a route between the departure point and the destination by using network data for search in which station data that can be transferred to a taxi is added to general transportation network data. is there. It is a schematic diagram for demonstrating the guidance route | route at the time of searching for the route | route between a departure place and the destination using general transport system operation network data.

Explanation of symbols

10. Navigation system 11 ... Network 20 ... Navigation terminal device 21 ... Control means 22 ... Communication means 23 ... Position detection means 24 ... Route search Request editing means 25... Guidance data storage means 26... Operation and display means 30... Route search server 31. Means 34 ... Communication means 35 ... Search road network DB
36 ... Route search means 37 ... Network data editing means 38 ... Traffic network DB for search
39 .... Attribute information DB

Claims (22)

A navigation terminal device that requests a route search including car movement, and a route from the departure point to the destination point is expressed as a traffic network with the point as a node and a link between the points, and it is moved as a cost by a label determination method using a computer A navigation system comprising a route search server for searching under the shortest cost condition using time, travel distance, fare, etc.
The route search server includes an attribute information database that stores attribute information indicating stations that can be transferred to a car.
From the transportation stations, extract the stations that can be switched to the car movement within the specified conditions from the destination or departure point,
A navigation system characterized in that a route search is carried out by incorporating a route between a station that can be switched to automobile movement and a destination or departure point into a traffic network or a road network as an automobile route.   The navigation system according to claim 1, wherein a station that can transfer to a car within a predetermined distance from a destination point or a departure point is extracted as the predetermined condition.   2. The navigation system according to claim 1, wherein as the predetermined condition, a station capable of transferring to a predetermined number of car movements is extracted in order from a destination point or a departure point.   2. The navigation system according to claim 1, wherein a station that can be switched to moving a vehicle whose walking route distance from the destination or departure point is a predetermined distance or more is extracted as the predetermined condition.   The navigation system according to claim 4, wherein the predetermined distance is changed according to weather and a user. It is equipped with an attribute information database that stores attribute information indicating stations that can be switched to automobile movement, and expresses the traffic network from the starting point to the destination point by using the node as the point and the link between the points as a label using a computer. In the route search method of a traffic network that searches under the shortest cost condition using travel time, travel distance, fare, etc. as costs by the confirmation method,
From the transportation stations, extract the stations that can be switched to the car movement within the specified conditions from the destination or departure point,
A route search method characterized by incorporating a route between a station that can be switched to automobile movement and a destination or departure point into a traffic network or road network as a vehicle route.   The route search method according to claim 6, wherein a station that can be transferred to a car movement within a predetermined distance from a destination point or a departure point is extracted as the predetermined condition.   The route search method according to claim 6, wherein as the predetermined condition, stations that can be transferred to a predetermined number of car movements are extracted in order from a destination point or a departure point.   The route search method according to claim 6, wherein a station that can be changed to a car movement having a walking route distance from a destination point or a departure point that is a predetermined distance or more is extracted as the predetermined condition.   The route search method according to claim 9, wherein the predetermined distance is changed according to weather and a user. Express the traffic network from the starting point to the destination point, using the node as the point and the link between the points as the link, and using the computer to determine the cost by the label determination method, using the travel time, travel distance, fare, etc. as the shortest cost condition A route search server to search below,
It has an attribute information database that stores attribute information indicating stations that can be transferred to a car.
From the transportation stations, the stations that can be transferred to the car movement within the specified conditions from the destination point or the departure point are extracted, and the transportation network between the station that can change to the car movement and the destination point or the departure point is an automobile route. Alternatively, a route search server that is incorporated in a road network and searches for a route.   The route search server according to claim 11, wherein a station that can change to a car movement within a predetermined distance from a destination point or a departure point is extracted as the predetermined condition.   12. The route search server according to claim 11, wherein as the predetermined condition, stations capable of transferring to a predetermined number of car movements are extracted in order from a destination point or a departure point.   The route search server according to claim 11, further comprising: extracting a station that can be transferred to a moving vehicle whose walking route distance from the destination or departure point is a predetermined distance or more as the predetermined condition.   The route search server according to claim 14, wherein the predetermined distance is changed according to weather and a user. It is connected via a network to a navigation terminal device that requests route search including car movement, expresses the traffic network from the starting point to the destination point, using the point as a node and the point-to-point as a link, and labels it using a computer A route search server that searches under the shortest cost conditions using travel time, travel distance, fare, etc. as costs by a deterministic method, and has an attribute information database that stores attribute information indicating stations that can be transferred to car movement To the computers that make up the route search server
A process of extracting a station that can be switched to a car movement within a predetermined condition from a destination point or a departure point among transportation stations;
A program for executing a route search by incorporating a vehicle route between a station that can be switched to automobile movement and a destination point or a departure point as a vehicle route into a traffic network or a road network. In the computer constituting the route search server,
17. The program according to claim 16, wherein as the predetermined condition, a process of extracting a station that can be transferred to a car within a predetermined distance from a destination point or a departure point is executed. In the computer constituting the route search server,
17. The program according to claim 16, wherein, as the predetermined condition, a process of extracting a station that can be transferred to a predetermined number of car movements in order from a destination point or a departure point is executed. In the computer constituting the route search server,
17. The program according to claim 16, wherein a process for extracting a station that can be transferred to a moving vehicle having a walking distance from a destination point or a departure point that is a predetermined distance or more is executed as the predetermined condition.   The program according to claim 19, wherein the predetermined distance is a process of changing according to weather and a user. Express the traffic network from the starting point to the destination point, using the node as the point and the link between the points as the link, and using the computer to determine the cost by the label determination method, using the travel time, travel distance, fare, etc. as the shortest cost condition A route search server for searching below, which includes an attribute information database storing attribute information indicating stations that can be switched to automobile movement, and is within a predetermined condition from a destination or departure point of a transportation station A navigation terminal device connected via a network with a route search server that extracts stations that can be transferred to,
The navigation terminal device includes route search requesting means for requesting a route search including car movement.   The navigation terminal according to claim 21, wherein the route search request means designates a distance for extracting a station that can be transferred to an automobile within a predetermined distance from the destination or departure point as the predetermined condition. apparatus.

Images