Re-routing apparatus and method for calculating an optimum alternative path to an original path from a position deviated from the original path in a navigation system

Description

[0001] The present invention relates to a navigation system, and more particularly, to a re-routing apparatus and method for calculating an optimum alternative path to an original path from a position deviated from the original path and then performing a re-routing for a path to a destination according to the calculated result when a movable body receiving path guidance through a navigation system has deviated from the original path.

[0002] In general, movable bodies such as ships, airplanes and cars, may be provided with navigation systems. A navigation system receives radio signals, representing coordinates, e.g., latitude, a longitude, an altitude, etc., from a plurality of satellites included in the Global Positioning System (GPS), and calculates a current position of a movable body. Further, such a navigation system displays geographical information including the current position of the movable body according to map data stored in advance. That is, such a general navigation system provides drivers with various information necessary for driving, by means of information received from the GPS. For example, it displays on a screen a current speed of movement, a path of movement, set by a driver before driving, and an optimum path to a destination.

[0003] FIG 1 is a diagram showing the make-up of a conventional navigation system. Such navigation system includes a GPS satellite 10, a mobile terminal 30, for instance, cell phone, communicating with a wireless network 40 and a navigation terminal 20, for instance, a navigation kit, communicating with the GPS satellite 10 and the mobile terminal 30 in order to provide a driver with current position information and travel information of a movable body. In the exemplary navigation system the navigation terminal 20 and the mobile terminal 30 are provided in a car.

[0004] The navigation terminal 20 receives the position information of the movable body from the GPS satellite 10 and analyzes the position of the movable body. Further, the navigation terminal 20 transmits the position information to the mobile terminal 30 in order to provide the driver with the travel information of the corresponding position.

[0005] The mobile terminal 30 functions as an interface between the navigation system and driver. For instance, when the driver requests current position information of the movable object and a path to a destination by means of the mobile terminal 30, the navigation system provides corresponding information to the driver through a display unit (not shown) of the mobile terminal 30. Generally, the information thus provided through the display unit of the mobile terminal 30 is image information, and sound information is provided to the driver through a speaker installed on the navigation terminal 20.

[0006] For this, the mobile terminal 30 performs data transmission/reception with an information server 50 such as a traffic server, which is connected through the wireless network 40.

[0007] In general, the information server 50 constructs the travel information in a predetermined data format such as Route Guidance Information (RGI) data, and transmits the constructed data format to the navigation terminal 20 via the mobile terminal 30. The navigation terminal 20 analyzes the data format and provides the driver with the travel information of a corresponding position. In this case, the RGI data is the travel information of a link unit.

[0008] FIG 2 illustrates a data format of RGI data 60 utilized conventionally in a navigation system. The RGI data 60 includes a link number field 61, a travel distance field 62, a road type field 63 and a travel information field 64. Each field stores the following information. The link number field 61 stores an identification number regarding the link, the travel distance field 62 stores an entire travel distance of a corresponding link, the road type field 63 stores road types of the corresponding link such as a local highway, a national highway or an express highway. Further, the travel information field 64 stores travel information regarding what is in front of a movable body, such as a left turn 200m in front and a sharp curve 300m in front. The RGI data 60 may further include a field for storing additional service information regarding a corresponding path.

[0009] FIG. 3 is a flow chart of a path guidance method according to a conventional embodiment. First, if a user inputs a destination to the mobile terminal 30 in order to obtain optimum path information for a predetermined destination, the mobile terminal 30 transmits, in step S10, current position information sent from the navigation terminal 20 and, in step S11, the destination information, to the information server 50 via the wireless network. In the present case, the navigation terminal 20 detects the current position information of the movable object by means of a GPS receiver and transmits the detected result to the mobile terminal 30. The information server 50 calculates in step S12 an optimum path to a corresponding destination by using real-time traffic information stored in advance, and transmits first RGI data, which has been generated by the result from the calculation, to the navigation terminal 20 via the mobile terminal 30 in steps S 13, and S 14 respectively. In the present example, the information server 50 receives the real-time traffic information from an outside server such as the traffic server, or manages the information after collecting the information itself.

[0010] Further, in step S15 the navigation terminal 20 tracks a current position of a movable body by comparing the first RGI data with sensor data collected by itself, and in step S16 transmits path guidance information according to the result from the tracking, to the mobile terminal 30. Further, on the basis of the result from the tracking, the navigation terminal 20 judges whether the movable body has deviated from a path transmitted from the information server 50 or not. When a deviation is detected in step S17, the navigation terminal 20 transmits the deviation information such as a deviated position information to the mobile terminal 30 in step S 18.

[0011] The mobile terminal 30, which has received the deviation information, transmits the deviation information to the information server 50 after connecting to the information server 50 via the wireless network, in order to obtain an optimum path from the position deviated from the original path, hereinafter, referred to 'deviated position' to a destination and provide the obtained optimum path to the navigation terminal 20 in step S 19.

[0012] In step S20 the information server 50 recalculates the optimum path to the destination from the deviated position by means of the deviation information and the already stored destination information and transmits second RGI data, which has been generated as a result of the calculation, to the navigation terminal 20 via the mobile terminal 30 in steps S21 and S22respectively. That is, in the prior art, when the movable body has deviated from an initial path transmitted from the information server 50, the navigation terminal 20 must receive the optimum path from the deviated position to the destination again, only after reconnection to the information server 50 via the mobile terminal 30.

[0013] Accordingly, in the prior art, there is a problem in that the navigation system user must defray a communication cost for reconnection to the information server 50. Further, in the conventional navigation system, it takes too much time for a user to reconnect to the information server 50 and receive a new path, thereby increasing inconvenience to the user. Moreover, since the movable body goes on moving until it receives the new path, there is a high possibility that another deviation from the new received path may occur.

[0014] Document EP 0 805 336 A2 describes a route setting method and apparatus in a navigation system for setting an appropriate new route in case that the vehicle is deviated from the route set in advance.

[0015] It is the object of the present invention to provide a re-routing method and apparatus for calculating an optimum path from a deviated position to an original path, and for performing a re-routing for a path to a destination according to the calculated result, when a movable body has deviated from a predetermined path.

[0016] This object is solved by the subject matters of the independent claims. Preferred embodiments are defined in the dependent claims.

