1300659 九、發明說明： 【發明所屬之技術領域】 一種無線射頻識別(Radio Frequency Identification, RFID)追 椒系統及其方法，特別係指一種利用圖形結構轉換簡化方式對呼 叫點進行排程分群以減少訊號碰撞之無線射頻識別追蹤系統及其 方法。 ’、 【先前技術】 如「第1圖」所示，無線射頻識別（Rad丨0 Frequency 丨dentification，RF丨D)追蹤系統55係目前在RF|D技術領域中頗受 重視的應用所在。習知的RFID追縱系統55，其主要係利用前端 的標鐵(T_o、識別器(Reade⑽及定位器(L〇cat〇⑽之間的 呼叫回報機㈣標籤1G當時所在位置進行定位，並透過後端 器奶傳送定位資訊至後端的顧程式中5G執行對應追縱處理， 追縱結果可崎過網路Q5提供給需求人貞進行了解。1300659 IX. Description of the invention: [Technical field of invention] A radio frequency identification (RFID) system and method thereof, in particular, a method for scheduling call points by using a simplified structure conversion method to reduce the number of call points A radio frequency identification tracking system and method for signal collision. ‘, [Prior Art] As shown in Fig. 1, the Radio Frequency Identification (RFD) tracking system 55 is currently widely used in the field of RF|D technology. The conventional RFID tracking system 55 mainly uses the front-end standard iron (T_o, the identifier (Reade (10) and the positioner (L〇cat〇 (10) between the call return machine (4) label 1G at the time of positioning, and through The back-end milk transmits the positioning information to the back-end program, and the 5G performs the corresponding tracking process. The tracking result can be provided to the demander by the network Q5.
標籤10收到來自識別器20所發出的呼叫訊號 ’所以可以在 .，Jf" ·「々知 a iThe tag 10 receives the call signal from the recognizer 20 so that it can be in ., Jf"
ί 1300659 的能力因此適合距離較長的應用。被動式的呼叫回報機制，如「第 3圖」所示，因為其所使用的標籤1〇係採取電磁感應的方式將識 別器20傳送的呼叫訊號15的電波直接轉換成電力來驅動標籤 進行回報訊號25的發送’因此此種呼叫回報機制僅能夠被應用在 較短距離的情況。 整個RFID追蹤系統55的基本組成方塊圖，請參考「第4圖 的部分，除了會包括前面所提到前端的標籤1〇、識別器2〇、^ 位器30之外還會有後端的應用程式5〇，以及介於前端和後端之 間的後端伺服器40，在後端伺服器40中更包含用來分別管控識 別斋20及定位器30並進行訊息溝通傳輸的識別器控制介面 及定位器控制介面42，以及絲處理標籤1Q定位f訊的處理模 組43，最後應用程式50再透過應用程式介面44接收處理後的標 籤10相關資訊，實現整個RF丨D追蹤系統55的基本運作。 然而，目前的RFiD追縱系統55存在一個長期以來未解決的 問題’就是當標籤10處於多個識別器2〇/定位器3〇料叫訊號 15交集範圍内時，當識別器20/定位器3〇同時發送呼叫訊號^ 時，就會很容易產生呼叫訊號15相互碰撞的問題。產生呼叫城 15相互碰撞的結果’將會造成標籤1〇無法順利收到呼叫訊號 15 ’也就是標籤10無法繼續進行發送回報訊號25的程序，以至 於無法對標籤10完成定位的動作，同時對於整個咖追縱系统 55的運作來說’當呼叫訊號15相互碰彳_題越加嚴重的情況 下將降低整體RF7丨D追蹤系統55的可靠度。 「第5圖」為RFID追縱系統55中發生呼叫訊號π碰撞的 1300659 示意圖，如圖所示’標籤10正好位於識別器A2〇/定位器A3〇與 硪別器B20/定位器B30的呼叫點訊號範圍的交集位置中，於是當 • 兩邊同時發出呼叫訊號15時’標籤1()會因為呼叫訊號15 2 、 碰撞的緣故’而一個呼叫訊號15也收不到，導致無法進°行定位和 使整體RFID追蹤系統55的可靠度降低。 f知解決RFID追縱系統55中呼叫訊號15碰撞問題都係採 用分時多工傳輸處理(Tjme Djvisbn Μ_丨e⑽咖，τ〇Μ〜技 • 術’控制各個識別器2败位器3G在不同時間點進行呼叫訊號15 的發送，以減少碰撞的機會。但是此種方式，在識別器2〇/定位器 3〇過多的情況下將會造成—個時間週期内的分時頻率過高，使每 個識別器20/定位器30在同一個時間週期内可發送呼叫訊號15 的時間比例因而變少，造成整體RHD追蹤系統55的次數回報率 降，，導致RRD追縱系統55的可靠性就降低，故無法滿足越來 越高的RFID追蹤系統55可靠性需求。 書 此外“ &成呼叫訊號15碰撞的另一個主因是識別器2〇/定 的30的配置位置不夠精確，任意配置的識別器定位器加 將造成呼叫贱絲_交餘度越高，使賴 20/定:器 30的整體配置不符合經濟效益，浪費許多識別器2〇/定位器3〇 的建置成本費用。 因此’如何能夠提套有效的排程分群鋪，特別是能夠 有效解決在RFID追縱系統55中呼叫訊號15相互碰撞的問題， 並且月匕夠同時有效改善不良的識別器2〇/定位器Μ配置，使阳D 追4系、、先55的整體可靠度提昇並增加日後在識別器2〇/定位器3〇 1300659 配置上的經濟效益，是箭 【發明内容】 月而克服的問題所在。 2以上的問題，本發明在於提供—種應 、、先之啤叫訊號排程分群系統及翌 旧追缺糸 當分群後再配置予不_::=吏:有™ 1_根據圖縣構轉換簡化a '百的功政. 發送時的碰撞情況降低。’使财呼叫闕的呼叫訊號 合經卿結構雜耻結果，使㈣_配㈣夠更加符 3·提高整體RRD追縱系統的可靠性。 统，:括右述目的功效’本發明所揭露之呼叫訊號排程分群系 j包括有.可依照RF丨D追縱系統之控制進行各 ::呼叫點(㈣別器或定位器) 二 :=:器;根據分群排程結果生成排程參數的參： 杈、、且，以及負責進行呼叫點 參數進行運作的同步模組。⑽始化以使各呼叫點依照各排程 =峨肺分啊妓_，包括：先計算所有可發 二所涵蓋之哞叫點訊號範圍引， 所對岸之斗 應頂點V1, V2...Vn，並對各頂點間 =ΓΓ:有交集者__ ▽_對應 :=圖形結構G，E);當圖形結構G中存在 Hi的情况時，刪除所有呼叫點訊號範圍办所The ί 1300659's ability is therefore suitable for longer distance applications. The passive call return mechanism, as shown in "Fig. 3", uses the tag 1 to directly convert the electric wave of the call signal 15 transmitted by the recognizer 20 into electric power to drive the tag to perform the return signal. The transmission of 25 'so this call return mechanism can only be applied at shorter distances. For the basic block diagram of the entire RFID tracking system 55, please refer to the section of Figure 4, in addition to the front-end label 1〇, the identifier 2〇, and the positioner 30, there will be a back-end application. The program 5〇, and the backend server 40 between the front end and the back end, further includes a recognizer control interface for separately controlling the identification and the locator 30 and performing message communication transmission in the backend server 40. And the locator control interface 42 and the processing module 43 for processing the tag 1Q, and finally the application 50 receives the processed information of the tag 10 through the application interface 44 to implement the basic RF 丨D tracking system 55. However, the current RFiD tracking system 55 has a long-standing unresolved problem 'When the tag 10 is in the range of multiple identifiers 2 / locator 3 叫 signal 15 , when the identifier 20 / When the locator 3 sends the call signal ^ at the same time, it will easily cause the problem that the call signals 15 collide with each other. The result of the collision between the calling cities 15 will cause the label 1 to fail to receive the call. 15 'that is, the tag 10 cannot continue to send the report of the reward signal 25, so that the positioning of the tag 10 cannot be completed, and for the operation of the entire coffee tracking system 55, when the call signal 15 touches each other _ the more In severe cases, the reliability of the overall RF7丨D tracking system 55 will be reduced. “Fig. 5” is a schematic diagram of the 1300659 where the call signal π collision occurs in the RFID tracking system 55, as shown in the figure, the tag 10 is located in the identifier. In the intersection of the A2〇/Locator A3〇 and the discriminator B20/Positioner B30 call point signal range, then when • both sides simultaneously send the call signal 15 'label 1 () will be due to the call signal 15 2 , collision The reason for a call signal 15 is also not received, resulting in inability to locate and reduce the reliability of the overall RFID tracking system 55. f knows that the call signal 15 collision problem in the RFID tracking system 55 is based on time-division multiplex transmission processing (Tjme Djvisbn Μ _ 丨 e (10) coffee, τ 〇Μ ~ technology • technology 'control each recognizer 2 stalker 3G in The transmission of the call signal 15 is performed at different time points to reduce the chance of collision. However, in the case where the identifier 2/positioner 3 is too much, the time-sharing frequency in the time period is too high. The proportion of time that each recognizer 20/locator 30 can transmit the call signal 15 during the same time period is thus reduced, resulting in a decrease in the number of times the overall RHD tracking system 55 returns, resulting in the reliability of the RRD tracking system 55. As a result of the reduction, it is unable to meet the increasing reliability requirements of the RFID tracking system 55. In addition, the other main reason for the collision of the call signal 15 is that the position of the identifier 2 is not accurate enough, any configuration The identification of the identifier locator will cause the call to be twisted _ the higher the degree of redundancy, the overall configuration of the Lai 20 / fixed: 30 is not economical, wasting the cost of the construction of many identifiers 2 / Locator 3 〇 So ' How can an effective scheduling grouping be provided, in particular, the problem that the calling signals 15 collide with each other in the RFID tracking system 55 can be effectively solved, and the monthly identification can effectively improve the poor identifier 2/positioner configuration. The overall reliability of Yang D chasing 4 series, first 55 and increasing the economic benefits in the future configuration of the identifier 2〇/locator 3〇1300659 is the problem that the arrow overcomes. The problem of the present invention is to provide a kind of first-hand, first-order beer signal scheduling grouping system and the old chase after the grouping and then configure it to not _::=吏: there is TM 1_ simplified according to the graph county structure conversion a 'Hundred gongs. The collision situation at the time of transmission is reduced. 'The call signal of the financial call is combined with the result of the structure of the sorrow, so that (4) _ match (four) is more consistent. 3. Improve the reliability of the overall RRD tracking system. System, including the purpose of the right purpose of the invention, the call signal scheduling group j disclosed in the present invention includes: according to the control of the RF丨D tracking system:: call point ((four) or locator) 2: =: device; generate parameters for scheduling parameters based on cluster scheduling results杈,, and, and the synchronization module responsible for the operation of the call point parameters. (10) Initialization so that each call point is in accordance with each schedule = 峨 分 ,, including: first calculate all the covers that can be sent 二Called the signal range range, the opposite bank should be the vertex V1, V2...Vn, and between the vertices = ΓΓ: there is an intersection __ ▽ _ corresponding: = graphic structure G, E); when the graphic structure G In the case of Hi, delete all call point signal range offices
J300659 "貝’占VX ’虽圖形結構G存在頂點VI與Vm有相同連接頂 加時’合併頂點VI及Vm成為ν丨，m且對應 哪㈣__w);最後以在圖形 w E(v 丨，vm)連 M m L、曰，㈣日疋不同的群組屬性；及依群組屬性的數量 點，佔Γ量之排程參數，並分別設置到各群組屬性中的對應頂 T謂應之呼叫點可同步初始化錢各排程參數進行運作。 有關本I㈣特彳梢貫作，賊合圖示作最佳實施例詳細說 明如下。 【實施方式】 本發明提ίΒ -種制於無線射頻制(RadjQ F「equency Identification，RFID)追縱系統之呼叫訊號排程分群系統及方法， 基本的瞻追蹤系統55運作如前面對「第1圖」中所描述，在 此不再多作贅述。但首先必須定義的是在本發财所稱的呼叫點 包含前面「第2a圖」、「第2b圖」及「第3圖」中所述可用來發 送呼叫訊號15的識別器2〇或者妓位器加，因此本發明並不侷 限於前端呼叫回報機_絲性或者被動性，在鱗別說明。 請參考「第6圖」與「第5圖」之間的差異，可知本發明與 習知之RFID追蹤系統55的差異主要在於後端伺服器4〇中多增 加了呼叫訊號排程分群系統60的部分，其餘部份均與習知技術相 同，其呼叫訊號排程分群系統60組成包括： (1)排程窃61，為本發明主要核心所在，用以計算在RF丨D追 1300659 縱系統55中所有呼叫點的呼 如「第8cR “ m械15 /函盍範圍，並透過轉換為 如弟8c圖」中圖形結構8〇 化虛97万Μ進仃間化圖形結構80簡 化處理，並跑爾輸彡結獅進彳 以被適當分群具有不同群組屬性。 < 特呼m (2)參數設置模組62，依照排程㈣的分群結果，根據所有 被分群的群組屬性數量來生成對應的排程參數，並分別設J300659 "Bei's account for VX' Although the graph structure G has vertex VI and Vm have the same connection top plus 'merge vertex VI and Vm become ν丨,m and which corresponds to (four)__w); finally in the graph w E(v 丨, Vm) even M m L, 曰, (4) different group attributes of the day; and the number of points according to the group attribute, the scheduling parameters of the quantity, and set to the corresponding top T of each group attribute respectively The call point can be synchronized to initialize the money scheduling parameters to operate. The details of the preferred embodiment of the thief and the thief are described in detail below. [Embodiment] The present invention provides a call signal scheduling grouping system and method for a radio frequency system (RadjQ F "equency identification (RFID) tracking system", and the basic tracking system 55 operates as described above. As described in Fig. 1, it will not be repeated here. But the first thing that must be defined is that the call point referred to in this financial statement contains the identifier 2 or 可 that can be used to send the call signal 15 as described in "2a", "2b" and "3". The bit is added, so the present invention is not limited to the front-end call reporting machine _ silky or passive, as described in the scale. Please refer to the difference between "figure 6" and "figure 5". It can be seen that the difference between the present invention and the conventional RFID tracking system 55 is mainly due to the fact that the call signal scheduling grouping system 60 is further added to the backend server. In part, the rest are the same as the prior art, and the call signal scheduling grouping system 60 comprises: (1) Scheduling 61, which is the main core of the present invention, and is used to calculate the 1300659 vertical system in the RF丨D. All the call points in the call are as follows: "8cR "m-machine 15 / function range, and through the conversion to the same as the 8c picture" in the graphic structure 8 〇 960 960 Μ 仃 仃 图形 图形 图形 图形 图形 简化 简化 简化 简化 简化 简化 简化 简化The lions are sent to the lions to be properly grouped with different group attributes. < special call m (2) parameter setting module 62, according to the grouping result of the scheduling (four), generate corresponding scheduling parameters according to the number of group attributes of all the groups, and respectively set
Wi i R顿屬性帽應頂點的呼叫財，即將排程參數設 置到則述之識別器20或者定位器3〇中。 〃⑶同步模組63,當完成各辦叫點的分群及排程參數設置之 將由朗步模組63統—進行對财呼叫闕行同步初始化， 凡成之後便可使各呼叫點依照各對麟程參細始進行運作。 詳細的方法步驟將配合「第7圖」的流糊及「第⑼圖」、「第 牝圖」、「第8c圖」及「第8d圖」的實施例與作進一步的描述(以 下提到的X，I，m，u，η具有X, |, m，u c {i.』}的關係）： 我們假設實施例在一空間環境中’共設置有呼叫點A〜呼叫點 F 一共六個呼叫點。 … 百先，由排程器61先計算出各呼叫點各自所涵蓋之呼叫點訊 就範圍S1, S2.__Sn(步驟彻），其中每個呼叫點其所對應的呼叫 點《；_ 70可透過呼叫關位置座標再糊其發射功率的大 再利用已知的成號乾圍演算公式加以計算便可得知，若以每 個空間核境中顯示-個呼叫點訊號範圍7Q的方式加以顯示的 洁’其結果將如「第8a圖」中所示，而「第8b圖」則顯示將六 個啤叫點峨範目Μ整合料—空晴賴科的航，由「第 11 1300659 8b圖」中可以發現’有許多呼叫點彼此之間的呼叫點訊號範圍7〇 係屬於重#交_ ’這些絲崎況若是未_有賴排程分群 的話將很容易產生所謂的訊號碰撞問題。The Wi i R attribute cap should be set to the verifier of the vertex, that is, the schedule parameter is set to the identifier 20 or the positioner 3〇 described later. 〃(3) Synchronization module 63, when the grouping and scheduling parameter setting of each calling point is completed, the Lange module 63 system performs synchronous initialization of the financial call, and each call point can be made according to each pair. Lin Chengjian began to operate. The detailed method steps will be further described in conjunction with the "Map 7" and the "(9)", "D", "8c" and "8d" examples (mentioned below) X, I, m, u, η have the relationship of X, |, m, uc {i.』}): We assume that the embodiment has a total of six call points A to call points F in a space environment. Calling point. ... hundred first, the scheduler 61 first calculates the call points covered by each call point in the range S1, S2.__Sn (steps), wherein each call point corresponds to the call point "; _ 70 can By calling the position coordinate and then smearing the transmission power, it can be calculated by using the known number calculation formula, if it is displayed in the space of each space, the location of the call signal range is 7Q. The result of the cleansing will be as shown in Figure 8a, while the image of Figure 8b will show the six beeres as the target of the integration of the aircraft - Air Clear Lai Ke, by "11 1300659 8b" In the figure, it can be found that there are a lot of call points between each other. The call signal range is 7 属于 重 交 这些 这些 这些 这些 这些 这些 这些 这些 这些 这些 这些 这些 这些 这些 这些 这些 这些 这些 这些 这些 这些 这些 这些 这些 这些 这些 这些 这些 这些 这些 这些 这些 这些 这些 这些 。 。 。
因此，當取得所有呼叫點的呼叫點訊號範圍7〇後，排程器 61將轉換各呼叫點騎應継V1, V2...Vn，鱗各継間所對 應之呼叫點訊號範圍有交集者賴形邊E(v丨，Vm)連接對應頂點 二產生圖形結構80，G=(V，E)(步驟11〇)。請參考「第8C圖」的 部分，在實施例中六個呼叫點被轉換為頂點A〜F，而經過對前述 各個呼叫點減賴70的範圍輯運算後，可以躺出各個頂點 之間的連接關係，因此透過圖形邊的連接便形成如「第8 圖形結構G 80。 回」、 完成轉換程序之後，繼續由排程器61進行對圖形結構的本 身的簡化程序，請參考「第8d圖」，整_化程序主要包 兩個部分： 3判斷圖形結構G 80中，是否存在4的 ，=況？（烟·啦，_轉财啊軸絲圍私所對 :之頂點Vx(步驟_。對應到實施例中，可以發現「第8 中呼叫點C被刪除。 有關步驟120及步驟130的部分，可以再參考 ^單示意，假設有頂點⑻、卿)及頂點⑹的呼叫點訊號^ 如所讀存在，顧為頂點_呼叫點峨細7q完全被涵 盍在頂點⑻及頂點⑹的呼叫點訊號範圍7〇的聯集範圍春中，因 此頂點⑼可以被拿掉而不會影響到整體的啤叫訊號15機田制。 l3〇〇659 b.判斷圖形結構G 80中，是否存在頂點v丨與_有相同連 接頂點VU且阶㈣C办的情況？（步驟140)如果有，則合併 了頁點V丨及Vm使其在圖形結構G 8〇上成為頂點v丨，m且對應呼叫 軸虎範圍重新修正為d耐—⑽(步驟彳導對應到 實施例中▼以發現在「第8d圖」中頂點A及頂點D被合併為 •頂點AD。 蠢 ^關步驟140及步驟15〇的部分，可以再參考「第沘圖」 的簡單示μ作又.又有頂點(a)、頂點(b)及頂點⑹的呼叫點訊號範圍 士所示身又存在’則因為頂點⑻及頂點⑹透過圖形邊的連接存 在有頂點⑼的共同連接點，且頂點⑼的呼叫點訊絲圍7〇已經 疋全包含頂點⑻及頂點⑹之呼叫點訊號範圍7〇較集範圍，因 此可以將頂點⑻及頂點⑹進行合併成為頂點㈣。 几成簡化之後，排程器61再進一步以在圖形結構G 8〇中出 現最少群組屬性為指定原則，將仍然藉由圖形邊E(v丨，Vm)所連接 _ 之對應頂點V丨，Vm指定不同的君f組屬性(步驟160)。如「第8d 圖」中所示意’整個簡化後的圖形結構G 8〇將把頂點AD及頂點 F分為一個群組(假設為群組A)，其餘的頂點B及頂點E則被分 為另一個群組(假設為群組B)，總共由原本的圖形結構G 8〇產生 出兩個不同群組屬性的群組A及群組B。 群組屬性’可以是一種顏色屬性，也就是可以透過在圖形結 構G 80上透過填上不同顏色來提供對不同群組的區分，此種應用 通常係為了在視覺上能夠提供直接的辨識而使用，事實上群組屬 13 1300659 性亦可以是一種文數字屬性，也就是在圖形結構G 80中對不同群 組給予不同的定義(相當於參數值)，然後可以直接提供後續的運作 • 模組直接讀取加以識別及處理。 . 產生不同群組屬性的群組後，接著交由參數設置模組62依照 群組屬性的數量來決定並生成對應數量之排程參數，並分別設置 .到各群組屬性中的對應頂點中(也就是設置到實際頂點所對應的 啤叫點中）。基本上參數設置模組62會以一個時間週期作為排程 # 的基礎，然後依照所產生分群的數量來進行自動排程，使每個分 群都能夠有不同的排程參數可以執行呼叫訊號15的發送，最後透 過同步模組63進行同步初始化的程序，使每個頂點所對應之呼叫 點都可以在同步初始化的過程中取得運作上所需的排程參數，然 後可依照各排程參數進行各自的運作(步驟17〇)。 「第10a圖」便是呼叫訊號排程分群系統6〇之參數設置模 組62的運作示意圖，同樣以前述之實施例為例，由於最後係產生 _ 出兩個具有不同群組屬性的群組A及群組B，因此參數設置模組 62會對群組a及群組b進行不同排程參數的設置，即將群組a 排程參數設置給群組A中頂點AD及頂點F所對應的呼叫點a、 呼叫點D及呼叫點F，而將群組B排程參數設置給群組B中頂點 B及頂點E所對應的啤叫點b及呼叫點E，。 值得注意的是，在前面所述的步驟13〇中我們於處理圖形結 構G 80簡化時有將頂點c給刪除，此一步驟所代表的實際意義 對於參數設置模組62來說，是要使這些被删除的頂點所對應的呼 叫點在實際運作上保持休眠狀態，因此當參數設置模組62在對各 14 1300659 * 群組進行排程參數設置的時候，還包含同時設置這些被删除頂點 所對應之呼叫點。如「第10a圖」中所示，參數設置模組62會 • 設置所謂的休眠參數給頂點C所對應的呼叫點C。 • 排程參數基本上會包含有幾個參數：一是用來表示此群組群 別的群組屬性(可以用文數字定義來區分不同的群組)、一是控制呼 • 叫點何時啟動的啟動時間(Start time)、一是控制呼叫點作用時間 長短的作用時間(active time)以及用來控制呼叫點休眠持續時間 參 長短的休眠間隔(sleep interval)。Therefore, when the call point signal range of all the call points is obtained, the scheduler 61 will switch the call points of the call points V1, V2...Vn, and the call point signal range corresponding to each of the scales has an intersection. The edge E (v 丨, Vm) is connected to the corresponding vertex 2 to generate a graphic structure 80, G = (V, E) (step 11 〇). Please refer to the section of "8C". In the embodiment, the six call points are converted into vertices A to F, and after the range of the above-mentioned respective call points minus 70, the vertices can be laid out between the vertices. Since the connection relationship is formed by the connection of the graphics side, the "eighth picture structure G 80. back" is formed, and after the conversion process is completed, the simplified program of the graphic structure itself is continued by the scheduler 61, please refer to "8d picture". The whole _ ization program mainly consists of two parts: 3 Judging whether there is 4 in the graphic structure G 80, = condition? (Smoke, ah, _ turn the money ah axis is privately owned: the vertex Vx (step _. Corresponding to the embodiment, you can find that the 8th call point C is deleted. For the steps 120 and 130, You can refer to the ^ single diagram, assuming that there are vertex (8), qing) and vertex (6) call point signal ^ as read, Gu vertices _ call point 7 fine 7q is completely covered by the vertex (8) and vertex (6) call point signal The range of 7〇 is in the middle of the spring, so the vertex (9) can be removed without affecting the overall beer signal 15 field system. l3〇〇659 b. Judging whether there is a vertex v丨 in the graph structure G 80 _ Is there the same connection vertex VU and the case of the fourth (four) C? (step 140) If there is, the page points V丨 and Vm are merged to become the vertex v丨,m on the graphic structure G 8〇, and the corresponding call axis range Re-corrected to d resistance - (10) (Steps correspond to the example in the ▼ to find that in the "8d picture" vertex A and vertex D are merged into the vertex AD. Stupid ^ off the steps 140 and 15 You can refer to the simple description of the "Drawing Diagram" again. There are also vertices (a), vertices (b) and tops. (6) The call point signal range indicates that there is another 'there is a common connection point of the vertex (9) because the vertex (8) and the vertex (6) are connected through the edge of the figure, and the call point of the vertex (9) is already included. (8) and the vertex (6) call point signal range is 7〇, so the vertex (8) and the vertex (6) can be merged into a vertex (4). After a few simplifications, the scheduler 61 further appears to have the least in the graph structure G 8〇 The group attribute is a specified principle, and the corresponding vertex V丨, Vm, which is still connected by the graph edge E(v丨, Vm), Vm, specifies a different group f attribute (step 160). As shown in the "8d figure" It is indicated that 'the entire simplified graph structure G 8〇 will divide the vertex AD and the vertex F into one group (assumed to be group A), and the remaining vertex B and vertex E are divided into another group (assumed to be a group) Group B), a total of two different group attributes of group A and group B are generated by the original graphic structure G 8〇. The group attribute 'can be a color attribute, that is, can be transmitted through the graphic structure G 80 Provide different pairs by filling in different colors Group distinction, such application is usually used to provide direct identification in the visual sense. In fact, the group genus 13 1300659 can also be a literary attribute, that is, the different groups are given in the graphic structure G 80 Different definitions (equivalent to parameter values) can then directly provide subsequent operations. • Modules are directly read for identification and processing. After generating groups of different group attributes, they are then passed to the parameter setting module 62 according to the group. The number of attributes determines and generates the corresponding number of scheduling parameters, and respectively set to the corresponding vertex in each group attribute (that is, set to the beer point corresponding to the actual vertex). Basic parameter setting module 62 will use a time period as the basis of schedule #, and then automatically schedule according to the number of clusters generated, so that each group can have different scheduling parameters to perform the transmission of call signal 15, and finally through the synchronization mode The group 63 performs the process of synchronous initialization, so that the call points corresponding to each vertex can obtain the row required for operation in the process of synchronous initialization. Parameters, can be Then the respective operation (step 17〇) in accordance with each schedule parameter. "Picture 10a" is a schematic diagram of the operation of the parameter setting module 62 of the call signal scheduling grouping system. The same is taken as an example of the foregoing embodiment, since the last system generates two groups with different group attributes. A and group B, therefore, the parameter setting module 62 sets different scheduling parameters for the group a and the group b, that is, sets the group a scheduling parameter to the vertex AD and the vertex F corresponding to the group A. The call point a, the call point D, and the call point F are set, and the group B scheduling parameter is set to the beer point b and the call point E corresponding to the vertex B and the vertex E in the group B. It is worth noting that in step 13 of the foregoing, we have to delete the vertex c when processing the graphics structure G 80. The actual meaning represented by this step is to enable the parameter setting module 62. The call points corresponding to the deleted vertices remain dormant in actual operation, so when the parameter setting module 62 performs scheduling parameters for each 14 1300659 * group, it also includes setting the deleted vertices at the same time. Corresponding call point. As shown in "Picture 10a", the parameter setting module 62 will set a so-called sleep parameter to the call point C corresponding to the vertex C. • The scheduling parameters basically contain several parameters: one is to represent the group attribute of this group group (you can use the number definition to distinguish different groups), and the other is to control the call. Start time, one is the active time that controls the length of time the call point is active, and the sleep interval used to control the short duration of the call point sleep duration.
繼續以同一實施例加以說明，假設參數設置模組62給群組A 的排程參數依照群組屬性、啟動時間、作用時間及休眠間隔的順 序依序為(A, 0,彳，彳），而群組b為(B, 1,彳，彳），則「第彳此圖」可 以顯不經過參數設置模組62設置及同步模組的同步初始化後，所 有群組中的呼叫點開始運作時所產生的時間序列示意圖。 「第11a圖」及「第11b圖」則為未應用本發明呼叫訊號排 響私分群系統6〇時於同一實施例環境下所產生的圖形結構G⑽以 及時間序騎賴。我們可以發現，應用f知技術所產生的將會 有三個不同的群組，即群組(1)、群組(2)及群組(3)，從時間序列圖 中可以發現每個群組所對應到的呼叫點在同一個時間週期中可以 分得到的__僅有1/3,本發财叫訊號難分群系統 60後則可以使母個群組所對應到的呼叫點在同一時間週期中分 到1/2的作用時間，相對來說有較長的作用時間，這表示應用本 發明之RFID追縱系統55可以有較佳的呼叫訊號回報結果，增加 整體可靠度。 1300659 ▲此外，「第11 a圖」及「第】i b圖」中所有的呼叫點均被維持 不4的保留下來，但是在本發明呼叫訊號排程分群系統的中，我 們建墩可以將頂點C所對應的呼叫點C給拿掉，僅保留下五個呼 叫點’因此就呼叫闕配置上確實也能夠達馳符合經濟效益的 目的功效。 1 軸本發似前述之錄實關揭露如上，财並非用以限 林發明，任何熟習相像㈣者，在不脫縣發明之精神和範圍 ·'，、當可作些許之更動與潤飾，因此本發明之專利保護範圍須視 本說明書所附之申請專利範圍所界定者為準。 【圖式簡單說明】 第1圖係習知無線射頻識別(Rad|〇Frequency丨de_catj〇n RFID)追蹤系統示意圖； ’ 第2a圖及第2b圖係習知主動式RF|D呼叫回報機制示意圖； 第3圖係習知被動sRRD呼叫回報機制示意圖； 馨 第4圖係習知RFID追蹤系統方塊圖； 第5圖係RFID追蹤系統呼叫訊號碰撞示意圖； 第6圖係包含本發明呼叫訊號排程分群系統之r闩d 統方塊圖； 第7圖係本發明呼叫訊號排程分群系統之流程圖； 第8a圖至第叫系應用本發明呼叫訊號排程分群系統之實施 例圖形結構示意圖； 、 第9a圖係第7圖中步驟]2〇及步驟】30之細部說明示意圖; 第兆圖係第7圖中步驟14〇及步驟，5〇之細部說明示娜 16 ί3〇〇659 意圖 第10a圖係本發明和|訊號排程分 群系統之參數設置模組示Continuing with the description of the same embodiment, it is assumed that the scheduling parameters of the parameter setting module 62 for the group A are sequentially (A, 0, 彳, 彳) according to the group attribute, the startup time, the action time, and the sleep interval. If the group b is (B, 1, 彳, 彳), then the "third picture" can be displayed without the parameter setting module 62 setting and the synchronous initialization of the synchronization module, the call points in all groups start to operate. A time series diagram generated at the time. The "Fig. 11a" and "11b" diagrams show the graphical structure G(10) and time-sequence riding in the same embodiment environment when the call signal of the present invention is not applied to the private branching system. We can see that there will be three different groups generated by the application technology, namely group (1), group (2) and group (3), each group can be found from the time series chart. The corresponding call point can be divided into __ only 1/3 in the same time period. After the rich call signal is difficult to be grouped, the call point corresponding to the parent group can be made at the same time. The action time divided into 1/2 in the cycle has a relatively long action time, which means that the RFID tracking system 55 to which the present invention is applied can have better call signal return results and increase overall reliability. 1300659 ▲ In addition, all the call points in "11a" and "pi" are saved as 4, but in the call signal scheduling system of the present invention, we can build a vertice The call point C corresponding to C is removed, and only the next five call points are reserved. Therefore, it is indeed possible to achieve the economical effect of the call on the call configuration. The 1 axis is like the above-mentioned record. The above is the same as the above. The money is not used to limit the invention of the forest. Anyone who is familiar with the similarity (4), in the spirit and scope of the invention of the county, can make some changes and refinements. The patent protection scope of the present invention is defined by the scope of the patent application attached to the specification. [Simple diagram of the diagram] Figure 1 is a schematic diagram of a conventional radio frequency identification (Rad|〇Frequency丨de_catj〇n RFID) tracking system; 'Fig. 2a and 2b are diagrams of a conventional active RF|D call return mechanism Figure 3 is a schematic diagram of a conventional passive sRRD call return mechanism; Xin 4th is a block diagram of a conventional RFID tracking system; Figure 5 is a schematic diagram of an RFID tracking system call signal collision; Figure 6 is a call signal schedule of the present invention Figure 7 is a flow chart of the call signal scheduling grouping system of the present invention; Figure 8a is a schematic diagram showing the structure of an embodiment of the call signal scheduling grouping system of the present invention; Figure 9a is a schematic diagram of the steps in step 7 of Figure 7 and steps 30; the first megagraph is the step 14 and the steps in Figure 7, and the details of the 5 说明 are shown in Fig. 16 ί3〇〇659 intent 10a The figure shows the parameter setting module of the invention and the signal scheduling grouping system
05 10 15 20 25 30 40 41 42 43 44 50 55 60 61 62 弟10b圖係應用本發 時間序列示意圖；及月呼恤虎排知分群系統之實施例運作 a第11a圖及第11b係未應用本發明呼叫訊號排程分群系統之 ，貫施例圖形結構及時間序列示意圖。 【主要元件符號說明】 網路 標籤 呼叫訊號 識別器 回報訊號 定位器 後端伺服器 識別器控制介面 定位器控制介面 處理模組 應用程式介面 應用程式 無線射頻識別追縱系統 呼叫訊號排程分群系統 排程器 參數設置模組 17 Ϊ300659 63 7〇 75 80 同步模組 呼叫點訊號範圍 整體啤叫訊號涵蓋範圍 圖形結構 S2...sn 丨算所有呼叫點各自涵蓋之呼叫點訊號範圍S1, 有各:::=v1’v2 …v__ 產生圖形結構G=(V E) _ E(VI，_連麟應頂點以 乂驟120圖形結構中存在&^1(^2··办—i ?05 10 15 20 25 30 40 41 42 43 44 50 55 60 61 62 The brother 10b is a schematic diagram of the application of the time series; and the operation of the embodiment of the monthly greeting system is a11a and 11b are not applied. The call signal scheduling grouping system of the present invention has a graphical structure and a time series diagram. [Main component symbol description] Network tag call signal recognizer report signal locator back-end server recognizer control interface locator control interface processing module application interface application radio frequency identification tracking system call signal scheduling group system Program parameter setting module 17 Ϊ300659 63 7〇75 80 Synchronous module call point signal range Overall beer call signal coverage range Graphic structure S2...sn Calculate the call point signal range S1 covered by all call points, each: ::=v1'v2 ...v__ Generate a graph structure G=(VE) _ E(VI, _Lian Lin should be the vertices in the step 120 graph structure exists & ^1 (^2··do-i?
=驟130刪除所有呼叫點訊號範圍SX所對應之頂點VX 且=)41縣構中存在頂點νι與vm有相同連接她 二：(::：:為 Vl’m 且_，範 步驟160以_結構中出現最少群組屬性 邊E(V丨，_連接之對應頂點V丨，Vm指定不同的敎屬^有圖形 步驟仍依群組屬性的數量生成對應數量之排程 別設置到各群組雜中的對應_依照各排程參數進行所=Step 130 deletes the vertex VX corresponding to all call point signal range SX and =) 41 There is a vertex in the county structure νι has the same connection with vm. Her two: (:::: is Vl'm and _, van step 160 to _ The minimum group attribute edge E appears in the structure (V丨, the corresponding vertex V丨 of the _ connection, Vm specifies a different ^ ^ ^ There are graphic steps still generate the corresponding number of schedules according to the number of group attributes set to each group The correspondence in the miscellaneous _ according to each scheduling parameter