JP2009103657A - Navigation system, server and method for route search, and terminal device - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To give a guidance on a station having fewer entrance lines and less possibility of causing a mistake or missing of a child, as a junction, in the case when there are stations having a number of entrance lines, on the occasion of searching for a candidate route for going from an arbitrary starting place to a destination by using traffic facilities. <P>SOLUTION: A navigation system 10 has an entrance additive cost calculating means 37 which calculates entrance additive cost, based on the entrance line information accumulated in a station line information database 36, and a network data editing means which adds the calculated entrance additive cost to change-of-train cost contained in route cost, including transfer cost, which is accumulated in network data 35 for a route search. On the occasion of searching for a route in a change-of-train facilitating recommendation mode, a route search means 33 searches for an optimum route, based on the route cost calculated by adding the entrance additive cost to the change-of-train cost contained in the route cost, including the transfer cost. <P>COPYRIGHT: (C)2009,JPO&INPIT

Description

  The present invention relates to a navigation system that searches for and guides candidate routes from an arbitrary starting point to a destination by using walking, automobiles, or public transportation, and in particular, any starting point using transportation. When searching for a candidate route from the ground to the destination, if there are many transfer routes at the transfer station, the navigation system will guide the station as a transfer station with fewer transfer routes and less chance of mistakes or getting lost. The present invention relates to a system, a route search server, a route search method, and a terminal device.

  2. Description of the Related Art Conventionally, navigation devices and navigation systems that search for a route from a desired departure place to a destination by using map data and road data and guide a user are known. As such a navigation device and navigation system, a car navigation device that is installed in an automobile and guides the route to the driver, a route search request is sent from the terminal device to the route search server via the network, and the result is received. Communication-type navigation systems that receive route guidance have been put into 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. The route search server uses the road (route) of the map data as the node, the position of the inflection point as the node, the route connecting each node as the link, and the cost information (distance and travel time) of all the links in the database As prepared. Then, the route guidance server refers to the database, sequentially searches for links from the departure node to the destination node, and traces the node and link with the smallest cost information of the link to obtain a guidance route. The shortest route can be guided to the navigation terminal. As such a route search method, a method called label determination method or Dijkstra method is used.

  Furthermore, as a navigation system for pedestrians, it is preferable to add a route guidance function including transportation, and in addition to walking route search and guidance, the route search server accumulates transportation route and operation time data. In addition, there is 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.

  A route search system for searching for a route using such a transportation system includes an operation time database in which operation time data of each transportation facility is databased as route search data, an in-vehicle navigation system, and a pedestrian navigation system. As with the road network data in, in addition to the data that networked each station on a traffic route as a node and a two-way link between stations, the operation time and movement of each link for each means of transportation operated on each traffic route It has a database of a traffic network with time added as link cost data. Furthermore, there is a system in which fare data is added and the fare of the searched guide route is guided together.

  Then, based on the route search request such as departure date / time, departure place, destination, arrival time specified by the user, refer to these databases and use the connection between departure place and destination including transfer (transfer) Follow each possible means of transportation (individual trains and buses) as a route, and select one guide route (departure station, destination station, route, train, etc.) that matches the route search conditions. It is configured to present multiple items. In general, as route search conditions, conditions such as travel time, number of transfers, and fare can be specified.

  From such a technical background, a technique for searching and guiding a route including a connection from a departure place to a destination using a transportation facility is disclosed in, for example, the following Patent Document 1 (Japanese Patent Laid-Open No. 2006-193020). It is disclosed as “navigation system, route search server, portable terminal device and program thereof”. The system disclosed in Patent Document 1 includes a transfer time DB in which data relating to transfer times at transfer locations is accumulated, and performs route search by optimizing transfer times at each transfer location to transfer times according to the actual situation. Is.

  The route search system includes a transfer time DB that accumulates transfer times at transfer locations, a transfer time collection unit that collects transfer times from mobile terminal devices, and a transfer time for each transfer location collected by the transfer time collection unit. And statistical processing means for calculating the transfer time for each transfer location by statistically processing the data of, and is configured to update the transfer time accumulated in the transfer time DB with the transfer time calculated by the statistical processing means. ing.

  Further, a technique for providing a user with an appropriate traffic route that takes into account the transfer time is disclosed in, for example, the following Patent Document 2 (Japanese Patent Laid-Open No. 2007-183880): “Traffic Route Guidance System, Traffic Information Providing Device, Traffic It is disclosed as “route receiving terminal and traffic route guide terminal”.

The system disclosed in this patent document 2 is a terminal that transmits a traffic route search request for searching for a traffic route from a departure point to a destination, and receives the traffic route search request from the terminal to change the transportation system. A traffic route guidance system comprising a traffic information providing device that searches for a traffic route including a required transfer time and transmits it to the terminal. The traffic information providing device performs a transfer time for each traffic route search request received from the terminal. And a traffic route search means for searching for a traffic route including the transfer time using the transfer time estimated by the transfer time estimation means. In other words, this traffic route guidance system is provided with a transfer time estimation means for estimating the transfer time according to the congestion status of the transfer route and the characteristics of the owner of the mobile terminal, and performs a route search considering the transfer time individually. It is possible to provide an appropriate route to the user.
Japanese Patent Laying-Open No. 2006-193020 (FIG. 1, paragraphs [0045] to [0048]) Japanese Patent Laying-Open No. 2007-183880 (FIG. 3, paragraphs [0035] to [0045])

  As disclosed in the above-mentioned Patent Document 1 or Patent Document 2, a user searches for a route from a departure point to a destination by using a transportation facility, and the optimum movement route includes movement by train. In some cases, route guidance is generally performed in consideration of train timetables and transfer times. In particular, transfer time data is collected from the actual station transfer time data and estimated based on the data at the time of route guidance, or estimated from the individual conditions of the user and the congestion rate within the station premises. The actual time required to transfer trains is converted. As described above, according to the conventional technique, a route search in which the time required for transfer is calculated in each user's state is performed in consideration of the congestion rate in the station premises.

  However, when the user actually gets off at the transfer station, the number of routes to enter the transfer station may be very large. Even if the user knows the transfer route to which he / she should get on, there are many other routes that enter the station, so it may be very difficult to understand which route he / she is on. In particular, in the case of a large station where many routes are used, it is very easy for elderly people and elementary and junior high school students to get lost. .

  In addition, some users wish for a route with a small number of transfers and a short travel time, but also consider the balance with other conditions other than the number of transfers, such as time, fare, or walking distance. There is an increasing need to provide a route search service that can obtain a comprehensively optimal route.

  The inventor of the present application has conducted various studies to solve the above problems, and as a result, when the number of transfer lines at the transfer station is large, the above problem is solved by guiding a station with few transfer lines as a transfer station. The present invention has been completed by conceiving that the points can be eliminated.

  That is, the present invention has an object to solve the above problems, and when searching for a candidate route from an arbitrary departure point to a destination using transportation, there are a large number of transfer routes at a transfer station. An object of the present invention is to provide a navigation system, a route search server, a route search method, and a terminal device that guide a station having a small number of entering routes and a low risk of getting lost or lost as a transfer station.

