CN101995253B - Satellite navigation device and related navigation method thereof - Google Patents

Abstract

The present invention provides a satellite navigation device and its related navigation method. The navigation method includes: judging whether the satellite navigation device is in a non-navigation mode; and when the satellite navigation device is in a non-navigation mode, The passed route is recorded in a database for the route planning of the satellite navigation device in the navigation mode. The advantage of the present invention is that the satellite navigation device can learn the route preferred by the user no matter in the navigation mode or the non-navigation mode. Therefore, when the user wants to go from a familiar street environment or geographical environment to an unfamiliar street environment or from an unfamiliar street environment to a familiar street environment next time, the satellite navigation device can be used to generate a navigation route, and The navigation route can indicate that the user arrives at the destination through a more preferred street in a familiar street environment, and therefore, it can better meet the user's route navigation needs.

Description

Satellite navigation device and related navigation method

technical field

The invention relates to a navigation mechanism, in particular to a satellite navigation device and a related navigation method.

Background technique

At present, the existing satellite navigation device plans a navigation route with reference to the data of a geographic map database, so as to suggest the user to reach the destination through the navigation route. However, the navigation route planned by the existing satellite navigation device may not meet the needs of users. For example, when the user goes from an unfamiliar geographical environment to a familiar geographical environment or from a familiar geographical environment to an unfamiliar geographical environment, the existing satellite navigation device may be used to generate a navigation route. However, since existing satellite navigation devices only generate navigation routes based on the data in their geographical databases, the sub-paths of the navigation route in the geographical environment familiar to the user may not meet the needs of the user, causing the user to use the Under the familiar geographical environment, they follow the well-known route instead of following the suggested navigation route; in other words, the existing satellite navigation device is quite low in practicability for the user, and it cannot fully meet the user's needs .

Contents of the invention

Therefore, one of the objectives of the present invention is to provide a high-practicability satellite navigation device and a related navigation method that can be more suitable for users' needs, so as to solve the existing problems.

According to an embodiment of the present invention, a navigation method used in a satellite navigation device is provided. The navigation method includes: judging whether the satellite navigation device is in a non-navigation mode (free-run mode); and when the satellite navigation device is in the non-navigation mode, recording the path passed by the satellite navigation device in a database for satellite It is used for route planning when the navigation device is in the navigation mode.

According to an embodiment of the present invention, a navigation method used in a satellite navigation device is disclosed. The navigation method includes: setting a starting point and an end point; according to the starting point, the end point and a preset image data database, using the route planning algorithm provided by the satellite navigation device to generate a planned route; and according to a database, using a The sub-route of the user preferred route replaces the sub-route of the planned route to determine a navigation route.

According to an embodiment of the present invention, a navigation method used in a satellite navigation device is disclosed. The navigation method includes: learning a learning path, the learning path includes a starting node line and an ending node line; generating a planning path according to the starting node line, ending node line and path planning algorithm; comparing the planning path with the learning path to generate a path comparison result; according to the path comparison result, determine whether to update a database with the learning path.

According to the embodiment of the present invention, it further discloses a satellite navigation device. The satellite navigation device includes a processing unit and a database, wherein the processing unit is used to determine whether the satellite navigation device is in the non-navigation mode, and the database is coupled to the processing unit and used for when the processing unit indicates that the satellite navigation device is in the non-navigation mode A path passed by the satellite navigation device is recorded for use in path planning when the satellite navigation device is in a navigation mode.

According to the embodiment of the present invention, it further discloses a satellite navigation device. The satellite navigation device includes a database and a processing unit, wherein the database is used to store a user preferred route, and the processing unit is coupled to the database for setting a starting point and an end point, and according to the starting point, the end point and a preset The graphic information database uses a route planning algorithm to generate a planned route, and according to the database, uses a sub-route of a user's preferred route to replace the sub-route of the planned route to determine a navigation route.