[0017] It is an aspect of the present invention to provide a re-routing method and apparatus for enabling a navigation terminal by itself to calculate an optimum path from a deviated position to an original path, and for performing a re-routing for a path to a destination according to the calculated result, without connecting with servers through a communication network.

[0018] It is another aspect of the present invention to provide a re-routing method and apparatus for calculating an optimum path from a deviated position to an original path by means of map information already stored in a navigation terminal, and for performing a re-routing for a path to a destination according to the calculated result.

[0019] It is a further aspect of the present invention to provide a re-routing method and apparatus for calculating an optimum path from a deviated position to an original path of a destination direction, and for performing a re-routing for a path to a destination according to the calculated result.

[0020] The above features and advantages of the present invention will be more apparent from the following detailed description taken in conjunction with the accompanying drawings, in which:

FIG. 1 is a diagram showing a construction of a conventional navigation system;

FIG 2 is a diagram of a data format of RGI data 60 utilized conventionally in a navigation system;

FIG 3 is a flow chart of a path guidance method according to a conventional embodiment;

FIG 4 is a flow chart of a path guidance method according to an embodiment of the present invention;

FIG. 5 is a block diagram showing a schematic construction of a re-routing apparatus according to an embodiment of the present invention;

FIG. 6 is a flow chart of a re-routing method according to a first embodiment of the present invention;

FIG 7 is a flow chart of a re-routing method according to a second embodiment of the present invention; and

FIG 8a and FIG 8b are two dimensional space graphs showing a result from the re-routing according to the first and the second embodiment of the present invention.

[0021] Hereinafter, preferred embodiments of the present invention will be described with reference to the accompanying drawings. In the following description of the present invention, a detailed description of known functions and configurations incorporated herein will be omitted when it may make the subject matter of the present invention unclear.

[0022] FIG 4 is a flow chart of a path guidance method according to an embodiment of the present invention. First, if a user inputs a destination to the mobile terminal 300 in order to obtain optimum path information to a predetermined destination, the mobile terminal 300 transmits current position information sent from the navigation terminal 200 and the destination information to the information server 500 via the wireless network in steps S101 and S105 respectively. In this case, the navigation terminal 200 detects the current position information by means of a GPS receiver and transmits the detected result to the mobile terminal 300. The information server 500 calculates an optimum path to a corresponding destination by using real-time traffic information stored in advance in step S110, and transmits RGI data, which has been generated by the result from the calculation, to the navigation terminal 200 via the mobile terminal 300 in steps S115 and S120respectively. In this case, the information server 500 receives the real-time traffic information from an outside server such as the traffic server, or manages the information after collecting the information by itself

[0023] In step S125, the navigation terminal 200 tracks a current position of the movable body by means of the first RGI data, sensor data collected by itself, and stored map data. Further, the navigation terminal 200 transmits path guidance information according to the result obtained by tracking to the mobile terminal 300 in step S 130. According to the result obtained by tracking in step S125, it is judged in step S 135 whether a movable body has deviated from a path transmitted from the information server 500 or not. Herein, since a method, for judging whether the movable body has deviated from the path or not departs from the subject matter of the present invention, a detailed description for such a path deviation judgment method is omitted.

[0024] From the result of the judgment in step S 135, when it is judged that the movable body has deviated from the path, the navigation terminal 200 in step S 140 recalculates a path by itself by means of deviation information such as deviated position link information. That is, the navigation terminal 200 calculates an optimum path from the position deviated from the original path, hereinafter, referred to 'deviated position' to a predetermined path included in the optimum path received from the information server 500 by means of the map data already stored in the navigation terminal 200.

[0025] In step 145, the navigation terminal 200 generates RGI data according to the result of step S 140 of the calculation, and then guides the movable body through a path of step S130, while tracking the position of the movable body in step S125. Further, the navigation terminal 200 repeatedly carries out a series of steps S125 to S 145 of detecting, in step S135, if there exists a deviation of the movable body from the original path or not.

[0026] Thus, according to the present invention, the navigation terminal 200 does not have to reconnect with the information server 500 in order to provide re-routing information to a movable body, which has deviated from a path.

[0027] FIG 5 is a block diagram showing a schematic construction of a re-routing apparatus according to an embodiment of the present invention. The re-routing apparatus 600 includes a deviation information input section 610, an adjacent link detecting and judging section 620, a second table 630, a path selecting section 640, a first table 650, a re-routing information extraction section 660.

[0028] When a traveling movable body has deviated from a predetermined path having been provided by an information server, the deviation information input section 610 receives deviation information such as deviated position link information, and then stores the deviated position link information in the first table 650. Further, the deviation information input section 610 transmits the deviated position link information to the adjacent link detecting and judging section 620, and enables the adjacent link detecting and judging section 620 to detect links adjacent to the deviated position link.

[0029] The adjacent link detecting and judging section 620 detects link information detected from map data in a process of calculating an optimum path from the deviated position to the original path. That is, the adjacent link detecting and judging section 620 detects links from map data, which are adjacent to reserved links, which will be included in the deviated position link, or the optimum link. In this case, if there is an adjacent link meeting the original path from among the detected adjacent links, the adjacent link detecting and judging section 620 stores the corresponding adjacent link in the first table. On the contrary, if there is no link meeting the original path from among the detected adjacent links, the adjacent link detecting and judging section 620 stores the adjacent link information in the second table 630. Further, the adjacent link detecting and judging section 620 judges if there exist a link meeting the original path from among the detected adjacent links, or if the link of the original path meeting the detected links is a destination link. From the result of the judgment, the adjacent link detecting and judging section 620 controls an operation of the path selecting section 640 and the re-routing information extraction section 660. For example, when the destination link is included in the detected adjacent links, the re-routing information extraction section 660 performs an inverse trace for the destination links on the basis of the link information stored in the first table 650, and enables the re-routing paths to be determined. When there is no link meeting the original path from among the detected adjacent links, the adjacent link detecting and judging section 620 stores the detected adjacent links in the second table 630 and then enables the path selecting section 640 to select a link having a minimum cost from the second table, and to move the selected link to the first table.

[0030] The second table 630 temporarily stores link information detected by the adjacent link detecting and judging section 620. In the present example, the link information stored in the second table 630 includes an accumulated travel cost information from the deviated position to the corresponding link according to each link.