In order to solve the above-mentioned problem, the invention according to claim 1 of the present application is
Based on a route search request including a starting point and a destination, route search means for searching for an optimum route including a route using a transportation facility with reference to network data for route search as needed, and the route search means In a navigation system comprising display means for displaying the searched candidate route,
The navigation system includes:
As a route guide, there is an easy-to-change recommended mode that gives priority to transfer station information that is easy to transfer,
A station route information database that accumulates information on routes to and from each station,
A boarding / addition cost calculating means for calculating boarding / addition cost based on boarding / route information stored in the station route information database;
Network data editing means for adding the addition addition cost calculated by the addition addition cost calculation means to the transfer cost included in the route cost including the transit stored in the route search network data,
When searching for a route in the easy-to-change recommended mode, the route search means is optimal based on the route cost obtained by adding the transfer addition cost by the network data editing means to the transfer cost included in the route cost including transit. It is characterized by searching for a route.

  The invention according to claim 2 of the present application is the navigation system according to claim 1, wherein the boarding / addition cost calculating means is boarding / adding based on the number of boarding routes that can be changed included in the boarding route information. The cost is calculated.

  The invention according to claim 3 of the present application is the navigation system according to claim 1, wherein the boarding / addition cost calculating means includes the number of boarding routes that can be boarded included in the boarding route information, and the route search. A travel addition cost is calculated on the basis of the number of trains on a transferable route in a predetermined time zone acquired based on time information included in the request.

  The invention according to claim 4 of the present application is the navigation system according to any one of claims 1 to 3, wherein operation input means for inputting a route search request including a condition for enabling the easy-to-change recommended mode is provided. It is characterized by providing.

The invention according to claim 5 of the present application is
A route search request including a starting point and a destination is transmitted to the route search server, and connected to a terminal device having display means for displaying the candidate route received from the route search server, and received from the terminal device. Based on the route search request, in the route search server that searches for the optimum route including the route using the transportation means with reference to the route search network data, if necessary,
As a route guide, there is an easy-to-change recommended mode that gives priority to transfer station information that is easy to transfer,
A route search means for searching for an optimum route including a route using a transportation means as needed with reference to the network data for route search;
A station route information database that accumulates information on routes to and from each station,
A boarding / addition cost calculating means for calculating boarding / addition cost based on boarding / route information stored in the station route information database;
Network data editing means for adding the addition addition cost calculated by the addition addition cost calculation means to the transfer cost included in the route cost including the transit stored in the route search network data,
The route search means is optimal based on a route cost obtained by adding the transfer addition cost by the network data editing means to a transfer cost included in a route cost including a connection when performing a route search in the transfer easy recommendation mode. It is characterized by searching for a route.

  The invention according to claim 6 of the present application is the route search server according to claim 5, wherein the boarding / addition cost calculating means enters the board based on the number of boarding routes that can be changed included in the boarding route information. The addition cost is calculated.

  The invention according to claim 7 of the present application is the route search server according to claim 5, wherein the boarding addition cost calculating means includes the number of boarding routes that can be boarded included in the boarding route information, and the route. A travel addition cost is calculated based on the number of trains on a transferable route in a predetermined time zone acquired based on time information included in the search request.

Furthermore, the invention according to claim 8 of the present application is
Based on a route search request including a starting point and a destination, route search means for searching for an optimum route including a route using a transportation facility with reference to network data for route search as needed, and the route search means A route search method in a navigation system comprising display means for displaying the searched candidate route,
The navigation system includes:
As a route guide, there is an easy-to-change recommended mode that gives priority to transfer station information that is easy to transfer,
A station route information database that accumulates information on routes to and from each station,
A boarding / addition cost calculating means for calculating boarding / addition cost based on boarding / route information stored in the station route information database;
Network data editing means for adding the addition addition cost calculated by the addition addition cost calculation means to the transfer cost included in the route cost including the transit stored in the route search network data,
A first step of calculating a boarding / addition cost based on the boarding route information by the boarding / addition cost calculating means when performing a route search in the easy-to-change mode;
A second step of adding, by the network data editing means, a transfer addition cost calculated in the first step to a transfer cost included in a route cost including a connection;
And a third step of searching for an optimum route based on the route cost added in the second step by the route search means.

  The invention according to claim 9 of the present application is the route search method according to claim 8, wherein the first step includes a boarding / addition cost based on the number of boarding routes that can be changed included in the boarding route information. Is calculated.

  The invention according to claim 10 of the present application is the route search method according to claim 8, wherein the first step includes the number of routes that can be entered included in the entry route information and the route search request. And calculating a boarding / addition cost based on the number of trains on a transferable route in a predetermined time zone acquired based on the time information included in.