According to the embodiment of the present invention, it further discloses a satellite navigation device. The satellite navigation device includes a learning unit and a processing unit, wherein the learning unit is used to learn a learning path, the learning path includes a start node line and a termination node line, and the processing unit is coupled to the learning unit for according to the The starting node line, the ending node line and a route planning algorithm generate a planned route, and compare the planned route with the learned route to determine whether to update a database according to the learned route.

In addition, an advantage of this embodiment is that the satellite navigation device can learn the route preferred by the user no matter it is in the navigation mode or the non-navigation mode. Therefore, when the user wants to go from a familiar street environment (or geographical environment) to an unfamiliar street environment or from an unfamiliar street environment to a familiar street environment, the satellite navigation device can be used to generate a navigation route. , and the navigation route can indicate that the user arrives at the destination through a more preferred street in a familiar street environment, so it can better meet the user's route navigation needs.

Description of drawings

FIG. 1 is a schematic block diagram of a satellite navigation device according to an embodiment of the present invention.

FIG. 2 is a flow chart of route learning performed by the satellite navigation device shown in FIG. 1 in a non-navigation mode.

FIG. 3 is a flow chart of route planning performed by the satellite navigation device shown in FIG. 1 .

4A-4G are schematic diagrams of an embodiment of the sub-path replacement operation performed by the satellite navigation device shown in FIG. 1 on the planned path P. FIG.

FIG. 5 is a flowchart of route learning performed by the satellite navigation device shown in FIG. 1 .

Detailed ways

Please refer to FIG. 1 , which is a schematic block diagram of a satellite navigation device 100 according to an embodiment of the present invention. The satellite navigation device 100 includes a processing unit 105 , a database 110 and a learning unit 115 . In this embodiment, the satellite navigation device 100 is used in vehicles such as vehicles, and it can not only perform route learning in navigation mode, but also perform route learning in non-navigation mode (free-run mode). The purpose of route learning is to record the preferred driving route of the user (car user or driver) in the familiar geographic environment area for subsequent route planning in the navigation mode. The processing unit 105 can determine whether the satellite navigation device 100 is in the non-navigation mode or in the navigation mode. When the processing unit 105 indicates that the satellite navigation device 100 is in the non-navigation mode, the learning unit 115 performs route learning so that the database 110 records a route passed by the satellite navigation device 100 (in other words, the database 110 stores the route preferred by the user) , the route can be used for route planning when the satellite navigation device 100 is in the navigation mode. In addition, when the satellite navigation device 100 is in the navigation mode and deviates from the originally planned route, the learning unit 115 can also perform route learning, so that the database 110 records a route passed by the satellite navigation device 100 after deviating from the planned route. The route can be used by the satellite navigation device 100 for route planning with different starting points or different ending points in the navigation mode. Since the satellite navigation device 100 of the embodiment of the present invention can learn the route preferred by the user no matter in the navigation mode or the non-navigation mode, when the user wants to drive from a familiar street environment (or geographical environment) to an unfamiliar Familiar street environment or when going from an unfamiliar street environment to a familiar street environment, a navigation route can be generated through the planning of the satellite navigation device 100, and the navigation route instructs the user to pass through the preferred route in the familiar street environment. streets to reach the destination. Therefore, the satellite navigation device 100 does not plan a navigation route that is inconvenient or impractical for the user, so it can better meet the user's route navigation requirements.

The path learning operation carried out by the above-mentioned learning unit 115 can be started by the user himself or the learning unit 115 can start automatically, and recording the learned path of this section in the database 110 is the starting point, end point, departure time, arrival time, etc. of the section of the path. Information such as time and how long it lasted is recorded in the database 110 . Please refer to FIG. 2, which is a flow chart showing the route learning of the satellite navigation device 100 shown in FIG. 1 in the non-navigation mode; The steps in the process are carried out sequentially, and the steps shown in FIG. 2 do not have to be carried out consecutively, that is, other steps can also be inserted therein. The process steps of Figure 2 are described below:

