TW202501192A - Path Generation System - Google Patents
Path Generation System Download PDFInfo
- Publication number
- TW202501192A TW202501192A TW113120990A TW113120990A TW202501192A TW 202501192 A TW202501192 A TW 202501192A TW 113120990 A TW113120990 A TW 113120990A TW 113120990 A TW113120990 A TW 113120990A TW 202501192 A TW202501192 A TW 202501192A
- Authority
- TW
- Taiwan
- Prior art keywords
- block
- transport
- aforementioned
- path
- points
- Prior art date
Links
- 238000004088 simulation Methods 0.000 claims description 5
- 239000000284 extract Substances 0.000 abstract description 5
- 238000012545 processing Methods 0.000 description 16
- 238000005192 partition Methods 0.000 description 5
- 101000827703 Homo sapiens Polyphosphoinositide phosphatase Proteins 0.000 description 4
- 102100023591 Polyphosphoinositide phosphatase Human genes 0.000 description 4
- 238000010586 diagram Methods 0.000 description 4
- 238000012546 transfer Methods 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 3
- 101100233916 Saccharomyces cerevisiae (strain ATCC 204508 / S288c) KAR5 gene Proteins 0.000 description 2
- 238000004422 calculation algorithm Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 238000000034 method Methods 0.000 description 2
- 101100012902 Saccharomyces cerevisiae (strain ATCC 204508 / S288c) FIG2 gene Proteins 0.000 description 1
- 239000000470 constituent Substances 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000004807 localization Effects 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 239000003550 marker Substances 0.000 description 1
- 238000002360 preparation method Methods 0.000 description 1
- 238000010845 search algorithm Methods 0.000 description 1
- 238000011144 upstream manufacturing Methods 0.000 description 1
Images
Abstract
路徑產生系統具備:產生讓搬運車在行走區域從出發地行走到目的地的路徑之控制器。控制器,對行走區域之複數個點,設定分成3個以上的第1區塊、及與第1區塊連接的第2區塊,擷取搬運出發地區塊、搬運目的地區塊及第2區塊所含的點,搬運出發地區塊係第1區塊當中出發地所屬的1個第1區塊,搬運目的地區塊係第1區塊當中目的地所屬的1個第1區塊,從所擷取的點中產生路徑。The path generation system includes: a controller that generates a path for the transport vehicle to travel from a departure point to a destination in a travel area. The controller sets a plurality of points in the travel area to be divided into three or more first blocks and a second block connected to the first block, extracts points included in the transport departure block, the transport destination block, and the second block, the transport departure block being one first block to which the departure point belongs among the first blocks, and the transport destination block being one first block to which the destination belongs among the first blocks, and generates a path from the extracted points.
Description
本揭露是關於產生搬運車的行走路徑之路徑產生系統。The present disclosure relates to a path generation system for generating a travel path of a transport vehicle.
以往,可在短時間內作成路徑計畫之路徑計畫裝置及搬運系統是已知的,該路徑計畫,是在複數台自動無人搬運車(AGV:Automated Guided Vehicle)從初期地點行走到搬運目的地地點(目的地)時,使搬運車的總搬運時間或總搬運距離成為最短(例如,參照專利文獻1)。 [先前技術文獻] [專利文獻] In the past, a route planning device and a transport system that can create a route plan in a short time are known. The route plan is to minimize the total transport time or total transport distance of a plurality of automated guided vehicles (AGVs) when they travel from an initial location to a transport destination location (destination) (for example, refer to Patent Document 1). [Prior Art Document] [Patent Document]
[專利文獻1] 日本特許第4138541號公報[Patent Document 1] Japanese Patent No. 4138541
[發明所欲解決之問題][The problem the invention is trying to solve]
上述以往的系統,是將所有的搬運車之路徑計畫在短暫的計算時間內作成,當行走區域擴大的情況,路徑計畫的計算變得龐大。在以往的系統,沒有考慮到這點,在廣闊的行走區域之路徑計畫需要龐大的計算負荷。根據情況,用於路徑探索之記憶體量有可能達到可使用的記憶體量之上限,而使路徑的產生變得不可能。The above-mentioned conventional system creates all the transporter route plans in a short calculation time. When the travel area is expanded, the calculation of the route plan becomes huge. In the previous system, this point was not taken into account. The route plan in a wide travel area requires a huge calculation load. Depending on the situation, the memory volume used for path exploration may reach the upper limit of the available memory volume, making the generation of the path impossible.
本揭露是說明甚至在廣闊的行走區域也能減輕路徑產生所需的負荷之路徑產生系統。 [解決問題之技術手段] This disclosure is to describe a path generation system that can reduce the load required for path generation even in a wide walking area. [Technical means for solving the problem]
本揭露的一態樣,係產生用於讓1台或複數台搬運車在行走區域從出發地行走到目的地的路徑之路徑產生系統,其具備:產生搬運車所行走的路徑之控制器,行走區域具有:搬運車可通過及停止之複數個點(point),控制器,對於複數個點,設定分成3個以上的第1區塊、及與第1區塊連接的第2區塊,擷取搬運出發地區塊、搬運目的地區塊及第2區塊所含的點,搬運出發地區塊係第1區塊當中出發地所屬的1個第1區塊,搬運目的地區塊係第1區塊當中目的地所屬的1個第1區塊,從所擷取的點中產生路徑。One aspect of the present disclosure is a path generation system for generating a path for one or more transport vehicles to travel from a starting point to a destination in a travel area, and the system comprises: a controller for generating a path for the transport vehicle to travel, wherein the travel area has: a plurality of points where the transport vehicle can pass and stop, and the controller sets the plurality of points to be divided into three or more first blocks and a second block connected to the first block, and extracts points included in a transport departure block, a transport destination block, and a second block, wherein the transport departure block is a first block to which the departure point belongs among the first blocks, and the transport destination block is a first block to which the destination belongs among the first blocks, and generates a path from the extracted points.
依據該路徑產生系統,藉由控制器設定:分成3個以上的第1區塊、與該等第1區塊連接的第2區塊。亦即,行走區域之複數個點屬於該等區塊之任一個區塊。藉由控制器,擷取3個以上的第1區塊中的搬運出發地區塊和搬運目的地區塊及第2區塊所含的點,從該等點中產生路徑。如此般,在路徑產生時控制器所探索的區域(點),不是行走區域的全體(全點)而局限(限定)在一部分。如此,甚至在廣闊的行走區域也能減輕路徑產生所需的負荷。According to the path generation system, the controller is set to divide the first block into three or more and the second block connected to the first blocks. That is, a plurality of points in the walking area belong to any one of the blocks. The controller extracts the points included in the transport departure block and the transport destination block and the second block in the three or more first blocks, and generates a path from the points. In this way, the area (point) explored by the controller when generating the path is not the entire walking area (all points) but is limited (restricted) to a part. In this way, the load required for path generation can be reduced even in a wide walking area.
也可以是,第2區塊,係根據全搬運模式的模擬,而以包含通過頻率高之點的方式進行設定。在此情況,可根據實際環境而適切地設定第2區塊。The second block may be set to include a point with a high passing frequency based on the simulation of the full transport mode. In this case, the second block may be appropriately set based on the actual environment.
也可以是,控制器係對複數台搬運車的每一台所行走的路徑個別地設定第2區塊。根據搬運車而改變第2區塊,藉此可減少搬運車彼此間發生干涉的頻率。Alternatively, the controller may set the second block individually for each of the paths traveled by the plurality of transport vehicles. By changing the second block according to the transport vehicle, the frequency of interference between transport vehicles can be reduced.
也可以是,對第1區塊的每一個所含之點的個數設定上限。在此情況,在路徑產生時控制器所探索之區域(點)的個數減少,因此可進一步減輕路徑產生所需的負荷。Alternatively, an upper limit may be set for the number of points contained in each of the first blocks. In this case, the number of regions (points) to be explored by the controller during path generation is reduced, thereby further reducing the load required for path generation.
也可以是,在行走區域內之複數個點當中至少1個點,與只有3條以下的通路連接,第2區塊包含該至少1個點。Alternatively, at least one point among a plurality of points in the walking area is connected to no more than three paths, and the second block includes the at least one point.
也可以是,第2區塊包含:分別與4條以上的通路連接之複數個點。 [發明之效果] Alternatively, the second block may include: a plurality of points connected to four or more paths, respectively. [Effect of the invention]
依據本揭露,甚至在廣闊的行走區域也能減輕路徑產生所需的負荷。According to the present disclosure, the load required to generate the path can be reduced even in a wide walking area.
以下,針對本揭露的實施形態,參照圖式做說明。又在圖式的說明中,對同一要素賦予同一符號而省略重複的說明。Hereinafter, the embodiments of the present disclosure will be described with reference to the drawings. In the description of the drawings, the same elements are given the same symbols and repeated descriptions are omitted.
首先參照圖1,針對運用本實施形態的路徑產生系統6(參照圖3)之無人搬運車系統1做說明。如圖1所示般,無人搬運車系統1是例如在建物100內進行物品的搬運等之搬運系統。無人搬運車系統1具備:搬運物品之複數台無人搬運車10、及無人搬運車10所行走的行走區域A。在圖1所示的例子,在建物100內設有:例如3個處理裝置(第1處理裝置31、第2處理裝置32及第3處理裝置33)、搬出站34及搬入站35。行走區域A設置在除了第1處理裝置31~第3處理裝置3、搬出站34及搬入站35以外的區域。在無人搬運車系統1中處理的物品,只要是可藉由各無人搬運車10搬運的零件或商品等即可,沒有特別的限定。以下,無人搬運車系統1簡稱為「搬運車系統1」,無人搬運車10簡稱為「搬運車10」。First, referring to FIG. 1 , an unmanned transport vehicle system 1 using a path generation system 6 (see FIG. 3 ) of the present embodiment will be described. As shown in FIG. 1 , the unmanned transport vehicle system 1 is a transport system that performs, for example, transporting items within a
在搬運車系統1中,第1處理裝置31~第3處理裝置3、搬出站34及搬入站35分別配置成,可藉由沿著行走區域A內之既定路徑行走的搬運車10移載物品。搬運車系統1可具備:保管複數個物品之1或複數個自動倉庫(未圖示)。自動倉庫可具有:可載置複數個物品之保管棚架、將物品對於保管棚架進行移載之堆高式起重機、及可藉由搬運車10移載物品之複數個出入埠(皆未圖示)。處理裝置的個數和配置、及行走區域A可自由決定,並不限定於圖1所示的例子。In the transport vehicle system 1, the first processing device 31 to the third processing device 3, the
搬運車10沿著事先設定的路徑2自律行走(autonomous travel)。搬運車10是例如AGV(Automated Guided Vehicle)。The
參照圖2(a)及圖2(b),針對行走區域A的構成做說明。行走區域A是在地板面上(行走面上)呈二維狀展開的區域,且是各搬運車10可行走的區域。行走區域A具有:各搬運車10可通過及停止之多數個(複數個)點P、及設置在這些點P之間(詳言之,相鄰的2個點P之間)且用於將這些點P連接之複數個路段(通路)S。為了讓各搬運車10之行走控制部15可偵測本車的位置,可在各點P設有條碼或二維碼等碼。各搬運車10具有讀取裝置(未圖示)。當設有二維碼的情況,各搬運車10藉由從二維碼讀取資訊來偵測本車的位置。二維碼可含有用於確定方向的資訊。或者也可以是,二維碼不含用於確定方向的資訊,各搬運車10具有:用於確定本車的方向(行走的方向)之羅盤等的方向偵測手段。Referring to Figures 2(a) and 2(b), the structure of the walking area A is explained. The walking area A is an area that is two-dimensionally developed on the floor surface (walking surface), and is an area where each
又搬運車10也可以一邊偵測從磁帶或磁性標記等輸出的磁信號等一邊行走。或者,搬運車10也可以從雷射等產生光,一邊藉由偵測由安裝於建物的壁部等之反射鏡所反射的反射光來偵測本身位置一邊行走,搬運車10也可以一邊利用GPS等的資訊來偵測本身位置一邊行走。作為對搬運車10的導航方式,可採用SLAM(同步定位與地圖構建,Simultaneous Localization and Mapping)技術。搬運車系統1可設有:用於對搬運車10供應電力之充電點或充電站等。The
圖中用虛線表示之直線狀的各路段S,具有相當於2個點P間的距離(節距)之長度、亦即區間長度。各路段S的區間長度,在行走區域A可以是一定,也可以不是一定。在一部分的路段S之區間長度,可以比其他許多的路段S之(平均的)區間長度更長,相反地也可以更短。在搬運車系統1,為了實現穩定的行走,例如對路段S的長度、亦即區間長度設定上限。區間長度的上限,例如1000mm~3000mm左右。Each straight line section S represented by a dotted line in the figure has a length equivalent to the distance (pitch) between two points P, that is, the interval length. The interval length of each section S may be constant or not constant in the travel area A. The interval length of a part of the section S may be longer than the (average) interval length of many other sections S, or vice versa. In the transport vehicle system 1, in order to achieve stable travel, for example, an upper limit is set for the length of the section S, that is, the interval length. The upper limit of the interval length is, for example, about 1000 mm to 3000 mm.
如圖2(b)所示般,作為探索及產生搬運車10之行走路徑所需的資訊,使各點P與原地旋轉(spin turn)時間(秒)相關聯。原地旋轉時間(秒)是設定關於以下2種情況之固有的時間(旋轉時間),即搬運車10停止於點P上而原地旋轉90度的情況、及原地旋轉180度的情況。又使各路段S與區間長度(mm)和行走速度(mm/秒)相關聯。根據這2個資訊,算出搬運車10在該路段S行走所花費的時間(行走時間)。這些旋轉時間及行走時間,是後述路徑產生部14進行路徑探索處理所使用的指標,從其他觀點是「成本(cost)」。又各點P也可以稱為「停止點」。As shown in FIG2(b), as information required for exploring and generating the travel path of the
如圖3所示般,搬運車系統1具備路徑產生系統6,路徑產生系統6產生用於使複數台搬運車10的每一台在行走區域A從出發地P
from行走到目的地P
to的行走路徑R。出發地P
from及目的地P
to是行走區域A內之任意2個點P。
As shown in FIG3 , the transport vehicle system 1 includes a path generation system 6 that generates a travel path R for each of the plurality of
如圖3所示般,路徑產生系統6具備:搬運物品之複數台搬運車10、控制複數台搬運車10之搬運車控制器20、以及對搬運車控制器20提出搬運要求之上位控制器5。As shown in FIG. 3 , the path generation system 6 includes: a plurality of
搬運車10,當從搬運車控制器20被分配搬運指令(後述)的情況,實行用於讓物品從出發地P
from往目的地P
to搬運的行走控制及裝貨卸貨控制。在路徑產生系統6,使搬運車控制器20和搬運車10協作,來產生從出發地P
from往目的地P
to的行走路徑R。亦即,產生行走路徑R之控制器的功能分散至搬運車控制器20和搬運車10。在裝貨卸貨控制,藉由讓搬運車10所具有的昇降機上昇及下降,來實施從各處理裝置或移載站往搬運車10的裝貨,實施從搬運車10往各處理裝置或移載站的卸貨。
When a transport instruction (described later) is assigned to the
搬運車控制器20是管理複數台搬運車10的控制裝置。搬運車控制器20是電腦,該電腦具有:儲存有程式等之ROM(Read Only Memory)、將資料暫時儲存之RAM (Random AccessMemory)、HDD(Hard Disk Drive)等記憶媒體、CPU(Central Processing Unit)等處理器、及無線LAN等通訊電路等。搬運車控制器20能以軟體的形式構成,該軟體是將例如儲存於ROM的程式載入RAM中而由CPU執行。搬運車控制器20也能以使用電子電路等之硬體的形式構成。搬運車控制器20可由一個裝置所構成,也可以由複數個裝置所構成。在由複數個裝置所構成的情況,藉由將其等透過網際網路或內部網路等通訊網路連接,藉此構築邏輯上的一個搬運車控制器20。The
搬運車控制器20是利用有線或無線來與搬運車10及上位控制器5連接。搬運車控制器20從搬運車10接收與該搬運車10之現在位置及現在速度等有關的資訊。搬運車控制器20從上位控制器5接收用於讓物品從某個處理裝置往其他處理裝置搬運之搬運要求。搬運要求,是以例如物品抵達了出庫輸送機的前端、或物品在上游設備的處理完畢而抵達了交貨站為契機而產生。搬運車控制器20,按照所接收到的搬運要求來產生搬運指令,並對搬運車10分配該搬運指令。The
搬運指令是用於將物品藉由搬運車10從搬運要求之搬運出發地的移載站搬運到搬運目的地的移載站之控制指令。搬運指令包含:關於在搬運出發地的移載站之物品的移載、沿著從搬運出發地的移載站往搬運目的地的移載站之路徑2的行走、在搬運目的地的移載站之物品的移載之資訊。The transport instruction is a control instruction for transporting an object from a transport departure station to a transport destination station by means of the
如圖3所示般,搬運車控制器20具有:搬運要求接收部21、資訊取得部23、第1區塊設定部24、分配決定部25、記憶部27。搬運要求接收部21,從上位控制器5接收搬運要求,按照所接收到的搬運要求產生搬運指令。資訊取得部23,取得與行走區域A有關的資訊,並取得與所有的搬運車10之行走狀態有關的資訊。分配決定部25,針對該搬運要求,將其分配給沒有其他搬運要求正在實行中的搬運車10、即空搬運車(空的無人搬運車)。關於第1區塊設定部24,隨後敘述。記憶部27儲存:與對於行走區域A由第1區塊設定部24所設定的分割區塊B1a~B1e (第1區塊。參照圖4)相關的資訊。As shown in FIG3 , the
搬運車10,作為與本車的行走控制有關的功能,係具有搬運指令接收部11、區域資訊取得部12、第2區塊設定部13、路徑產生部14、行走控制部15。這些搬運指令接收部11、區域資訊取得部12、第2區塊設定部13、路徑產生部14及行走控制部15都是包含有ROM、RAM、HDD等記憶媒體、CPU等處理器、及無線LAN等通訊電路等而構成。搬運指令接收部11接收從搬運車控制器20之分配決定部25發送的搬運指令。區域資訊取得部12取得與行走區域A有關的資訊。由搬運車控制器20之資訊取得部23及搬運車10之區域資訊取得部12所取得的資訊,包含與上述各點P及各路段S有關的資訊。關於第2區塊設定部13隨後敘述。路徑產生部14,根據由第1區塊設定部24所設定的分割區塊B1a~B1e、由第2區塊設定部13所設定的共有區塊B2來產生本車的行走路徑R。The
接下來,參照圖3、圖4及圖5,針對在路徑產生系統6之各區塊的設定及行走路徑R的產生做說明。在路徑產生系統6,在產生欲實行搬運要求之各搬運車10的行走路徑R時,不是以行走區域A內全部的點P作為路徑探索的對象,而是僅以一部分的點P作為路徑探索的對象。Next, the setting of each block and the generation of the travel path R in the path generation system 6 will be described with reference to Fig. 3, Fig. 4 and Fig. 5. In the path generation system 6, when generating the travel path R of each
如圖3及圖4所示般,搬運車控制器20之第1區塊設定部24,是對行走區域A內全部的點P設定分成3個以上的分割區塊B1a~B1e。例如以將行走區域A分割的方式存在5個分割區塊B1a~B1e。對分割區塊B1a~B1e的每一個所含之點P的個數設定例如上限。每一個分割區塊1可含之點P的上限個數,可設定成例如少於50個,也可以設定成少於100個,也可以設定成少於200個。可按照行走區域A的規模來決定。上限個數可按照搬運車控制器20之記憶體的計算能力或性能等來決定。分割區塊的個數沒有特別的限定,在圖4所示的例子,以使各分割區塊所含之點P的個數成為9個~17個左右的方式設定分割區塊。複數個分割區塊的設定方式,例如以各處理裝置之搬入站及搬出站作為基準,使在其周邊所存在之複數個點屬於1個分割區塊。As shown in FIG. 3 and FIG. 4 , the first
搬運車10之第2區塊設定部13,作為讓路徑產生部14產生行走路徑R的事前準備,是根據全搬運模式的模擬,以包含通過頻率高之點P的方式設定共有區塊(第2區塊)B2。共有區塊B2透過複數個路段S來與分割區塊B1a~B1e連接。The second
又搬運車控制器20之第1區塊設定部24,可在第2區塊設定部13進行共有區塊B2的設定後,藉由將共有區塊B2以外的區域分割來設定分割區塊B1a~B1e。分割區塊(第1區塊)和共有區塊(第2區塊)是分開設定。Furthermore, the first
圖4顯示本實施形態的區塊設定X1。如圖4所示般,在現在的搬運指令(搬運要求)中,對共有區塊B2所含的點P分配3000~3100的數字。而且,對分割區塊B1a~B1e所含的點P分配3000~3100以外的數字。例如,對分割區塊B1a分配3201~3300的數字,對分割區塊B1b分配3301~3500的數字,對分割區塊B1c分配3501~3700的數字,對分割區塊B1d分配3701~3900的數字,對分割區塊B1e分配3901~4100的數字。FIG4 shows the block setting X1 of the present embodiment. As shown in FIG4, in the current transport instruction (transport request), the numbers 3000 to 3100 are assigned to the points P included in the common block B2. Furthermore, the numbers other than 3000 to 3100 are assigned to the points P included in the divided blocks B1a to B1e. For example, the
如圖4所示般,共有區塊B2包含:分別與只有3條以下的路段S連接之複數個點P。特別是在本實施形態,共有區塊B2僅包含:分別與只有3條以下的路段S連接之複數個點P。例如,共有區塊B2包含:與只有1條路段S連接之第1種點P1、與只有2條路段S連接的第2種點P2、及與只有3條路段S連接的第3種點P3。將共有區塊B2設定成為了在不同分割區塊間往來而必須通過的區域。As shown in FIG4 , the shared block B2 includes: a plurality of points P connected to only 3 or fewer road segments S. In particular, in the present embodiment, the shared block B2 includes only: a plurality of points P connected to only 3 or fewer road segments S. For example, the shared block B2 includes: a first type of point P1 connected to only 1 road segment S, a second type of point P2 connected to only 2 road segments S, and a third type of point P3 connected to only 3 road segments S. The shared block B2 is set as an area that must be passed through in order to travel between different divided blocks.
而且,如圖5所示般,搬運車10之路徑產生部14從分割區塊B1a~B1e中擷取出發地P
from(3304號)所屬的分割區塊B1b(搬運出發地區塊)、目的地P
to(4001號)所屬的分割區塊B1e(搬運目的地區塊)、及共有區塊B所含的點P,並從該等點中產生行走路徑R。路徑產生部14,藉由使用例如戴克斯特拉演算法(Dijkstra's algorithm)等公知的手法作為路徑探索演算法,來求出最短路徑。依據戴克斯特拉演算法必然會求出最短路徑。除此以外的分割區塊沒用利用於路徑探索(視為不存在)。
As shown in FIG5 , the
路徑探索的結果,路徑產生部14產生在圖5中用粗線的箭頭表示的行走路徑R。行走路徑R包含:在分割區塊B1b中產生的搬運出發地路徑R1b、在共有區塊B2中產生的共有路徑R2、及在分割區塊B1e中產生的搬運目的地路徑R1e。As a result of the route search, the
又3個以上的分割區塊(第1區塊)之設定、及1個或複數個共有區塊(第2區塊)之設定,也可以在地圖資料作成時離線進行。Furthermore, the setting of three or more divided blocks (first blocks) and the setting of one or more shared blocks (second blocks) can also be performed offline when the map data is created.
行走控制部15,根據由路徑產生部14產生的行走路徑R讓搬運車10行走。The
依據本實施形態的搬運車系統1及路徑產生系統6,藉由第1區塊設定部24設定分成3個以上的分割區塊B1a~B1e,藉由第2區塊設定部13設定共有區塊B2。亦即,行走區域A內全部的點P,屬於該等區塊之任一個區塊。藉由路徑產生部14,擷取分割區塊B1a~B1e當中出發地P
from所屬的分割區塊B1b(搬運出發地區塊)、目的地P
to所屬的分割區塊B1e(搬運目的地區塊)及共有區塊B所含的點P,從該等點中產生行走路徑R。如此般,在路徑產生時由路徑產生部14探索的區域(點P),不是行走區域A的全體(全點)而局限(限定)在一部分。如此,甚至在廣闊的行走區域A也能減輕路徑產生所需的負荷。
According to the transport vehicle system 1 and the path generation system 6 of the present embodiment, the first
共有區塊B2,是根據全搬運模式的模擬,以包含通過頻率高之點P的方式進行設定。如此,可根據實際環境而適切地設定共有區塊B2。The shared area B2 is set to include the point P with a high passing frequency based on the simulation of the full transport pattern. In this way, the shared area B2 can be appropriately set according to the actual environment.
第2區塊設定部13,是對搬運車10每一台所行走的行走路徑R個別地設定共有區塊B2。根據搬運車10而改變共有區塊B2,藉此可減少搬運車10彼此間發生干涉的頻率。The second
對分割區塊B1a~B1e的各個所含之點P的個數設定上限。如此,在路徑產生時路徑產生部14所探索的區域(點P)之個數減少,因此可進一步減輕路徑產生所需的負荷。An upper limit is set for the number of points P included in each of the divided blocks B1a to B1e. In this way, the number of areas (points P) to be searched by the
以上是針對本揭露的實施形態做說明,但本發明並不限定於上述實施形態。例如,根據行走區域A的構成(點P的個數及配置,路段S的個數、長度及配置)、以及行走區域A的大小(規模),3個以上的分割區塊(第1區塊)及1個或複數個共有區塊(第2區塊)能以不同的態樣進行設定。The above is an explanation of the embodiments of the present disclosure, but the present invention is not limited to the embodiments. For example, according to the structure of the walking area A (the number and arrangement of points P, the number, length and arrangement of road sections S), and the size (scale) of the walking area A, more than three divided blocks (first blocks) and one or more shared blocks (second blocks) can be set in different ways.
例如,可以如圖6所示之區塊設定X2那樣,在全體形成為L字形區塊狀且互相連結之5個分割區塊B1a~B1e中,設定將其中央連結成L字形的線狀之一條共有區塊B2。在此情況,共有區塊B2包含:分別與4個以上的路段S連接之複數個點P。也可以是,某台搬運車10設定這樣的共有區塊B2,另一方面,其他搬運車10設定其他的共有區塊(例如,與圖6之共有區塊B2位置錯開的區塊)。又在圖6以下的各圖中,省略點P的圖示,點P的位置以格子點的方式表現。For example, as shown in the block setting X2 in FIG. 6 , a shared block B2 may be set in which the five divided blocks B1a to B1e are connected to each other in an L-shaped block shape. In this case, the shared block B2 includes: a plurality of points P connected to four or more road sections S. Alternatively, a
又可以如圖7(a)所示的區塊設定X3那樣,由一條共有區塊B2將4個分割區塊B1a~B1d連接。也可以如圖7(b)所示的區塊設定X4那樣,由十字狀的共有區塊B2將4個分割區塊B1a~B1d連接。又可以如圖8(a)所示的區塊設定X5那樣,將區塊設定X3和X4組合,將各分割區塊和其他所有的分割區塊用共有區塊B2a,B2b連接。也可以如圖8(b)所示的區塊設定X6那樣,僅一部分的分割區塊和其他所有的分割區塊用共有區塊B2a,B2b連接。Alternatively, as in block setting X3 shown in FIG7(a), four partitioned blocks B1a to B1d may be connected by a common block B2. Alternatively, as in block setting X4 shown in FIG7(b), four partitioned blocks B1a to B1d may be connected by a cross-shaped common block B2. Alternatively, as in block setting X5 shown in FIG8(a), block settings X3 and X4 may be combined to connect each partitioned block to all other partitioned blocks with common blocks B2a and B2b. Alternatively, as in block setting X6 shown in FIG8(b), only a portion of the partitioned blocks may be connected to all other partitioned blocks with common blocks B2a and B2b.
也可以如圖9所示的區塊設定X7那樣,由共有區塊B2a將分割區塊B1a,B1b連接,其成為基礎部並由共有區塊B2b將4個分割區塊B1c~B1f連接。As in the block setting X7 shown in FIG. 9 , the divided blocks B1a and B1b may be connected by the shared block B2a, which serves as a base and the four divided blocks B1c to B1f may be connected by the shared block B2b.
在上述實施形態,針對由搬運車控制器20和搬運車10協作來產生從出發地P
from往目的地P
to的行走路徑R之態樣做說明。然而,也可以僅由搬運車控制器20、或僅由設置於搬運車10的控制器、或僅由與搬運車控制器20及搬運車10分開設置的控制器來產生行走路徑R。也可以由搬運車控制器20和其他控制器協作來產生行走路徑R,也可以由設置於搬運車10的控制器和其他控制器協作來產生行走路徑R。
In the above-mentioned embodiment, the description is made of a mode in which the
搬運車系統1也可以僅具備1台搬運車10,路徑產生系統6產生那1台搬運車10的行走路徑R。搬運車10並不限定於AGV,也可以是例如高架行走車及有軌道台車等。The transport vehicle system 1 may include only one
本發明的構成要件可記載如下。 [1] 一種路徑產生系統,係產生用於讓1台或複數台搬運車在行走區域從出發地行走到目的地的路徑, 該路徑產生系統具備:產生前述搬運車所行走的前述路徑之控制器, 前述行走區域具有:前述搬運車可通過及停止之複數個點, 前述控制器, 對前述複數個點,設定分成3個以上的第1區塊、及與前述第1區塊連接之第2區塊, 擷取搬運出發地區塊、搬運目的地區塊及前述第2區塊所含的前述點,該搬運出發地區塊係前述第1區塊當中前述出發地所屬的1個第1區塊,該搬運目的地區塊係前述第1區塊當中前述目的地所屬的1個第1區塊,從所擷取的前述點中產生前述路徑。 [2] 如[1]所記載的路徑產生系統,其中, 前述第2區塊,係根據全搬運模式的模擬,以包含通過頻率高之點的方式進行設定。 [3] 如[1]或[2]所記載的路徑產生系統,其中, 前述控制器,對於複數台前述搬運車的每一台所行走的前述路徑個別地設定前述第2區塊。 [4] 如[1]~[3]之任一者所記載的路徑產生系統,其中, 對前述第1區塊的每一個所含之前述點的個數設定上限。 [5] 如[1]~[4]之任一者所記載的路徑產生系統,其中, 在前述行走區域內之前述複數個點當中之至少1個點,與只有3條以下的通路連接, 前述第2區塊包含該至少1個點。 [6] 如[1]~[4]之任一者所記載的路徑產生系統,其中, 前述第2區塊包含:分別與4條以上的通路連接之複數個點。 The constituent elements of the present invention can be described as follows. [1] A path generation system generates a path for one or more transport vehicles to travel from a starting point to a destination in a travel area. The path generation system comprises: a controller for generating the path along which the transport vehicle travels. The travel area has: a plurality of points at which the transport vehicle can pass and stop. The controller. For the plurality of points, a first block divided into three or more and a second block connected to the first block are set. The transport departure block, the transport destination block and the aforementioned points included in the aforementioned second block are captured, the transport departure block being a first block to which the aforementioned departure point belongs among the aforementioned first blocks, and the transport destination block being a first block to which the aforementioned destination belongs among the aforementioned first blocks, and the aforementioned path is generated from the captured aforementioned points. [2] The path generation system as described in [1], wherein, the aforementioned second block is set in a manner to include points with a high passing frequency based on a simulation of a full transport pattern. [3] A path generation system as described in [1] or [2], wherein: the controller sets the second block individually for the path traveled by each of the plurality of transport vehicles. [4] A path generation system as described in any one of [1] to [3], wherein: an upper limit is set for the number of the aforementioned points contained in each of the aforementioned first blocks. [5] A path generation system as described in any one of [1] to [4], wherein: at least one point among the aforementioned plurality of points in the aforementioned travel area is connected to no more than three paths, and the second block includes the at least one point. [6] A path generation system as described in any one of [1] to [4], wherein the aforementioned second block includes: a plurality of points connected to four or more paths respectively.
1:搬運車系統(無人搬運車系統) 5:上位控制器 6:路徑產生系統 10:搬運車(無人搬運車) 11:搬運指令接收部 12:區域資訊取得部 13:第2區塊設定部 14:路徑產生部 15:行走控制部 20:搬運車控制器 21:搬運要求接收部 23:資訊取得部 24:第1區塊設定部 25:分配決定部 A:行走區域 B1a,B1b,B1c,B1d,B1e,B1f:分割區塊(第1區塊) B2:共有區塊(第2區塊) P:點 P from:出發地 P to:目的地 R:行走路徑 R1b:搬運出發地路徑 R1e:搬運目的地路徑 R2:共有路徑 S:路段(通路) 1: Transport vehicle system (automatic transport vehicle system) 5: Host controller 6: Path generation system 10: Transport vehicle (automatic transport vehicle) 11: Transport instruction receiving unit 12: Area information acquisition unit 13: Second block setting unit 14: Path generation unit 15: Travel control unit 20: Transport vehicle controller 21: Transport request receiving unit 23: Information acquisition unit 24: First block setting unit 25: Allocation determination unit A: Travel area B1a, B1b, B1c, B1d, B1e, B1f: Divided block (first block) B2: Shared block (second block) P: Point P from : Starting point P to :Destination R: Walking path R1b: Transportation departure path R1e: Transportation destination path R2: Total path S: Section (access)
[圖1]係運用本揭露的路徑產生系統之無人搬運車系統的全體概要圖。 [圖2(a)]係顯示行走區域(行走路線),[圖2(b)]係抽取行走區域的一單位來顯示。 [圖3]係顯示一實施形態的控制器的功能構成之功能方塊圖。 [圖4]係藉由控制器所設定之複數個第1區塊及1個第2區塊之說明圖。 [圖5]係在路徑產生時藉由控制器所探索的區域之說明圖。 [圖6]係顯示第1變形例之行走區域和第1及第2區塊。 [圖7(a)]及[圖7(b)]分別顯示第2及第3變形例之行走區域和第1及第2區塊。 [圖8(a)]及[圖8(b)]分別顯示第4及第5變形例之行走區域和第1及第2區塊。 [圖9]係顯示第6變形例之行走區域和第1及第2區塊。 [FIG. 1] is a general diagram of an unmanned transport vehicle system using the path generation system disclosed herein. [FIG. 2(a)] shows a walking area (walking route), and [FIG. 2(b)] shows a unit of the walking area extracted for display. [FIG. 3] is a functional block diagram showing the functional configuration of a controller of an implementation form. [FIG. 4] is an explanatory diagram of a plurality of first blocks and a second block set by the controller. [FIG. 5] is an explanatory diagram of an area explored by the controller when a path is generated. [FIG. 6] shows the walking area and the first and second blocks of the first variant. [FIG. 7(a)] and [FIG. 7(b)] show the walking area and the first and second blocks of the second and third variants, respectively. [Figure 8(a)] and [Figure 8(b)] show the walking area and the 1st and 2nd blocks of the 4th and 5th variants, respectively. [Figure 9] shows the walking area and the 1st and 2nd blocks of the 6th variant.
A:行走區域 A: Walking area
B1b,B1e:分割區塊(第1區塊) B1b, B1e: Split block (block 1)
B2:共有區塊(第2區塊) B2: Shared block (block 2)
Pfrom:出發地 P from : departure place
Pto:目的地 P to : destination
R:行走路徑 R: Walking path
R1b:搬運出發地路徑 R1b: Transportation departure route
R1e:搬運目的地路徑 R1e: Transport destination path
R2:共有路徑 R2: Shared path
X1:區塊設定 X1: Block settings
3001,3101,3201,3203,3304,3402,3405,3501,3504,3602,3605,3701,3704,3802,3805,3903,3904,3905,3906,3907,4001,4002,4003:點 3001,3101,3201,3203,3304,3402,3405,3501,3504,3602,3605,3701,3704,3802,3805,3903,3904,3905,3906,3907,4001,4002,4003: points
Claims (6)
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2023-097995 | 2023-06-14 |
Publications (1)
Publication Number | Publication Date |
---|---|
TW202501192A true TW202501192A (en) | 2025-01-01 |
Family
ID=
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP3254059B1 (en) | Apparatus and method for navigation path compensation | |
JP7397181B2 (en) | Method and device for controlling automated guided vehicles | |
US20190185265A1 (en) | Method and system for automated transport of items | |
RU2542932C1 (en) | Perfected procedure and system for processing of info of maps for navigation of industrial vehicles | |
CN110356760B (en) | Control method and device based on transfer robot | |
US11468770B2 (en) | Travel control apparatus, travel control method, and computer program | |
CN113406951A (en) | Travel control device, travel control method, and computer program | |
JP2024020457A (en) | Information processing device, information processing method, computer program and information processing system | |
JP7598497B2 (en) | Driving control device, driving control method, and computer program | |
CN113467449A (en) | Fleet control method and device, electronic equipment and storage medium | |
CN118753699B (en) | Intelligent warehousing multi-layer robot system based on cloud-edge collaboration | |
TW202501192A (en) | Path Generation System | |
WO2024257464A1 (en) | Route generation system | |
KR20230116883A (en) | Systems and methods for managing movement of material handling vehicles | |
CN112748730B (en) | Travel control device, travel control method, travel control system, and computer program | |
JP7514874B2 (en) | Information processing method, information processing device, and program | |
JP7596576B1 (en) | Information processing device, information processing method, and program | |
JP7511598B2 (en) | Information processing method, information processing device, and program | |
JP2023136223A (en) | Information processing device, movement control system, information processing method and program | |
WO2022190505A1 (en) | Control device and transport system |