The invention according to claim 11 of the present application is
Based on a route search request that includes the departure point and destination, route search means that searches the route search network data and searches for the optimum route including routes using transportation as necessary, and boarding at each station A station route information database storing route information, a boarding / addition cost calculating means for calculating a boarding / addition cost based on the boarding route information stored in the station route information database, and storing in the network data for route search Network data editing means for adding the transfer addition cost calculated by the transfer addition cost calculation means to the transfer cost included in the route cost including the connected transfer, and for easy transfer as route guidance A transfer easy recommendation mode in which priority is given to station guidance, and the route search means includes a route in the easy transfer recommendation mode. Connected via a network to a route search server that searches for an optimum route based on a route cost obtained by adding the addition addition cost by the network data editing means to a transfer cost included in a route cost including a connection when searching. A terminal device,
The terminal device
Operation input means for inputting a route search request including a condition for enabling the easy-to-change recommended mode;
Display means for displaying candidate routes searched by the route search means;
It is characterized by providing.

  In the invention according to claim 1, the station route information database storing the entry route information for each station, and the entry addition calculating the entrance addition cost based on the entry route information stored in the station route information database. Cost calculation means, and network data editing means for adding the addition addition cost calculated by the addition addition cost calculation means to the transfer cost included in the route cost including the transit stored in the route search network data. The route search means searches for the optimum route based on the route cost obtained by adding the addition addition cost by the network data editing means to the transfer cost included in the route cost including the connection when the route search is performed in the easy transfer recommendation mode. Configured to do.

  According to such a configuration, by adding a transfer addition cost calculated based on predetermined transfer route information such as a large number of routes to one station to the transfer cost, Because it becomes possible to lower the priority of use of stations that require complicated transfers due to a large number of passengers, it is possible to transfer to the desired route, and there are stations with fewer passengers. In this case, the route search result using the station can be guided.

  According to a second aspect of the present invention, the navigation system according to the first aspect is configured to calculate the boarding / addition cost based on the number of boarding routes that can be changed included in the boarding route information.

  According to such a configuration, when there are a large number of routes on one station, adding a transfer addition cost to the transfer cost requires a large number of routes and complicated transfers. It is possible to lower the priority of use of a station, so it is possible to transfer to a desired route, and if there are stations with a small number of passengers, guide the route search results using that station Will be able to.

  In the invention according to claim 3, in the navigation system according to claim 1, the predetermined number acquired based on the number of routes that can be entered included in the entry route information and the time information included in the route search request. It was configured to calculate the boarding / adding cost based on the number of trains on the transferable route in the time zone.

  According to such a configuration, when calculating the boarding / addition cost, not only the number of boarding lines but also the average number of trains in a predetermined time zone is taken into consideration when calculating the boarding / addition cost. By entering, it becomes possible to make a difference in the additional cost of entry / exit when there are few trains depending on the day of the week or time zone even if there are many inbound routes, so it is possible to transfer to the desired route Thus, when there is a station with a small number of passengers in a predetermined time zone, it is possible to guide a route search result using the station.

  According to a fourth aspect of the present invention, the navigation system according to any one of the first to third aspects further comprises an operation input means for inputting a route search request including a condition for enabling the easy-to-change mode. Configured.

  According to such a configuration, when there are a large number of routes on one station, adding a transfer addition cost to the transfer cost requires a large number of routes and complicated transfers. It is possible to lower the priority of use of a station, so it is possible to transfer to a desired route, and if there are stations with a small number of passengers, guide the route search results using that station Will be able to. Therefore, the user can obtain a desired route that meets his / her request.

  In the inventions according to claims 5 to 7, it is possible to provide a route search server constituting the navigation system according to claims 1 to 3, respectively, and inventions according to claims 8 to 10. Can provide a route search method for realizing a navigation system according to claims 1 to 3, respectively. Moreover, in the invention concerning Claim 11, the terminal device which comprises the navigation system concerning Claim 4 can be provided now.

  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.

  FIG. 1 is a system configuration diagram showing a configuration of a navigation system 10 according to an embodiment of the present invention. As shown in FIG. 1, the navigation system 10 includes a terminal device 20 and a route search server 30 that are connected via a network 12. The navigation system 10 includes a POI information distribution server 50 that provides detailed information such as the location of POIs (Points of Interest) that belong to various categories, service contents, advertisements, map data, traffic route data, and operation timetables. It includes various information distribution servers 51 that provide data, contents such as music and various images, and other information.

  The route search server 30 can acquire necessary data from the POI information distribution server 50 or other information distribution server 51 via the network 12 and add it to its own database. Similarly, a search request can be transmitted to the POI information distribution server 50 or another information distribution server 51 to obtain a desired search result.

  The navigation system 10 according to the present invention is not limited to the above configuration, and the route search server 30 may have the function of a map distribution server that distributes the map of the POI location together with the navigation service function. The terminal device 20 can also use a mobile phone, and may be a portable device such as a PDA, a music player, a portable game machine, or a personal computer (PC).

  The route search server 30 shown in FIG. 1 includes a map database 34, a route search network database 35, and a station route information database 36. When there is a route search request from the terminal device 20, the route search server 30 refers to the route search network database 35. Route search. And it has the general navigation function which transmits the guidance route (recommended route) obtained from the result of route search to the terminal device 20. Further, when there is a request for obtaining map data by designating a desired point or POI from the terminal device 20, the corresponding map data is read with reference to the map database 34 and distributed to the terminal device 20.

  When the terminal device 20 requests a route search from the route search server 30 and receives a route guidance service, the terminal device 20 sets route search conditions such as a desired departure place and destination and sends the route search server 30 with the route search condition. Send a route search request. When the terminal device 20 requests a route search with a route search condition that guides a station with a small number of transit routes and a low risk of being mistaken or lost as a transfer station, the terminal device 20 uses “a station that can be easily changed” as a transfer condition. An instruction such as “priority” can be set.

  When there is a route search request in which such a transfer condition is set from the terminal device 20, the route search server 30 calculates a transfer addition cost calculated by referring to the station route information database 36 as will be described later. The candidate route is searched by adding to the transfer cost included in the database 35. The route search at this time can be performed by a route search method of setting condition specification performed in a general navigation system.

  By performing such a route search, it is possible to obtain a candidate route that can be transferred to a station with few inbound routes and less likely to be mistaken or lost, and the user of the terminal device 20 further responds to his / her request. The desired route can be obtained.

  Hereinafter, the navigation system 10 according to the embodiment of the present invention will be described based on specific examples, but before that, the detailed configuration of the navigation system 10 according to the present invention will be described. FIG. 2 is a block diagram showing a detailed configuration of the navigation system 10 of FIG. The terminal device 20 is a terminal capable of receiving a navigation service, and includes a control unit 201, a communication unit 21, a GPS reception unit 22, a search request unit 23, a guide route data storage unit 24, a display unit 25, and an operation input unit 26. It is prepared for.

  In the terminal device 20, the control means 201 is a microprocessor having a RAM, a ROM, and a processor (not shown), and controls the operation of each unit by a control program stored in the ROM. The communication means 21 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 22 receives a signal from a GPS satellite and calculates the current position by latitude and longitude. The operation input means 26 consists of numbers, alphabet keys, other function keys, selection keys, scroll keys (up / down / left / right arrow keys), etc., and performs input for operating the terminal device 20, as well as the departure place, purpose It is also used as an input function for route search conditions such as ground. The display means 25 comprises a liquid crystal display panel or the like, and is used for displaying a guidance route, a recommended route or a map distributed (transmitted) from the route search server 30. The display unit 25 also functions as an input unit for displaying the menu screen and operating the terminal device 20.

  The search request unit 23 creates a route search request based on the route search conditions such as the departure point and the destination set by the operation input unit 26 or the display unit 25, and transmits the route search request to the route search server 30.

  The guide route data storage unit 24 temporarily stores guide route data that is a route search result distributed from the route search server 30, and guide routes and recommended routes transmitted from the route search server 30 to the terminal device 20. Is stored in the guide route data storage unit 24 together with the map data, and the guide data and map data such as the guide route stored in the guide route data storage unit 24 are read out as necessary and displayed. 25.

  When a map is displayed on the display unit 25, generally, a guide route and a current state of the terminal device 20 are displayed 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 unit 22. A mark indicating the position is superimposed and displayed so that the current position mark is 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. In addition, when voice guide data is added to the guidance route data distributed from the route search server 30, for example, when the terminal device 20 approaches an intersection or a branch point (guidance point), “Further, 300m Play a voice message such as “Turn left at the intersection. Please turn left” and guide the user.

  FIG. 4 is a diagram illustrating an appearance of a mobile phone as a terminal device according to the embodiment of the present invention. When the terminal device 20 is a mobile phone, as shown in FIG. 4, the terminal device 20 has a display means 25 such as a liquid crystal display panel, a numeric keypad and a scroll key SK (launcher key), a clear key, a display on a specific numeric key, etc. Operation input means 26 to which a mode switching key is assigned is provided. Map data and guide route data transmitted from the route search server 30 are stored in the guide route data storage unit 24, read out from the guide route data storage unit 24 as necessary, and displayed on the display screen 251 of the display unit 25. The

  FIG. 5 is a diagram showing an example of a route search condition input screen 500 displayed on the display screen 251. When making a route search request to the route search server 30, the terminal device 20 selects and sets predetermined conditions from various pull-down menus displayed on the display unit 25 as shown in FIG. Then, a desired condition is input and transmitted to the route search server 30.

  The route search condition input screen 500 includes a departure point input field 501, a destination input field 502, a use date input field 503, a time input field 504, a time type input field 505, a moving means input field 506, and a route display order input field. 507, a transfer condition input field 508, a walking setting input field 509, a used route input field 510, a search start button 511 at the current time, and a search start button 512 at the set conditions.

  The starting point and destination are set by inputting an address, a telephone number, a station name, a point name such as a building name, a latitude / longitude, or the like in the starting point input field 501 and the destination input field 502. That is, in this input field, free word input is possible in principle, but it can be set by address, telephone number, POI name, and the like. Further, the current location of the terminal device 20 measured by the GPS receiving means 22 can be used for the input of the departure place. Furthermore, a method may be used in which a map is displayed on the display unit 25 of the terminal device 20, a point is designated on the displayed map, and converted into latitude and longitude information.

  The setting of the use date and time is set by inputting the date and time of actually using a transportation facility such as a train in the use date input field 503 and the time input field 504 in order to perform a search according to the operation timetable data. In the use date input field 503 and the time input field 504, the date and time when the route search condition input screen 500 is displayed are set as initial values.

  In the time type input field 505, the conventional “departure”, “arrival”, “last train”, and “first departure” conditions can be selected and set from the pull-down menu 505-1 for the type of time input in the time input field 504. is there. As a result, it is possible to set whether the departure time or arrival time is selected when “departure” or “arrival” is selected as the time input in the time input field 504. 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.

  In the moving means input field 506, it is possible to select and set moving means at the time of route search. When “Vehicle + Walk” is selected, permitted vehicles (airplane, Shinkansen, limited express, route bus, etc.) can be set in the use route column 510.

  In the route display order input field 507, the conventional route display order is "in order of shorter required time", "in order of cheaper fare", "in order of decreasing number of transfers", "in order of less walking (distance of walking route is short)" These conditions can be selected and set using a pull-down menu 507-1.

  Here, in "Short order of required time", the specified departure time range is satisfied and the route is found in the order of shorter required time. In "Lowest fare order", the specified departure time range is satisfied, and the route is in ascending order of fare. Is obtained. In addition, the route with the specified departure time is satisfied in the order of the least number of transfers and the route is obtained in the order of the smaller number of transfers, and the route in the order of the smaller distance of the walking section is satisfied with the specified departure time range. Routes are found in ascending order. In the route display order input field 507, “the order in which the required time is short” is set as an initial value.

  In the transfer condition input field 508, it is possible to select and set transfer conditions that the user can tolerate. The initial value is set to “don't care”, but the present invention will function if the condition “prioritize stations that are easy to transfer” is selected.

  In other words, when “Prefer priority is given to easy-to-change stations” is selected in the transfer condition input field 508, the more routes there are, the more difficult it is to transfer due to congestion. The candidate route is searched based on the total required cost that includes the transfer addition cost calculated based on the number of transfers in addition to the transfer cost. Information on guide routes that can be changed at stations with few incoming lines will be obtained.

  In the walking setting input field 509, it is possible to select and set the conventional “skeka”, “standard”, and “slow” conditions for the walking speed from the pull-down menu 509-1. Here, the time cost of the walking section is estimated at 6 km / h for “Saseka”, 5 km / h for “standard”, and 4 km / h for “slow”.

  When the necessary condition setting is completed and the search start button 511 or 512 is operated, a route search request is transmitted from the terminal device 20 to the route search server 30.

  On the other hand, as shown in FIG. 2, the route search server 30 includes a control unit 301, a communication unit 31, a search request storage unit 32, a route search unit 33, a map database 34, a route search network database 35, and a station route information database 36. , A boarding / addition cost calculating unit 37, a network data editing unit 38, and a guide route data editing unit 39.

  In the route search server 30, the control unit 301 is a microprocessor having a RAM, a ROM, and a processor (not shown), and controls the operation of each unit by a control program stored in the ROM. The communication unit 31 is an interface for communicating with the terminal device 20, the POI information distribution server 50, and other information distribution servers 51 via the network 12.

  The search request storage means 32 is for temporarily storing a route search condition included in a route search request transmitted from the terminal device 20.

  The route search means 33 refers to the search network database 35 based on the route search conditions such as the departure point and destination and the current position information transmitted from the terminal device 20, and the route from the departure point to the destination. Perform a search. As such a route search method, a method called label determination method or Dijkstra method is used. Such a configuration is the same as that of a general navigation system.

  The route search network database 35 stores road network data for searching for a travel route by foot or car and traffic network data for searching for a travel route using public transportation. Specifically, the road (route) is the node and the position of the inflection point is the node, the route connecting each node is the link, node data, link data, and cost information (distance and required time) of all links It consists of some link cost data and is made into a database. Transport network data is also stored in stations as nodes, links between stations, and timetable data (departure time, arrival time, required time, transfer time) of each vehicle such as trains that are linked as link cost data. It is a thing.

  Road network data for route search in pedestrian navigation systems and car navigation systems uses the end points, intersections, and inflection points of each road as nodes, and the roads connecting each node are represented by directional links. (Link latitude / longitude of the node), link data (link number), and link cost data using link cost (link distance or time required for traveling the link) of each link as data.

  When a 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, and the link cost is accumulated to minimize the accumulated link cost. Search and guide the route. In other words, since there are actually multiple routes from the departure node to the destination node, each route is searched in the same way, and the route with the lowest link cost is determined as the optimum route. To do. This method is performed by, for example, a known method called the Dijkstra method.

  On the other hand, the traffic network data for route search of transportation means that each station (each airport on an aircraft route) provided on each traffic route is a node, and a section connecting each node is directed. It is represented by a link, and node data (latitude / longitude) and link data (link number) are network data. The link cost of a transportation network is a fixed and static ring cost in a road network, whereas a train or an aircraft that operates a traffic route (hereinafter, each route such as an individual train or an aircraft is referred to as a transportation means). ) Are variable and dynamic.

  That is, the time of departure from a node in each means of transportation and the time of arrival at the next node are fixed (specified by timetable data and operation data), and each route is not necessarily linked to an adjacent node. May not. 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.