Step 200: start;

Step 205: the satellite navigation device 100 is in the non-navigation mode, and the vehicle starts to move;

Step 210: the learning unit 115 records the starting point and the node line (link) passed by the current vehicle, so as to learn the path passed;

Step 215: The learning unit 115 judges whether the user issues a command to start learning? If so, proceed to step 220, otherwise, proceed to step 225;

Step 220: The learning unit 115 resets the starting point recorded when the vehicle starts to move, and sets the starting point as the starting point when the user issues the start learning command;

Step 225: The learning unit 115 determines whether the user issues a command to stop learning or the vehicle stops moving for a specific period of time? If so, proceed to step 230, otherwise, proceed to step 235;

Step 230: the learning unit 115 records the end point and stops recording the passing node lines, so as to stop learning the path; then, the processing unit 105 decides whether to use the path recorded by the last learning unit 115 to update the database according to a path updating procedure 110, so that a better user preference path is recorded and stored in the database 110;

Step 235: the learning unit 115 keeps recording the nodal lines passed by the vehicle, so as to learn the nodal lines on the route; and

Step 240: end.

As described in steps 210 and 215, the learning unit 115 sets the passed route according to at least one of the user activation command for activating the route learning function and the position change state of the satellite navigation device 100 (for example, the vehicle starts to move). The starting point of the route and the end point of the route are set according to the user end command for ending the route learning function and the position change state of the satellite navigation device 100 (for example, the vehicle remains stationary for more than a certain time). And, if the flow process shown in Figure 2 executes step 220 after executing step 215, it means that the user actively issues an order to start learning (for example, the user presses the button of the man-machine interface), so the learning unit 115 will The starting point recorded when the vehicle started to move is reset to set the starting point at the time when the user issued the start learning command.

Please refer to FIG. 3 . FIG. 3 is a flow chart of routing performed by the satellite navigation device 100 shown in FIG. 1 . The process steps of Figure 3 are described below:

Step 300: start;

Step 305: The user sets a starting point and an end point;

Step 310: the processing unit 105 uses a preset route planning algorithm to generate a planned route P according to the starting point, the destination point and a preset map data database;

Step 315: The processing unit 105 judges whether there is a sub-path in the database 110, the start link (start link) and the end link (end link) of the sub-path are the same as the start node of a sub-path of the planned path P line vs. terminating stanzas? If so, proceed to step 320, otherwise proceed to step 330;

Step 320: the processing unit 105 uses the sub-path to replace the sub-path of the planned path P;

Step 325: Determine whether the end node line of the sub-path to be replaced is equal to the end node line of the planned path P? If so, proceed to step 335, otherwise, recurse to step 315;

Step 330: the processing unit 105 uses the planned path P as a navigation path;

Step 335: the processing unit 105 uses the last replaced path as the navigation path; and

Step 340: end.

Specifically, after the user sets the start point and end point, the processing unit 105 first generates the planned route P, and then replaces the planned route P with a sub-route in at least one user-preferred route according to the content in the database 110 A sub-path of , to determine the final navigation path. In addition, the processing unit 105 judges whether a time-dependent sub-route exists in the database 110 based on the content of the database 110 to generate the navigation route (the time-dependent sub-route can be used as the user preference subpath of path). When there is this time-related sub-path in the database 110, the processing unit 105 uses this time-related sub-path to replace the sub-path of the planned path P; and when there is no time-related sub-path in the database 110 , the processing unit 105 uses a time-independent sub-path to replace the sub-path of the planned path P; in short, if a time-dependent sub-path and a time-independent sub-path can be used to replace When planning a sub-path of the path P, the processing unit 105 first selects a time-related sub-path to replace, and the detailed description of the time-related sub-path and the time-independent sub-path will be described later. In steps 315 to 325, the processing unit 105 uses a greedy algorithm (Greedy Algorithm) to replace at least one sub-route in the planned route P, so that at least a part of the finally obtained navigation route is a sub-route preferred by the user . The sub-path in this embodiment is defined as including a plurality of consecutive node lines in a certain path; that is, two consecutive node lines can form a sub-path, or the path itself can also be a sub-path. For example, if a path includes a plurality of consecutive nodal lines p1~p10 in sequence, two consecutive nodal lines (such as p1, p2) can form a sub-path, and nodal lines p1~p10 (that is, the path) are another sub-path. path. In addition, the node line in this embodiment refers to a node line of geographical information and corresponds to a road such as a street, an alley, etc., which represents that the starting point and the end point of the two ends on the map are respectively bifurcation intersections (such as crossroads or three-way intersections) ) and roads such as streets and alleys without any bifurcating intersections in the middle, and the aforementioned starting node line includes the node line of the starting point, and the ending node line includes the node line of the ending point.