[0031] According to the control of the adjacent link detecting and judging section 620, the path selecting section 640 analyzes the link information stored in the second table 630, and selects an optimum path from the deviated position link to one link from among links included in the original path. In the present example, the path selecting section 640 selects an optimum path, for instance, an optimum path to predetermined destination provided from the information server according to a user request, from the deviated position to the original path by means of a path calculation algorithm generally utilized in a navigation system. The path selecting section 640 selects an optimum path from the deviated position link to any one link from among the plurality of links. In order to calculate the optimum path, the path selecting section 640 selects a link from among links stored in the second table 630, which has a minimum travel cost, and then stores the selected link in the first table 650. Further, the path selecting section 640 enables the adjacent link detecting and judging section 620 to detect links adjacent to the selected link.

[0032] The first table 650 stores link information selected as reserved links, which will be included in the optimum path, from the second table 630 in a process that the path selecting section 640 calculates the optimum path.

[0033] According to the control of the adjacent link detecting and judging section 620, the re-routing information extraction section 660 extracts links included in the optimum path from the deviated position to the original path, from among links stored in the first table 650, and then extracts re-routing paths including the extracted links. That is, the re-routing information extraction section 660 extracts the re-routing paths, which enables the movable body to arrive at a destination of the original path from the deviated position via the optimum path. It is preferred that the re-routing apparatus 600 is embedded in the navigation terminal 200 (FIG. 4).

[0034] FIGs. 6 and 7 are flowcharts illustrating re-routing methods according to a first and a second embodiment of the present invention respectively. That is, FIG. 6 is a flowchart of a re-routing method according to the first embodiment of the present invention, in which a first one of links meeting a link extending in a direction having a small accumulated travel cost from a deviated position or a selected link is selected from among links included in the original path, and then a path from the deviated position through the selected link to the destination is determined as the re-routing path. FIG 7 is a flowchart of a re-routing method according to the second embodiment of the present invention, in which information about a predetermined number of links meeting the link extending in a direction having a small accumulated travel cost from a deviated position or a selected link is compared with each other, so as to select a link having a minimum sum of a first cost necessary for traveling from the deviated position to corresponding link and a second cost necessary for traveling from the link to destination, and then a path from the deviated position through the selected link to the destination is determined as the re-routing path.

[0035] Referring to FIGs. 5 and 6, the re-routing method according to the first embodiment of the present invention is described. When the movable body, which has traveling according to a predetermined path guidance transmitted from the navigation terminal 200, has deviated from the path, a predetermined apparatus such as a deviation sensing section, which was installed on the navigation terminal 200, senses the path deviation of the movable body and then transmits the path deviation information such as the deviated position link information to the re-routing apparatus 600.

[0036] Next, the deviation information input section 610 stores the deviated position link information in the first table 650 in step S205 and transmits the deviated position link information to the adjacent link detecting and judging section 620. The adjacent link detecting and judging section 620 detects links adjacent to the deviated position link from the map data by means of the deviated position link information in step S210 and checks, in sequence, if there exist the destination link from among the detected links, or if there exist links meeting the original path from among the detected links in steps S215 and S220 respectively. From the result obtained by checking steps S215 and S220, when the destination link has not been included in the detected links and there are no links meeting the original path from among the detected links, the adjacent link detecting and judging section 620 stores the detected links in the second table 630 in step S225. In this case, the link information stored in the second table 630 includes accumulated travel cost information from the deviated position to corresponding link according to each link.

[0037] The path selecting section 640 selects a link from among the links stored in the second table 630, which has a minimum accumulated cost, and then enables the selected links to be moved from the second table 630 to the first table 650 in step S235. Further, the path selecting section 640 controls the adjacent link detecting and judging section 620 to detect links adjacent to the selected links. The adjacent link detecting and judging section 620 detects links adjacent to the selected links in step S240, and then loops to perform step S215 and step S220.

[0038] From the result obtained by checking in step S215, when the destination link has not been included in the links detected in step S210 or there exist links meeting the original path from among the detected links, the destination link from among the detected adjacent links or the link meeting the original path are backtracked. From the result of backtracking, the optimum path from the deviated position to the original path is extracted and the re-routing paths, which include links included in the optimum path, are extracted in step S245. That is, in step S245, the optimum path is extracted by backtracking the links prior to the selected links, and the re-routing paths are extracted, which enable the movable body to arrive at the destination of the original path from the deviated position via the optimum path.

[0039] Referring now to FIGs. 5 and 7, the re-routing method according to the second embodiment of the present invention is described below. As described above, according to the re-routing method of the second embodiment of the present invention, information about a predetermined number of links meeting the link extending in a direction having a small accumulated travel cost from the deviated position is compared with each other, so as to select a link having a minimum sum (hereinafter, referred to a third cost SUM_COST) of a first cost necessary for traveling from the deviated position to corresponding link and a second cost necessary for traveling from the link to destination, and then a path from the deviated position through the selected link to the destination is determined as the re-routing path. The second embodiment of the present invention includes a first variable CNT and a second variable MIN_COST, and initializes the first variable CNT and the second variable MIN_COST in step S305, wherein a first variable counts the number of times, by which the deviated position link and the original path meet each other, and the second variable MIN_COST compares the third costs SUM_COST necessary for traveling from the deviated position to the destination via links meeting the deviated link from among links included in the original path.

[0040] In this case, it is preferred that the second variable MIN_COST is a larger value than the third cost SUM_COST which may actually occur. This is for the original third cost SUM_COST to be updated into the second variable MIN_COST. In the example of FIG. 7, the second variable MIN_COST was set to slightly larger value than a total cost necessary for traveling from a first starting point to the destination. However, when the third cost SUM_COST necessary for traveling from the deviated position to the destination via the links meeting the deviated position link is actually very larger than a value set as an initial value of the second variable MIN_COST in step S305, the time information is discarded.

[0041] Accordingly, in order to exclude a case in which a time necessary for traveling from the deviated position to the destination exceeds a predetermined time when the re-routing has been performed, the second variable MIN_COST is set to a predetermined time value. For example, as the example of FIG. 7, in a case in which the second variable MIN_COST is set to a total time necessary for traveling from the first starting point to the destination, when the time necessary for traveling from the deviated position to the destination exceeds the total time necessary for traveling from the first starting point to the destination when the re-routing is performed, the re-routing information becomes useless. Here, the navigation system can provides the user with a message, which guides the user to reconnect to the server and find an optimum path from a current position to the destination, together with a re-routing error message. In the present example, when the movable body returns to the first starting point and comes into contact with the original path after having deviated from a path early, since the second variable MIN_COST may be larger than the original third cost SUM_COST, the initial value of the second variable MIN _COST may be set to a slightly larger value than the original third cost SUM_COST.

