200839189 九、發明說明： 【發明所屬之技術領域】 本發明是有關於-種導航路線搜倉方法，特別是指_ 種要徑式導航路線搜索方法。 曰 【先前技術】 目前導航路線搜索方法有採用最短路徑演算法， 理是取得—電子地圖的各節點的數量及其座標位置，再來 需統計各節點彼此之間的路徑組合有多少，最後計算各路 徑組合的距離，並配合每—條道路有其道路規則屬性（例如 .:向或雙向行車）或優先順序（例如：高速公路、—般道路 、最短距離或其他條件）之不同權重（又稱為成本）列為搜索 條件，最後以成本最小者為較佳的路徑。 ’、 目前的搜索方法主要是侷限在依據使用者所設定的一 $發地與:目的地之間可以找到的數條路徑供使用者選擇 、深c疋由於亚未將-些特殊要徑列為 考慮，因此找出的路線常有下列問題： (1)在一些車流較大的路口一般禁止直接左轉，因此 會在路旁會有交通標誌'指示駕駛需要進行迴轉（如：P型、c 型或U型），讓駕馱者可依據其㈣湘附近的巷道進行迴 轉，但是目前導航方法由於其導航資料庫並無將需要迴轉 =要位列入考慮’因此只會依據一般搜索條件搜索，造成 駕駛必須自行判斷如何迴轉’因而常會遇到繞遠路或是鑽 進巷弄的窘境。 ⑺在-般搜索條件下建議的路線，當遇到需要穿過一 200839189 市區街道時’由於並未對其設限，因此該路線會直接經過 市區街這，而非繞過市區街道；此外，目前之搜索法對於 市區街1 ’在權重上或是距離都會較優先被選擇，但是 由於市區常會遇到擁塞的情況而造成耗時過久，因此反而 不是時間成本較佳的路線。 (秘高速公路或是重要省道附近，經常會有替代道路 的看板，猎此分散車流以加速行駛速度，但是在目前導航 方法由於其導航資料庫並無將替代道路列人考慮，因此無 法搜索出具有替代道路的路線。 【發明内容】 有繁於目前導航路線搜索方法未能將前述的特殊要徑 =為考慮’因而無法提供駕駛最佳化的路線，本發明的概 念即是希望將不同路徑定義其屬性為一般路徑或要徑，並 將要徑也列入搜索條件來得到最佳化的路線。 本發明的一目的，即在提供一種可以提供最佳化導航 路線的要徑式導航路線搜索方法。 本發明要徑式導航路線搜索方法包含下述步驟··（幻 ▲備 $航資料庫，該導航資料庫之多個路徑分別定義一 屬性值，該屬性值用以判斷各路徑屬於一般路徑或一要徑 ;(b)對於一出發地及一目的地之間的所有路徑進行搜索， 且其搜索方式係將該等路徑的至少一要徑列為搜索目標， 並將各該要徑給予較一般路徑為低的一行走成本；及輸 出一具有該要徑之導航路線。 由於本發明要徑式導航路線搜索方法是將不同路徑依 6 200839189 其性貝區分為一般路徑或要徑，並將要徑也列入搜索條件 因此相較於現有搜索法能夠得到最佳化的導航路線。 【實施方式】 有關本發明之前述及其他技術内容、特點與功效，在 以下配合參考圖式之較佳實施例的詳細說明中，將可、、主姑 的呈現。 π疋 食阅團 个知％罟徑式導航路線搜索方法的一較佳實 轭例包括三個階段，第一階段是是製備一導航資料庫，嗦 導f資料庫之多個路徑分料義—屬性值，該屬性值心 判斷各路㈣於—般路徑或—要徑（步驟⑻）；第二階段是 產生-經過要徑搜索之導引資訊，主要是對於—出發地及 :目的地之間的所有路徑進行搜索，且其搜索方式係將該 等U至V要;為搜索目標’並將各該要徑給予較 -般路徑為低的-行走成本（步驟1G2);及第三階段是輸出 一具有該要徑之導航路線（步驟103)。 各階段分述如下： ()製作一具備要獲資料的導般資料庫 參閱圖2，一電子地圖之道路網絡100 +，複數個節點 iVP"中任二相鄰節點（如：Ρι及p2)之間稱為—路徑且任 —道路是由多個路徑組合而成，各道路之集合即形成該道 路網絡100。 田ί 1图 又私子地圖是由多種類別的不同圖層11〜14 a而成八犬員別可區分為一高層路網圖層Η、一中層路 網圖層12、一低層路網圖層 . 口嘈13及一底層路網圖層14，其 200839189 區分方式在於：快速道路/高速公路是屬於高層路網圖層u 之道路；縣道/國道是屬於中層路網圖層12之道路；寬度在 5-7公尺之間的道路是屬於 又 鸯於低層路網圖層13之道路；寬产 在3-5公尺附近的道路則县厪 又 屬；底層路網圖層14之道路。 對於多個路徑需分別定 我其屬性值，該屬性值係用以 判斷各路徑是屬於「一般路 忠一「面， 用 二」或 要徑」。本較佳實施 例所謂的「一般路徑，指 、 相的即疋屬於鬲層路網圖層u/中 層路網圖層12之道路，且| 無特疋迴轉方向或非替代道路； 至於所謂的「要徑」，指的即 疋屬於底層路網圖層1 3 /低声 路網圖層14之路徑，且是屬 -曰 疋屬於具有一特定迴轉方向之路段 、一替代路段或一捷徑路段。 參閱圖4，製作—具備要徑資料的導航資料庫4的流程 ’包括下述步驟：自-道路調查資㈣21、—道路使 提供資料庫22或-官方地圖f料庫23等處，收集不同來 源的，子地圖集並分類(步驟2〇1)。其中如道路調查資料庫 ^是^業者自行進行實際的道路勘查而得到；道路使用者 提供貝料庫22則是由道路使用者提供的捷徑資料；官方地 圖貧料庫23則是由政府提供的最新電子地圖集等。收集後 取出其中具有要徑的電子地圖及依據「要徑類別」將各要 徑加以分類，該「要徑類別」是用以區分一特定迴轉方向 之道路、一替代道路或一捷徑道路。 接下來’將收集的各種要徑資料轉換為標準袼式（步驟 2〇2)，該標準袼式是符合現有地圖資料庫的資料結構，主要 疋用以儲存包括目前所有的路徑資料，包括有路徑的基本 8 200839189 資料、共用資料、道路構造資料、交通狀況及交通規則等 搁位。再來’將該荨路徑之貧料結構附加一代表要徑之屬 性值（步驟203)。 本較佳實施例中，是於現有地圖資料庫的資料結構内 更增加一用以標示「要徑類別」、「要徑方向」、「預定時段 」及「優先等級」之屬性值的攔位。 1· 「要徑類別」的定義： ① 一般道路：無附加任何屬性。 ② 特定迴轉方向之道路··其屬性值可區分為p迴轉、 C迴轉、u迴轉、其它迴轉。 ③ 替代道路：其屬性值可區分為不經市區、高速公路 替代、快速公路替代。 ④ 捷徑道路：其屬性值可區分為捷徑、小路。 2· 「要徑方向」的定義： ① 順車道方向 ② 逆車道方向 ③ 兩方向 3. 預定時段」的定義： ^①^時間區間··將—天24小時區分成數個時間時 段例如母天早上7點到9點，及下午$點到7點的時間 區間，代表每日容易塞車的時間區間。 日士門丁間區間·用數字8碼表示，前4碼代表開始 二二碼代表結束時間。例如晚上六時至九點三十分 ““碼表不為〇_而結束4碼表示為2130。 200839189 ③每週時間區間：用數字2碼表示，前t碼代表星期 幾開始’ I i碼代表星期幾結束，例如星期天，其】碼的 表示方式為7。 4碼代表開始 ，其4碼曰期 ④特定曰期區間：用數字8碼表示，針 日期，後4碼代表結束日期。例如2月12日 表示方式為0212。 4·「適用級別」的定義： 其屬性值共區分為十級，用於由複數相鄰要徑連接而 成的-要徑群組，且相同的要徑群組之各路#具有相同的 「群組級別」，當「群組級別」為越高時，表示其被取用作 為導引路線的優先順序越高（即成本較低）。t不同路層的路 徑彼此重疊時’則優先取用「適用級別」較高的要径群組 ，不同路層的路徑其「適用級別」也不相同。 、 接著，依據道路層類別分割且將不同路層類別的路徑 分配到所屬的路層（步驟2〇5);最後，將各路層有交接之路 徑彼此相連接為一道路網絡（步驟2〇5)，如此即完成了—具 備要徑資料的導航資料庫4的製作。 、 二）產生一經過要徑搜索之導引資訊： 以圖2為例，本較佳實施例的搜索是以最小成本計曾 去為基礎，對一出發地pG及一目的地Pn之間的所有路徑進 行技索，而該等要徑具有至少一要徑群組，所謂「要彳㊉群 、、且」疋由相同屬性的多條相鄰要徑相互連接而成的路段， 且各定義有一起始點、一終點及一方向，如圖2的―p迴 轉方向的路段（IViVPrP^)及一捷徑路段迴 10 200839189 其搜索方式是從出發地P。開始，當判斷其搜索的—路徑（ Pl_P2)的「要徑類別」是屬於P迴轉方向的路段時，由於 為-要徑群組（Pl_P2备Ρ4_Ρι)的起始節點，將依循該 要徑群組（Pi_P2_P3.P4_Pi)定義的要徑方向行進；接著判斷 預疋丰㈣是否有另-要徑群組，由於判斷有另一要徑 群組〇VP8-p9)，因此會由該要徑群組（Ρι·Ρ2·ρ3_ρ4_Ρι)的 -最後路徑（P4-Pl)直接跳到相鄰的另一要徑群組（ΡΑ Ρ9)的-最後路徑（Ρ8-Ρ9)’其"9為要徑群組（ )的-終止節點，再進行後續的探索。其決定是否跳到相 鄰的另-要徑群組的判斷依據是判斷相鄰：個要徑群电彼 此之間距小於—參考半徑（如5公里）時，則直接將二個要徑 群組之集合的-起始點及一終點之間的要徑相互連接。 如吾人所知，目前最小成本計算法是取得—電子地圖 的各即點的數量及其座標位置，再來統計各節點彼此之間 的路徑組合有多少，最後計算各路徑組合的距離，並配八 每-條道路有其道路規則屬性及其行走成本列為搜索料 ，最後以搜索結果成本最小者為較佳的路徑。 本較佳實施例除了以-般最小成本計算法為基礎 將不同要徑給予較低的一行走成本，且在各要徑群 會於每-次進行搜索時再Μ對，藉此料輸出 適的導引路線。 在距離成本方面，是依據要徑到目的地ρ"的距離 ，給予不同的一行走成本，例如··以30公里為分水嶺，未 滿30公里的行走成本較低，反之，縣予較 走= 200839189 。另外，搜尋時若遇到具有_ 目前行走方…要J “迴轉方向之路徑時，且 用u斤 ^ 群組之要徑方向相同時，則直接採 用该要輕群组。伯备里山4 〜且丧妹 組，且1…、 徑開始具有另-備選要徑群 用該備選要徑群組。 一組之㈣成本時，則採 ,時：成本方面’是依照目前行駛的時間，整200839189 IX. INSTRUCTIONS: [Technical field to which the invention pertains] The present invention relates to a navigation route search method, and more particularly to a method for searching a route.曰[Prior Art] At present, the navigation route search method adopts the shortest path algorithm, which is to obtain the number of nodes of the electronic map and its coordinate position, and then to count the number of path combinations between the nodes, and finally calculate The distance of each path combination, and with each road has different weights of its road rule attributes (for example: to or two-way traffic) or priority order (for example: highway, general road, shortest distance or other conditions) (again The cost is listed as the search condition, and finally the path with the lowest cost is the preferred one. ', the current search method is mainly limited to a number of paths that can be found between the destination and the destination: the user can choose, deep c疋 because of the Asian-specific For consideration, the routes found are often subject to the following problems: (1) It is generally forbidden to turn left directly at some intersections with large traffic flow, so there will be traffic signs at the roadside indicating that the driving needs to be turned (eg P-type, Type c or U type), allowing the driver to revolve according to the roadway near (4) Xiang, but the current navigation method does not need to be rotated because of its navigation database = the position is considered. Therefore, it will only be based on general search conditions. Searching, causing the driver to judge how to turn on his own, often encounters a dilemma around the road or into the lane. (7) The recommended route under the general search conditions, when encountering the need to cross a 200839189 urban street, 'because it is not restricted, the route will go directly through the urban street instead of bypassing the urban street. In addition, the current search method is preferred for the urban street 1 'weight or distance, but it is too long due to the congestion in the urban area, so it is not the time cost. route. (Under the secret highway or near the important provincial roads, there are often kanbans that replace the roads, hunting the scattered traffic to speed up the speed, but the current navigation method does not consider the alternative roads because of its navigation database, so it cannot be searched. A route with an alternative road. [Summary of the Invention] The concept of the present invention is that the current navigation route search method fails to take the aforementioned special path = for consideration and thus cannot provide driving optimization. A path defines a route whose attribute is a general path or a path, and which is also included in the search condition to be optimized. One object of the present invention is to provide a route-originating route that can provide an optimized navigation route. The search method of the present invention includes the following steps: (the illusion of the navigation database, the plurality of paths of the navigation database respectively define an attribute value, the attribute value is used to determine that each path belongs to a general path or a path; (b) searching for all paths between a departure point and a destination, and the search method is At least one path of the path is listed as a search target, and each of the paths is given a lower walking cost than the general path; and a navigation route having the required path is output. Since the present invention requires a path navigation route search method Different paths are classified into general paths or major paths according to 6 200839189, and the path is also included in the search condition, so that the navigation route can be optimized compared with the existing search method. And other technical contents, features and effects, in the following detailed description of the preferred embodiment with reference to the drawings, will be able to present, the appearance of the aunt. π 疋 阅 团 个 知 知 知 知 知 知 知 知A preferred embodiment of the yoke includes three phases. The first phase is to prepare a navigation database, and the plurality of paths of the f-database are divided into attribute-attribute values, and the value of the attribute is used to determine each path (four) in the general path. Or - the path (step (8)); the second stage is to generate - through the path search information, mainly for the search between the starting point and the destination: and search The system is to select the U to V; to search for the target 'and to give each of the path to a lower path--walking cost (step 1G2); and the third stage is to output a navigation route having the path (Step 103). Each stage is described as follows: () Make a guide database with information to be obtained. Refer to Figure 2, an electronic map of the road network 100 +, a plurality of nodes iVP" : Ρι and p2) are called - path and any - road is composed of multiple paths, and the collection of each road forms the road network 100. Tian 1 1 and private maps are composed of different layers of different categories 11~14 a can be divided into a high-level road network layer, a middle-level road network layer 12, a low-level road network layer. The mouth 13 and the bottom road network layer 14, its 200839189 distinguishing way is: The expressway/highway is the road belonging to the high-level road network layer u; the county road/national road is the road belonging to the middle road network layer 12; the road with the width between 5-7 meters belongs to the low-level road network layer 13 The road; the road near the 3-5 meters wide is the county Also belongs to; the road of the underlying road network layer 14. For multiple paths, I need to set their attribute values separately. This attribute value is used to judge whether each path belongs to “general road loyalty, face, or use”. The so-called "general path" refers to the "general path, which means that the phase belongs to the road of the layered road network layer u/the middle layer road network layer 12, and | no special turning direction or non-replacement road; "Path" refers to the path of the underlying road network layer 13 / low-voice road network layer 14, and belongs to the road segment with a specific direction of rotation, an alternative road segment or a shortcut road segment. Referring to FIG. 4, the process of producing the navigation database 4 having the required data includes the following steps: self-road survey capital (4) 21, road providing database 22 or official map f library 23, etc. Source, sub-atlas and classification (step 2〇1). For example, the road survey database is obtained by the actual operator on the road survey; the road user provides the bunker library 22 is the shortcut information provided by the road user; the official map poor library 23 is provided by the government. The latest electronic atlases, etc. After the collection, the electronic map having the required path is taken out and the main paths are classified according to the "required path type", which is a road for distinguishing a specific turning direction, an alternative road or a shortcut road. Next, 'convert the various data collected into a standard format (step 2〇2), which is a data structure that conforms to the existing map database, and is mainly used to store all current path data, including The basic 8 of the route 200839189 data, shared materials, road construction data, traffic conditions and traffic rules, etc. Then, the lean structure of the meandering path is appended with a property value representative of the path (step 203). In the preferred embodiment, an additional information is provided in the data structure of the existing map database for indicating the attribute values of the "required path type", the "required path direction", the "predetermined time period" and the "priority level". . 1· Definition of “Path category”: 1 General road: No attributes are attached. 2 Roads in a specific direction of rotation · The attribute values can be divided into p-turn, C-turn, u-turn, and other revolutions. 3 Alternative roads: The attribute values can be divided into urban areas, highway replacements, and expressway replacements. 4 Short-cut roads: The attribute values can be divided into shortcuts and trails. 2· Definition of “path to direction”: 1 Direction in the lane 2 Direction in the opposite lane 3 Directions in both directions 3. Definition of the predetermined time period: ^1^Time interval··The 24-hour time is divided into several time periods such as mother-day morning The time interval from 7:00 to 9:00, and from $5:00 to 7:00, represents the time interval for daily traffic jams. The interval between the Japanese gates is represented by the number 8 code, and the first 4 codes represent the beginning of the 22nd code represents the end time. For example, from 6 pm to 9:30 pm "The code table is not 〇 _ and the end code 4 is represented as 2130. 200839189 3 Weekly time interval: expressed by the number 2 code, the first t code represents the beginning of the day of the week. The I i code represents the end of the day of the week, for example, Sunday, the code is represented by 7. The 4 code represents the beginning, and its 4 yards period 4 is the specific period: it is represented by the number 8 code, the needle date, and the last 4 yards represents the end date. For example, on February 12, the representation is 0212. 4. Definition of "applicable level": The attribute values are divided into ten levels, which are used for the group of the main path that is connected by the multiple adjacent paths, and the same path group has the same "Group level", when the "group level" is higher, it indicates that the priority order (ie, lower cost) is taken as the guiding route. When the paths of different road layers overlap each other, the priority group with higher "applicable level" is preferred, and the "applicable level" for different road layers is different. Then, according to the road layer category, the paths of different road layer categories are assigned to the associated road layer (step 2〇5); finally, the paths with the intersections of the road layers are connected to each other as a road network (step 2〇 5), this is done - the production of the navigation database 4 with the required data. And (2) generating a guide information through the search for the path: In the example of FIG. 2, the search of the preferred embodiment is based on the minimum cost, and between a departure point pG and a destination Pn. All the paths are technically advanced, and the essential paths have at least one group of paths, and the so-called "10 groups, and" are connected to each other by a plurality of adjacent paths of the same attribute, and each definition There is a starting point, an ending point and a direction, as shown in Fig. 2, the section of the "p-turn direction" (IViVPrP^) and a shortcut section back to 10 200839189. The search mode is from the departure point P. At the beginning, when it is judged that the "required path type" of the path (Pl_P2) of the search is a section belonging to the direction of the P-turn, since the start node of the --path group (Pl_P2 preparation 4_Ρι) is followed, the path group is followed. The group (Pi_P2_P3.P4_Pi) defines the direction of the path; then it is judged whether the pre-Fengfeng (4) has another----------------------------------------------------- The last path (P4-Pl) of the group (Ρι·Ρ2·ρ3_ρ4_Ρι) jumps directly to the adjacent path group (ΡΑ Ρ9) - the last path (Ρ8-Ρ9) 'its"9 is the path Group ( ) - terminate the node, and then carry out subsequent exploration. The decision basis for judging whether to jump to the adjacent another----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- The set of paths - the starting point and the end point are interconnected. As we know, the current minimum cost calculation method is to obtain the number of points of the electronic map and its coordinate position, and then count the number of path combinations between the nodes, and finally calculate the distance of each path combination, and match Eight per-roads have their road rule attributes and their walking costs listed as search materials, and finally the one with the lowest search result cost is the preferred path. In addition to the minimum cost calculation method, the preferred embodiment gives a lower walking cost to different paths, and the pair of paths will be re-aligned every time the search is performed, thereby making the output suitable. Guided route. In terms of distance cost, it is based on the distance to the destination ρ", giving a different walking cost, for example, 30 km as a watershed, less than 30 km, the walking cost is lower, and vice versa, the county is more than = 200839189. In addition, if you encounter a _ current walking party...you want J to "swing direction", and use the u jin ^ group to have the same direction, then use the light group directly. And the funeral group, and 1..., the trail begins with another-alternate group to use the alternative path group. When a group (4) costs, then, when: the cost aspect is based on the current travel time, whole
紅過一般路徑i及「|菸 ΛΑ 士 0B 徑及〜 」的時間，主要是將「-般路 料…徑」分別乘上不同的時間成本，以自動判斷應 “市區逼路或外環道，進而得到最佳導引路線。 例如··在上下班尖峰時間，早上7點到9點，下午5 點到7點的時間段内，當搜索到「要徑類別」為「替代道 路」或「捷徑道路」時，將其時間成本設為零，則導引路 線就S避開市中心的堵車路段以節省時間。 另外，時間成本會依到達要徑的時間在「預定時段」 時自動執行路徑再搜索。例如：原本下午4點就會通過桃 園市，但因某事，下午5點才會經過桃園市，由於進入了 苇心日守間區間」，因此在接近桃園市時會啟動路徑再搜索 ’將導引路線導引出外環道以避開堵車。 (二）輪出最合適的導航路線 參閱圖5,本發明要徑式導航路線搜索方法是由一導航 系統執行，該系統需安裝具有要徑資料的導航資料庫4，且 每次搜索到的導引路線皆會紀錄在一路線資料庫3中，並 依其區域、常用順序加以排序，因此當下次有相同搜索時 叮直接引用路線資料庫3之資料。本發明要徑式導航路線 12 200839189 搜索方法實際進行搜索的流程包含下述步驟·· 首先輸入—出發地及一目的地（步驟3〇1);接著， 於路線資料庫3中預存的資料，判斷該出發地及該目的地 之間是否已存在-要#導航路線（步驟地）？若已存 =導航路線，則再邦岐否還有其他備用路線（步驟⑽）？ 若否’則輸出成本最小的要徑導航路線（步驟3ιι)。 · 右路❹料庫3衫在要徑導航路線，則取用導航資 料庫4的賴，對所有路徑進行搜索（步驟303)，且其搜索 係判斷目可是否為要徑優先搜尋模式（步驟304)?所謂的要 徑優先搜尋模式，例如為判斷目前是否屬於「預定^要 :若判斷目前不是「預定時段」，則進行-般路徑之最二 2索驟-312)、；若判斷目前是「預定時段」，將該等路 ^、至少一要徑列為搜素目標，判斷路徑之屬性是-般路 徑或要徑（步驟305)?若 』断疋叙路徑，即進行一般路徑 之取小成本搜索法（步驟312)。 的隸是屬於一要徑群組時，則判斷依據是在 、疋半仏内疋搜哥否有另—要徑群組（步驟3G6)?若預定 半控内益另一要和栽4 、 I、、’則進行一般路徑之最小成本搜索 驟3叩若有另—要徑群組，則自動連接另—要徑群 ^步驟3〇7)，魏接方式是依循該要徑群組定義的要徑方 °:進’並^要後群級的一最後路徑直接跳到相鄰的另 組的-最後路徑；接著，依據要徑距離該目的地 的距離遠近分配不同的杆丰 的仃走成本（步驟308)，其方式是計算 4要偟距離該目的地的_ ^ 離’右該距離高於一預定距離 13 200839189 公里)’則判斷其行走成本較高，若該距 預定距離者，貝丨丨划娜廿v丄、 ，…土、 其行走成本較低；最後，累加不同要 :、二成本以計算'累積成本(步驟309);再來需判斷是 其他備用路線(步驟310)?若否，則輸出成本最小的 曰線(步驟311);若有其他備用路線，則比較成本 驟311)(^ ‘ 313) ’亚選擇輸出成本最小的要徑導航路線（步 參閱圖6 ’以_倒c迴轉路段521為例，導航晝面$會 分：成左右二個子晝面51、52,其中一子晝面Μ顯示一般 的導航畫面，另-子畫面52則顯示有標示該倒c迴轉路段 521之畫面。此外，該倒c迴轉路段521在右方的子畫面 52以擴大圖的方式顯示其位置，且子畫面52的右下角標示 各轉彎路口的方向及距離供駕駛預覽。 苓閱圖7，以一替代路段為例，導航晝面5,也會分割成 左右二個子畫面51，、52，，其中一子畫面51，顯示一般的導 航畫面，另一子晝面52,則會標示原來的一主要道路52〇，及 一替代路段521，之晝面。 歸納上述，由於本發明要徑式導航路線搜索方法是將 不同路徑依其性質區分為一般路徑或要徑，並將要徑也列 入搜索條件，因此相較於現有搜索法能夠得到最佳化的導 航路線。 惟以上所述者，僅為本發明之較佳實施例而已，當不 能以此限定本發明實施之範圍，即大凡依本發明申請專利 範圍及發明說明内容所作之簡單的等效變化與修飾，皆仍 14 200839189 屬本發明專利涵蓋之範圍内。 【圖式簡單說明】 圖1是一流程圖’說明本發明要徑式導航路線搜索方 法之最佳實施例； 圖2是一不意圖’說明_電子地圖之道路網絡中具有 複數個節點； 圖3疋一不思圖’說明一電子地圖是由多種類別的不 同圖層疊合而成； 說明如何製作一具備要徑資料的導 說明該較佳實施例實際進行搜索的 圖4是一流程圖， 航資料庫， 圖5是一流程圖， 流程； C迴轉路段之導航畫面 圖6是一示意圖，說明具有一 圖7是一示意圖 之導航畫面。 說明具有一主要道路及— 替代路段 15 200839189 【主要元件符號說明】 11 〜14····圖層 301 〜312 100 .......道路網絡 4 .......... 101 〜103 步驟 5、5’ ···· 51 、 52 、 21 .........道路調查資料 ............ 22 .........道路使用者提供 520’…… 資料庫 521…… 23 .........官方地圖資料庫 521’…… 201〜205步驟 3 ..........路線貢料庫 步驟 導航資料庫 導航晝面 51’ 、 52” 子晝面 主要道路 C迴轉路段 替代路段 16The time between red and general path i and "|Smoke 0 0B diameter and ~" is mainly to multiply the "----------------------------------------------------------------------------------------------- The road, in order to get the best guide route. For example, during the peak hours of commuting, from 7:00 am to 9:00 pm, from 5 pm to 7 pm, when searching for "required path type" as "alternative road" Or "shortcut road", set its time cost to zero, then guide the route to avoid the traffic jams in the city center to save time. In addition, the time cost will automatically perform the path search again during the "predetermined time period" according to the time of arrival. For example, it will pass through Taoyuan City at 4 o'clock in the afternoon, but it will pass Taoyuan City at 5 pm due to something, and it will enter the path of the 日心日守," so when you approach Taoyuan City, it will start the path and search again. The guiding route leads out of the outer ring road to avoid traffic jams. (2) Turning out the most suitable navigation route Referring to FIG. 5, the method for searching for the trailing route of the present invention is performed by a navigation system, which needs to install a navigation database 4 having the required data, and each time it is searched The guided routes are recorded in a route database 3, and are sorted according to their regions and common order, so when the same search is performed next time, the data of the route database 3 is directly referred to. The present invention requires a path navigation route 12 200839189 Search method The actual search process includes the following steps: First input - departure place and a destination (step 3〇1); then, the data pre-stored in the route database 3, Judging whether there is already a place between the departure place and the destination - to # navigation route (step)? If there is already a navigation route, is there any other alternate route (step (10))? If no, the output route with the least cost is output (step 3 ιι). · If the right path database 3 is in the navigation route, the navigation database 4 is used to search all the paths (step 303), and the search system determines whether the target is the priority search mode (step 304)? The so-called priority search mode, for example, to determine whether it is currently "scheduled": if it is judged that it is not the "predetermined time period", then the most common path of the -2 path -312); It is a "predetermined time period". The path and the at least one path are listed as search targets, and the attribute of the path is determined to be a general path or a path (step 305). If the path is broken, the general path is performed. A small cost search method is taken (step 312). If the affiliation belongs to a group of majors, then the judgment is based on whether there is another group in the 疋 仏 疋 要 要 要 ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( I,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,, The diameter of the path: into the 'and ^ after the group's last path directly jumps to the adjacent group - the last path; then, according to the distance from the destination to the distance of the distribution of different poles Taking the cost (step 308), the method is to calculate that the distance from the destination is _ ^ away from the right distance is higher than a predetermined distance 13 200839189 km), then the walking cost is determined to be higher, if the distance is the predetermined distance , 丨丨 丨丨 廿 廿 丄 丄 , , , , , , , , , , , , , , , , , , , , , , , , , , ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; If not, the lowest cost line is output (step 311); if there are other alternate routes, it is compared This step 311) (^ ' 313) 'Sub-selection of the minimum cost of the navigation route (see Figure 6 'take _ inverted c-turn section 521 as an example, navigation 昼 face $ will be divided into: two left and right sub-surface 51 52, one of the sub-surfaces displays a general navigation screen, and the other sub-screen 52 displays a picture indicating the inverted c-turned section 521. Further, the inverted c-turned section 521 is enlarged on the right sub-picture 52. The figure shows the position, and the lower right corner of the sub-picture 52 indicates the direction and distance of each turn intersection for driving preview. Referring to Figure 7, taking an alternative road section as an example, the navigation surface 5 is also divided into two left and right children. The screens 51, 52, one of the sub-pictures 51 display a general navigation picture, and the other sub-surface 52 marks the original one main road 52〇, and an alternative road section 521, which is summarized above. Since the present invention requires the path navigation route search method to classify different paths into general paths or paths according to their properties, and to include the path as a search condition, an optimized navigation route can be obtained compared to the existing search method. But the above, only For the preferred embodiment of the present invention, the scope of the present invention is not limited thereto, that is, the simple equivalent changes and modifications made by the scope of the invention and the description of the invention are still 14 inventions. BRIEF DESCRIPTION OF THE DRAWINGS [Brief Description of the Drawings] Fig. 1 is a flow chart 'illustrating a preferred embodiment of the method for searching for a radial navigation route of the present invention; FIG. 2 is a road network not intended to illustrate _ an electronic map There are a plurality of nodes; FIG. 3 is an illustration of an electronic map which is composed of different types of different maps; how to make a map with the required data to actually search the preferred embodiment. 4 is a flow chart, aeronautical database, FIG. 5 is a flow chart, a flow; a navigation screen of a C-turned road section. FIG. 6 is a schematic diagram showing a navigation screen having a schematic diagram of FIG. Description has a main road and - alternative road segment 15 200839189 [Main component symbol description] 11 ~ 14 · · · · Layer 301 ~ 312 100 ....... Road network 4 .......... 101 ~103 Step 5, 5' ···· 51 , 52 , 21 ......... Road survey data............ 22 ......... Road users provide 520'... Database 521... 23 ......... Official map database 521'... 201~205 Step 3 .......... route tribute library Step navigation database navigation page 51', 52" sub-surface main road C revolving road section alternative road section 16