Please refer to FIGS. 4A-4E , which are diagrams illustrating an embodiment of the sub-route replacement operation performed by the satellite navigation device 100 shown in FIG. 1 on the planned route P generated by the aforementioned processing unit 105 . As shown in FIG. 4A , the planned path P includes a plurality of consecutive node lines p1-p8 in sequence, and the processing unit 105 replaces the sub-paths starting from the starting node line p1 of the planned path P, and the specific method is to search In the database 110, whether there is a subpath with the pitch line p1 as the starting pitch line and any one of the pitch lines p2-p8 as the ending pitch line. For example, in FIG. 4B , there are two sub-paths P1 and P2 in the database 110, and the two sub-paths P1 and P2 respectively have consecutive nodal lines p1, g1, g2 and p5 and consecutive nodal lines p1, h1, h2 and p4, and the processing unit 105 selects the subpath with the nodal line p5 closer to the terminating nodal line p8 (that is, the subpath P1 with the nodal lines p1, g1, g2 and p5) among the two subpaths P1, P2 to perform the path replace. Therefore, after the path is replaced, the processing unit 105 can obtain a replaced path P' (including the continuous node lines p1, g1, g2 and p5-p8), as shown in FIG. 4C . Next, the processing unit 105 performs sub-path replacement starting from the node line g2. Similarly, in this embodiment, the processing unit 105 searches the database 110 for a sub-path that has the node line g2 as the starting node line and any one of p5-p8 as the ending node line, and selects from the database 110 A sub-path including consecutive node lines g2, k1, k2, k3 and p7 is generated (as shown in FIG. 4D). Therefore, after the sub-path is replaced this time, the processing unit 105 obtains a replaced path P" (including continuous node lines p1, g1, g2, k1-k3, p7 and p8), as shown in FIG. 4E. Then , the processing unit 105 begins to replace the sub-path with the node line k1. In this replacement, the processing unit 105 selects the sub-path that includes the continuous node lines k1, m1, m2 and p8 from the database 110, as shown in Figure 4F Therefore, after the sub-path is replaced this time, the processing unit 105 obtains a replaced path P'", which includes continuous node lines p1, g1, g2, k1, m1, m2 and p8, as shown in FIG. 4G Show. Since the sub-path replaces the terminating node line p8 that has proceeded to the original planning path P at the end, the processing unit 105 will end the greedy algorithm, and combine the node lines p1, g1, g2, k1, m1, m2 and The route P'" of p8 is used as the navigation route. In other words, when the user selects the start point and the end point when driving a car so that the start node line and the end node line are respectively p1 and p8, the satellite navigation device 100 will determine the continuous node line The navigation paths of p1, g1, g2, k1, m1, m2, and p8 are recommended as better paths for the user to drive.