[0042] When the variables, i.e. the first variable CNT, the second variable MIN_COST, for the second embodiment of the present invention have been initialized, the deviation information input section 610 waits for receiving the path deviation information, for instance, the deviated position link information, etc., of the movable body outputted from the predetermined apparatus such as the deviation sensing section, which was installed on the navigation terminal 200.

[0043] Further, when the movable body, which has traveling according to a predetermined path guidance transmitted from the navigation terminal 200, has deviated from the path, and the predetermined apparatus, such as the deviation sensing section, transmits the path deviation information of the movable body such as the deviated position link information, the deviation information input section 610 stores the deviated position link information in the first table 630 in step S310, and then transmits the deviated position link information to the adjacentlink detecting and judging section 620.

[0044] The adjacent link detecting and judging section 620 detects links adjacent to the deviated position link from the map data by means of the deviated position link information in step S315, and then judges if there exist links meeting the original path from among the detected adjacent links in step S320.

[0045] From the result of the judgment in step S320, when there is no link meeting the original path from among the detected adjacent links, the adjacent link detecting and judging section 620 stores the detected adjacent links in the second table 630 in step S325. In this case, the link information stored in the second table 630 includes accumulated cost information from the deviated position to corresponding link according to each link.

[0046] Further, according to the adjacent link detecting and judging section 620, the path selecting section 640 selects a link from among the adjacent links stored in the second table 630, which has a minimum cost, and then enables the selected links to be moved to the first table 650 in step S330. Further, the adjacent link detecting and judging section 620 detects links adjacent to the selectedlinks in step S335, and then performs step S320.

[0047] From the result of the judgment in step S320, when there exist a link meeting the original path from among the detected adjacent links, the adjacent link detecting and judging section 620 judges again if the link of the original path meeting the detected links is a destination link in step S340.

[0048] From the result of the judgment in step S340, when the link of the original path meeting the detected links is the destination link, the adjacent link detecting and judging section 620 enables the re-routing information extraction section 660 to perform the inverse trace for the destination links and to determine the re-routing paths.

[0049] Next, the re-routing information extraction section 660 determines the re-routing paths by performing the inverse trace for the destination links on the basis of the link information stored in the first table 650 in step S380. That is, in step S380, an optimum path is extracted by backtracking the link prior to the destination link, and the re-routing paths are extracted, which enable the movable body to arrive at the destination of the original path from the deviated position via the optimum path.

[0050] From the result of the judgment in step S340, when the link of the original path meeting the detected links is not the destination link, the adjacent link detecting and judging section 620 compares the first variable CNT with a predetermined value N set in advance, so as to check the number of times, by which the adjacent link and the original path meet each other in step S345.

[0051] As a result of the comparison in step S345, when the first variable CNT is not larger than the predetermined value N set in advance, the value of the first variable CNT is increased by '1' in step S350, and then a fourth cost D_COST is calculated in step S355, which is an cost considering an cost necessary for traveling to the destination, that is, an cost considering the sum of the cost obtained by adding the first cost necessary for traveling from the deviated position to the corresponding link and the second cost necessary for traveling from the link to destination.

[0052] Further, the calculated fourth cost D_COST is compared with the second variable MIN_COST in step S360. Herein, when the second variable MIN_COST is larger than the fourth cost D_COST, the second variable MIN_COST is updated by means of the fourth cost D_COST, and corresponding link information is stored in the third variable MIN_LINK in step S365. This is for a link, which has a minimum fourth cost D_COST considering the cost to the destination, to be selected by comparing predetermined number N of link information meeting the deviated position link from among links included in the original path. From the result of the comparison in step S360, when the second variable MIN_COST is not larger than the fourth cost D_COST, step S365 is omitted. And, an adjacent links, which exclude current link, for instance, a link of the original path meeting the detected adjacent links, is stored in the second table 630 in step S370, and then step S330 and the consequent steps are repeated.

[0053] From the result of the comparison in step S345, when the first variable CNT is larger than the predetermined value N set in advance, since the number of meeting the original path is larger than the predetermined value N set in advance, re-routing paths are determined by backtracking the links stored in the third variable MIN_LINK (S375). That is, in step S375, the optimum path is extracted by backtracking links prior to links stored in the third variable MIN_LINK, and the re-routing paths are extracted, which enable the movable body to arrive at the destination of the original path from the deviated position via the optimum path.

[0054] FIGs. 8a and 8b are directional graphs showing a result from the re-routing according to the first and the second embodiment of the present invention. The reference character 'P' represents a position of the deviated position of the movable body, an arrow under 'P' represents a moving direction of the movable body, and a big arrow L marked by a thick line represents the original path, wherein the direction of the arrow represents the direction of the destination. Thick arrows connected from the position of the deviated position of the movable body to the original path L represent re-routing paths (ℓ1, ℓ2, ℓ3) according to the first and the second embodiment.

[0055] As described above, in a re-routing apparatus according to the present invention, when the movable body traveling on a predetermined path provided by the navigation system has deviated from the path, a navigation terminal by itself can calculate an optimum path from a deviated position to the original path without connecting with a server, thereby reducing communication cost for connection to the server and decreasing possibility of another deviation due to time delay taken until new paths are provided.

[0056] While the invention has been shown and described with reference to certain preferred embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the scope of the invention as defined by the appended claims.

Claims

1. A re-routing method in a navigation system, the method comprising the steps of:

(1) when a movable body has deviated from a predetermined original path, detecting (S315) adjacent links from the original path;

(2) checking (S320) in sequence if there exists a link meeting the original path from among the adjacent links;
when there exists a link meeting the original path from among the adjacent links,

(3) determining (S340) if the link meeting the original path is a destination link;

(4) when the link meeting the original path is not the destination link, storing (S370) link information about the link meeting the original path in a first table (650), and counting the number of times by which the adjacent links and the original path meet each other;