FIG. 3 is a schematic diagram for explaining the configuration of the route search network according to the embodiment of the present invention.
FIG. 3 shows, for example, links consisting of traffic lines A, B, C, and D constituting a subway network as public traffic lines by arrow lines (solid line, broken line, two-dot chain line, one-dot chain line). Stations serving as nodes provided on routes A, B, C, and D are indicated by ○ and ◎ (◎ indicates a subway transfer station). The links connecting the nodes include directional links facing in the up and down directions of the traffic route. In FIG. 3, only the links in the direction of the arrows are shown to simplify the illustration. .

Specifically, on route A, the subway departs from station A1, and then stops in the order of station A2, station A3, station A4, station M, station A6, station N, station A8, and station A9. On route B, the subway stops in the order of station B1, station M, station N, and station B4. On route C, the subway stops in the order of station C1, station C2, station M, station C4, and station C5. Further, on the route D, the subway stops in the order of the station D1, the station D2, and the station M.
Station M is a station that includes all of routes A, B, C, and D and includes station A5 on route A, station B2 on route B, station C3 on route C, and station D3 on route D. is there. Further, the station N is a station including the line A and the line B, and includes the station A7 on the line A and the station B3 on the line B.

  In the subway network (traffic network) shown in FIG. 3, for example, 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) Ba to Bc on the transportation route B. ... will exist. Therefore, in the transportation operation network, each node, link, and link cost data has a data amount proportional to the total number of transportation means (routes such as individual airplanes and trains).

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

  For example, in FIG. 3, when a specific departure time is designated with the departure point as the node A1 of the traffic route A and a route search is performed with the node B4 of the traffic route B as the destination, the route is operated on the traffic route A. Of the transportation means Aa to Ac..., All transportation means after the departure time are sequentially selected as the departure route. Based on the arrival time at the transit node on the transit route B, among all the transit methods Ba to Bc... Operating on the transit route B, all combinations of transit means after the time that can be boarded at the transit node. The total time required for each route, the number of transfers, and the like are guided.

  Here, when the user performs a route search from the station A1 of the departure point S to the station B4 of the destination G, the station B4 of the destination G is on the route B as shown in FIG. It can be seen that the user needs to change from route A to route B. In other words, when heading from the departure point S to the station B4 on the route B which is the destination G using the route A, in order to transfer from the route A to the route B, it is only necessary to change at the station M or the station N.