It should be noted that the node lines p1 - p8 included in the planned path P are only used to explain the operation of the path planning in this embodiment, rather than limiting the present invention. The aforementioned planned path P can also be formed sequentially by multiple nodal lines p ₁ ~p _N , N is a positive integer greater than 2, and the start and end points of the roads corresponding to these nodal lines p ₁ ~p _N are respectively represented by Different fork intersections are defined, and the processing unit 105 executes the following operation at least once: the processing unit 105 judges whether there is a first user preference sub-path including a segment line p _i and a segment line p _j in the database 110, The node lines p _i and the node lines p _j belong to these node lines p ₁ ~ p _N , the parameter j is a positive integer greater than the parameter i, and the first user preference sub-path also includes nodes located between the node lines p _i and node lines at least one section line p' between p and _j ; and, when the first user preference sub-path exists in the database 110, the processing unit 105 is based on at least one section line p' of the first user preference sub-path to replace the nodal line between the nodal line p _i and the nodal line p _j in the planned path P.

In addition, when there is another second user preference sub-path in the database 110, and the second user preference sub-path includes a node line p _i and another node line p _k , (the parameter k is a positive integer greater than the parameter j , the second user preference sub-path includes at least one node p″ between the node p _i and p _k ), the processing unit 105 uses at least one node p” of the second user preference sub-path to replace The nodal line between the nodal line p _i and the nodal line p _k in the planned route P; this is also the operation of the greedy algorithm, and the purpose is to find a better user preferred route.

Please refer to FIG. 5 . FIG. 5 is a flowchart of route learning performed by the satellite navigation device 100 shown in FIG. 1 . The process steps of Figure 5 are described below:

Step 500: start;

Step 505: the learning unit 115 learns a learning path L having a starting pitch line and a ending pitch line, and outputs the learning path L to the processing unit 105;

Step 510: The processing unit 105 uses the start node line and the end node line according to a preset map data database of the satellite navigation device 100 or the database 110 of this embodiment storing user preference data and uses the aforementioned greedy An algorithm is used as the basis to generate a planning path R;

Step 515: The processing unit 105 judges whether the learning path L is the same as the planning path R? If the learning path L is the same as the planning path R, proceed to step 520, otherwise, if the learning path L is different from the planning path R, then proceed to step 525;

Step 520: The processing unit 105 determines whether the data of the learning path L already exists in the database 110? If so, proceed to step 530, otherwise, proceed to step 525;

Step 525: the processing unit 105 updates the database 110 according to a path update procedure; and

Step 530: end.

One of the purposes of the process steps shown in FIG. 5 is to judge whether to use any sub-path of the learned learning path L to update the path data or sub-path data in the database 110, so as to moderately reduce the number of data updates . Steps 515 , 520 , and 525 can be regarded as the processing unit 105 first compares the planned route R and the learning route L to generate a route comparison result, and then decides whether to update the database 110 with the learning route L according to the route comparison result. In more detail, since the planned route R is generated by the processing unit 105 according to the route data of at least one of the preset map data database and the database 110, if the route comparison result is that the learned route L is different from the planned route R , it means that the database 110 does not have the data of the learning path L, so the data of the learning path L needs to be used to update the content of the database 110 at this time. On the contrary, if the path comparison result is that the learning path L is the same as the planned path R, then the learning path L may exist in the database 110, or may not exist in the database 110, therefore, the present embodiment utilizes the operation of step 520 to check whether the learning path L already exists in the database 110 . That is to say, when the planned route R is different from the learning route L, or when the planned route R is the same as the learning route L but the learning route L is not a sub-route of a user's preferred route in the database 110, the processing unit 105 will The path L updates the database 110, wherein when the planned path R is the same as the learning path L but the learning path L is not a sub-path of a user's preferred path in the database 110, the processing unit 105 can choose to directly add the learning path L to the database 110; And when the planned route R is the same as the learning route L and the learning route L is a sub-path of a user's preferred route in the database 110, the processing unit 105 will not update the database 110 according to the learning route L, but choose to discard the learning route L and The content of the database 110 is maintained unchanged.