(5) when (S345) the number of times, by which the adjacent links and the original path meet each other, is larger than a predetermined number set in advance, selecting the link having the minimum cost necessary for traveling from the deviated position to the destination via the corresponding link; and

(6) determining (S375) re-routing paths by backtracking the link selected on the basis of the link information; and
when there is no link meeting the original path from among the detected adjacent links and the destination link is not among the detected adjacent links,

(7) temporarily storing (S325) the detected adjacent links in a second table (630) together with link information including accumulated cost information from the deviated position to each of the stored adjacent links;

(8) selecting (S330) the adjacent link from the second table with the minimum accumulated travel cost;

(9) detecting (S335) links adjacent to the selected adjacent link with the minimum accumulated travel cost; and

(10) turning back to step (2).

2. The re-routing method as claimed in claim 1, wherein in step (6) a first one of links meeting a link extending in a direction having a small accumulated travel cost from the deviated position is determined as the re-routing path.

3. The re-routing method as claimed in claim 1, wherein the method further comprises the steps of:

as a result of checking in step (2), when there exists the link meeting the original path among the adjacent links, determining which paths are re-routing paths to the destination via the adjacent link.

4. The re-routing method as claimed in claim 1, wherein information about a predetermined number of links meeting the link extending in the direction having a small accumulated travel cost from the deviated position link is compared with each other, so as to select a link having a minimum sum of a first cost necessary for traveling from the deviated position to a corresponding link and a second cost necessary for traveling from the link to destination, and then a path from the deviated position through the selected link to the destination is determined as the re-routing path.

5. The re-routing method as claimed in claim 1, wherein the method further comprises the step of determining a re-routing error, when the cost exceeds a predetermined cost set in advance, which is a cost necessary for traveling from the deviation from the original path to the destination via the link having minimum cost selected in the selecting step.

6. A re-routing apparatus adapted to perform the method of claim 1 in a navigation system, the apparatus comprising:

a deviation information input section (610) adapted to receive the deviated position link information when the movable body traveling on the predetermined original path provided from the navigation system has deviated from the original path;

an adjacent link detecting and judging section (620) adapted to:

(1) detect the adjacent links;

(2) check in sequence if there exists a link meeting the original path from among the adjacent links;

when there exists a link meeting the original path that is not a destination link,

(3) enable a first table (650) to store the link information about the link meeting the original path, and count the number of times by which the adjacent links and the original path meet each other; and

(4) when the number of times, by which the adjacent links and the original path meet each other, is larger than the predetermined number set in advance, enable a path selecting section (640) to select the link having the minimum cost necessary for traveling from the deviated position to the destination via the corresponding link; and
when there is no link meeting the original path from among the detected adjacent links and the destination link is not among the detected adjacent links,

(5) temporarily store the detected adjacent links in the second table (630) together with link information including accumulated cost information from the deviated position to each of the stored adjacent links;

(6) select the adjacent link from the second table with the minimum accumulated travel cost;

(7) detect links adjacent to the selected adjacent link with the minimum accumulated travel costs; and

(8) turn back to step (2);

the first table (650) adapted to store the link information about the link meeting the original path;

the second table (630) adapted to store temporarily the detected adjacent links not meeting the original path together with link information including accumulated cost information from the deviated position to each of the stored adjacent links;

the path selecting section (640) adapted to select the link having the minimum cost necessary for traveling from the deviated position to the destination via the corresponding link; and

a re-routing information extracting section (660) adapted to determine the re-routing paths by backtracking the link selected by the path selecting section, on the basis of the link information.

7. The re-routing apparatus as claimed in claim 6, wherein the deviation information input section (610) transmits the deviated position link information to the adjacent link detecting and judging section (620) and the adjacent link detecting and judging section (620) detects links adjacent to the deviated position link.

8. The re-routing apparatus as claimed in claim 6, wherein the apparatus further comprises a second table (630) adapted to store link information including accumulated cost information from the deviated position to a corresponding link according to each link detected by the adjacent link detecting and judging section.

9. The re-routing apparatus as claimed in claim 8, wherein the path selecting section (640) selects a link from among links stored in the second table (630) as a reserved link which has a minimum accumulated cost, stores the selected link in the first table (650), transmits the reserved link information to the adjacent link detecting and judging section (620), and the adjacent link detecting and judging section (620) detects links adjacent to the reserved links.

10. The re-routing apparatus as claimed in claim 6, wherein the adjacent link detecting and judging section (620) detects the deviated position link transmitted from the deviation information input section (610) and the links adjacent to the reserved links selected by the path selecting section (640).

11. The re-routing apparatus as claimed in claim 10, wherein the adjacent link detecting and judging section (620) controls an operation of the second table (630), the path selecting section (640) and the re-routing information extraction section (660) on the basis of the checking result.

12. The re-routing apparatus as claimed in claim 11, wherein as a result of the checking, when there are destination links from among the adjacent links, the adjacent link detecting and judging section (620) enables the re-routing information extraction section (660) to determine the re-routing paths by backtracking the destination link on the basis of the link information stored in the first table (650).

13. The re-routing apparatus of one of claims 6 to 12, wherein the re-routing apparatus is part of a navigation system.

Ansprüche

1. Rückleitverfahren in einem Navigationssystem, wobei das Verfahren die folgenden Schritte umfasst:

(1) wenn ein beweglicher Körper von einem vorgegebenen ursprünglichen Weg abgewichen ist, Erfassen (S315) angrenzender Verbindungen von dem ursprünglichen Weg;

(2) sequenzielles Prüfen (S320), ob unter den angrenzenden Verbindungen eine Verbindung existiert, die auf den ursprünglichen Weg trifft;
wenn unter den angrenzenden Verbindungen eine Verbindung existiert, die auf den ursprünglichen Weg trifft,

(3) Feststellen (S340), ob die Verbindung, die auf den ursprünglichen Weg trifft, eine Zielverbindung ist;

(4) wenn die Verbindung, die auf den ursprünglichen Weg trifft, nicht die Zielverbindung ist, Speichern (S370) von Verbindungsinformationen über die Verbindung, die auf den ursprünglichen Weg trifft, in einer ersten Tabelle (650), und Zählen, wie oft die angrenzenden Verbindungen und der ursprüngliche Weg aufeinandertreffen;