When the route search from the station A1 (departure point S) to the station B4 (destination G) is performed, the route cost from the station M to the station B4 (destination G) is included in the route search network database 35. When calculating with reference to the time cost and transfer cost, the route cost SM when transferring at the station _M is:
S _M = (M _AB ) + (M → N) + (N → G) = 5 + 5 + 6 = 16
The route cost _SN when changing at station _N is
S _N = (M → A6) + (A6 → N) + (N _AB ) + (N → G) = 5 + 4 + 3 + 6 = 18
It becomes. Here, (M _AB ) and (N _AB ) represent transfer costs at station M and station N, respectively, (M → N), (N → G), etc., between station M and station N, and station N−, respectively. The time required cost between the stations B4 (destination G) is shown.

  Each value of the transfer cost and the required time cost is stored in a table (data) in the route search network database 35 as shown in FIG. 6A, for example. FIG. 6A is a diagram for explaining the configurations of the required time cost table 35-1 and the transfer cost table 35-2 included in the route search network database 35 according to the embodiment of the present invention.

  Each table is created based on the operation timetable data provided from the information distribution server 51, and the required time cost table 35-1 indicates the required time (cost) between stations for each of the routes A to B. The data is converted into data, and the transfer cost table 35-2 is data in which transfer times (costs) at the transfer stations M and N are converted into data.

  Therefore, in determining the route with the lowest cost from the station A1 (departure point S) to the station B4 (destination G), the cost from the station A1 to the station M is the same regardless of whether the transfer is made at either the station M or the station N. Referring to the required time cost and transfer cost included in the route search network database 35 shown in FIG. 7, (A1 → A2) + (A2 → A3) + (A3 → A4) + (A4 → M) = 3 + 5 + 4 + 5 = It can be seen that the route 17 and the route are common. For this reason, transfer from station S (station A1) to station M via route A by comparing the required time costs for the transfer at station M and the transfer at station N. After that, the route that changes to the route B and arrives at the destination G (station B4) via the station N is found to be the minimum cost.

  However, the station M is a terminal station in which four lines A to D are on board and the transfer is complicated. For this reason, there is a possibility that the estimated time required for the transfer will be exceeded while being confused by the transfer or getting lost in the station premises. Therefore, if a candidate route includes a station with a small number of inbound routes so as not to be embarrassed or confused about the transfer, the user is given priority to the candidate route so that the transfer can be made at a station with a small number of inbound routes. You can guide to.

  Therefore, in the navigation system according to the present invention, when the user sets the departure point S and the destination G as input information, first, the number of passengers on the route is acquired for the terminal station where transfer is expected. Then, the transfer addition cost calculated from the number of transfers acquired for the station where transfer is expected is added to the transfer cost.

