ROUTE SEARCHING METHOD AND ROUTE SEARCHING SYSTEM

• US 20080319645A1
• Filed: 06/20/2008
• Published: 12/25/2008
• Est. Priority Date: 06/22/2007
• Status: Abandoned Application

• Current Assignee: Hitachi, Ltd.
• Original Assignee: Hitachi, Ltd.
• Inventors: Kumagai, Masatoshi, Hiruta, Tomoaki, Kono, Toshiaki
• Application Number:
  US12/143,512
• Publication Number:
  US 20080319645A1
• Time in Patent Office: Days
• US Class Current: 701/201
• CPC Class Codes: G01C 21/3461 Preferred or disfavoured areas, e.g. dangerous zones, toll or emission zones, intersections, manoeuvre types, segments such as motorways, toll roads, ferries
• CPC Class Codes: G01C 21/3484 Personalized, e.g. from learned user behaviour or user-defined profiles
• CPC Class Codes: G08G 1/01 Detecting movement of traffic to be counted or controlled G08G1/07 - G08G1/14 take precedence
• CPC Class Codes: G08G 1/096811 where the route is computed offboard
• CPC Class Codes: G08G 1/096844 where the complete route is dynamically recomputed based on new data

Abstract

It is an object of the present invention to provide a route searching which can reflect know-how such as easiness of running included in the probe car data in an entire route from departure place to destination.

A center device detects main branch nodes from probe car data received from an in-vehicle terminal device by means of a main branch node detecting section. A probe car data dividing section divides the probe car data into probe segments by the main branch nodes. A route dividing section divides an initial route generated by a initial route generating section based on specified departure place and destination, and a derived route generating section substitutes probe segments for the divided routes so as to generate derived routes. The route selecting section scores the derived routes and select one so as to provide a recommended route in which know-how such as easiness of running included in the probe car data is reflected.

Claims

1. A route searching system which searches for routes based on specified departure place and destination using probe car data including running history data of a vehicle, comprising:

a main branch node detecting section which detects main branch nodes as intersection nodes with a lot of branching of the vehicle based on the probe car data;

a probe car data dividing section which divides route information of the probe car data using the main branch nodes so as to obtain probe segments;

an initial route generating section which generates an initial route based on the departure place and the destination;

a route dividing section which divides the route information into a plurality of partial routes using the main branch nodes;

a derived route generating section which substitutes the probe segments for at least one partial route so as to generate derived routes; and

a route selecting section which selects at least one of the generated derived routes,

wherein the derived route generating section substitutes the probe segments for the partial routes obtained by dividing the initial route as the route information in the route dividing section so as to generate derived routes.

2. The route searching system according to claim 1, wherein

the route dividing section further divides the route information as the derived route selected by the route selecting section into partial routes,

the derived route generating section substitutes the probe segments for the partial routes so as to generate derived routes.

3. The route searching system according to claim 2, wherein

a determination condition is such that the derived route generating section executes a repeating process for generating derived routes based on the derived route selected by the route selecting section at predetermined number of times,

or, the derived route generating section includes a derived route database in which the generated derived routes are recorded,

the derived route generating section ends the repeating process for generating the derived routes based on the derived route selected by the route selecting section under the determination condition such that the number of new derived routes unrecorded in the derived route database among the generated derived routes is less than the predetermined number, and outputs the derived route selected by the route selecting section at the end point as a recommended route.

4. The route searching system according to claim 1, further comprising:

a map database in which a length of a road link is recorded,

wherein at least when a number of running vehicles is large, the route selecting section gives higher score to the derived routes based on lengths of the derived routes obtained from the map database, necessary time and the number of running vehicles on the derived routes obtained from the probe car data, and selects one or a plurality of derived routes having the higher score.

5. A route searching method for searching for a route based on specified departure place and destination using probe car data including running history data of a vehicle, comprising:

executing a main branch node detecting process for detecting intersection nodes with many branching of the vehicle based on the probe car data as main branch nodes and a probe car data dividing process for dividing route information of the probe car data using the main branch nodes so as to obtain probe segments so as to obtain the main branch nodes and the probe segments in advance;

generating an initial route based on the specified departure place and the destination;

executing a route dividing process for dividing the route information into a plurality of partial routes using the main branch nodes so as to divide the initial route into partial routes;

executing a derived route generating process for substituting the probe segments for at least one partial route so as to generate derived routes, and generating derived routes in which the partial routes obtained by dividing the initial route are substituted; and

executing a route selecting process for selecting at least one of the generated derived routes so as to obtain a selected route.

6. The route searching method according to claim 5, wherein

at the route dividing process, the derived route selected at the route selecting process is used as new route information so as to divide the route information into partial routes;

at the derived route generating process, the probe segments are substituted for the partial routes so as to generate derived routes.

7. The route searching method according to claim 6, wherein

at the derived route generating process, a determination condition is such that a repeating process for generating the derived routes based on the derived route selected at the route selecting process is executed at a predetermined number of times;

or, at the derived route generating process, the generated derived routes are recorded,

at the derived route generating process, the repeating process for generating derived routes based on the derived route selected at the route selecting process is ended under the determination condition such that a number of new derived routes not included in the recorded derived routes among the generated derived routes is less than a predetermined number, and the derived route selected at the route selecting process at the end time is output as a recommended route.

8. The route searching method according to claim 5, wherein

at the route selecting process, at least when a number of running vehicles is large, higher score is given to the derived routes based on lengths of the derived routes obtained from a map database, necessary time and the number of running vehicles on the derived routes obtained from the probe car data, and one or a plurality of derived routes having the higher score is selected.