(5) wenn (S345) die Häufigkeit, mit der die angrenzenden Verbindungen und der ursprüngliche Weg aufeinandertreffen, größer ist als eine vorgegebene, im Voraus festgelegte Zahl, Auswählen der Verbindung mit den minimalen benötigten Kosten für die Fahrt von der Abweichposition zu dem Ziel über die entsprechende Verbindung; und

(6) Bestimmen (S375) von Rückleitwegen durch Zurückverfolgen der ausgewählten Verbindung auf Basis der Verbindungsinformationen; und
wenn es unter den erfassten angrenzenden Verbindungen keine Verbindung gibt, die auf den ursprünglichen Weg trifft, und die Zielverbindung nicht unter den erfassten angrenzenden Verbindungen ist,

(7) temporäres Speichern (S325) der erfassten angrenzenden Verbindungen in einer zweiten Tabelle (630) zusammen mit Verbindungsinformationen, die Informationen über akkumulierte Kosten von der Abweichposition zu jeder der gespeicherten angrenzenden Verbindungen enthalten;

(8) Auswählen (S330) der angrenzenden Verbindung mit den minimalen akkumulierten Fahrtkosten aus der zweiten Tabelle;

(9) Erfassen (S335) von Verbindungen, die an die ausgewählte angrenzende Verbindung mit den minimalen akkumulierten Fahrtkosten angrenzen; und

(10) Zurückkehren zu Schritt (2).

2. Rückleitverfahren nach Anspruch 1, wobei in Schritt (6) eine erste von Verbindungen, die auf eine Verbindung treffen, die in einer Richtung mit geringen akkumulierten Fahrtkosten von der Abweichposition verläuft, als der Rückleitweg bestimmt wird.

3. Rückleitverfahren nach Anspruch 1, wobei das Verfahren des Weiteren die folgenden Schritte umfasst:

als Ergebnis des Prüfens in Schritt (2), wenn unter den angrenzenden Verbindungen die Verbindung existiert, die auf den ursprünglichen Weg trifft, Bestimmen, welche Wege Rückleitwege zu dem Ziel über die angrenzende Verbindung sind.

4. Rückleitverfahren nach Anspruch 1, wobei Informationen über eine vorgegebene Anzahl von Verbindungen, die auf die Verbindung treffen, die in der Richtung mit geringen akkumulierten Fahrtkosten von der Abweichposition verläuft, miteinander verglichen werden, um eine Verbindung auszuwählen, die eine minimale Summe erster Kosten hat, die für die Fahrt von der Abweichposition zu einer entsprechenden Verbindung benötigt werden, und zweite Kosten, die für die Fahrt von der Verbindung zu dem Ziel benötigt werden, und dann ein Weg von der Abweichposition über die ausgewählte Verbindung zu dem Ziel als der Rückleitweg bestimmt wird.

5. Rückleitverfahren nach Anspruch 1, wobei das Verfahren des Weiteren den Schritt des Feststellens eines Rückleitfehlers umfasst, wenn die Kosten im Voraus festgelegte, vorgegebene Kosten übersteigen, bei denen es sich um Kosten handelt, die für die Fahrt von der Abweichung von dem ursprünglichen Weg zu dem Ziel über die in dem Auswählschritt ausgewählte Verbindung mit minimalen Kosten benötigt werden.

6. Rückleitvorrichtung, die zum Durchführen des Verfahrens nach Anspruch 1 in einem Navigationssystem eingerichtet ist, wobei die Vorrichtung umfasst:

einen Abweichungsinformations-Eingabeabschnitt (610), der so eingerichtet ist, dass er die Abweichpositions-Verbindungsinformationen empfängt, wenn der bewegliche Körper, der auf dem von dem Navigationssystem bereitgestellten vorgegebenen ursprünglichen Weg fährt, von dem ursprünglichen Weg abgewichen ist;

einen Abschnitt (620) zum Erfassen und Beurteilen angrenzender Verbindungen, der so eingerichtet ist, dass er:

(1) die angrenzenden Verbindungen erfasst;

(2) sequenziell prüft, ob unter den angrenzenden Verbindungen eine Verbindung existiert, die auf den ursprünglichen Weg trifft;
wenn eine Verbindung existiert, die auf den ursprünglichen Weg trifft und keine Zielverbindung ist,

(3) eine erste Tabelle (650) aktiviert, um die Verbindungsinformationen über die Verbindung zu speichern, die auf den ursprünglichen Weg trifft, und zu zählen, wie oft die angrenzenden Verbindungen und der ursprüngliche Weg aufeinandertreffen; und

(4) wenn die Häufigkeit, mit der die angrenzenden Verbindungen und der ursprüngliche Weg aufeinandertreffen, größer ist als eine im voraus festgelegte vorgegebene Zahl, einen Wegauswählabschnitt (640) aktiviert, um die Verbindung mit den minimalen benötigten Kosten für die Fahrt von der Abweichposition zu dem Ziel über die entsprechende Verbindung auszuwählen; und
wenn es unter den erfassten angrenzenden Verbindungen keine Verbindung gibt, die auf den ursprünglichen Weg trifft und die Zielverbindung nicht unter den erfassten angrenzenden Verbindungen ist,

(5) temporär die erfassten angrenzenden Verbindungen in der zweiten Tabelle (630) zusammen mit Verbindungsinformationen speichert, die Informationen über akkumulierte Kosten von der Abweichposition zu jeder der gespeicherten angrenzenden Verbindungen enthalten;

(6) die angrenzende Verbindung aus der zweiten Tabelle mit den minimalen akkumulierten Fahrtkosten auswählt;

(7) Verbindungen erfasst, die an die ausgewählte angrenzende Verbindung mit den minimalen akkumulierten Fahrtkosten angrenzen; und

(8) zu Schritt (2) zurückkehrt;

die erste Tabelle (650), die so eingerichtet ist, dass sie die Verbindungsinformationen über die Verbindung speichert, die auf den ursprünglichen Weg trifft;

die zweite Tabelle (630), die so eingerichtet ist, dass sie temporär angrenzende Verbindungen, die nicht auf den ursprünglichen Weg treffen, zusammen mit Verbindungsinformationen speichert, die Informationen über akkumulierte Kosten von der Abweichposition zu jeder der gespeicherten angrenzenden Verbindungen enthalten;