In the station route information database 36, traffic route data including the number of trains entering each station is accumulated. For example, as shown in FIG. 6B, the number of passengers on the route is stored in the station route information database 36 as a table (data). FIG. 6B is a diagram for explaining the configuration of the boarding number data table 36-1 included in the station route information database 36 according to the embodiment of the present invention.
This boarding number data table 36-1 is created based on the traffic route data provided from the information distribution server 51, and is the number of boarding numbers for each station.

  In this embodiment, the addition / addition cost calculation means 37 is a route search in which the user of the terminal device 20 specifies that priority is given to a station that can be easily changed in order to avoid transfer at a terminal station where a plurality of routes have entered. Is requested, the transfer addition cost is calculated based on the number of routes on the route included in the station route information database 36.

Specifically, when the value of the boarding / addition cost is the square of the number of boarding routes, the value of the boarding / addition cost at the station M (ΔM _AB ) is
(ΔM _AB ) = 4 ² = 16
In addition, the value (ΔN _AB ) of the addition cost at station N is
(ΔN _AB ) = 2 ² = 4
It becomes.

In the present embodiment, the network data editing unit 38 adds the boarding / addition cost calculated by the boarding / addition cost calculating unit 37 to the transfer cost at the corresponding transfer station. That is, the newly edited transfer cost (M _AB ) ′ at station M is
(M _AB ) ′ = (M _AB ) + (ΔM _AB ) = 5 + 16 = 21
Also, the newly edited transfer cost (N _AB ) 'at station N is
(N _AB ) ′ = (N _AB ) + (ΔN _AB ) = 3 + 4 = 7
It becomes. When a route search is performed based on the route cost added in this way, the transfer cost at the terminal station with a large number of routes on the route increases, so the transfer at that station is selected and the priority is lowered, A guide route that avoids transfer at complicated terminal stations is selected.

That is, when the route of the lowest cost from the station M to the station B4 (destination G) is obtained using the transfer cost at the station M and the station N to which the calculated transfer addition cost is added, The route cost S _M ′ is
S _M '= (M _AB )' + (M → N) + (N → G) = 21 + 5 + 6 = 32
It becomes. On the other hand, the route cost S _N ′ when transferring at station N is
S _N '= (M → A6) + (A6 → N) + (N _AB ) ′ + (N → G) = 5 + 4 + 7 + 6 = 22
It becomes.

  Therefore, as a route search result when priority is given to a station that can be easily changed, the route is displayed to the user in the order of the route changed at the station N and the route changed at the station M. Further, the result of the route search may be displayed to the user together with the result of the normal route search as a result of using a station where transfer is easy.

  The guide route data editing unit 39 is for editing the guide route (transportation means such as individual trains) searched by the route search unit 33 into data for distribution to the terminal device 20. That is, the guide route data editing unit 39 performs guidance such as embedding the data of the optimum route or a plurality of candidate routes searched by the route search unit 33 into the map data including the current position read from the map database 34. Create route data.

  When there is a route search request from the terminal device 20, the route search server 30 temporarily stores it in the search request storage unit 32. The route search means 33 searches for a plurality of candidate routes from the departure point to the destination with reference to the route search network database 35 according to the route search request stored in the search request storage means 32.

