JP2004333377A - Route-search method - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a route-search method capable of realizing improved convenience in ease of running, safety and saving of time sensed, etc. <P>SOLUTION: A navigation center 30 calculates the shortest route, from present position designated by the general vehicle 40 to a destination, and an area of a threshold from each node of the route, then searches a link in the area to a traffic control center 20, if the link is obtained, the calculation of the route is performed again so as to include the link. When the link is obtained from the traffic control center 20, the traffic control center 20 processes from the traffic historical data, while weighting with the number of times for all business vehicles which passed through each of the link classified by vehicle kinds (vehicle sizes), the day of the week, and the time zone. While when the route is obtained, the traffic control center 20 processes the traffic history in the route format (the node and the link). <P>COPYRIGHT: (C)2005,JPO&NCIPI

Description

[0001]
TECHNICAL FIELD OF THE INVENTION
The present invention relates to a route search method in a vehicle navigation system.
[0002]
[Prior art]
In a route search in a navigation system, a method of calculating a shortest distance route is most common. In addition, since traffic congestion information can be obtained by VICS (Vehicle Information and Communication System: road traffic information communication system) or the like, travel time on each link of the road network is stored, and the travel time is minimized. A route search can be performed (Non-Patent Document 1, Non-Patent Document 2, etc.).
[0003]
Further, while VICS is information only on major arterial roads, a mechanism for collecting speed information of a traveling vehicle is being studied by using a probe car as a method of acquiring traffic congestion or traveling time (Non-Patent Document) 3).
[0004]
[Non-patent document 1]
Inner Navi Premium Club, “New Road Traffic Information”
[Non-patent document 2]
http: // premium-club. jp / promotion / hservice2. html)
[Non-Patent Document 3]
Togitsu, Takahashi, "Internet ITS Project (Experimental Edition)", Information Processing, Vol. 43, No. 4, pp. 357-362, 2002. 4
[0005]
[Problems to be solved by the invention]
In the conventional route search technology described above, the route search is performed to shorten the arrival time by reflecting the travel time on the link, but the ease of travel, safety, and the Route selection know-how such as shortening is not reflected.
[0006]
SUMMARY OF THE INVENTION An object of the present invention is to provide a route search method capable of improving convenience such as ease of traveling, safety, and reduced traveling time.
[0007]
[Means for Solving the Problems]
The route search method of the present invention is a step of calculating a shortest route between a departure position and a destination position specified by a general vehicle, and a step of calculating an area within a certain threshold from each node of the shortest route, For the links in the area, the links in the area are weighted according to the number of travels by vehicle type, day of the week, and time zone from the vehicle operation history data of the commercial vehicle, and the link with the larger weight is selected to recalculate the route. Having the step of:
[0008]
The present invention utilizes vehicle operation history data of a vehicle operation management system for commercial vehicles such as trucks, buses, taxis, etc., which are currently being introduced, that is, generally utilizes the route selection know-how of commercial vehicle drivers. Car route search is performed.
[0009]
BEST MODE FOR CARRYING OUT THE INVENTION
Next, embodiments of the present invention will be described with reference to the drawings.
[0010]
FIG. 1 shows the overall configuration of a commercial vehicle operation management system according to an embodiment of the present invention. The commercial vehicle operation management system according to the present embodiment includes a sales vehicle 10 and a vehicle operation management center 20, a navigation center 30 that performs a route search using vehicle operation history data, and a general vehicle 40 that requests and receives a navigation service. Are connected via a mobile network 50 and a fixed network 60.
[0011]
FIG. 2A shows a configuration example of the vehicle operation management center 20, and FIG. 2B shows a configuration example of the navigation center 30. The vehicle operation center 20 performs a vehicle operation management process, a vehicle operation history storage unit 22 that stores a vehicle operation history, and processes the vehicle operation history to transmit the vehicle operation history to the navigation center 30. And a communication processing unit 24 that communicates with the navigation center 30 and the business vehicle 10. The navigation center 30 includes a vehicle operation history collection unit 31 that requests the vehicle operation history data from the vehicle operation management center 20, a road link / route data storage unit 32 that stores data obtained by processing the obtained vehicle operation history, and a route. A route search unit 33 for searching and calculating, a road network data storage unit 34 for storing road network data used for route calculation, and a communication processing unit 35 for communicating with the vehicle operation management center 20 and the general vehicles 40 are provided.
[0012]
FIG. 3 shows a processing flow of the commercial vehicle operation management system.
[0013]
Within the range of normal business, vehicle position data (vehicle identifier, latitude, longitude, time) and operation status data (vehicle identifier, destination identifier, status content (arrival, departure, passage), time) are transmitted from the commercial vehicle 10. The vehicle operation management center 20 is notified and the history is accumulated. When performing navigation, the general vehicle 40 notifies the navigation center 30 of a route search request. The navigation center 30 notifies the vehicle operation management center 20 of the vehicle operation history collection request, and receives vehicle operation history data from the vehicle operation management center 20. The navigation center 30 returns the route calculated from the data to the general vehicle 40.
[0014]
FIG. 4 shows a flow example of the route search processing in the navigation center 30. The navigation center 30 first calculates the shortest route between the current position designated by the general vehicle 40 and the destination (step 101). FIG. 5A shows the calculated shortest path. Next, an area of a certain threshold is calculated from each node of the route (step 102). FIG. 5 (2) shows the result. Next, the vehicle operation management center 20 searches for a link (FIG. 5 (3)) existing in the area (step 103). If a link is obtained, the link is weighted by the number of runs. If the link is a certain weight or more (a link with a low weight is excluded even if it is within the area) (step 104), the route is re-entered so as to always include the link. Calculation is performed (step 105). For example, a route from the starting point to the nearest selected link and a route from the link to the destination are obtained. FIG. 5 (4) shows the result. When a link is obtained from the vehicle operation management center 20, the vehicle operation management center 20 weights the number of times all business vehicles have traveled on each link by vehicle type (size), day of the week, and time zone from the vehicle operation history data. Process in shape. On the other hand, when a route is obtained, the vehicle operation management center 20 processes the vehicle operation history into a route format (nodes and links). Further, the processing of the vehicle operation history can be realized by the navigation center 30 instead of the vehicle operation management center 20. Further, there may be a plurality of vehicle operation management centers 20.
[0015]
FIG. 6 shows another example of the flow of the route search process in the navigation center 30. The navigation center 30 first calculates the shortest route between the current position designated by the general vehicle 40 and the destination (step 101, FIG. 7A). An area of a certain threshold value is calculated from each node of the route (step 102, FIG. 7 (2)). Next, the vehicle operation management center 20 searches for a route where two destinations exist in the area (step 106, FIG. 7 (3)). When a route is obtained, the two destinations are connected to the nearest node, and the route is replaced with the route shown in FIG. 7A (step 107, FIG. 7D).
[0016]
FIG. 8 shows an application example of the present invention. The vehicle operation management center 20 is located at a transportation company or a taxi company that has introduced the vehicle operation management system. Of course, there is also an example in which a center function is used as an ASP (Application Service provider). The navigation center 30 is placed in a navigation center operating company that provides a navigation service, and the navigation center operating company pays a transportation company or the like for the purchase cost of the vehicle operation history data. The general vehicle 40 and the user pay the service usage fee to the navigation center operating company and receive the navigation service of the present invention.
[0017]
【The invention's effect】
As described above, the present invention can utilize the route selection know-how of the commercial vehicle driver in the route search by using the vehicle operation history data of the vehicle operation management system for commercial vehicles, Not only can it improve ease of use, safety, and convenience, such as shortening the travel time experienced, but it can also be used for new businesses, such as selling vehicle operation history data to transportation companies and taxi companies.
[Brief description of the drawings]
FIG. 1 is a configuration diagram of a commercial vehicle operation management system of the present invention.
FIG. 2 is a diagram illustrating a configuration example of a vehicle operation management center and a navigation center.
FIG. 3 is a diagram showing an overall processing flow.
FIG. 4 is a diagram showing a processing flow of a first example of a route search.
FIG. 5 is an explanatory diagram of a first example.
FIG. 6 is a diagram showing a processing flow of a second example of the route search.
FIG. 7 is an explanatory diagram of a second example.
FIG. 8 is a diagram showing an application example of the present invention.
[Explanation of symbols]
10 Business Vehicle 20 Vehicle Operation Management Center 21 Vehicle Operation Management Unit 22 Vehicle Operation History Storage Unit 23 Vehicle Operation History Processing Unit 24 Communication Processing Unit 30 Navigation Center 31 Vehicle Operation History Collection Unit 32 Road Link / Route Data Storage Unit 33 Accounting Search Unit 34 Road network data storage unit 35 Communication processing unit 40 General vehicle 50 Mobile network 60 Fixed network 101 to 107 Step

Claims (2)

A route search method in a navigation system that provides directions to a destination,
Calculating the shortest route between the departure position and the destination position specified by the general vehicle;
Calculating an area at a distance within a certain threshold from each node of the shortest path;
For the links in the area, the links in the area are weighted according to the number of travels by vehicle type, day of the week, and time zone from the vehicle operation history data of the commercial vehicle, and the link with the larger weight is selected to recalculate the route. A route search method comprising the steps of: A route search method in a navigation system that provides directions to a destination,
Calculating the shortest route between the departure position and the destination position specified by the general vehicle;
Calculating an area at a distance within a certain threshold from each node of the shortest path;
A search is made for a route in which two destinations are present in the area and at least some of the links are present in the area, and the obtained route having the shortest route between the destinations is replaced with the shortest route. A route search method having steps.

Images