den Wegauswählabschnitt (640), der so eingerichtet ist, dass er die Verbindung mit den minimalen Kosten speichert, die für die Fahrt von der Abweichposition zu dem Ziel über die entsprechende Verbindung benötigt werden; und

einen Rückleitinformations-Extrahierabschnitt (660), der so eingerichtet ist, dass er die Rückleitwege auf Basis der Verbindungsinformationen bestimmt, indem er die durch den Wegauswählabschnitt ausgewählte Verbindung zurückverfolgt.

7. Rückleitvorrichtung nach Anspruch 6, wobei der Abweichungsinformations-Eingabeabschnitt (610) die Abweichpositions-Verbindungsinformationen zu dem Abschnitt (620) zum Erfassen und Beurteilen angrenzender Verbindungen sendet, und der Abschnitt (620) zum Erfassen und Beurteilen angrenzender Verbindungen Verbindungen erfasst, die an die Abweichpositions-Verbindung angrenzen.

8. Rückleitvorrichtung nach Anspruch 6, wobei die Vorrichtung des Weiteren eine zweite Tabelle (630) umfasst, die so eingerichtet ist, dass sie Verbindungsinformationen, die Informationen über akkumulierte Kosten von der Abweichposition zu einer entsprechenden Verbindung enthalten, entsprechend jeder durch den Abschnitt zum Erfassen und Beurteilen angrenzender Verbindungen erfassten Verbindung speichert.

9. Rückleitvorrichtung nach Anspruch 8, wobei der Wegauswählabschnitt (640) eine Verbindung aus in der zweiten Tabelle (630) gespeicherten Verbindungen als eine reservierte Verbindung mit minimalen akkumulierten Kosten auswählt, die ausgewählte Verbindung in der ersten Tabelle (650) speichert, die Informationen über die reservierte Verbindung zu dem Abschnitt (620) zum Erfassen und Beurteilen angrenzender Verbindungen sendet, und der Abschnitt (620) zum Erfassen und Beurteilen angrenzender Verbindungen Verbindungen erfasst, die an die reservierte Verbindung angrenzen.

10. Rückleitvorrichtung nach Anspruch 6, wobei der Abschnitt (620) zum Erfassen und Beurteilen angrenzender Verbindungen die von dem Abweichungsinformations-Eingabeabschnitt (610) gesendete Abweichpositions-Verbindung und die Verbindungen erfasst, die an die von dem Wegauswählabschnitt (640) ausgewählte reservierte Verbindung angrenzen.

11. Rückleitvorrichtung nach Anspruch 10, wobei der Abschnitt (620) zum Erfassen und Beurteilen angrenzender Verbindungen eine Funktion der zweiten Tabelle (630), des Wegauswählabschnitts (640) und des Rückleitinformations-Extrahierabschnitts (660) auf Basis des Ergebnisses der Prüfung steuert.

12. Rückleitvorrichtung nach Anspruch 11, wobei als Ergebnis der Prüfung, wenn Zielverbindungen unter den angrenzenden Verbindungen vorhanden sind, der Abschnitt (620) zum Erfassen und Beurteilen angrenzender Verbindungen den Rückleitinformations-Extrahierabschnitt (660) aktiviert, um die Rückleitwege durch Zurückverfolgen der Zielverbindung auf Basis der in der ersten Tabelle (650) gespeicherten Verbindungsinformationen zu bestimmen.

13. Rückleitvorrichtung nach einem der Ansprüche 6 bis 12, wobei die Rückleitvorrichtung Teil eines Navigationssystems ist.

Revendications

1. Procédé de calcul d'une route alternative dans un système de navigation, le procédé comprenant les étapes consistant à :

(1) lorsqu'un corps mobile a dévié d'une trajectoire originale prédéterminée, détecter (S315) des liaisons adjacentes à la trajectoire originale ;

(2) vérifier (S320) dans la séquence s'il existe une liaison rejoignant la trajectoire originale parmi les liaisons adjacentes ;
lorsqu'il existe une liaison rejoignant la trajectoire originale parmi les liaisons adjacentes,

(3) déterminer (S340) si la liaison rejoignant la trajectoire originale est une liaison de destination ;

(4) lorsque la liaison rejoignant la trajectoire originale n'est pas une liaison de destination, enregistrer (S370) l'information de liaison concernant la liaison rejoignant la trajectoire originale dans une première table (650), et compter le nombre de fois où les liaisons adjacentes et la trajectoire originale se rejoignent ;

(5) lorsque (S345) le nombre de fois où les liaisons adjacentes et la trajectoire originale se rejoignent est supérieur à un nombre prédéterminé fixé à l'avance, sélectionner la liaison présentant le coût minimal nécessaire pour se déplacer de la position déviée jusqu'à la destination via la liaison correspondante ; et

(6) déterminer (S375) des trajectoires de route alternative en retraçant la liaison sélectionnée sur base de l'information de liaison ; et
lorsqu'il n'y a pas de liaison rejoignant la trajectoire originale parmi les liaisons adjacentes détectées et que la liaison de destination ne se trouve pas parmi les liaisons adjacentes détectées,

(7) enregistrer temporairement (S325) les liaisons adjacentes détectées dans une seconde table (630) avec l'information de liaison, y compris l'information de coût cumulé de la position déviée jusqu'à chacune des liaisons adjacentes enregistrées ;

(8) sélectionner (S330) la liaison adjacente de la seconde table dont le coût de déplacement cumulé est minimal ;

(9) détecter (S335) des liaisons adjacentes à la liaison adjacente sélectionnée dont le coût de déplacement cumulé est minimal ; et

(10) retourner à l'étape (2).

2. Procédé de calcul d'une route alternative selon la revendication 1 dans lequel, à l'étape (6), une première liaison rejoignant une liaison qui s'étend dans une direction à faible coût de déplacement cumulé depuis la position déviée est déterminée comme étant la trajectoire de route alternative.

3. Procédé de calcul d'une route alternative selon la revendication 1 dans lequel le procédé comprend en outre les étapes consistant à :

suite à l'étape de vérification (2), lorsqu'il existe la liaison rejoignant la trajectoire originale parmi les liaisons adjacentes, déterminer quelles trajectoires sont des trajectoires de route alternative jusqu'à la destination via la liaison adjacente.

