1274141 九、發明說明： 【發明所屬之技術領域】 本發明是有關於一種電子地圖之多重目標規 特別是指-種具有行程規劃功能之電子 規劃方法。 回之夕目標行程 【先前技術】 現今電子地圖已有提供多重目標探索的功能，作 前這些目標必須由使用者逐個做資料輸入至 p目 航裝置（例如具有電子地圖導航系統的可攜式電腦、個= 位助理或手機）中，然後設於導航裝置中的 — 據輸入的這些目標依照輸入順序一個—個的二會根 圖1所示，當接收到使用者依序輸入目標點gi 如 W等6個目標點資料後，其通過目標點的順 ^ 的時間先後決定行程的順序為目標點目標點1 = 點…目標點0 “目標…目標點以。因每〜:: 距離出發點S的遠近並非相同，且若按 ^ :順序所決定的行程順序，會有來回行駛或繞路的 現。因此，習知的探索功能，使用者必須先自行決定 = =點的順序後再輸人資料，否則其探索的結果會有^ : = 出現，遇到物流業者必須通過許多目標點或者 滿足此類需求。不池悉令’現有的探索機能無法 【發明内容】 因此’本發明之目的，即在提供—種可將多個目標點 4 1274141 駛而1成、…八一取佳化的行程，以達到避免來回行 .-，=㈣駕駛人日㈣及行駛多餘不必要路程的功效。 於疋，本發明提供一電子地 孛方法，也A k 夕i目&订程規劃探 蒙方法係包括以下步驟：首先，於—起 個目標點資^ σ ”、、同蚪接收一 m 哕叔私赴从士 a 计异各該目標點與 j起始點的直線輯後，自該m個目標點取出n個目標點 作為候補點，作為候補點仏 Μ ^ ^ , 心合A S ‘點與该起始點間的距 離小於未作為候補點之剩 離，兮， 之幻餘目軚點分別與該起始點間的距 硪，该η為正整數且該n<m。鈇々 ^ ^ κ , ' '、、、後，计异各該候補點至該 之始點的订程距離後，取 作Α日^ 取出δ玄订知距離最短的對應候補點 作為目的地點；最後，將該 砧作為下一起始點，及對 Μ等目^示點中的剩餘目禪 知點重祓上述的步驟，依序排出下 :畢：目的地點之對應目標點’直到所有目標點皆被排列 本發明另提供一電子地圖導航電子裝置，包括一電子 地圖資料庫，儲存有m個 二 知”、、占貝料及一起始點資料，其 中忒m為正整數、一顯示單 ^ 早70 用以顯不一電子地圖圖案 ”亥m個目標點及^一起妒f上♦ Bfe m ★ , 屹始點之對應圖案、一控制單元，接 收各該目標點與該起始點的直 直綠距離後，自该m個目標點 取出η個目標點作為候補點 ^ 铺』作為候補點之各該目標點與 該起始點間的距離小於未作糸 、 ^ 衣作為候補點之剩餘目標點分別與 該起始點間的距離，該η Α τ μ # ^ η為正整數且該n^m。接著，計算 各該作為候補點之目標點至兮如 二 ”芏孩起始點的行程距離後，取出 该行程距離最短的對應候補點作為目的地點，及將該目的 1274141 地點作為下_ * # 、始點。然後，對該等目標點中的剩餘目標 重複則述步驟’依序排出下—作為目的地點之對應目標 ^直到所有目標點皆被排列完畢為止，以產生一通過該 等目私點之仃程順序並顯示於該顯示單元。一導航單元， 自該起始點依該行程順序進行導航 以通過該等目標點。 本發明另提供一電腦可讀取之記錄媒體，可設置於一1274141 IX. Description of the invention: [Technical field to which the invention pertains] The present invention relates to a multi-target specification of an electronic map, and more particularly to an electronic planning method having a trip planning function. Back to the target travel [previous technology] Today's electronic maps have provided multiple target exploration functions. Before the target, the user must input data to the p-horizon device (for example, a portable computer with an electronic map navigation system). , a = assistant or mobile phone), and then set in the navigation device - according to the input order, one of the two will be shown in Figure 1, when the user is received, the target point gi is entered in sequence. After W and other 6 target point data, the order of the itinerary is determined by the time of the target point as the target point. The target point is 1 = point... The target point is 0. "Target... Target point. Because each ~:: Distance starting point S The distance is not the same, and if you follow the sequence of strokes determined by the order of ^, there will be a round trip or a detour. Therefore, the conventional exploration function, the user must first decide == point order before inputting Information, otherwise the results of its exploration will be ^ : = appears, the logistics industry must meet many target points or meet such needs. Do not know that 'the existing exploration function can not [invented Therefore, the purpose of the present invention is to provide a trip that can take multiple target points 4 1274141 into one, and to make a good trip to avoid round trips. -, = (4) Driver's Day (4) And the effect of driving unnecessary unnecessary distances. In the present invention, the present invention provides an electronic mantle method, and also includes the following steps: First, at - a target point ^ σ ”, 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪 蚪仏Μ ^ ^ , the distance between the point of convergence of the heart and the starting point is smaller than the distance between the starting point and the starting point, which is the distance between the starting point and the starting point. An integer and the n<m.鈇々^ ^ κ , ' ', , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , Finally, the anvil is used as the next starting point, and the remaining steps in the points of the Μ ^ 祓 祓 祓 祓 祓 祓 祓 祓 祓 祓 祓 祓 祓 祓 : : : : : 毕 毕 毕 毕 毕 毕 毕 毕 毕 毕 毕 毕 毕 毕 毕 毕The present invention further provides an electronic map navigation electronic device, comprising an electronic map database, storing m two knows, a shellfish and a starting point data, wherein 忒m is a positive integer, a display sheet ^ early 70 is used to display the electronic map pattern "Hing m target points and ^ together 妒 f ♦ Bfe m ★, the corresponding pattern of the starting point, a control unit, receiving each of the target point and the starting point straight After the green distance, the n target points are taken as the candidate points from the m target points as the candidate points, and the distance between the target points and the starting point is smaller than the remaining targets of the unfinished points and the clothing as the candidate points. The distance between the point and the starting point, the η Α μ # ^ η is a positive integer and the n ^ m. Then, after calculating the travel distance of each of the candidate points as the candidate points to the starting point of the second child, the corresponding candidate point having the shortest travel distance is taken as the destination point, and the destination 1274141 is taken as the lower _ * # And starting point. Then, repeating the remaining targets in the target points, the step of 'sequentially discharging the next target as the destination point ^ until all the target points are arranged, to generate a pass through the target The order of the points is displayed on the display unit. A navigation unit navigates from the starting point in the sequence of the travel to pass the target points. The present invention further provides a computer readable recording medium, which can be set in One
计^機裝置中以被讀取的執行上述多重目標行程規劃探索 方法。 【實施方式】 有關本赉明之前述及其他技術内容、特點與功效，在 、下配s參考圖式的一個較佳實施例的詳細說明中，將可 清楚的呈現。 如圖2所示，本發明電子地圖導航電子裝置1是為一 具有計算機功能的電子裝置，其包括_輸人單& 1()、_電 子地圖資料庫u、一衛星定位單元12、一顯示單元i3、一 導航單元30及一控制單元2〇。 八中該輸人單元K)可為例如但不限於：_外接之筆記型 電腦、個人數位助理（PDA)、或設於該電子地圖導航電子裳 置11中的觸控螢幕、鍵盤。其可供使用者輪入多筆目標點 資料⑽如座標資料）。衛星定位單元12可根據目前該^ 地圖導航電子裝置丨之所在位置產生一起始點資料(例如座 標貧料）。電子地圖資料庫u中儲存有多筆電子地圖資料、 接收的目標點資料及起始點資料（圖未示）。顯示單元13用 以顯示該電子地圖資料、目標點資料及起始點資料的對應 6 1274141 二圖案（見圖4)。 導航單元30例如為一 栽；儲存媒體中的導航程式，可 被續取的接收由輪入單元 • 航功能，此導航程式在本，輪：的目標點而對其進行導 - 撕的目標點而進行ΐ:;:可使用任何-習用可根 控制單…為-載有航程式’在此不再費述。 但不限於一硬碟、光碟V电腦可讀取之紀錄媒體(例如 •取的進行如圖3的行程規二式:碟或網路磁碟)’可被讀 ^ -併參閱圖2至圖、二=使其包㈣列步驟： 多筆目標點資料於—清單“使二者使用輸入單元1〇輸人 帛⑽並儲存至該電子地圖資 二中後:控制單元2。可至該電子地圖資料庫η中讀 心、m筆目標點的檔案或直接接收該檔案⑽ 筆目標點資料，i中哕盔 :、中4⑽為正整數（步驟S1)，在本實施例 ^ i…、的目標點以6(m=6)筆目標點為例，分別為 才示點⑴〜目標點G6(見圖句，每一目標點G1〜G6具有 鲁:對應座標（圖未示）。接著，計算每一目標點與起始點間的 直線距離（步驟S2)。舉例來說，目標，點⑴的座標為（χ】， y 1)起始點s的座標為（Xg，y。），則起始點s至目我點 ㈣直線距離#算^有目 標點G1〜G6距離起始點s的直線距離後，進入步驟幻取 出直線距離最短（即目標點距離起始點最近）的η個目標點（ 其中11為正整數且ngm)作為候補點，在本實施例中是取直The multi-target trip planning search method described above is executed in the computer device. [Embodiment] The foregoing and other technical contents, features, and advantages of the present invention will be apparent from the detailed description of the preferred embodiments of the accompanying drawings. As shown in FIG. 2, the electronic map navigation electronic device 1 of the present invention is a computer-enabled electronic device, which includes an input unit & 1 (), an electronic map database u, a satellite positioning unit 12, and a The display unit i3, a navigation unit 30 and a control unit 2〇. The input unit K) may be, for example but not limited to: an external notebook computer, a personal digital assistant (PDA), or a touch screen or keyboard disposed in the electronic map navigation electronic device 11. It allows the user to wheel multiple target points (10) such as coordinate data. The satellite positioning unit 12 can generate a starting point data (e.g., coordinate poor material) according to the current location of the map navigation electronic device. The electronic map database u stores a plurality of electronic map data, received target point data, and starting point data (not shown). The display unit 13 is configured to display the corresponding 6 1274141 two patterns of the electronic map data, the target point data, and the starting point data (see FIG. 4). The navigation unit 30 is, for example, a navigation program; the navigation program in the storage medium can be continuously received by the wheel-in unit and the navigation function, and the navigation program guides and tears the target point at the target point of the wheel: And the ΐ:;: can use any - the use of the root control ... ... - with the program - will not be mentioned here. However, it is not limited to a hard disk, CD V computer readable recording medium (for example, take the trip gauge as shown in Figure 3: disc or network disk) 'can be read ^ - and see Figure 2 to , 2 = Make the package (4) column steps: Multiple target data in the list - "Use the input unit 1 to input the input (10) and store it in the electronic map 2: Control unit 2. Available to the electronic Map file database η read the heart, m pen target point file or directly receive the file (10) pen target point data, i in the helmet:, 4 (10) is a positive integer (step S1), in this embodiment ^ i... The target point is taken as an example of a 6 (m=6) pen target point, which is a point (1) to a target point G6 (see the figure, each target point G1 to G6 has a Lu: corresponding coordinate (not shown). Then, Calculate the linear distance between each target point and the starting point (step S2). For example, the target, the coordinate of point (1) is (χ), y 1) the coordinate of the starting point s is (Xg, y.), Then, the starting point s to the point of the point (four) straight line distance #算^The distance between the target points G1~G6 and the starting point s is the shortest distance (ie, the straight line distance is entered. The n target points (where 11 is a positive integer and ngm) whose target point is closest to the starting point are used as candidate points, which is straight in this embodiment.
線距離最近的的其中3個㈣）目標點⑴、及G 補點。 馬候 1274141 見圖4 ’由上述步驟得出直線距離最近的3個 序為目標點G4、目標點G5及目標點〇!作為候補點：依 對這些作為候補點的目標點進行行程探索，及^接著 候補點與起始點間的行程距離（步驟S4)。由於每二:— 補點的目標點G4、G5及G1與起始點s間的行程乍= 僅藉-直線路徑就可直接互通’而是有可能為彎折的路： 、街道或者是多個彼此垂直且相接的街道或路：The line is the nearest 3 (four)) target point (1), and G complement point. Mahou 1271441 See Figure 4 'The three orders with the closest linear distance from the above steps are the target point G4, the target point G5 and the target point 〇! As candidate points: the route is searched for these target points as candidate points, and ^ Then the travel distance between the candidate point and the starting point (step S4). Since every two: - the target point of the supplementary point G4, G5 and the distance between the G1 and the starting point s = only borrow - the straight path can be directly communicated 'but it is possible to bend the road:, street or more Streets or roads that are perpendicular to each other:
=折首轉折或街道賴被定義為節點，兩相鄰節： 間則為-直線距離。因此，每一作為候補點的目標點至起 始點的行程距離為由起始點至所有通過節 的距離和，其相關函式如下： 。目‘點 C(S,Gn)= R(S, Nl)+R(Nl5 N2)+..+R(Nk Gn) /上述算式中，C(S，Gn)代表由起始點8至目標點如的 -程距離，R(S，Nl)代表起始點s至節點&的直線距離， 咖，ν2)代表節點Νι至節點ν2的直線距離，··咖仏） 代表節點Νκ至目標點Gn的直線距離。由算式得出起始點 S至目標點Gn的行程距離為由起始點8經所有節點N】〜队 至目標點Gn直線距離的距離和。 舉例來說，以圖5的目標點G1為例，由起始點s至目 標點G1行程4途中形成有節點，〜队。因此，由起始點S 至目標點G1的行程距離c(s，G〇為起始點s至節點&、節 .’：1至節點、節點N2至節點N3及節點n3至節點n4的 直線距離和，其對應算式為： c(S5G1)=R(S5N])+R(N1,N2)+R(N2,N3)+R(N3 N4)+ 1274141 R(N4，Gn^ 程距中’ C(S，Gl)代表由起始點S至目標點Gl㈣= folding first turn or street lay is defined as a node, two adjacent sections: between - straight-line distance. Therefore, the travel distance from the target point to the starting point as the candidate point is the distance from the starting point to all the passing points, and the related function is as follows:目 'Point C(S, Gn) = R(S, Nl)+R(Nl5 N2)+..+R(Nk Gn) / In the above formula, C(S, Gn) represents the starting point 8 to the target Point-like distance, R(S, Nl) represents the linear distance from the starting point s to the node & café, ν2) represents the linear distance from the node Νι to the node ν2, · · 咖仏) represents the node Ν κ to the target The straight line distance of point Gn. From the equation, the travel distance from the starting point S to the target point Gn is the sum of the distances from the starting point 8 through all the nodes N] ~ the team to the target point Gn. For example, taking the target point G1 of FIG. 5 as an example, a node, a team, is formed in the middle of the stroke 4 from the starting point s to the target point G1. Therefore, the travel distance c (s, G 〇 from the starting point S to the target point G1 is the starting point s to the node &, the section ''1 to the node, the node N2 to the node N3, and the node n3 to the node n4 The straight line distance sum is corresponding to: c(S5G1)=R(S5N))+R(N1,N2)+R(N2,N3)+R(N3 N4)+ 1274141 R(N4,Gn^ in the path 'C(S, Gl) stands for the starting point S to the target point G1 (four)
=ΝΛ )代表起始點S至節點〜的直線距離， R(N!，N2)代表節點N * ^ N ^ , 即2 N2的直線距離…R(N4, Gl)代 表即队至目標點G】的直線距離。 十m出作為候補點的目標點◦ j、g5 離後，取行程距離最短的 、仃王 ，舉例來說，若欣山固 目軚點作為目的地點（步驟S5) °〜出圖4的目標點Gl、G5及G4中 點G4的行程距離最短 及G4中，仏 的地點。 目軚2 G4就會被選定作為目 接著’於步驟S6以作a曰从丄丄 —起# S； ^ 々地點的目標點G4作為下 起始點，而因為原目標點μ 作為下 餘目俨s； &叙e、 雨新的起始點，所以剩 餘目心點的數1減少卜換句話 目的地點，當進行更新後，剩餘目標點僅= 點G4被選為 G3、G5及〇6。目；p點數 ; k彳下目標點G1〜 U數目則由6個減至5個。 畜更祈完畢後，於步驟s7判斷 於η，若否的話則回到步驟幻 ’、軚點數量是否小 到剩餘目標點數量小於n時，摟:,驟S2〜S7的流程，直 否等於零?若不等於突則 者1]斷剩餘目標點數量是 卜寻万、答則代表目標點數 ’如此則取出所有剩餘目標點 二但是大於零 回到她並進行步驟S4至步驟％的=^^ 點數量等於零，代表所有目標點都已 直到剩餘目標 程規劃流程（步驟 Sl0)e 完畢，可結束行 舉例來說，當剩餘目標點數量剩 個4，因為5^3 1274141 ，所以接下來重覆步驟S2〜 ,_ 的動作，如此可接著依序得 出士通過的二的地點之行程順序為目標點gi、g5“2，此 時剩餘目軚點數量僅剩2個|妖、 小於選取的候選點3個時，則 取剩下的2個目標點作 則 點，回到步驟S4及重覆S4 到步驟S9的動作，排 後 者依序通過的目的地點為目標點 G3及G6,直到剩餘目 流程。並可再經由導航單_ I;4於零，取後結束打程規劃 過該等目標點。早7依該行程順序進行導航以通=ΝΛ ) represents the linear distance from the starting point S to the node ~, R(N!, N2) represents the node N * ^ N ^ , ie the linear distance of 2 N2...R(N4, Gl) represents the team to the target point G 】 straight line distance. Ten m is the target point of the candidate point ◦ j, g5 After the departure, take the shortest distance, the king, for example, if the Xinshan solid point is the destination point (step S5) ° ~ the target of Figure 4 The G1, G5, and G4 midpoints G4 have the shortest travel distance and the G4, the location of the 仏. The target 2 G4 will be selected as the next step 'in step S6 for a曰 from 丄丄-起# S; ^ 目标 location target point G4 as the next starting point, and because the original target point μ is the lower target俨s; & 叙e, the new starting point of rain, so the number of remaining gaze points is reduced by the value of the destination point. When the update is made, the remaining target points are only = point G4 is selected as G3, G5 and 〇 6. The number of p points; the number of target points G1 to U under k彳 is reduced from 6 to 5. After the animal has finished praying, it is judged at η in step s7, and if not, it returns to step illusion, and if the number of defects is small until the number of remaining target points is less than n, 搂:, the flow of steps S2 to S7 is directly equal to zero. If it is not equal to the protrusion, 1] the number of remaining target points is the number of the remaining points, and the answer is the number of the target points. Thus, all the remaining target points are taken but the value is greater than zero and returned to her and the step S4 to step % = ^ ^ The number of points is equal to zero, which means that all target points have been completed until the remaining target planning process (step Sl0) e is completed, and the end line can be ended. For example, when the number of remaining target points is 4, because 5^3 1274141, the next step is heavy. The action of step S2~, _ is repeated, so that the sequence of the route of the second pass of the pass is sequentially obtained as the target point gi, g5 "2, and only 2 of the remaining target points are left | demon, less than selected When there are three candidate points, the remaining two target points are taken as the point, and the process returns to step S4 and repeats S4 to step S9, and the destination points that are sequentially passed are the target points G3 and G6 until Remaining project flow and can be accessed via navigation sheet _ I;4 Zero, after the end of the fight to take over the planning process such target point as early as 7 to navigate according to the travel in order to pass
籍甶上述的方法，可媒 『侍出由起始點s依序通過的行程 順序為目標點G4、目椤脏m ， 目才不點G1、目標點G5、目標點G2、目 標點G3及目標點- … 並颂不於顯示單元13上（見圖6)。如 此可以具有下列優點： ⑴可規劃最佳化行程··本發明可根據輸入的多個目標 』I由運异後根據行程距離的遠近依序排出目的地點， 藉以產生最佳化的行程，可避免習知使用者需先自行決定 通過目標的順序後再輸入資料的不便，及習知依據其探索 的、、°果可旎會有來回行駛的行程出現的情形。 产^(2)钕索效率較佳··同時探索過多目標點，會使探索速 口此本發明先選定直線距離該起始點最近的η個 衿”’纟再對该等目標點進行探索。如此不用對每一目標 .’、、占進仃行程探索而感覺整體探索時間太長，可縮短行程探 索時間1 罙索效率較佳。 & 准以上所述者，僅為本發明之較佳實施例而已，當不 月I以it卜丄々 丨艮疋本發明實施之範圍，即大凡依本發明申請專利 10 1274141 範圍及發明說明内容所作之簡單的等效變化與修飾，皆仍 屬本發明專利涵蓋之範圍内。 【圖式簡單說明】 圖1是一平面示意圖，說明習知使用者依序輸入多目 標點時，電子地圖導航裝置產生的行程順序； 圖2是-方塊示意圖，說明本發明多目標行程規割系 統之一較佳實施例；According to the above method, the medium can be used to serve the target point G4, the target point G4, the target dirty point m, the target point G1, the target point G2, the target point G3 and The target point - ... is not displayed on the display unit 13 (see Fig. 6). In this way, the following advantages can be obtained: (1) The optimized travel can be planned. The present invention can sequentially output the destination point according to the distance of the travel distance according to the plurality of targets input, thereby generating an optimized stroke. It is forbidden for the user to decide the inconvenience of inputting the data after the order of the target, and the situation that the conventionally learned, according to the exploration, may have a trip back and forth. Production ^ (2) 钕 效率 效率 · · · 探索 探索 探索 探索 探索 探索 探索 探索 探索 探索 探索 探索 探索 探索 探索 探索 探索 探索 探索 探索 探索 探索 探索 探索 探索 探索 探索 探索 探索 探索 探索 探索 探索 探索 探索 探索 探索 探索Therefore, it is not necessary to explore each target. ', and take the exploration of the journey and feel that the overall exploration time is too long, and the travel time can be shortened. 1 The search efficiency is better. & The above is only the comparison of the present invention. In the preferred embodiment, the simple equivalent changes and modifications made by the scope of the invention and the scope of the invention are still in the scope of the invention. The present invention covers the scope of the invention. [Fig. 1 is a schematic plan view showing the sequence of strokes generated by the electronic map navigation device when a conventional user inputs multiple target points in sequence; FIG. 2 is a block diagram of A preferred embodiment of the multi-target stroke cutting system of the present invention is illustrated;
圖3是一流程圖 一較佳實施例； 說明本發明多目標行程規劃方法之 圖4是一平面示意圖，說明去 ，各目標點之相關位置； ’肖者輸入多目標點時 圖5是圖4的局部放大示意圖；及 圖6是一平面示意圖，說明經 〆 法之行程規劃結果。 S明行程規劃探索方 1274141 【圖式之主要元件代表符號說明】 I ..........電子地圖導航電 30......... 子裝置 20......... 10.........輸入單元 100....... II .........電子地圖資料庫 G1〜G6· 12 .........衛星定位單元 S .......... 13 .........顯示單元 S1〜S10 導航單元 控制單元 清單檔案 目標點 起始點 步驟3 is a flow chart 1; FIG. 4 is a schematic plan view showing the relative position of each target point; FIG. 5 is a diagram when the multi-target point is input. A partial enlarged view of 4; and Fig. 6 is a schematic plan view showing the results of the stroke planning by the 〆 method. S Ming trip planning explorer 1271441 [The main components of the diagram represent the symbol description] I .......... Electronic map navigation electricity 30......... Sub-device 20..... .... 10.........Input unit 100....... II .........Electronic map database G1~G6· 12 ....... .. satellite positioning unit S .......... 13 ......... display unit S1 ~ S10 navigation unit control unit list file target point starting point step
1212