METHOD, APPARATUS AND COMPUTER PROGRAM FOR SELECTING AND DISPLAYING ROUTE FAVORABLE TO DRIVER

• US 20130060463A1
• Filed: 09/05/2012
• Published: 03/07/2013
• Est. Priority Date: 09/06/2011
• Status: Abandoned Application

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Osogami, Takayuki, Onsj, Mikael Folke
• Application Number:
  US13/603,975
• Publication Number:
  US 20130060463A1
• Time in Patent Office: Days
• US Class Current: 701/428
• CPC Class Codes: G01C 21/3446 Details of route searching algorithms, e.g. Dijkstra, A*, arc-flags, using precalculated routes

Abstract

A method and apparatus for selecting and displaying a route preferable to a driver while reducing the frequency of changing the route. A dynamic strategy is computed which depends on time required to reach each intersection to be passed through between a departure place and a destination place. A probability distribution of the required time for each intersection and a driving direction to be selected is computed according to the computed dynamic strategy. A driving direction having the highest probability of the required time is sequentially selected to determine intersections to be passed through to the destination. At each intersection, the probability of the required time for each driving direction can be added and a driving direction that has the highest total probability among the results of the additions can be sequentially selected.

Claims

1. A method of selecting and displaying a route for a driver, the method comprising the steps of:

computing a dynamic strategy depending on a time required to reach each intersection potentially passed through between a departure place and a destination place;

computing, according to the computed dynamic strategy, a probability distribution of the required time for each intersection and a driving direction to be selected depending on the required time; and

selecting, sequentially, a driving direction having the highest probability of the required time to determine intersections to be passed through to the destination place.

2. The method according to claim 1, further comprising the step of:

at each intersection, adding the probability of the required time for each of the driving directions, wherein a direction having the highest total probability among the results of the additions is sequentially selected.

3. An apparatus for selecting and displaying a route for a driver, comprising:

a dynamic strategy computing unit that computes a dynamic strategy depending on a time required to reach each intersection potentially passed through between a departure place and a destination place;

a driving direction computing unit that computes, according to the computed dynamic strategy, a probability distribution of the required time for each intersection and a driving direction to be selected depending on the required time; and

an intersection determining unit that sequentially selects a driving direction having the highest probability of the required time to determine intersections to be passed through to the destination place.

4. The apparatus according to claim 3, further comprising:

a probability adding unit adding, at each intersection, the probability of the required time for each driving direction, wherein the intersection determining unit sequentially selects a driving direction having the highest total probability among the results of the additions.

5. A non-transient computer readable storage medium tangibly embodying a computer readable program code having computer readable instructions which, when implemented, cause a computer to carry out the steps of a method of selecting and displaying a route for a driver, the method comprising:

computing a dynamic strategy depending on a time required to reach each intersection potentially passed through between a departure place and a destination place;

computing, according to the computed dynamic strategy, a probability distribution of the required time for each intersection and a driving direction to be selected depending on the required time; and

selecting, sequentially, a driving direction having the highest probability of the required time to determine intersections to be passed through to the destination place.

6. The non-transient computer readable storage medium according to claim 5, further comprising:

at each intersection, adding the probability of the required time for each of the driving directions, wherein a direction having the highest total probability among the results of the additions is sequentially selected.