Here, when the user of the terminal device 20 requests a route search specifying that priority is given to a station that can be easily changed in order to avoid transfer at a terminal station where a plurality of routes have entered, a network for route search The route addition network cost calculated by the addition addition cost calculation means 37 is added to the transfer cost included in the route cost including the transit stored in the database 35, and the route search network data including the added route cost. Based on the route search.
This transfer addition cost may be added in advance for all transfers at stations where transfer is possible, or the transfer addition cost is added when a station that may be transferred during route search is reached. You may search for a route.

  Then, the candidate route is edited into guide route data and distributed to the terminal device 20 together with the map data. Further, the route search server 30 distributes the requested map data to the terminal device 20 according to the request from the terminal device 20.

  The route search server 30 searches for a plurality of candidate routes from the departure point to the destination according to the route search condition using such network data, and transmits the result to the terminal device 20 as guide route data. When the departure time of the departure place is specified in the route search condition, the departure time of the departure place is included in the guidance route data, and the terminal device 20 can display these on the display means 25 together with the details of the route. When the transfer route is included in the guide route, the train to be transferred at the transfer station and its departure time can be displayed in the same manner.

  Next, an operation procedure of route search giving priority to a station that can be easily changed in the route search server 30 according to the embodiment of the present invention will be described with reference to FIG. FIG. 7 is a flowchart showing an operation procedure of the route search server according to the embodiment of the present invention.

  The operation procedure shown in FIG. 8 is realized by the control means 301 of the route search server 30 executing the control program stored in the ROM.

  First, in step S701, the route search condition including the departure point, the destination, and the output order input by the user according to the route search condition input screen shown in FIG. To do.

  The route search server 30 temporarily stores this in the search request storage means 32 in the process of step S702.

  The boarding / addition cost calculating means 37 acquires the number of boarding routes included in the station route information database 36 in the process of step S703, and calculates the switching addition cost based on the boarding number acquired in the processing of step S704. .

  In the process of step S705, the network data editing unit 38 calculates the addition / addition calculated by the addition / addition cost calculation unit 37 for the transfer cost included in the route cost including the transit stored in the route search network database 35. The cost is added and the process proceeds to step S706.

  In step S706, the route search unit 33 performs route search based on the route search network data including the route cost obtained by adding the boarding addition cost by the network data editing unit 38 as necessary. The candidate route is sent to the guide route data editing means 39. In step S707, the guide route data editing means 39 temporarily stores the candidate route data sent from the route search means 33.

  The route search by the route search means 33 is a route search for specifying a moving means (used in both walking and transportation) used in general route search. It is a route search to follow. In this route search, even if a plurality of candidate routes are searched, all are stored in the guide route data editing means 39 and the process proceeds to S708.

  In the process of step S708, the guide route data editing means 39 sorts the temporarily stored candidate routes in the designated display order to create guide route data, and communicates the guide route data created in the process of step S709. It transmits to the terminal device 20 via the means 31, and complete | finishes a process. And the terminal device 20 displays a route search result based on the received guidance route data.

  As described above in detail, according to the navigation system according to the present invention, when there are a large number of routes on a single station, by adding the transfer addition cost to the transfer cost, It becomes possible to lower the priority of use of stations that require a large number of entrances and complicated transfers. In addition, when there is a station that can be changed to a desired route and has a small number of passengers, a route search result using the station can be guided. Therefore, the user can further provide a navigation system that can obtain a desired route that meets the user's request.

  In the above-described embodiment, the value of the boarding / addition cost is described as the square of the number of boarding routes. However, the present invention is not limited to this, and may be changed depending on the mode of boarding the boarding route. For example, if there are two boarding routes at one station and the route on which the user gets into the station is the terminal station, there is only one transfer destination route for the user. That is, at the time of transfer, the user only needs to consider whether to get on the “upward direction” or to get on the “downward direction”. In such a case, it may be less than the entrance addition cost when there are two entry routes.

By the way, the number of trains varies depending on the time of day even if there are many transit stations. For example, in the commuting time zone, the number of trains on all the routes to enter is very large, and it may be easy to get lost. On the other hand, in times when the number of passengers is small, there are cases where the number of trains is not so many even if the number of routes is large.
Therefore, based on the time information included in the input information from the user, the average number of trains in that time zone is acquired together with the number of routes to enter the station where transfer is expected.

When calculating the boarding / addition cost, the average number of trains in the specified time zone as well as the number of boarding routes is obtained and taken into account when calculating the boarding / addition cost. Even in a large number of stations, it is possible to make a difference in boarding / addition costs when the number of trains is small and when the number of trains is not.
As for the number of trains, the number of trains included in a predetermined time before and after the train to be used may be acquired based on time information included in the input information from the user, and this may be taken into consideration for the additional cost. .

  In this embodiment, the communication type navigation system including the terminal device and the route search server has been described. However, the present invention is not limited to the communication type navigation system, and the update of the map data can be managed. If present, the present invention may be applied when data is downloaded to a portable information device that operates in a stand-alone manner in which the terminal device and the route search server are integrated, and route guidance is performed by the portable information terminal alone.

  In addition, the navigation system according to the present invention is not limited to the above-described configuration, and the route search server may be a server having a navigation function for automobiles in addition to a navigation function for pedestrians. The terminal device may be a mobile phone that does not have a GPS receiving means. In the case of a mobile phone that does not have a GPS receiving means, the location information of the communication area is obtained by location registration with respect to the base station, and the route search server may receive this location information from the mobile phone and determine the location.

  In the navigation system according to the present invention, when a user performs a route search, if there is a transfer station in the moving route, the route search with many transfers is reduced by considering the number of transfers at the transfer station. In addition, it is possible to avoid transfer at complicated stations with many transfer lines.

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 in the Example of this invention. It is a schematic diagram for demonstrating the structure of the route search network concerning the Example of this invention. It is a figure which shows the external appearance of the mobile telephone as a terminal device concerning the Example of this invention. It is a screen block diagram which shows an example of the input screen of the route search conditions concerning the Example of this invention. It is a figure for demonstrating the structure of each table stored in the route search server concerning the Example of this invention. It is a flowchart which shows the operation | movement procedure of the route search server concerning the Example of this invention.