The database 110 classifies the data content recorded therein into two categories, namely time-dependent paths and time-independent paths. The time-related route refers to the route that the user drives through only at a specific time or on a specific day. For example, if the user only drives through a certain route at a specific working time (such as 8:00 in the morning), the route will be The database 110 is classified as time-related paths; and time-independent paths refer to the paths that users drive through at different times or on different days. The routes passed by vehicles on different days of the week (that is, the same learning routes obtained by the satellite navigation device 100 in different operating periods), the routes will be classified as time-independent routes by the database 110 . In terms of the priority of path planning, the time-related path will be selected by the processing unit 105 as a reference for path replacement prior to the time-independent path. For example, when the user activates the satellite navigation device 100 at a specific time to plan a route, the processing unit 105 searches the time-related routes in the database 110 before performing route replacement. The specific time belongs to the same time period and its sub-path can be used to replace the path of a sub-path in the planned path; and when the processing unit 105 cannot find any path in the time-related paths that can be used for path replacement, it will turn to Searching whether there is a path that belongs to the same time period as the specific time in the time-independent path and whose sub-path can be used to replace a sub-path in the planned path. It should be noted that the processing unit 105 first classifies the learning path learned for the first time as a time-related path, and then if the processing unit 105 learns the learning path again or more When the time period of the learned path is different, the path will be classified as a time-independent path. In addition, the data of the user's preferred route stored in the database 110 is to record the total time cost of the preferred route, each node line on the preferred route, the time cost of each node line, and other related data (such as the driving time of different users) information).

Please refer to Fig. 5 again, it will be explained below that according to different flow conditions, the path update program of the processing unit 105 updates the data content of the database 110 to different degrees; in fact, the path update program compares the planned path with the learning path It is determined whether to update the database 110 according to the learning path. For example, the learning route L includes a plurality of continuous pitch lines L1-L8 that users drive through sequentially, wherein L1 is the starting pitch line, L8 is the ending pitch line, and the planned route R generated by the processing unit 105 includes A nodal line composed of L1, R2~Rn, and L8 in sequence. First of all, in the first flow situation, the flow of Fig. 5 is followed by step 530 after step 520, indicating that the learning path L is completely the same as the planned path R (that is, the node lines R2-Rn are sequentially identical to the node Lines L2-L7) and the learning path L already exists in the database 110, then the processing unit 105 does not need to use the learning path L to update the data content of the database 110, and the process ends at step 530.

Secondly, in the second process situation, the process of FIG. 5 proceeds to step 525 after step 520, indicating that the learning path L is completely the same as the planned path R but the learning path L is not the user's preferred path in the database 110. sub-path (that is, the learning path L does not exist in the database 110 at this time), the processing unit 105 directly adds the learning path L to the database 110 to update the database 110, and the learning path L will be classified as time-related path, because the learning unit 115 learns the learning path L for the first time in this situation.