4. Procédé de calcul d'une route alternative selon la revendication 1, dans lequel des informations concernant un nombre prédéterminé de liaisons rejoignant la liaison qui s'étend dans la direction à faible coût de déplacement cumulé depuis la liaison à position déviée sont comparées entre elles, de manière à sélectionner une liaison minimisant la somme d'un premier coût nécessaire pour se déplacer de la position déviée à une liaison correspondante et d'un second coût nécessaire pour se déplacer de la liaison jusqu'à la destination, et dans lequel une trajectoire de la position déviée via la liaison sélectionnée jusqu'à la destination est ensuite déterminée comme la trajectoire de route alternative.

5. Procédé de calcul d'une route alternative selon la revendication 1, dans lequel le procédé comprend en outre l'étape de détermination d'une erreur de route alternative lorsque le coût dépasse un coût prédéterminé fixé à l'avance, qui est le coût nécessaire pour se déplacer de la déviation de la trajectoire originale vers la destination via la liaison à coût minimal sélectionnée à l'étape de sélection.

6. Appareil de calcul d'une route alternative adapté pour mettre en oeuvre le procédé de la revendication 1 dans un système de navigation, l'appareil comprenant :

une section d'entrée d'information de déviation (610) adaptée pour recevoir l'information de liaison de la position déviée lorsque le corps mobile se déplaçant sur la trajectoire originale prédéterminée procurée par le système de navigation a dévié de la trajectoire originale ;

une section de détection et d'évaluation d'une liaison adjacente (620) adaptée pour:

(1) détecter les liaisons adjacentes ;

(2) vérifier dans la séquence s'il existe une liaison rejoignant la trajectoire originale parmi les liaisons adjacentes ;
lorsqu'il existe une liaison rejoignant la trajectoire originale qui n'est pas une liaison de destination,

(3) activer une première table (650) pour enregistrer l'information de liaison concernant la liaison rejoignant la trajectoire originale et compter le nombre de fois où les liaisons adjacentes et la trajectoire originale se rejoignent ; et

(4) lorsque le nombre de fois où les liaisons adjacentes et la trajectoire originale se rejoignent est supérieur au nombre prédéterminé fixé à l'avance, activer une section de sélection de trajectoire (640) pour sélectionner la liaison présentant le coût minimal nécessaire pour se déplacer de la position déviée jusqu'à la destination via la liaison correspondante ; et
lorsqu'il n'y a pas de liaison rejoignant la trajectoire originale parmi les liaisons adjacentes détectées et que la liaison de destination ne se trouve pas parmi les liaisons adjacentes détectées,

(5) enregistrer temporairement la liaison adjacente détectée dans la seconde table (630) avec l'information de liaison, y compris l'information de coût cumulé de la position déviée jusqu'à chacune des liaisons adjacentes enregistrées ;

(6) sélectionner la liaison adjacente de la seconde table dont le coût de déplacement cumulé est minimal ;

(7) détecter des liaisons adjacentes à la liaison adjacente sélectionnée dont les coûts de déplacement cumulés sont minimaux ; et

(8) retourner à l'étape (2) ;

la première table (650) étant adaptée pour enregistrer l'information de liaison concernant la liaison rejoignant la trajectoire originale ;

la seconde table (630) étant adaptée pour enregistrer temporairement les liaisons adjacentes détectées qui ne rejoignent pas la trajectoire originale ainsi que des informations de liaison, y compris l'information de coût cumulé de la position déviée jusqu'à chacune des liaisons adjacentes enregistrées ;

la section de sélection de trajectoire (640) étant adaptée pour sélectionner la liaison présentant le coût minimal nécessaire pour se déplacer de la position déviée jusqu'à la destination via la liaison correspondante ; et

une section d'extraction d'information de calcul de route alternative (660) adaptée pour déterminer les trajectoires de route alternative en retraçant la liaison sélectionnée par la section de sélection de trajectoire, sur base de l'information de liaison.

7. Appareil de calcul d'une route alternative selon la revendication 6, dans lequel la section d'entrée d'information de déviation (610) transmet l'information de liaison de la position déviée à la section de détection et d'évaluation d'une liaison adjacente (620) et la section de détection et d'évaluation d'une liaison adjacente (620) détecte des liaisons adjacentes à la liaison de la position déviée.

8. Appareil de calcul d'une route alternative selon la revendication 6, dans lequel l'appareil comprend en outre une seconde table (630) adaptée pour enregistrer des informations de liaison, y compris des informations de coût cumulé de la position déviée jusqu'à une liaison correspondante selon chaque liaison détectée par la section de détection et d'évaluation d'une liaison adjacente.

9. Appareil de calcul d'une route alternative selon la revendication 8, dans lequel la section de sélection de trajectoire (640) sélectionne une liaison parmi des liaisons enregistrées dans la seconde table (630) comme liaison réservée ayant un coût cumulé minimal, enregistre la liaison sélectionnée dans la première table (650), transmet les informations de liaison réservées à la section de détection et d'évaluation d'une liaison adjacente (620), et dans lequel la section de détection et d'évaluation d'une liaison adjacente (620) détecte des liaisons adjacentes aux liaisons réservées.

10. Appareil de calcul d'une route alternative selon la revendication 6, dans lequel la section de détection et d'évaluation d'une liaison adjacente (620) détecte la liaison de la position déviée transmise depuis la section d'entrée d'information de déviation (610) et les liaisons adjacentes aux liaisons réservées sélectionnées par la section de sélection de trajectoire (640).

11. Appareil de calcul d'une route alternative selon la revendication 10, dans lequel la section de détection et d'évaluation d'une liaison adjacente (620) contrôle une opération de la seconde table (630), de la section de sélection de trajectoire (640) et de la section d'extraction d'information de calcul de route alternative (660) sur base du résultat de la vérification.

12. Appareil de calcul d'une route alternative selon la revendication 11, dans lequel, suite à la vérification, lorsqu'il y a des liaisons de destination parmi les liaisons adjacentes, la section de détection et d'évaluation d'une liaison adjacente (620) permet à la section d'extraction d'information de calcul de route alternative (660) de déterminer les trajectoires de route alternative en retraçant la liaison de destination sur base de l'information de liaison enregistrée dans la première table (650).

13. Appareil de calcul d'une route alternative selon l'une des revendications 6 à 12, dans lequel l'appareil de calcul d'une route alternative fait partie d'un système de navigation.

Drawing