Explanation of symbols

DESCRIPTION OF SYMBOLS 10 ... Navigation system 12 ... Network 20 ... Terminal device 201 ... Control means 21 ... Communication means 22 ... GPS reception means 23 ... Search request means 24 ··· Guide route data storage means 25 ··· Display means 251 ··· Display screen 26 ··· Operation input means 30 ··· Route search server 301 · · · Control means 31 ··· Communication Means 32 .... Search request storage means 33 ... Route search means 34 ... Map database 35 ... Route search network database 36 ... Station route information database 37 ... Input / addition cost calculation means 38... Network data editing means 39... Guide route data editing means 50... POI information distribution server 51.

Claims (11)

Based on a route search request including a starting point and a destination, route search means for searching for an optimum route including a route using a transportation facility with reference to network data for route search as needed, and the route search means In a navigation system comprising display means for displaying the searched candidate route,
The navigation system includes:
As a route guide, there is an easy-to-change recommended mode that gives priority to transfer station information that is easy to transfer,
A station route information database that accumulates information on routes to and from each station,
A boarding / addition cost calculating means for calculating boarding / addition cost based on boarding / route information stored in the station route information database;
Network data editing means for adding the addition addition cost calculated by the addition addition cost calculation means to the transfer cost included in the route cost including the transit stored in the route search network data,
When searching for a route in the easy-to-change recommended mode, the route search means is optimal based on the route cost obtained by adding the transfer addition cost by the network data editing means to the transfer cost included in the route cost including transit. A navigation system characterized by searching for a route.   The navigation system according to claim 1, wherein the boarding / addition cost calculating means calculates boarding / addition cost based on the number of boarding routes that can be changed included in the boarding route information.   The boarding / addition cost calculating means can transfer in a predetermined time zone acquired based on the number of boarding routes included in the boarding route information and the time information included in the route search request. The navigation system according to claim 1, wherein a boarding / adding cost is calculated based on the number of trains on the route.   The navigation system according to any one of claims 1 to 3, further comprising operation input means for inputting a route search request including a condition for enabling the easy-to-change mode. A route search request including a starting point and a destination is transmitted to the route search server, and connected to a terminal device having display means for displaying the candidate route received from the route search server, and received from the terminal device. Based on the route search request, in the route search server that searches for the optimum route including the route using the transportation means with reference to the route search network data, if necessary,
As a route guide, there is an easy-to-change recommended mode that gives priority to transfer station information that is easy to transfer,
A route search means for searching for an optimum route including a route using a transportation means as needed with reference to the network data for route search;
A station route information database that accumulates information on routes to and from each station,
A boarding / addition cost calculating means for calculating boarding / addition cost based on boarding / route information stored in the station route information database;
Network data editing means for adding the addition addition cost calculated by the addition addition cost calculation means to the transfer cost included in the route cost including the transit stored in the route search network data,
The route search means is optimal based on a route cost obtained by adding the transfer addition cost by the network data editing means to a transfer cost included in a route cost including a connection when performing a route search in the transfer easy recommendation mode. A route search server characterized by searching for a route.   6. The route search server according to claim 5, wherein the boarding / addition cost calculating means calculates boarding / addition cost based on the number of boarding routes that can be changed included in the boarding route information.   The boarding / addition cost calculating means can transfer in a predetermined time zone acquired based on the number of boarding routes included in the boarding route information and the time information included in the route search request. 6. The route search server according to claim 5, wherein a boarding / adding cost is calculated based on the number of trains on the route. Based on a route search request including a starting point and a destination, route search means for searching for an optimum route including a route using a transportation facility with reference to network data for route search as needed, and the route search means A route search method in a navigation system comprising display means for displaying the searched candidate route,
The navigation system includes:
As a route guide, there is an easy-to-change recommended mode that gives priority to transfer station information that is easy to transfer,
A station route information database that accumulates information on routes to and from each station,
A boarding / addition cost calculating means for calculating boarding / addition cost based on boarding / route information stored in the station route information database;
Network data editing means for adding the addition addition cost calculated by the addition addition cost calculation means to the transfer cost included in the route cost including the transit stored in the route search network data,
A first step of calculating a boarding / addition cost based on the boarding route information by the boarding / addition cost calculating means when performing a route search in the easy-to-change mode;
A second step of adding, by the network data editing means, a transfer addition cost calculated in the first step to a transfer cost included in a route cost including a connection;
And a third step of searching for an optimum route based on the route cost added in the second step by the route search means.   9. The route search method according to claim 8, wherein in the first step, a boarding / addition cost is calculated based on the number of boarding routes that can be changed included in the boarding route information.   In the first step, the number of routes that can be entered included in the entry route information and the number of routes that can be changed in a predetermined time zone acquired based on the time information included in the route search request. The route search method according to claim 8, wherein a boarding / addition cost is calculated based on the number of trains. Based on a route search request that includes the departure point and destination, route search means that searches the route search network data and searches for the optimum route including routes using transportation as necessary, and boarding at each station A station route information database storing route information, a boarding / addition cost calculating means for calculating a boarding / addition cost based on the boarding route information stored in the station route information database, and storing in the network data for route search Network data editing means for adding the transfer addition cost calculated by the transfer addition cost calculation means to the transfer cost included in the route cost including the connected transfer, and for easy transfer as route guidance A transfer easy recommendation mode in which priority is given to station guidance, and the route search means includes a route in the easy transfer recommendation mode. Connected via a network to a route search server that searches for an optimum route based on a route cost obtained by adding the addition addition cost by the network data editing means to a transfer cost included in a route cost including a connection when searching. A terminal device,
The terminal device
Operation input means for inputting a route search request including a condition for enabling the easy-to-change recommended mode;
Display means for displaying candidate routes searched by the route search means;
A terminal device comprising:

Images