本發明是為了克服上述缺點或其它缺點而完成的，所採用的技術方案如下。 本發明的一個方面提供一種換電等待時間確定系統，包括： 排隊順序確定單元，其被配置成針對需要換電的車輛使用者確定排序號(x)；以及 換電等待時間計算單元，其被配置成基於由所述排隊順序確定單元確定的排序號(x)來計算相應的換電等待時間(tx
)。 進一步地，在根據本發明的一個方面的換電等待時間確定系統中，還包括： 充換電功率比較單元，其被配置成將對儲能單元充電的最大可利用功率(Pcmax
)與最大換電輸出功率(Psmax
)進行比較， 其中，所述最大換電輸出功率(Psmax
)由下式(1)表示：… (1) 其中，Psmax
為所述最大換電輸出功率，Wp
為新更換的滿電儲能單元的電量，tc
為一次換電操作的時間長度， 其中，所述換電等待時間計算單元根據由所述充換電功率比較單元得到的功率比較結果來計算相應的換電等待時間(tx
)。 進一步地，在根據本發明的一個方面的換電等待時間確定系統中，還包括： 排序號比較單元，其被配置成對由所述排隊順序確定單元確定的排序號(x)與閾值排序號(n)進行數值比較。 進一步地，在根據本發明的一個方面的換電等待時間確定系統中， 在所述對儲能單元充電的最大可利用功率(Pcmax
)大於等於所述最大換電輸出功率(Psmax
)的情況下，所述換電等待時間計算單元按照下式(2)來計算所述換電等待時間(tx
)：… (2) 其中，tx
為所述換電等待時間，x為所述排序號， 在所述對儲能單元充電的最大可利用功率(Pcmax
)小於所述最大換電輸出功率(Psmax
)的情況下，所述換電等待時間計算單元根據由所述排序號比較單元得到的排序號比較結果來計算相應的換電等待時間(tx
)。 進一步地，在根據本發明的一個方面的換電等待時間確定系統中， 在所述排序號(x)小於等於所述閾值排序號(n)的情況下，所述換電等待時間計算單元按照下式(3)來計算所述換電等待時間(tx
)：… (3) 在所述排序號(x)大於所述閾值排序號(n)的情況下，所述換電等待時間計算單元按照下式(4)來計算換電等待時間(tx
)：… (4) 其中，n為所述閾值排序號，tb
為比所述一次換電操作的時間長度更長的時間間隔並且由下式(5)確定：… (5) 其中，Pcmax
為對儲能單元充電的最大可利用功率。 進一步地，在根據本發明的一個方面的換電等待時間確定系統中，所述閾值排序號(n)是最後一個在一次換電操作的時間長度內能被供應滿電儲能單元的車輛使用者的排序號。 本發明的另一方面提供一種換電站，包括： 根據本發明的一個方面的換電等待時間確定系統； 換電申請接收單元，其被配置成接收來自至少一個車輛用戶的換電申請並將其輸出至所述換電等待時間確定系統；以及 換電等待時間發送單元，其被配置成將由所述換電等待時間確定系統確定的換電等待時間發送至所述至少一個車輛用戶。 本發明的又一方面提供一種換電系統，其特徵在於，包括： 至少一個根據本發明的另一方面的的換電站；以及 至少一個移動終端，其包括： 換電申請發送單元，其被配置成將車輛使用者的換電申請發送至所述至少一個換電站； 換電等待時間接收單元，其被配置成從所述至少一個換電站接收相應的換電等待時間資訊；以及 換電等待時間顯示單元，其被配置成向所述車輛使用者顯示與所述換電等待時間資訊對應的換電等待時間。 本發明的再一方面提供一種換電等待時間確定方法，其特徵在於，包括： 排隊順序確定步驟，針對需要換電的車輛使用者確定排序號(x)；以及 換電等待時間計算步驟，基於由所述排隊順序確定步驟確定的排序號(x)來計算相應的換電等待時間(tx
)。 進一步地，在根據本發明的再一方面的換電等待時間確定方法中，還包括： 充換電功率比較步驟，將對儲能單元充電的最大可利用功率(Pcmax
)與最大換電輸出功率(Psmax
)進行比較， 其中，所述最大換電輸出功率(Psmax
)由下式(6)表示：… (6) 其中，Psmax
為所述最大換電輸出功率，Wp
為新更換的滿電儲能單元的電量，tc
為一次換電操作的時間長度， 其中，在所述換電等待時間計算步驟中，根據由所述充換電功率比較步驟得到的功率比較結果來計算相應的換電等待時間(tx
)。 進一步地，在根據本發明的再一方面的換電等待時間確定方法中，還包括： 排序號比較步驟，對由所述排隊順序確定步驟確定的排序號(x)與閾值排序號(n)進行數值比較。 進一步地，在根據本發明的再一方面的換電等待時間確定方法中， 在所述對儲能單元充電的最大可利用功率(Pcmax
)大於等於所述最大換電輸出功率(Psmax
)的情況下，在所述換電等待時間計算步驟中，按照下式(7)來計算所述換電等待時間(tx
)：… (7) 其中，tx
為所述換電等待時間，x為所述排序號， 在所述對儲能單元充電的最大可利用功率(Pcmax
)小於所述最大換電輸出功率(Psmax
)的情況下，在所述換電等待時間計算步驟中，根據由所述排序號比較步驟得到的排序號比較結果來計算相應的換電等待時間(tx
)。 進一步地，在根據本發明的再一方面的換電等待時間確定方法中， 在所述排序號(x)小於等於所述閾值排序號(n)的情況下，在所述換電等待時間計算步驟中，按照下式(8)來計算所述換電等待時間(tx
)：… (8) 在所述排序號(x)大於所述閾值排序號(n)的情況下，在所述換電等待時間計算步驟中，按照下式(9)來計算換電等待時間(tx
)：… (9) 其中，n為所述閾值排序號，tb
為比所述一次換電操作的時間長度更長的時間間隔並且由下式(10)確定：… (10) 其中，Pcmax
為對儲能單元充電的最大可利用功率。 進一步地，在根據本發明的再一方面的換電等待時間確定方法中，所述閾值排序號(n)是最後一個在一次換電操作的時間長度內能被供應滿電儲能單元的車輛使用者的排序號。 本發明提供一種記錄介質，其特徵在於，在其中存儲有用於使電腦執行根據本發明的再一方面的換電等待時間確定方法的程式。 相對於現有技術，本發明的有益效果如下： 1)為用戶提供排隊時間，讓用戶有一個心理預期，當用戶知道了排隊時間，用戶可以選擇其它的能源方案，例如直流快充或交流慢充； 2)讓使用者提前知道目標換電站的繁忙程度，當所有的換電站都有排序號之後，站與站之間的繁忙程度一目了然，這樣可以為潛在用戶推薦換電地點，為用戶節省時間，從而提高用戶體驗效果； 3)很容易知道用戶充電難易程度，可以知道換電站所在的區域內換電供需是否平衡，為進一步規劃換電服務提供真實的資料參考； 4)附近換電站的繁忙程度推送到用戶，這樣使用者通過手機等終端就可以知道附近換電站的繁忙情況，使用者可以自主選擇較空閒的換電站去換電池，這樣有利於換電站調度，自動平衡了換電站的換電負荷，此外，有利於使各個換電站的繁忙程度均衡，從而使各個換電站的運營均達到價值最大化，同時可以提高用戶的體驗。The present invention is completed in order to overcome the above shortcomings or other shortcomings, and the technical solutions adopted are as follows. An aspect of the present invention provides a battery replacement waiting time determination system, including: a queuing sequence determining unit configured to determine a ranking number (x) for a vehicle user who needs to switch; and a battery replacement waiting time calculation unit, which is configured to It is configured to calculate the corresponding power exchange waiting time (t x ) based on the sort number (x) determined by the queuing order determining unit. Further, in the system for determining the waiting time for battery exchange according to one aspect of the present invention, it further includes: a charging and changing power comparing unit configured to compare the maximum available power (P cmax ) for charging the energy storage unit with the maximum exchange The electrical output power (P smax ) is compared, where the maximum switching output power (P smax ) is represented by the following formula (1): … (1) where P smax is the maximum power exchange output power, W p is the power of the newly replaced fully charged energy storage unit, and t c is the length of time for one power exchange operation, where the power exchange waiting time The calculation unit calculates the corresponding power-swap waiting time (t x ) according to the power comparison result obtained by the power-swap power comparison unit. Further, in the system for determining the waiting time for power exchange according to one aspect of the present invention, it further includes: a sorting number comparing unit configured to compare the sorting number (x) determined by the queuing order determining unit with the threshold sorting number (n) Perform numerical comparison. Further, in the system for determining the waiting time for power exchange according to one aspect of the present invention, the maximum available power (P cmax ) for charging the energy storage unit is greater than or equal to the maximum power exchange output power (P smax ) In this case, the power replacement waiting time calculation unit calculates the power replacement waiting time (t x ) according to the following formula (2): … (2) where t x is the waiting time for the battery swapping, x is the ranking number, and the maximum available power for charging the energy storage unit (P cmax ) is less than the maximum battery swapping output power (P smax ), the power replacement waiting time calculation unit calculates the corresponding power replacement waiting time (t x ) according to the ranking number comparison result obtained by the ranking number comparison unit. Further, in the system for determining the waiting time for power exchange according to one aspect of the present invention, in a case where the ranking number (x) is less than or equal to the threshold ranking number (n), the power changing waiting time calculation unit is in accordance with The following formula (3) is used to calculate the waiting time (t x ) for the power exchange: ... (3) In the case that the sorting number (x) is greater than the threshold sorting number (n), the power-swap waiting time calculation unit calculates the power-swapping waiting time (t x ) according to the following formula (4): … (4) where n is the threshold ranking number, and t b is a time interval longer than the time length of the one-time switching operation and is determined by the following formula (5): … (5) Among them, P cmax is the maximum available power for charging the energy storage unit. Further, in the system for determining the waiting time for a battery exchange according to one aspect of the present invention, the threshold ranking number (n) is the last one that can be used by a vehicle that can supply a fully charged energy storage unit within the time length of a battery exchange operation. The sort number of the person. Another aspect of the present invention provides a power swap station, including: a power swap waiting time determination system according to an aspect of the present invention; a power swap request receiving unit configured to receive a power swap request from at least one vehicle user, and Output to the power swap waiting time determination system; and a power swap waiting time sending unit configured to send the power swap waiting time determined by the power swap waiting time determination system to the at least one vehicle user. Another aspect of the present invention provides a battery swap system, which is characterized by comprising: at least one swap station according to another aspect of the present invention; and at least one mobile terminal, which includes: a battery swap request sending unit, which is configured To send a battery swap application of a vehicle user to the at least one battery swapping station; a battery swap waiting time receiving unit configured to receive corresponding battery swap waiting time information from the at least one battery swap station; and a battery swap waiting time The display unit is configured to display the battery replacement waiting time corresponding to the battery replacement waiting time information to the vehicle user. Another aspect of the present invention provides a method for determining the waiting time for battery replacement, which is characterized in that it includes: a queuing sequence determining step, determining a ranking number (x) for vehicle users who need to change a battery; and a calculating step for the waiting time for battery replacement, based on The sequence number (x) determined by the queuing sequence determination step is used to calculate the corresponding power exchange waiting time (t x ). Further, in the method for determining the waiting time for a battery exchange according to still another aspect of the present invention, it further includes: a step of comparing the charging and changing power, which compares the maximum available power (P cmax ) for charging the energy storage unit with the maximum output power of the battery exchange (P smax ) for comparison, where the maximum switching output power (P smax ) is represented by the following formula (6): … (6) where P smax is the maximum power exchange output power, W p is the power of the newly replaced fully charged energy storage unit, and t c is the length of time for one power exchange operation, where, in the power exchange waiting In the time calculation step, the corresponding power replacement waiting time (t x ) is calculated according to the power comparison result obtained in the charging and switching power comparison step. Further, in the method for determining the waiting time for power exchange according to still another aspect of the present invention, it further includes: a sequence number comparison step, which compares the sequence number (x) determined by the queuing sequence determination step with the threshold sequence number (n) Perform numerical comparisons. Further, in the method for determining the waiting time for power exchange according to another aspect of the present invention, the maximum available power (P cmax ) for charging the energy storage unit is greater than or equal to the maximum power exchange output power (P smax ) In the case of the power replacement waiting time calculation step, the power replacement waiting time (t x ) is calculated according to the following formula (7): … (7) where t x is the waiting time for the battery exchange, x is the sequence number, and the maximum available power for charging the energy storage unit (P cmax ) is less than the maximum output power (P In the case of smax ), in the power swap waiting time calculation step, the corresponding power swap waiting time (t x ) is calculated according to the ranking number comparison result obtained in the ranking number comparison step. Further, in the method for determining the waiting time for power exchange according to still another aspect of the present invention, in the case where the ranking number (x) is less than or equal to the threshold ranking number (n), the waiting time for power exchange is calculated In the step, calculate the waiting time (t x ) for power exchange according to the following formula (8): … (8) In the case that the sorting number (x) is greater than the threshold sorting number (n), in the power-changing waiting time calculation step, the power-changing waiting time (t) is calculated according to the following formula (9) x ): ... (9) where n is the threshold ranking number, and t b is a time interval longer than the time length of the one-time power-swap operation and is determined by the following formula (10): … (10) Among them, P cmax is the maximum available power for charging the energy storage unit. Further, in the method for determining the waiting time for a battery exchange according to still another aspect of the present invention, the threshold ranking number (n) is the last vehicle that can be supplied with a fully charged energy storage unit within the time length of a battery exchange operation. The user's sort number. The present invention provides a recording medium characterized by storing therein a program for causing a computer to execute the method for determining a battery replacement waiting time according to still another aspect of the present invention. Compared with the prior art, the beneficial effects of the present invention are as follows: 1) Provide users with queuing time, so that users have a psychological expectation. When the user knows the queuing time, the user can choose other energy solutions, such as DC fast charging or AC slow charging 2) Let the user know the busyness of the target swap station in advance. When all the swap stations have a sequence number, the busyness between stations is clear at a glance. This can recommend swap locations for potential users and save time for users , So as to improve the user experience; 3) It is easy to know how easy it is for users to charge, and you can know whether the supply and demand of power exchange in the area where the power exchange station is balanced, and provide real reference for further planning of the power exchange service; 4) The busy power exchange station nearby The degree is pushed to the user, so that the user can know the busy situation of the nearby swap station through the mobile phone and other terminals, and the user can choose a relatively idle swap station to change the battery, which is conducive to the swap station scheduling and automatically balances the swap station. The electrical load, in addition, is beneficial to balance the busyness of each switching station, thereby maximizing the value of the operation of each switching station, and at the same time improving the user experience.
以下將結合附圖對本發明涉及的換電等待時間確定系統及方法、換電站、換電系統以及記錄介質作進一步的詳細描述。需要注意的是，以下的具體實施方式是示例性而非限制的，其旨在提供對本發明的基本瞭解，並不旨在確認本發明的關鍵或決定性的要素或限定所要保護的範圍。 圖1是根據本發明的一個實施方式的換電系統100的示意圖。在該示意圖中，標記為#1的實線圓圈所包圍的區域表示換電站#1的內部區域，虛線圓圈所包圍的區域表示以換電站#1為中心、半徑為某一距離(在本實施方式中，例如，設為5公里)的區域，而虛線圓圈以外的區域為距換電站#1超過例如5公里的區域，此外，標記為C1～C6的三角形分別表示6個車輛用戶，其中，C1、C2為到達換電站的車輛用戶，C3、C4為距換電站5公里以內的車輛用戶，C5、C6為距換電站5公里以外的車輛用戶。這些車輛用戶C1～C6均具備向換電站申請換電的能力，但是，根據實際情況，在某個時間段內僅部分車輛使用者向換電站發出了換電申請而其餘車輛用戶暫時未向換電站發出換電申請。此外，雖然在圖1中針對1個換電站示出了6個車輛用戶，但是本領域技術人員應當意識到，換電系統100的結構不限於此，針對1個換電站可以有1個車輛用戶、也可以有多個車輛用戶。 圖1中所示出的這6個車輛用戶C1～C6在需要進行換電時均通過各自的移動終端來與換電站#1進行交互。以下，將參照圖2和圖3來說明各移動終端和換電站#1的結構。 圖2是圖1中所示出的車輛用戶C1～C6所使用的移動終端的示意框圖，圖3是圖1中所示出的換電站#1的示意框圖。 如圖2所示，各移動終端均包括：換電申請發送單元T10、換電等待時間接收單元T20、以及換電等待時間顯示單元T30。 移動終端的換電申請發送單元T10被配置成將相應的車輛用戶的換電申請發送至換電站#1。其中，所述換電申請可以包括但不限於車輛使用者的使用者資訊、車輛資訊。 換電等待時間接收單元T20被配置成從換電站#1接收換電等待時間資訊。其中，所述換電等待時間資訊是換電站#1回應於上述相應的車輛用戶的換電申請而針對該車輛用戶確定出的與換電等待時間相關的資訊。 換電等待時間顯示單元T30被配置成向上述相應的車輛使用者顯示與所接收的換電等待時間資訊對應的換電等待時間。該換電等待時間顯示單元T30可以是能夠向使用者顯示視覺介面的任何類型的顯示單元，例如可以使用任何類型的發光二極體(LED)、有機LED(OLED)、陰極射線管(CRT)、液晶顯示器(LCD)、等離子體、電致發光(EL)、電潤濕、MEMS或其它顯示技術來實現。 相應地，如圖3所示，換電站#1包括：換電申請接收單元E10、換電等待時間確定系統E20、以及換電等待時間發送單元E30。 換電申請接收單元E10被配置成接收來自車輛使用者C1～C6中的至少一個的換電申請並將其輸出至換電等待時間確定系統E20。 換電等待時間確定系統E20被配置成計算提交換電申請的車輛用戶的換電等待時間。具體細節將在後面進行敘述。 換電等待時間發送單元E30被配置成將由換電等待時間確定系統E20確定的換電等待時間發送至所述提交換電申請的車輛用戶。 接下來，將參照圖4來具體說明圖3中所示出的換電等待時間確定系統E20的具體結構。 圖4是圖3中所示出的換電等待時間確定系統E20的示意框圖。如圖4所示，換電等待時間確定系統E20包括排隊順序確定單元E201和換電等待時間計算單元E202。 排隊順序確定單元E201被配置成針對需要換電的車輛使用者確定排序號(x)。 在本示例中，對於到達換電站的車輛而言，如果需要進行換電則參與排隊，並且，先進入換電站道閘的車輛排在前面，相應地，被分配的排序號小於後進入換電站道閘的車輛。對於未到達換電站的車輛而言，根據預計到達換電站所需要的時間來進行排序，所需時間短的用戶排在前面，排序號小於預計到達所需時間較長的用戶。在本示例中，將在距換電站例如5公里以內且已經申請換電的用戶排在已經到達換電站的用戶後面，換言之，在距換電站例如5公里以內且已經申請換電的用戶的排序號大於已經到達換電站的用戶的排序號，相應地，將在距換電站例如5公里以外且已經申請換電的用戶排在距換電站例如5公里以內且已經申請換電的用戶後面，換言之，在距換電站例如5公里以外且已經申請換電的用戶的排序號大於在距換電站例如5公里以內且已經申請換電的用戶的排序號。另外，對於在距換電站例如5公里以內且沒有申請換電的用戶而言，其將被排在距換電站例如5公里以外且已經申請換電的用戶後面，換言之，在距換電站例如5公里以內且沒有申請換電的用戶的排序號將大於在距換電站例如5公里以外且已經申請換電的用戶的排序號。例如，當用戶活動在距換電站例如5公里內且用戶車輛的SOC低於例如30%時，這些用戶將被視為潛在換電用戶，這些用戶可能申請換電，也可能不申請換電。假設該類用戶的總數量為up
，申請換電的概率為α(該值可根據換電站運營歷史資料來進行調整)，由此，估算出在距換電站例如5公里以內沒申請換電但未來可能申請換電的用戶的總數量為r=up
×α，並且，假設這r個用戶中距離換電站最遠的那個用戶到達換電站所花費的時間為tr
。當存在一個活動在距換電站例如5公里以外且已經申請換電的用戶s(假設其到達換電站所花費的時間為ts
並且對應的排序號為qs
)時，tr
＜ts
並且這r個用戶的排序號處於(qs
，qs
+r)的區間。再有，對於在距換電站例如5公里以外且沒有申請換電的用戶而言，將不參與排序。 以圖1中的車輛用戶C1～C6為例，如上所述，C1、C2為到達換電站的車輛用戶，C3、C4為在距換電站5公里以內的車輛用戶，C5、C6為在距換電站5公里以外的車輛用戶，假設C3和C5已經向換電站#1申請換電而C4和C6沒有申請換電。當排隊順序確定單元E201對這6個用戶確定排序號時，由於C2比C1更早到達換電站，因此，C2的排序號為1號，C1的排序號為2號，接下來3號為C3，4號為C5，5號為C4，另外，由於C6處於5公里外且沒有申請換電，因此，不對其確定排序號。 換電等待時間計算單元E202被配置成基於由排隊順序確定單元E201確定的排序號來計算相應的換電等待時間。 優選地，換電等待時間確定系統E20可以還包括充換電功率比較單元E203。該充換電功率比較單元E203被配置成將對儲能單元充電的最大可利用功率Pcmax
與最大換電輸出功率Psmax
進行比較，換電等待時間計算單元E202根據由充換電功率比較單元E203得到的功率比較結果來計算相應的換電等待時間tx
。其中，上述對儲能單元充電的最大可利用功率Pcmax
是指換電站對儲能單元進行充電的最大充電功率，其受到換電站供電容量、充電機最大輸出能力等因素限制，而上述最大換電輸出功率Psmax
是由下式(1)表示：… (1) 其中，Wp
為新更換(即，被換上車)的滿電儲能單元的電量(即，在直流快充條件下允許的充電容量)，而且，從長期的統計效果來看，每次被換上車的儲能單元的電量相等，tc
為一次換電操作的時間長度並且其值通常由換電站自身的系統決定，對於同一套系統而言，tc
為定值。需要注意的是，一次換電操作是指車輛開始換電到換電完成(即，下一輛車可以開始換電)的過程。 在上述對儲能單元充電的最大可利用功率Pcmax
大於等於上述最大換電輸出功率Psmax
的情況下，換電等待時間計算單元E202按照下式(2)來計算換電等待時間tx
：… (2) 其中，x為由排隊順序確定單元E201確定的排序號。換言之，在換電站的最大可用充電總功率大於等於最大換電輸出功率的情況下，換電等待時間只需要通過將一次換電操作的時間長度與車輛用戶的排序號相乘即可算出。 另一方面，在上述對儲能單元充電的最大可利用功率Pcmax
小於上述最大換電輸出功率Psmax
的情況下，優選地，換電等待時間確定系統E20可以還包括排序號比較單元E204。該排序號比較單元E204被配置成對由排隊順序確定單元E201確定的排序號x與閾值排序號n進行數值比較，換電等待時間計算單元E202根據由排序號比較單元E204得到的排序號比較結果來計算相應的換電等待時間tx
。這是因為，當充電速度不能滿足換電輸出速度時，必然有使用者需要等待比一次換電操作的時間長度更長的時間。假設輪到第n個用戶時換電站中僅有一個滿電儲能單元，由於充電功率有限，在第n個用戶換電期間沒有儲能單元可以被充滿電，那麼第n+1個用戶在第n個用戶完成換電後由於沒有可用儲能單元而只能等待更長時間，直到電量最多的一個儲能單元被充滿電。因此，第n個用戶為最後一個在一次換電操作的時間長度內能被供應滿電儲能單元的車輛使用者。假設在換電站中原來有m個儲能單元為滿電狀態，那麼根據電量相等原理可以得到以下等式：… (3)， 在該等式中，第一項表示換電站中原有m個儲能單元的總電量，第二項表示預計到第n個用戶換電完成的這段時間內換電站給儲能單元充電的總電量，第三項表示到第n個用戶換電完成時被換上車的n個儲能單元的總電量，此外，由於在該等式中，只有n為未知量，因此，可得到n：… (4)。 對上述式(4)中的n取整數，在由排隊順序確定單元E201確定的排序號x小於等於閾值排序號n的情況下，換電等待時間計算單元E202按照下式(5)來計算換電等待時間tx
：… (5)， 另一方面，在所述排序號x大於所述閾值排序號n的情況下，這意味著對於第n+1個用戶至第x個使用者而言均需要等待比一次換電操作的時間長度tc
更長的時間(設為下面的tb
)，此時，換電等待時間計算單元E202按照下式(6)來計算換電等待時間tx
：… (6) 其中，tb
由下式(7)確定：… (7)。 由此，換電等待時間確定系統E20可以針對需要換電的車輛使用者確定排序號、進而確定換電等待時間。 此外，需要注意的是，雖然在圖1所示的換電系統100中僅示出了1個換電站，但是，根據本發明的換電系統的結構不限於此，也可以包括多個換電站。在圖5中示出了根據本發明的另一實施方式的換電系統200的示意圖。如圖5所示，標記為#1的實線圓圈所包圍的區域表示換電站#1的內部區域，標記為#2的實線圓圈所包圍的區域表示換電站#2的內部區域，包含換電站#1的虛線圓圈所包圍的區域表示以換電站#1為中心、半徑為某一距離(在本實施方式中，例如，設為5公里)的區域，而包含換電站#1的虛線圓圈以外的區域為距換電站#1例如超過5公里的區域，同樣地，包含換電站#2的虛線圓圈所包圍的區域表示以換電站#2為中心、半徑為某一距離(在本實施方式中，例如，設為5公里)的區域，而包含換電站#2的虛線圓圈以外的區域為距換電站#2超過例如5公里的區域。此外，標記為C1～C9的三角形分別表示9個車輛用戶。在圖5所例示的場景下，9個車輛用戶C1～C9中的需要進行換電的使用者通過移動終端將其換電申請分別發送至換電站#1和換電站#2，而且，從換電站#1和換電站#2分別接收換電等待時間資訊並顯示所對應的換電等待時間。由此，車輛用戶可以自主地選擇較空閒的換電站進行換電，這樣有利於換電站調度，自動平衡了換電站的換電負荷，此外，有利於使各個換電站的繁忙程度均衡，從而使各個換電站的運營均達到價值最大化，同時可以提高用戶體驗。 接下來，將參照圖6來說明圖4中所示出的換電等待時間確定系統E20中的換電等待時間確定方法S100。 如圖6所示，換電等待時間確定方法S100包括：排隊順序確定步驟S101和換電等待時間計算步驟S102。其中，在步驟S101中，排隊順序確定單元E201針對需要換電的車輛使用者確定排序號x，接著，在換電等待時間計算步驟S102中，換電等待時間計算單元E202基於由所述排隊順序確定步驟S101確定的排序號x來計算相應的換電等待時間tx
。 優選地，換電等待時間確定方法S100還包括充換電功率比較步驟，在該步驟中，充換電功率比較單元E203將對儲能單元充電的最大可利用功率Pcmax
與最大換電輸出功率Psmax
進行比較，換電等待時間計算單元E202根據由所述充換電功率比較步驟得到的功率比較結果來計算相應的換電等待時間tx
。其中，上述對儲能單元充電的最大可利用功率Pcmax
是指換電站對儲能單元進行充電的最大充電功率，其受到換電站供電容量、充電機最大輸出能力等因素限制，而上述最大換電輸出功率Psmax
是由下式(8)表示：… (8) 其中，Wp
為新更換(即，被換上車)的滿電儲能單元的電量(即，在直流快充條件下允許的充電容量)，而且，從長期的統計效果來看，每次被換上車的儲能單元的電量相等，tc
為一次換電操作的時間長度並且其值通常由換電站自身的系統決定，對於同一套系統而言，tc
為定值。需要注意的是，一次換電操作是指車輛開始換電到換電完成(即，下一輛車可以開始換電)的過程。 在上述對儲能單元充電的最大可利用功率Pcmax
大於等於上述最大換電輸出功率Psmax
的情況下，在換電等待時間計算步驟S102中換電等待時間計算單元E202按照下式(9)來計算換電等待時間tx
：… (9) 其中，x為由所述排隊順序確定步驟S101確定的排序號。換言之，在換電站的最大可用充電總功率大於等於最大換電輸出功率的情況下，換電等待時間只需要通過將一次換電操作的時間長度與車輛用戶的排序號相乘即可算出。 另一方面，在上述對儲能單元充電的最大可利用功率Pcmax
小於上述最大換電輸出功率Psmax
的情況下，優選地，換電等待時間確定方法S100還包括排序號比較步驟，在該步驟中，排序號比較單元E204對由所述排隊順序確定步驟S101確定的排序號x與閾值排序號n進行數值比較，在換電等待時間計算步驟S102中根據由所述排序號比較步驟得到的排序號比較結果來計算相應的換電等待時間tx
。這是因為，當充電速度不能滿足換電輸出速度時，必然有使用者需要等待比一次換電操作的時間長度更長的時間。假設輪到第n個用戶時換電站中僅有一個滿電儲能單元，由於充電功率有限，在第n個用戶換電期間沒有儲能單元可以被充滿電，那麼第n+1個用戶在第n個用戶完成換電後由於沒有可用儲能單元而只能等待更長時間，直到電量最多的一個儲能單元被充滿電。因此，第n個用戶為最後一個在一次換電操作的時間長度內能被供應滿電儲能單元的車輛使用者。假設在換電站中原來有m個儲能單元為滿電狀態，那麼根據電量相等原理可以得到以下等式：… (10)， 在該等式中，第一項表示換電站中原有m個儲能單元的總電量，第二項表示預計到第n個用戶換電完成的這段時間內換電站給儲能單元充電的總電量，第三項表示到第n個用戶換電完成時被換上車的n個儲能單元的總電量，此外，由於在該等式中，只有n為未知量，因此，可得到n：… (11)。 對上述式(11)中的n取整數，在由排隊順序確定步驟S101確定的排序號x小於等於閾值排序號n的情況下，在換電等待時間計算步驟S102中，按照下式(12)來計算換電等待時間tx
：… (12)， 另一方面，在所述排序號x大於所述閾值排序號n的情況下，這意味著對於第n+1個用戶至第x個使用者而言均需要等待比一次換電操作的時間長度tc
更長的時間(設為下面的tb
)，此時，在換電等待時間計算步驟S102中，按照下式(13)來計算換電等待時間tx
：… (13) 其中，tb
由下式(14)確定：… (14)。 由此，換電等待時間確定方法S100可以針對需要換電的車輛使用者確定排序號、進而確定換電等待時間。 雖然在此之前以換電等待時間確定系統及方法、換電站、換電系統的實施方式為中心進行了說明，但是本發明不限定於這些實施方式，也可以將本發明實施為以下方式：用於執行上述換電等待時間確定方法的電腦程式的方式或者用於實現上述換電等待時間確定系統的功能的電腦程式的方式或者記錄有該電腦程式的電腦可讀取的記錄介質的方式。 在此，作為記錄介質，能採用盤類(例如，磁片、光碟等)、卡類(例如，存儲卡、光卡等)、半導體記憶體類(例如，ROM、非易失性記憶體等)、帶類(例如，磁帶、盒式磁帶等)等各種方式的記錄介質。 通過在這些記錄介質中記錄使電腦執行上述實施方式中的換電等待時間確定方法的電腦程式或使電腦實現上述實施方式中的換電等待時間確定系統的功能的電腦程式並使其流通，從而能使成本的低廉化以及可攜帶性、通用性提高。 而且，在電腦上裝載上述記錄介質，由電腦讀出在記錄介質中記錄的電腦程式並儲存在記憶體中，電腦所具備的處理器(CPU：Central Processing Unit(中央處理單元)、MPU：Micro Processing Unit(微處理單元))從記憶體讀出該電腦程式並執行，由此，能執行上述實施方式中的運動物體的位置確定方法並能實現上述實施方式中的運動物體的位置確定系統的功能。 本領域普通技術人員應當瞭解，本發明不限定於上述的實施方式，本發明可以在不偏離其主旨與範圍內以許多其它的形式實施。因此，所展示的示例與實施方式被視為示意性的而非限制性的，在不脫離如所附各權利要求所定義的本發明精神及範圍的情況下，本發明可能涵蓋各種的修改與替換。The system and method for determining the waiting time for power exchange, the power exchange station, the power exchange system, and the recording medium involved in the present invention will be described in further detail below in conjunction with the accompanying drawings. It should be noted that the following specific embodiments are exemplary rather than limiting, and are intended to provide a basic understanding of the present invention, and are not intended to confirm the key or decisive elements of the present invention or limit the scope of protection to be protected. Fig. 1 is a schematic diagram of a power exchange system 100 according to an embodiment of the present invention. In the schematic diagram, the area surrounded by the solid circle marked #1 represents the internal area of the power exchange station #1, and the area surrounded by the dotted circle represents the center of the power exchange station #1 and a radius of a certain distance (in this implementation In the method, for example, it is set as an area of 5 kilometers), and the area outside the dashed circle is an area more than, for example, 5 kilometers from the power exchange station #1. In addition, the triangles marked C1 to C6 respectively represent 6 vehicle users, among which, C1 and C2 are vehicle users who arrive at the swap station, C3 and C4 are vehicle users within 5 kilometers of the swap station, and C5 and C6 are vehicle users who are 5 kilometers away from the swap station. These vehicle users C1 to C6 all have the ability to apply for a power swap to the power swap station. However, according to the actual situation, only some vehicle users have issued a power swap application to the power swap station within a certain period of time, while the rest of the vehicle users have not yet switched to the power swap station. The power station issues an application for a power exchange. In addition, although 6 vehicle users are shown for one switching station in FIG. 1, those skilled in the art should be aware that the structure of the power switching system 100 is not limited to this, and there can be one vehicle user for one switching station. , There can also be multiple vehicle users. The six vehicle users C1 to C6 shown in FIG. 1 all interact with the swap station #1 through their mobile terminals when they need to perform a power swap. Hereinafter, the structure of each mobile terminal and switching station #1 will be explained with reference to FIGS. 2 and 3. FIG. 2 is a schematic block diagram of mobile terminals used by vehicle users C1 to C6 shown in FIG. 1, and FIG. 3 is a schematic block diagram of switching station #1 shown in FIG. As shown in FIG. 2, each mobile terminal includes: a power replacement request sending unit T10, a power replacement waiting time receiving unit T20, and a power replacement waiting time display unit T30. The battery swap request sending unit T10 of the mobile terminal is configured to send the battery swap request of the corresponding vehicle user to the battery swap station #1. Wherein, the battery replacement application may include, but is not limited to, user information and vehicle information of the vehicle user. The power exchange waiting time receiving unit T20 is configured to receive power exchange waiting time information from the power exchange station #1. Wherein, the power swap waiting time information is information related to the power swap waiting time determined for the vehicle user by the power swap station #1 in response to the above-mentioned corresponding vehicle user's power swap application. The battery swap waiting time display unit T30 is configured to display the battery swap waiting time corresponding to the received battery swap waiting time information to the corresponding vehicle user. The battery replacement waiting time display unit T30 can be any type of display unit that can display a visual interface to the user, for example, any type of light emitting diode (LED), organic LED (OLED), or cathode ray tube (CRT) can be used. , Liquid crystal display (LCD), plasma, electroluminescence (EL), electrowetting, MEMS or other display technologies. Correspondingly, as shown in FIG. 3, the power swap station #1 includes: a power swap request receiving unit E10, a power swap waiting time determination system E20, and a power swap waiting time sending unit E30. The power replacement request receiving unit E10 is configured to receive a power replacement request from at least one of the vehicle users C1 to C6 and output it to the power replacement waiting time determination system E20. The battery swap waiting time determining system E20 is configured to calculate the battery swap waiting time of the vehicle user who submits the battery swap application. The specific details will be described later. The power-swap waiting time sending unit E30 is configured to send the power-swap waiting time determined by the power-swap waiting time determination system E20 to the vehicle user who submitted the power-swap application. Next, referring to FIG. 4, the specific structure of the power exchange waiting time determination system E20 shown in FIG. 3 will be explained in detail. FIG. 4 is a schematic block diagram of the power replacement waiting time determination system E20 shown in FIG. 3. As shown in Fig. 4, the power-swap waiting time determination system E20 includes a queuing sequence determination unit E201 and a power-swap waiting time calculation unit E202. The queuing order determining unit E201 is configured to determine the order number (x) for the vehicle user who needs to change the battery. In this example, for the vehicles that arrive at the swap station, if they need to be swapped, they will participate in the queuing, and the vehicles that enter the swap station barrier first are ranked first, and accordingly, the assigned sequence number is less than before entering the swap station Vehicles at the barriers. For the vehicles that have not arrived at the swap station, they are sorted according to the estimated time required to arrive at the swap station. Users with a short time required are ranked first, and the sort number is less than the users with a longer expected time to arrive. In this example, the users who are within, for example, 5 kilometers from the switching station and have applied for a power exchange, are ranked behind the users who have arrived at the switching station. The number is greater than the sequence number of users who have arrived at the switching station. Accordingly, users who are 5 kilometers away from the switching station and have applied for a power exchange are ranked behind users who are within, for example, 5 kilometers from the power switching station and have applied for a power exchange, in other words , The sequence number of users who have applied for a power swap outside, for example, 5 kilometers from the power exchange station, is greater than the sequence number of users who have applied for a power swap, within, for example, 5 kilometers away from the power exchange station. In addition, for users who are within, for example, 5 kilometers away from the switching station and have not applied for a power exchange, they will be ranked behind those users who have applied for a power exchange, for example, 5 kilometers away from the switching station. The sequence number of users who are within a kilometer and who have not applied for a battery swap will be greater than the sequence number of users who are away, for example, 5 kilometers from the swap station, and who have applied for a battery swap. For example, when a user is active within 5 kilometers from the switching station and the SOC of the user's vehicle is lower than, for example, 30%, these users will be regarded as potential power-swap users, and these users may or may not apply for a power-swap. Assuming that the total number of users in this category is u p and the probability of applying for a replacement is α (this value can be adjusted according to the historical data of the operation of the replacement station), it is estimated that no replacement is requested within 5 kilometers from the replacement station, for example. But the total number of users who may apply for a power swap in the future is r=u p ×α, and suppose that the user who is the farthest from the power swap station among the r users takes the time it takes to reach the power swap station as t r . When there is a user s who is active, for example, 5 kilometers away from the swap station and has applied for a power swap (assuming that the time it takes to reach the swap station is t s and the corresponding sequence number is q s ), t r <t s and The sort numbers of the r users are in the interval (q s , q s + r). Furthermore, for users who are away from the power exchange station, for example, 5 kilometers and have not applied for a power exchange, they will not participate in the sequencing. Take the vehicle users C1 to C6 in Figure 1 as an example. As mentioned above, C1 and C2 are vehicle users who arrive at the swap station, C3 and C4 are vehicle users within 5 kilometers of the swap station, and C5 and C6 are vehicle users who are within 5 kilometers of the swap station. For vehicle users who are 5 kilometers away from the power station, suppose that C3 and C5 have applied for power swap to power swap station #1, but C4 and C6 have not applied for power swap. When the queuing sequence determination unit E201 determines the sequence numbers for these 6 users, since C2 arrives at the switch station earlier than C1, the sequence number of C2 is number 1, the sequence number of C1 is number 2, and the next number 3 is C3 , No. 4 is C5, and No. 5 is C4. In addition, because C6 is 5 kilometers away and there is no application for battery replacement, therefore, the sequence number is not determined. The power replacement waiting time calculation unit E202 is configured to calculate the corresponding power replacement waiting time based on the ranking number determined by the queuing order determining unit E201. Preferably, the power-swap waiting time determination system E20 may further include a power-to-swap power comparison unit E203. The charging and swapping power comparison unit E203 is configured to compare the maximum available power P cmax for charging the energy storage unit with the maximum swap output power P smax . Calculate the corresponding waiting time t x for power exchange. Among them, the above-mentioned maximum available power P cmax for charging the energy storage unit refers to the maximum charging power for charging the energy storage unit by the switching station, which is limited by factors such as the power supply capacity of the switching station and the maximum output capacity of the charger. The electrical output power P smax is expressed by the following formula (1): … (1) Among them, W p is the electric quantity of the newly replaced (that is, put into the car) fully charged energy storage unit (that is, the allowable charging capacity under the condition of DC fast charging), and from the long-term statistical effect It can be seen that the power of the energy storage unit that is replaced each time is the same. t c is the length of time for a power replacement operation and its value is usually determined by the system of the power replacement station. For the same system, t c is a fixed value . It should be noted that a battery swap operation refers to the process from the start of the battery swap to the completion of the battery swap (that is, the next car can start the battery swap). In the case where the above-mentioned maximum available power P cmax for charging the energy storage unit is greater than or equal to the above-mentioned maximum switching output power P smax , the switching waiting time calculation unit E202 calculates the switching waiting time t x according to the following formula (2): … (2) Among them, x is the sorting number determined by the queuing order determining unit E201. In other words, when the maximum available total charging power of the switching station is greater than or equal to the maximum switching output power, the switching waiting time only needs to be calculated by multiplying the duration of a switching operation by the vehicle user's ranking number. On the other hand, in the case where the above-mentioned maximum available power P cmax for charging the energy storage unit is less than the above-mentioned maximum power exchange output power P smax , preferably, the power exchange waiting time determination system E20 may further include a ranking number comparison unit E204. The sorting number comparison unit E204 is configured to compare the sorting number x determined by the queuing order determining unit E201 with the threshold sorting number n numerically, and the replacement waiting time calculation unit E202 according to the sorting number comparison result obtained by the sorting number comparison unit E204 To calculate the corresponding waiting time t x for power exchange. This is because when the charging speed cannot meet the power exchange output speed, there must be users who need to wait for a longer time than the duration of a power exchange operation. Assuming that when it is the nth user’s turn, there is only one fully charged energy storage unit in the switching station. Due to the limited charging power, no energy storage unit can be fully charged during the nth user’s power exchange. Then the n+1th user After the nth user completes the power replacement, because there is no available energy storage unit, he can only wait for a longer time until the energy storage unit with the most power is fully charged. Therefore, the nth user is the last vehicle user who can be supplied with a fully charged energy storage unit within the time length of a battery swap operation. Assuming that there are m energy storage units in the power exchange station that are fully charged, then the following equation can be obtained according to the principle of power equalization: … (3). In this equation, the first term represents the total power of the original m energy storage units in the power exchange station, and the second term represents the estimated time until the nth user’s power replacement is completed. The total power charged by the energy unit, the third term represents the total power of n energy storage units that have been replaced in the car when the nth user is replaced. In addition, since in the equation, only n is an unknown quantity, so , We can get n: … (4). Take an integer for n in the above formula (4), and when the sort number x determined by the queuing order determination unit E201 is less than or equal to the threshold sort number n, the replacement waiting time calculation unit E202 calculates the replacement according to the following formula (5) Electric waiting time t x : ... (5). On the other hand, when the sort number x is greater than the threshold sort number n, this means that for the n+1th user to the xth user, it is necessary to wait for more than one change The electrical operation time length t c is longer (set as t b below), at this time, the power replacement waiting time calculation unit E202 calculates the power replacement waiting time t x according to the following formula (6): … (6) Among them, t b is determined by the following formula (7): … (7). Therefore, the battery replacement waiting time determination system E20 can determine the sorting number for the vehicle user who needs to switch the battery, and then determine the battery replacement waiting time. In addition, it should be noted that although only one power exchange station is shown in the power exchange system 100 shown in FIG. 1, the structure of the power exchange system according to the present invention is not limited to this, and may also include multiple power exchange stations. . FIG. 5 shows a schematic diagram of a power exchange system 200 according to another embodiment of the present invention. As shown in Fig. 5, the area enclosed by the solid circle marked #1 represents the internal area of the switching station #1, and the area enclosed by the solid circle marked #2 represents the internal area of the switching station #2, including The area surrounded by the dotted circle of power station #1 represents an area with a certain radius (in this embodiment, for example, 5 kilometers) centered on the power station #1, and the dotted circle of power station #1 is included The other area is the area more than 5 kilometers away from the switching station #1. Similarly, the area enclosed by the dotted circle containing the switching station #2 indicates that the center is at the switching station #2 and the radius is a certain distance (in this embodiment In, for example, it is set to an area of 5 kilometers), and the area outside the dashed circle including the power exchange station #2 is an area that is more than, for example, 5 kilometers away from the power exchange station #2. In addition, the triangles labeled C1 to C9 respectively represent 9 vehicle users. In the scenario illustrated in Figure 5, the users of the 9 vehicle users C1 to C9 who need to perform battery swaps send their battery swap applications to swap station #1 and swap station #2 via mobile terminals, and from Power station #1 and power swap station #2 respectively receive information about the waiting time for power exchange and display the corresponding waiting time for power exchange. As a result, vehicle users can autonomously select relatively idle swap stations for power swaps, which is conducive to swap station scheduling and automatically balances the swap load of the swap stations. In addition, it helps to balance the busyness of each swap station, so that The operation of each switching station has maximized the value and at the same time can improve the user experience. Next, referring to FIG. 6, the method S100 for determining the waiting time for replacement in the system E20 for determining the waiting time for replacement shown in FIG. 4 will be explained. As shown in FIG. 6, the method S100 for determining the waiting time for power exchange includes: a queuing sequence determining step S101 and a step S102 for calculating the waiting time for power exchange. Wherein, in step S101, the queuing order determining unit E201 determines the ranking number x for the vehicle users who need to change battery. Then, in the battery swap waiting time calculation step S102, the battery swap waiting time calculating unit E202 is based on the queuing order The sequence number x determined in step S101 is determined to calculate the corresponding power-changing waiting time t x . Preferably, the method S100 for determining the waiting time for battery replacement further includes a charging and replacement power comparison step. In this step, the charging and replacement power comparing unit E203 compares the maximum available power P cmax for charging the energy storage unit and the maximum output power P smax for charging the energy storage unit. For comparison, the battery swap waiting time calculation unit E202 calculates the corresponding battery swap waiting time t x according to the power comparison result obtained in the charging and swapping power comparison step. Among them, the above-mentioned maximum available power P cmax for charging the energy storage unit refers to the maximum charging power for charging the energy storage unit by the switching station, which is limited by factors such as the power supply capacity of the switching station and the maximum output capacity of the charger. The electrical output power P smax is expressed by the following formula (8): … (8) Among them, W p is the electric quantity of the newly replaced (that is, put into the car) fully charged energy storage unit (that is, the allowable charging capacity under the condition of DC fast charging), and from the long-term statistical effect It can be seen that the power of the energy storage unit that is replaced each time is the same. t c is the length of time for a power replacement operation and its value is usually determined by the system of the power replacement station. For the same system, t c is a fixed value . It should be noted that a battery swap operation refers to the process from the start of the battery swap to the completion of the battery swap (that is, the next car can start the battery swap). In the case where the above-mentioned maximum available power P cmax for charging the energy storage unit is greater than or equal to the above-mentioned maximum switching output power P smax , in the power-changing waiting time calculation step S102, the power-changing waiting time calculating unit E202 is in accordance with the following formula (9) To calculate the waiting time t x for power exchange: ... (9) Where, x is the sort number determined by the queuing order determination step S101. In other words, when the maximum available total charging power of the switching station is greater than or equal to the maximum switching output power, the switching waiting time only needs to be calculated by multiplying the duration of a switching operation by the vehicle user's ranking number. On the other hand, in the case where the maximum available power P cmax for charging the energy storage unit is less than the maximum switching output power P smax , preferably, the power switching waiting time determination method S100 further includes a sequence number comparison step, where In the step, the ranking number comparison unit E204 compares the ranking number x determined in the queuing order determination step S101 with the threshold ranking number n in numerical value, and in the power exchange waiting time calculation step S102, according to the ranking number comparison step obtained Compare the results of the sort numbers to calculate the corresponding waiting time t x for power exchange. This is because when the charging speed cannot meet the power exchange output speed, there must be users who need to wait for a longer time than the duration of a power exchange operation. Assuming that when it is the nth user’s turn, there is only one fully charged energy storage unit in the switching station. Due to the limited charging power, no energy storage unit can be fully charged during the nth user’s power exchange. Then the n+1th user After the nth user completes the power replacement, because there is no available energy storage unit, he can only wait for a longer time until the energy storage unit with the most power is fully charged. Therefore, the nth user is the last vehicle user who can be supplied with a fully charged energy storage unit within the time length of a battery swap operation. Assuming that there are m energy storage units in the power exchange station that are fully charged, then the following equation can be obtained according to the principle of power equalization: … (10). In the equation, the first term represents the total power of the original m energy storage units in the power-swap station, and the second term represents the estimated time until the n-th user’s power-switching is completed. The total power charged by the energy unit, the third term represents the total power of n energy storage units that have been replaced in the car when the nth user is replaced. In addition, since in the equation, only n is an unknown quantity, so , We can get n: … (11). Take an integer for n in the above formula (11), and if the sort number x determined by the queuing order determination step S101 is less than or equal to the threshold sort number n, in the power exchange waiting time calculation step S102, the following formula (12) To calculate the waiting time t x for power exchange: ... (12). On the other hand, when the sort number x is greater than the threshold sort number n, this means that for the n+1th user to the xth user, it is necessary to wait for more than one change The time length t c of the electrical operation is longer (set as t b below). At this time, in the power replacement waiting time calculation step S102, the power replacement waiting time t x is calculated according to the following formula (13): … (13) Among them, t b is determined by the following formula (14): … (14). Therefore, the method S100 for determining the waiting time for battery replacement can determine the sorting number for the vehicle user who needs to change the battery, and then determine the waiting time for the battery replacement. Although the description has been focused on the implementation of the power exchange waiting time determination system and method, the power exchange station, and the power exchange system before this, the present invention is not limited to these embodiments, and the present invention can also be implemented in the following ways: In the manner of executing the computer program of the method for determining the waiting time for replacement of the battery or the computer program for realizing the function of the system for determining the waiting time of the replacement of the battery, or a computer readable recording medium on which the computer program is recorded. Here, as the recording medium, disks (for example, magnetic disks, optical discs, etc.), cards (for example, memory cards, optical cards, etc.), semiconductor memories (for example, ROM, nonvolatile memory, etc.) can be used. ), tape type (for example, magnetic tape, cassette tape, etc.) and other types of recording media. By recording in these recording media a computer program that causes the computer to execute the method for determining the waiting time for replacement of the battery in the above-mentioned embodiment or the computer program that causes the computer to implement the function of the waiting time determining system for replacement of the battery in the above-mentioned embodiment and circulates it, It can reduce the cost and improve the portability and versatility. Moreover, the above-mentioned recording medium is loaded on the computer, and the computer program recorded in the recording medium is read by the computer and stored in the memory. The processor (CPU: Central Processing Unit) and MPU: Micro Processing Unit (microprocessing unit) reads out the computer program from the memory and executes it, so that the method for determining the position of a moving object in the above embodiment can be executed and the system for determining the position of a moving object in the above embodiment can be implemented. Features. Those of ordinary skill in the art should understand that the present invention is not limited to the above-mentioned embodiments, and the present invention can be implemented in many other forms without departing from its spirit and scope. Therefore, the examples and implementations shown are considered to be illustrative rather than restrictive. Without departing from the spirit and scope of the present invention as defined by the appended claims, the present invention may cover various modifications and replace.