Furthermore, in the third flow situation, the flow of FIG. 5 is followed by step 525 after step 515; the processing unit 105 generates a first step by comparing the overall time cost of the learning path L with the overall time cost of the planning path R A cost comparison result, and according to the first cost comparison result, it can be judged that the time cost difference between the learning path L and the planned path R does not exceed a predetermined limit, which means that the node line of the learning path L is consistent with the planned path R The nodal lines of L are different and the time cost of learning path L is still acceptable to users. At this time, the processing unit 105 decides to update the database 110 with the learning path L according to the first cost comparison result, so the processing unit 105 then judges whether any two nodes in the learning path L exist together in a sub-path of the database 110; specifically That is, the processing unit 105 determines whether a sub-path of the learning path L has the same specific start node and the same specific end node as a specific sub-path of any user preference path in the database 110 . If there are no two lines in a sub-path of the database 110 (that is, only one line exists in a sub-path of the database 110), it means that although there is a line in the learning path L, it is consistent with the planning One line in the path R is the same, but the sub-path of the learning path L does not exist in the database 110, so the processing unit 105 will directly add the learning path L to the database 110 to update the content of the database 110; otherwise, if the learning path Two knot lines in L exist together in a subpath of the database 110 (that is, a subpath of the learning path L has the same specific starting knotline as a specific subpath of any user preference path in the database 110 and the same specific terminal node line), it means that a sub-path formed by the two node lines and the continuous node lines between them may be suitable for updating the content of the database 110, so the processing unit 105 will further compare the sub-paths of the learning path L The time cost of the path and the time cost of the specific sub-path are used to determine whether to add to the database 110 according to the learning path. For example, a path M in the database 110 includes seven consecutive nodal lines M1-M7 in sequence, wherein the nodal line M2 of the path M is substantially the same as the nodal line L4 of the learning path L, and the nodal line M6 of the path M is substantially the same as the learning path L. The nodal line L8 of the path L is substantially the same, that is, a sub-path L' (including the nodal lines L4-L8) in the learning path L is the same as a sub-path M' (including the nodal lines M2-M6) in the database 110 have the same start and end pitch lines. At this time, the processing unit 105 compares the total time cost of the two sub-paths M', L' to determine whether to use the sub-path L' having the node lines L4-L8 to replace the sub-path M' having the node lines M2-M6. If the difference between the total time cost of the sub-path L' and the total time cost of the sub-path M' does not exceed a predetermined limit (that is, the total time cost of the sub-path L' is still within an acceptable range), then processing The unit 105 directly uses the sub-path L' of the learning path L to replace the sub-path M' of the path M in the database 110 to update the database 110, and at the same time, adds the learning path L to the database 110; The path M of will become a sub-path formed sequentially by the node lines M1, L4-L8 and M7. Conversely, if the difference between the total time cost of the sub-path L' and the total time cost of the sub-path M' exceeds the predetermined limit (that is, the total time cost of the sub-path L' has exceeded the acceptable range), the processing unit 105 may It is up to the user to decide whether to use the sub-path L' in the learning path L to update the sub-path M' in the path M (that is, refer to the command issued by the user). That is to say, when the time cost of the sub-path L' has exceeded the acceptable range, the user can still add it to the database 110 because L' is the most recently learned user preference sub-path, or the processing unit 105 may put the sub-path L' in the observation list, and decide whether to use the sub-path L' to replace the sub-path M' in the database 110 when the sub-path L' is learned again in the future.

Secondly, in the fourth process situation, the learning path L is different from the planning path R, and the processing unit 105 judges that the time cost difference between the learning path L and the planning path R exceeds the predetermined value based on the first cost comparison result , which means that the time cost of the learning path L has exceeded the acceptable range. At this time, the processing unit 105 leaves the choice of whether to update the database 110 with the learning path L to the user to decide. That is to say, when the time cost of learning the path L has exceeded the acceptable range, the user can still add it to the database 110 because L is the most recently learned user preference path, or the processing unit 105 can first Put the learning path L into the observation list, and decide whether to use the learning path L to update the data content of the database 110 when learning the learning path L again in the future.

Combining the above third and fourth process conditions, the processing unit 105 compares the time cost of the learning path L with the time cost of the planning path R to generate the first cost comparison result, and decides whether to use the learning path L to update the database 110. In the third process state, when the first cost comparison result is that the difference between the time cost of the learning path L and the time cost of the planning path R does not exceed the predetermined limit, the processing unit 105 judges that a sub-path of the learning path L and Whether a sub-path of a user's preferred path in the database has the same start node line and the same end node line; When the line is one of the same end node lines, the processing unit 105 will add the learning path L to the data in the database 110, and when the subpaths of the learning path L have the same start node line and the same end node line , the processing unit 105 compares the time cost of the sub-path of the learning path L with the time cost of the sub-path of the user's preferred path to generate a second cost comparison result, and decides whether to use the learning path according to the second cost comparison result The subpaths of L update the database 110 . When the difference between the time cost of the sub-path of the learning path L and the time cost of the sub-path of the user preference path does not exceed the predetermined limit, the processing unit 105 replaces the sub-path of the user preference path with the sub-path of the learning path L subpath to update the database 110. In the fourth process state, when the aforementioned difference exceeds the predetermined limit, the processing unit 105 decides whether to use a sub-path of the learning path L to replace the sub-path of the user's preferred path according to a user command, or to replace the sub-path of the learning path L The subpaths of are put into a watch list for reference of updating the database 110 .

In addition, in the above embodiments, the satellite navigation device 100 is used in a vehicle, however, the satellite navigation device 100 can also be applied in a mobile device (such as a mobile phone or a personal digital assistant). In other words, if the user wants to walk from a starting point to an end point, a more humanized navigation path can be obtained through the operation of the satellite navigation device 100, and even any public transportation means (such as Sub-paths passed by such as railway, highway, MRT, etc., that is to say, the navigation path can instruct the user to switch to public transportation while walking, so as to better meet the needs of the user.

The above descriptions are only preferred embodiments of the present invention, and all equivalent changes and modifications made according to the scope of the patent application of the present invention shall fall within the scope of the present invention.

Claims (4)

1. A navigation method used in a satellite navigation device, comprising: Learning a learning path, the learning path includes a starting pitch line and a ending pitch line; Generate a planned path according to the starting pitch line, the ending pitch line and a path planning algorithm; comparing the planning path and the learning path to generate a path comparison result; and updating a database with the learning path when the path comparison result is that the planning path is different from the learning path; When the route comparison result is that the planned route is the same as the learning route and the learning route is not a sub-route of a user-preferred route in the database, updating the database with the learning route; and When the path comparison result is that the planned path is the same as the learning path and the learning path is the sub-path of the user's preferred path in the database, the learning path is discarded and the content of the database remains unchanged. 2. A navigation method used in a satellite navigation device, comprising: Learning a learning path, the learning path includes a starting pitch line and a ending pitch line; Generate a planned path according to the starting pitch line, the ending pitch line and a path planning algorithm; comparing the planning path and the learning path to generate a path comparison result; and Determine whether to update a database with the learning path according to the path comparison result; When the step of determining whether to update the database with the learning path is to add the learning path to the database, the navigation method further includes: classifying the learning path as a time-dependent user preference path when the learning path is first added to the database; and classifying the learning path as a time-independent user preference path when the satellite navigation device obtains the same learning path in different operating periods; Among them, the time-related user preferred route refers to the route that the user drives through only at a specific time or on a specific day; the time-independent user preferred route refers to the route that the user drives through at different times or on different days . 3. A satellite navigation device comprising: a learning unit for learning a learning path, the learning path includes a starting pitch line and a ending pitch line; and a processing unit, coupled to the learning unit, for generating a planned path according to the starting pitch line, the ending pitch line and a path planning algorithm, wherein the processing unit compares the planning path with the learning path, When the planning path is different from the learning path, the processing unit updates a database with the learning path; when the planning path is the same as the learning path and the learning path is not a sub-path of a user preference path in the database , the processing unit updates the database with the learning path; when the planned path is the same as the learning path and the learning path is a sub-path of a user preference path in the database, the processing unit discards the learning path and maintains the The database contents are unchanged. 4. A satellite navigation device comprising: a learning unit for learning a learning path, the learning path includes a starting pitch line and a ending pitch line; and a processing unit, coupled to the learning unit, for generating a planned path according to the starting pitch line, the ending pitch line and a path planning algorithm, wherein the processing unit compares the planning path with the learning path, to decide whether to update a database according to the learning path; Wherein, when the learning route is added to the database for the first time, the processing unit classifies the learning route as a time-related user preference route; and, when the satellite navigation device is obtained under different operating periods respectively the same learning path, the processing unit classifies the learning path as a time-independent user preference path; Among them, the time-related user preferred route refers to the route that the user drives through only at a specific time or on a specific day; the time-independent user preferred route refers to the route that the user drives through at different times or on different days .

Images