JP2013035670A - Guided vehicle system - Google Patents

Guided vehicle system Download PDF

Info

Publication number
JP2013035670A
JP2013035670A JP2011174230A JP2011174230A JP2013035670A JP 2013035670 A JP2013035670 A JP 2013035670A JP 2011174230 A JP2011174230 A JP 2011174230A JP 2011174230 A JP2011174230 A JP 2011174230A JP 2013035670 A JP2013035670 A JP 2013035670A
Authority
JP
Japan
Prior art keywords
transport vehicle
eviction
destination
transport
vehicle
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
JP2011174230A
Other languages
Japanese (ja)
Inventor
Shiro Kuwata
城 桑田
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Murata Machinery Ltd
Original Assignee
Murata Machinery Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Murata Machinery Ltd filed Critical Murata Machinery Ltd
Priority to JP2011174230A priority Critical patent/JP2013035670A/en
Publication of JP2013035670A publication Critical patent/JP2013035670A/en
Pending legal-status Critical Current

Links

Images

Landscapes

  • Warehouses Or Storage Devices (AREA)

Abstract

PROBLEM TO BE SOLVED: To enable execution of push-out without performing unnecessary push-out travel.SOLUTION: A guided vehicle 10 travels in a predetermined travel route under control of a controller 14. The controller recognizes the present position of the guided vehicle, the presence or absence of a movement command, and a destination of the guided vehicle having the movement command. The controller detects a second guided vehicle that has no movement command and is located within a predetermined range from the present position of a first guided vehicle having the movement command and within a push-out range that does not exceed the destination, and determines a push-out destination. The controller also detects a third guided vehicle that has no movement command and is located within a range from the present position of the second guided vehicle to the push-out destination, and determines the push-out destination. The controller determines whether the third guided vehicle can arrive at the push-out destination ahead and the second guided vehicle can arrive at the push-out destination ahead except for the third guided vehicle. When it is determined that they can arrive ahead, the controller commands the second guided vehicle and third guided vehicle to move to the push-out destination.

Description

この発明は搬送車システムに関し、特に走行ルートを空けるための追い出しに関する。   The present invention relates to a transport vehicle system, and more particularly, to a drive-out for making a travel route.

搬送車を目的地まで走行させるには、途中で停止している他の搬送車等を目的地までの走行ルートから追い出す必要がある。このような処理を追い出しと呼び、例えば特許文献1(JPH11-143537A)は合流部等のブロッキング範囲からの追い出しを開示している。発明者は、追い出しを実行するタイミングが重要であることに着目した。例えば追い出す必要がある搬送車を検出すると、直ちに追い出しを実行するものとする。しかし追い出された搬送車が追い出し先の位置まで移動できないと、走行ルートを空けることにはならない。この場合の追い出しは無駄である。また追い出し先の位置が不適切な場合は、不要な移動を行うことになる。追い出しを効率的に実行するため、追い出しに関係する搬送車の走行をシミュレーションすることも可能である。しかしシミュレーションはコントローラの負担が大きい。   In order for the transport vehicle to travel to the destination, it is necessary to drive off other transport vehicles that are stopped on the way from the travel route to the destination. Such processing is called eviction. For example, Patent Document 1 (JPH11-143537A) discloses eviction from a blocking range such as a merging portion. The inventor noticed that the timing of executing the eviction is important. For example, when a transport vehicle that needs to be ejected is detected, the vehicle is immediately ejected. However, if the transported vehicle is not able to move to the destination position, the travel route is not freed. The eviction in this case is useless. In addition, if the position of the eviction destination is inappropriate, unnecessary movement is performed. In order to efficiently execute the eviction, it is possible to simulate the traveling of the transport vehicle related to the eviction. However, simulation is a heavy burden on the controller.

JPH11-143537AJPH11-143537A

この発明の課題は、シミュレーション等の複雑な処理を行わずに、かつ丁度必要な時に追い出しを実行することにある。
この発明の補助的な課題は、周回ルートでの追い出し先の位置の選択範囲を拡げることにある。
An object of the present invention is to execute eviction when it is necessary without performing complicated processing such as simulation.
An auxiliary problem of the present invention is to expand the selection range of the position of the eviction destination on the circulation route.

この発明は、予め定められた走行ルートを走行する複数の搬送車と、複数の搬送車を制御するコントローラとを備え、かつ搬送車が目的地まで走行できるように他の搬送車を目的地までの走行ルートから追い出す搬送車システムに関する。
この発明では、コントローラは、
複数の搬送車の現在位置を把握する現在位置把握手段、例えば実施例の搬送車ファイルと、
搬送車への移動指令の有無を把握する指令把握手段、例えば実施例の搬送指令ファイルと、
移動指令を有する搬送車の目的地を把握する目的地把握手段、例えば実施例の搬送指令ファイル、とを備えている。
コントローラは、
移動指令を有する第1の搬送車の現在位置から所定の範囲内で、かつ目的地を越えない追い出し範囲内に位置し、移動指令を有さない第2の搬送車を検出して追い出し先(実施例での追い出し位置)を決定すると共に、前記第2の搬送車の現在位置から追い出し先までの範囲内に位置し、かつ移動指令を有さない第3の搬送車を検出して追い出し先を決定する追い出し位置決定手段、例えば実施例の追い出し制御部と、
前記第3の搬送車が追い出し先へ先着でき、かつ前記第2の搬送車が、前記第3の搬送車を除いて、追い出し先へ先着できるか否かを判断する先着判断手段、例えば実施例の追い出し制御部を備えて、
先着できると判断された場合に、前記第2の搬送車及び前記第3の搬送車に追い出し先への移動を指令する。
The present invention includes a plurality of transport vehicles that travel on a predetermined travel route, and a controller that controls the plurality of transport vehicles, and allows other transport vehicles to reach the destination so that the transport vehicle can travel to the destination. The present invention relates to a transport vehicle system that is driven out from the travel route.
In this invention, the controller
Current position grasping means for grasping the current positions of a plurality of transport vehicles, for example, the transport vehicle file of the embodiment,
Command grasping means for grasping the presence or absence of a movement command to the transport vehicle, for example, a transport command file of the embodiment,
Destination grasping means for grasping the destination of the transport vehicle having the movement command, for example, a transport command file of the embodiment is provided.
The controller
A second transport vehicle that is located within a predetermined range from the current position of the first transport vehicle having the movement command and that does not exceed the destination and that does not have the movement command is detected and driven ( In the embodiment, and a third conveyance vehicle that is located within the range from the current position of the second conveyance vehicle to the displacement destination and that does not have a movement command is detected and the displacement destination is detected. Evicting position determining means for determining, e.g., evicting control unit of the embodiment;
First arrival judging means for judging whether or not the third transport vehicle can arrive first at the destination, and whether the second transport vehicle can arrive first at the destination except for the third transport vehicle, for example, the embodiment. With an expulsion controller
When it is determined that the first arrival can be made, the second transportation vehicle and the third transportation vehicle are instructed to move to the ejection destination.

この発明では、第2の搬送車を追い出すために第3の搬送車を検出して追い出しを制御するので、追い出しが必要な搬送車が連鎖的に増えても処理できる。また追い出し先へ先着できると判断するまでは追い出しを指令しないので、追い出し先まで追い出すことができないのに、追い出しを指令することがないので、省エネルギーである。なお先着できるか否かは搬送車毎に判断し、第3の搬送車が存在しない場合、第3の搬送車への処理は不要である。この発明では、シミュレーション等の複雑な処理を行わずに、丁度適切な時点で、追い出しを指令できる。   In the present invention, since the third conveyance vehicle is detected and the displacement is controlled in order to expel the second conveyance vehicle, processing can be performed even if the number of conveyance vehicles that need to be displaced increases. Further, since it is not instructed to eject until it is determined that it can arrive first at the destination, it is not possible to eject to the destination but it is not instructed to save the energy. Whether or not the vehicle can be arrived first is determined for each conveyance vehicle, and when the third conveyance vehicle does not exist, the processing to the third conveyance vehicle is unnecessary. According to the present invention, it is possible to command eviction at an appropriate time without performing complicated processing such as simulation.

好ましくは、前記第1の搬送車の現在位置から見て、合流部の下流側に位置する第2の搬送車及び第3の搬送車に対して、第1の搬送車が合流部の通過を前記コントローラから許可されるまで、追い出し先へ先着できるか否かの判断に係わらず、追い出し先への移動を指令しないようにする。合流部の通過を許可されるまでは合流部の下流側の搬送車を追い出す必要はないので、合流部の通過を許可されるのを待って追い出し先への移動を指令すると、丁度必要なときに追い出しを実行できる。   Preferably, when viewed from the current position of the first transport vehicle, the first transport vehicle passes through the merge portion with respect to the second transport vehicle and the third transport vehicle located on the downstream side of the merge portion. Until permitted by the controller, no movement to the eviction destination is commanded regardless of whether it is possible to arrive at the eviction destination. Since it is not necessary to drive out the transport vehicle downstream from the junction until it is allowed to pass through the junction, it is necessary to wait for the passage through the junction to move to the destination. You can run out.

また好ましくは、前記第1の搬送車が周回ルートを走行する際に、前記第2及び第3の搬送車の追い出し先として、第1の搬送車の現在位置及びその下流側で目的地よりも上流側の位置を指定自在にする。このようにすると、第1の搬送車が目的地までに周回ルートをほぼ一周する場合でも、周回ルート内に追い出し先を指定できる。   Further preferably, when the first transport vehicle travels on a round route, the second and third transport vehicles are driven away from the current position of the first transport vehicle and the downstream side of the destination. The upstream position can be specified freely. In this way, even when the first transport vehicle makes a round of the round route to the destination, the eviction destination can be specified in the round route.

実施例の搬送車システムのレイアウトを示す図The figure which shows the layout of the carrier system of an Example 実施例でのコントローラのブロック図Block diagram of the controller in the embodiment 実施例での追い出し制御アルゴリズムを示すフローチャートThe flowchart which shows the eviction control algorithm in an Example 実施例での追い出しの基本的な例を示す図で、1)で搬送車Aのための追い出し範囲を決定し、2)で搬送車B,Cの追い出し位置を仮に決定し、3)で搬送車Cが追い出し位置に先着できることと、追い出し位置が搬送車Bのための拡張追い出し範囲に含まれることとから、搬送車Cの追い出し位置をポイントP2へ変更し、4)で搬送車B,Cに追い出しの実行を指令する。In the figure showing a basic example of eviction in the embodiment, 1) determine the eviction range for conveyance vehicle A, 2) tentatively determine the eviction position of conveyance vehicles B and C, and 3) conveyance Since vehicle C can arrive first at the eviction position and the eviction position is included in the extended eviction range for conveyance vehicle B, change the eviction position of conveyance vehicle C to point P2, and in 4) conveyance vehicles B and C Command to run out. 合流部が追い出し範囲に含まれる際の処理を示し、1)で搬送車A,B各々の追い出し範囲を決定し、2)で搬送車Cの追い出し位置を追い出し範囲外のポイントP1へ決定する。The process when the joining portion is included in the eviction range is shown. In 1), the eviction range of each of the transport vehicles A and B is determined, and in 2) the eviction position of the transport vehicle C is determined as a point P1 outside the eviction range. 合流部が追い出し範囲に含まれる他の例を示し、1)で搬送車A,Bのための強制追い出し範囲を決定し、2)では搬送車Bが先に合流部を通過し、3)では搬送車Cが先に合流部を通過するので、搬送車Bの追い出し範囲に入り、追い出し先のポイントP4にいる搬送車Dを追い出す。Another example where the merging part is included in the eviction range is shown in 1), the forced eviction range for the vehicles A and B is determined in 1), in 2) the trolley B passes the merging portion first, and in 3) Since the transport vehicle C first passes through the junction, the transport vehicle B enters the eviction range of the transport vehicle B and expels the transport vehicle D at the point P4 of the eviction destination. 周回ルートでの追い出しの例を示し、1)で搬送車Aの1周目の強制追い出し範囲を決定し、2)で搬送車Bは搬送車Aの2周目の強制追い出し範囲内のポイントP2を追い出し位置とし、3)で搬送車A,Bは移動を完了する。An example of eviction on the lap route is shown. In 1), the forced eviction range for the first lap of transport vehicle A is determined, and in 2), the transport vehicle B is point P2 in the forced eviction range for the second lap of transport vehicle A. In step 3), transport vehicles A and B complete their movement. 分岐部を利用した追い出し位置の振り替えを示し、1)で搬送車B,Cが搬送車Aのための追い出し範囲に所在し、2)で搬送車B,Cの追い出し位置をポイントP2,P3へ分散させる。The transfer of the eviction position using the bifurcation is shown. In 1), the vehicles B and C are located in the eviction range for the vehicle A, and in 2) the eviction positions of the vehicles B and C are moved to the points P2 and P3. Disperse.

以下に本発明を実施するための最適実施例を示す。この発明の範囲は、特許請求の範囲の記載に基づき、明細書の記載とこの分野での周知技術とを参酌し、当業者の理解に従って定められるべきである。   In the following, an optimum embodiment for carrying out the present invention will be shown. The scope of the present invention should be determined according to the understanding of those skilled in the art based on the description of the scope of the claims, taking into account the description of the specification and well-known techniques in this field.

図1〜図8に実施例を示す。実施例は地上を無軌道で走行する無人搬送車を例とするが、搬送車は天井走行車もしくは有軌道台車でもよい。また搬送車の位置はポイント単位で管理するが、ポイントに代えて、走行ルートに沿った座標等で管理しても良い。実施例ではポイントを単位として搬送車の位置を管理するので、搬送車が新たなポイントへ移動する毎に現在位置としてポイント番号を報告する。これに対して座標で搬送車の位置を管理する場合、例えば所定の時間間隔で搬送車が現在位置を報告する。さらに実施例では、合流部を搬送車が通過する場合、地上側のコントローラによるブロッキング制御により、合流部の通過を許可する。特に複数の搬送車が同じ合流部を通過しようとする場合、ブロッキングの許可により合流部を搬送車が通過する順序を定める。ブロッキング制御に代えて、搬送車間での自発的な通信により、合流部を通過する順序を定めても良い。   1 to 8 show an embodiment. In the embodiment, an automatic guided vehicle traveling on the ground without a track is taken as an example, but the transported vehicle may be an overhead traveling vehicle or a tracked carriage. Further, the position of the transport vehicle is managed in units of points, but instead of the points, it may be managed by coordinates or the like along the travel route. In the embodiment, since the position of the transport vehicle is managed in units of points, the point number is reported as the current position every time the transport vehicle moves to a new point. On the other hand, when managing the position of the transport vehicle using coordinates, for example, the transport vehicle reports the current position at predetermined time intervals. Furthermore, in an Example, when a conveyance vehicle passes a junction part, the passage of a junction part is permitted by the blocking control by the controller on the ground side. In particular, when a plurality of transport vehicles try to pass the same junction, the order in which the transport vehicles pass through the junction is determined by permission of blocking. Instead of blocking control, the order of passing through the merging portion may be determined by spontaneous communication between transport vehicles.

各図において、2は搬送車システムで、4はその走行ルートであり、工場の建屋内、クリーンルームの内部などに配置されている。走行ルート4は合流部6と分岐部8とを備え、これらの内、合流部6に対しブロッキング制御を行う。また十字路状に構成されて、合流と分岐の双方が可能な個所があり、この個所にもブロッキング制御を行う。搬送車10が合流部等を通過する場合、地上側に固定のコントローラ14に合流部等を通行する許可を求め、このことをブロッキング要求と呼ぶ。ブロッキング要求に対して、通行が許可されることをブロッキングの許可と呼び、ブロッキングが許可されると合流部等を通過する。このようにして合流部6等で複数の搬送車10が互いに干渉することを防止する。合流部等よりも以遠(合流部等よりも下流側)の追い出しは、搬送車がブロッキング許可を得た時点で開始する。なお分岐部8にもブロッキング制御を行う場合、分岐部以遠の追い出しは、搬送車が分岐部に対するブロッキング許可を得た時点で開始する。   In each figure, 2 is a transport vehicle system, and 4 is a travel route thereof, which is arranged in a factory building, a clean room, or the like. The traveling route 4 includes a merging portion 6 and a branching portion 8, and of these, blocking control is performed on the merging portion 6. In addition, there is a portion that is configured like a cross road and can be merged and branched, and blocking control is also performed at this portion. When the transport vehicle 10 passes through a junction, etc., permission is given to the controller 14 fixed on the ground side to pass the junction, etc., and this is called a blocking request. In response to a blocking request, permission to pass is referred to as blocking permission, and when blocking is permitted, it passes through a junction or the like. In this way, the plurality of transport vehicles 10 are prevented from interfering with each other at the junction 6 or the like. Expulsion beyond the junction (such as downstream from the junction) begins when the transport vehicle obtains blocking permission. When blocking control is also performed on the branching unit 8, the eviction beyond the branching unit starts when the transport vehicle obtains a blocking permission for the branching unit.

走行ルート4に沿ってロードポート12が多数設けられ、搬送車10はロードポート12間で荷物を搬送する。ロードポート12は工作機械への荷物の出し入れ口、自動倉庫のステーション、ストッカのステーションなどである。ロードポート12以外にバッファを設けて、バッファとロードポート間などで荷物を搬送しても良い。図1のPはポイントで、走行ルート4上に位置をポイント単位で管理する。   A number of load ports 12 are provided along the travel route 4, and the transport vehicle 10 transports the cargo between the load ports 12. The load port 12 is a loading / unloading port for a machine tool, an automatic warehouse station, a stocker station, and the like. A buffer may be provided in addition to the load port 12, and the package may be transported between the buffer and the load port. P in FIG. 1 is a point, and the position on the travel route 4 is managed in points.

図2はコントローラ14の構成を示し、コントローラ14は通信部15を備えて複数台の搬送車10の車載コントローラと通信する。搬送車10の制御は車載コントローラが行い、以下では車載コントローラによる処理であることを省略して、「搬送車は…する」等と記載する。搬送車10は、新たなポイントに到着した、荷物を荷積みした、荷物を荷下ろしした、電池の充電量が不足し、充電ステーションへの走行が必要になった、などの状態の変化が起こる都度、コントローラ14へ自己が所在するポイント番号、自己の状態の変化等を報告する。コントローラ14は、通信部15から搬送車10に対し、搬送指令を割り付け、他にブロッキングに関する指令と追い出しに関する指令、配車に関する指令等を通信する。   FIG. 2 shows a configuration of the controller 14. The controller 14 includes a communication unit 15 and communicates with the in-vehicle controllers of the plurality of transport vehicles 10. Control of the transport vehicle 10 is performed by the in-vehicle controller, and hereinafter, processing by the in-vehicle controller is omitted, and “the transport vehicle performs” is described. The state of the transport vehicle 10 has changed such as arrival at a new point, loading of a load, unloading of a load, insufficient charge of a battery, traveling to a charging station, etc. Each time, the controller 14 reports the point number where it is located, the change in its own state, and the like. The controller 14 assigns a conveyance command from the communication unit 15 to the conveyance vehicle 10, and communicates a blocking command, a command regarding eviction, a command regarding vehicle allocation, and the like.

コントローラ14はメモリを備えて、ファイル16〜24を記憶する。搬送車ファイル16は、個々の搬送車10毎のその位置(所在するポイント番号)、搬送車の状態、目的地などのデータからなる。搬送車の状態には、搬送指令の割付の有無と割付済みの搬送指令のID、目的地、などがある。搬送指令ファイル18は、搬送指令とその実行状況のデータからなり、実行状況には未割付、割付済み、実行完了などがある。ルートマップ20は走行ルート4のレイアウトデータからなるファイルで、ブロッキングデータファイル22は、合流部毎のブロッキング要求の有無とブロッキングの許可状況とのデータからなるファイルである。ブロッキング要求は例えばブロッキングを要求した搬送車のIDで示され、ブロッキングの許可はブロッキングを許可した搬送車のIDで示される。なお搬送車が合流部等を通過してブロッキングを解除すると、ブロッキング要求とブロッキング許可に関するデータを抹消し、図示しないログファイルにデータを移す。   The controller 14 includes a memory and stores the files 16 to 24. The transport vehicle file 16 includes data such as the position (point number where the transport vehicle 10 is located), the state of the transport vehicle, and the destination for each transport vehicle 10. The state of the transport vehicle includes presence / absence of assignment of the transport command, ID of the transport command already assigned, destination, and the like. The conveyance command file 18 includes a conveyance command and execution status data. The execution status includes unallocated, allocated, and execution completion. The route map 20 is a file composed of layout data of the travel route 4, and the blocking data file 22 is a file composed of data on the presence / absence of a blocking request for each merging portion and the blocking permission status. The blocking request is indicated by, for example, the ID of a transport vehicle that has requested blocking, and the blocking permission is indicated by the ID of a transport vehicle that has permitted blocking. When the transport vehicle passes through the junction or the like and cancels the blocking, the data relating to the blocking request and the blocking permission is deleted, and the data is transferred to a log file (not shown).

追い出しファイル24は、搬送車毎の追い出しに関するデータのファイルである。追い出しでは、搬送、配車、充電などの、追い出し以外の移動指令を割り付けられた搬送車が移動できるように、走行ルートから移動指令を割り付けられていない他の搬送車を追い出す。他の搬送車を追い出す範囲が追い出し範囲である。搬送車を追い出す先のポイント(追い出し位置)が他の搬送車に占められている場合、追い出し範囲を拡げる必要がある。このようにして拡張した追い出し範囲を拡張追い出し範囲とする。強制追い出し範囲は、追い出し以外の処理を行う搬送車が移動するために追い出しが必要な範囲である。追い出しファイル24は、強制追い出し範囲内に存在する他の搬送車のリストを含んでいる。追い出しファイル24では、強制追い出し範囲内の他の搬送車に対し追い出しを指令し、強制追い出し範囲から追い出すための走行を開始させる。追い出しを指令された搬送車は、追い出しファイル24のリストから消去する。   The eviction file 24 is a data file related to eviction for each transport vehicle. In eviction, other conveyance vehicles that are not assigned a movement command are expelled from the travel route so that a conveyance vehicle assigned a movement command other than eviction, such as conveyance, dispatch, and charging, can move. The range that drives out other transport vehicles is the drive-out range. When the point (push-out position) to be driven out of the transport vehicle is occupied by another transport vehicle, it is necessary to expand the drive-out range. The extended eviction range thus expanded is set as an extended eviction range. The forced eviction range is a range where eviction is necessary because the transport vehicle that performs processing other than eviction moves. The eviction file 24 includes a list of other transport vehicles existing within the forced eviction range. In the eviction file 24, the other fleet in the forced eviction range is instructed to be evacuated, and the running for eviction from the forced eviction range is started. The transport vehicle that is instructed to be purged is deleted from the list of the eviction file 24.

搬送制御部26は搬送指令を搬送車10に割り当て、その実行状況を管理する。ブロッキング制御部28は合流部等でのブロッキングを制御し、具体的には搬送車10からのブロッキング要求を受け付けて、所定の基準によりブロッキングを許可する。追い出し制御部30は、搬送、配車、充電、追い出しのための搬送車10の移動を妨げる、他の搬送車を検出して、追い出しを制御する。追い出す範囲は搬送車10の現在地から目的地までの全域としても良く、あるいは現在地から所定のポイント数離れた位置までの区間、あるいは現在値から次の合流部等の手前などと制限しても良い。追い出す範囲を制限するのは、目的地が遠い場合に、不必要に広い範囲で追い出しを行わないためである。追い出し先への移動を指令するのは、追い出される搬送車が追い出し先へ先着できると判断した時点で、先着できない場合は、移動を指令しない。配車制御部31は、空の搬送車10が走行ルート上で、渋滞を避け、かつ発生した荷物を速やかに荷積みできるように分布するように、空の搬送車を移動させる。コントローラ14は、これ以外に搬送車10の充電を制御する充電制御部等を備えている。   The transport control unit 26 assigns a transport command to the transport vehicle 10 and manages its execution status. The blocking control unit 28 controls blocking at the merging unit or the like. Specifically, the blocking control unit 28 receives a blocking request from the transport vehicle 10 and permits blocking according to a predetermined standard. The eviction control unit 30 controls the eviction by detecting another conveyance vehicle that hinders the movement of the conveyance vehicle 10 for conveyance, dispatch, charging, and eviction. The range to be expelled may be the entire area from the current location of the transport vehicle 10 to the destination, or may be limited to a section from the current location to a position away from the current location by a predetermined number of points, or just before the next junction from the current value. . The reason for limiting the expelling range is that the expulsion is not performed in an unnecessarily wide range when the destination is far away. The movement to the displacement destination is instructed when it is determined that the transported vehicle to be ejected can arrive first at the displacement destination, and the movement is not instructed when it is not possible to arrive first. The vehicle allocation control unit 31 moves the empty transport vehicle 10 so that the empty transport vehicle 10 is distributed on the travel route so as to avoid traffic congestion and quickly load the generated load. In addition to this, the controller 14 includes a charge control unit that controls charging of the transport vehicle 10.

図3に追い出し制御のアルゴリズムを示し、追い出し制御は、搬送車の現在位置などの状態に変化が生じる毎、もしくは所定時間毎などに実行する。追い出し制御では搬送車毎の強制追い出し範囲を決定し、強制追い出し範囲内の他の搬送車を追い出すことに伴い必要となる拡張追い出し範囲を決定する。追い出し対象リストは、強制追い出し範囲内に所在し、かつ追い出し範囲外に目的地を持たない他の搬送車をリストする。追い出し位置の決定では、追い出し対象の搬送車を追い出す先(追い出し先のポイント)を追い出し位置として決定する。追い出し位置は、追い出しに伴う移動距離を最短とするため、好ましくは強制追い出し範囲の次のポイントとするが、次の次のポイント、あるいは荷積み等の要求の発生頻度が高いポイントなどでもよい。   FIG. 3 shows an algorithm for the eviction control. The eviction control is executed every time a change occurs in the state such as the current position of the transport vehicle or every predetermined time. In the eviction control, a forced eviction range is determined for each conveyance vehicle, and an extended eviction range that is required in accordance with the eviction of other conveyance vehicles within the forced eviction range is determined. The eviction target list lists other transport vehicles that are within the forced eviction range and do not have a destination outside the eviction range. In the determination of the eviction position, the destination to be driven out (the point of the eviction destination) is determined as the eviction position. The expulsion position is preferably the next point in the forced expulsion range in order to minimize the movement distance associated with the expulsion, but may be the next next point or a point where the frequency of requests such as loading is high.

ループ状の走行ルートを走行する場合、1周目の走行と2周目の走行とを区別することにより、追い出し位置の候補が増す。これによって、搬送車の現在位置及びその下流側で目的地よりも上流側の位置が、追い出し位置として指定自在になる。またループ状の走行ルート以外でも、複数の追い出し位置が可能な場合、追い出し位置を振り替えること、及び追い出し位置が分散するように選択することにより、追い出しに伴う移動距離を短縮すると共に、搬送車が走行ルート上に分散するように追い出すことができる。   When traveling on a looped travel route, the candidates for the eviction position are increased by distinguishing between the first lap and the second lap. As a result, the current position of the transport vehicle and the position on the downstream side and the upstream side of the destination can be designated as the eviction position. In addition, when a plurality of eviction positions are possible other than the looped travel route, by changing the eviction position and selecting the eviction positions to be dispersed, the movement distance associated with the eviction is shortened and the transport vehicle is It can be expelled to be distributed on the driving route.

先着判断では、追い出し位置へ追い出された搬送車が先着できるかどうか、即ち追い出し位置へ他の搬送車よりも先に到着できるかどうかを判断し、先着できる際に追い出し指令を搬送車に送信する。言い換えると搬送車が追い出し位置に先着できるようになるまで、追い出しは実行しない。なお単に追い出し位置を通過するに過ぎない搬送車、即ち追い出し位置よりも遠方の目的地を持つ搬送車は、先着判断の対象とはしない。実施例では、搬送車の現在位置から先着できるかどうかを判断するが、追い出し位置までの走行距離、平均の所要時間等を比較して、先着できるかどうかを判断しても良い。追い出し位置に先着できる際に追い出しを実行することにより、無駄な渋滞等を防止し、また搬送車の移動回数を減らしてエネルギー消費量を少なくする。先着できると判断されるまでの間、空荷の搬送車がロードポートに面した位置で待機すると、ロードポートに荷積み物品が出現した場合に、直ちに荷積みできるとの利点もある。なお先着できないと判断される状態が所定時間以上続くと走行ルートを塞ぐ。そこでこのような場合、例えば追い出し位置を手前の位置へ変更したうえで先着判断を行い、先着できると判断される場合に移動を指令しても良い。あるいはまたこのような場合は先着判断を省略し、前方の搬送車との間を詰めるように移動を指令しても良い。   In the first arrival determination, it is determined whether the transported vehicle that has been ejected to the ejection position can arrive first, that is, whether it can arrive before the other transport vehicle at the ejection position, and when the first arrival can be performed, the ejection command is transmitted to the transportation vehicle. . In other words, the eviction is not executed until the transport vehicle can arrive at the eviction position first. It should be noted that a transport vehicle that simply passes through the eviction position, that is, a transport vehicle having a destination farther than the eviction position is not subject to first arrival determination. In the embodiment, it is determined whether or not the first position can be reached from the current position of the transport vehicle. However, it may be determined whether or not the first position can be reached by comparing the travel distance to the eviction position, the average required time, and the like. By performing the expulsion when the vehicle can arrive at the expulsion position, wasteful traffic congestion and the like are prevented, and the number of movements of the transport vehicle is reduced to reduce the energy consumption. There is also an advantage that, when it is determined that it can be arrived first, if an empty transport vehicle stands by at a position facing the load port, it can be loaded immediately when a loaded article appears in the load port. If the state where it is determined that the first arrival is impossible continues for a predetermined time or longer, the travel route is blocked. Therefore, in such a case, for example, the first arrival determination may be performed after changing the eviction position to the previous position, and the movement may be commanded when it is determined that the first arrival can be performed. Alternatively, in such a case, the first arrival determination may be omitted, and the movement may be commanded so as to close the space between the front conveyance vehicles.

図4〜図8に、追い出しの例を示し、個別の搬送車を区別するために、A,B,Cなどの記号を用いる。32は搬送車が搬送中の荷物で、搬送車が目的地まで荷物32を搬送できるようにすること等のために追い出しを行う。荷物32を持たず、かつ荷積み、充電、配車、追い出し位置への走行などの指令を実行していない搬送車のためには、追い出しを行わない。言い換えると要求の処理を行っていない搬送車を移動させるために、追い出しを行うことはない。個々のポイントを区別するためにP1〜P4などの記号を用い、追い出し範囲を表わすためS1などの記号を用いる。また目的地及び追い出し位置を矢印で示す。   4 to 8 show examples of eviction, and symbols such as A, B, and C are used to distinguish individual carriages. Reference numeral 32 denotes a load that is being transported by the transport vehicle, which is expelled to allow the transport vehicle to transport the load 32 to the destination. Ejection is not performed for a transport vehicle that does not have the luggage 32 and has not executed commands such as loading, charging, dispatching, and traveling to the evicting position. In other words, there is no eviction in order to move a transport vehicle that is not processing the request. Symbols such as P1 to P4 are used to distinguish individual points, and symbols such as S1 are used to represent the eviction range. Also, the destination and the eviction position are indicated by arrows.

図4は基本的な追い出しの例を示し、搬送車Aの目的地はポイントP1で、搬送車Aの強制追い出し範囲はS1で、強制追い出し範囲S1に搬送車B,Cが所在するため、搬送車Aの強制追い出しリストに搬送車B,Cを登録する。搬送車B,Cの仮の追い出し位置を共にポイントP2とし、ポイントP2への先着判断では搬送車Cが先着する。このためポイントP2を搬送車Cの追い出し位置とする。搬送車Bの追い出し位置もポイントP2で、搬送車Cは搬送車Bの拡張追い出し範囲S2に存在するので、搬送車Cを搬送車Bの拡張追い出しリストに登録し、搬送車Cの追い出し位置をポイントP3に変更する。搬送車CはポイントP2を通過し、ポイントP3へ先着できるので、搬送車BはポイントP2へ先着できる。搬送車B,Cは各々ポイントP2,P3へ先着できるので、搬送車Aの強制追い出しリストから削除すると共に、搬送車Bの拡張追い出しリストも空にする。そして搬送車B,Cへ追い出し指令を送信して移動を開始させる。これにより搬送車AはポイントP1への移動を開始できる。なお図4の1)から3)への途中の処理は任意で、搬送車C,Bへの追い出し指令の送信順序も任意である。   Fig. 4 shows an example of basic eviction, where the destination of the transport vehicle A is point P1, the forced eviction range of the transport vehicle A is S1, and the transport vehicles B and C are located in the forced eviction range S1. Transfer vehicles B and C are registered in the forced eviction list of car A. The temporary eviction positions of the transport vehicles B and C are both set to the point P2, and the transport vehicle C arrives first when determining the arrival at the point P2. For this reason, the point P2 is set as the eviction position of the transport vehicle C. The eviction position of the transport vehicle B is also point P2, and since the transport vehicle C exists in the extended eviction range S2 of the transport vehicle B, the transport vehicle C is registered in the extended eviction list of the transport vehicle B, and the eviction position of the transport vehicle C is set. Change to point P3. Since the transport vehicle C passes the point P2 and can arrive first at the point P3, the transport vehicle B can arrive first at the point P2. Since the transport vehicles B and C can arrive at the points P2 and P3, respectively, they are deleted from the forced eviction list of the transport vehicle A and the extended eviction list of the transport vehicle B is also emptied. Then, an eviction command is transmitted to the transport vehicles B and C to start the movement. Thereby, the transport vehicle A can start moving to the point P1. In addition, the process in the middle from 1) to 3) in FIG. 4 is arbitrary, and the order of sending out the eviction commands to the transport vehicles C and B is also arbitrary.

図5は合流が関係する際の追い出しを示し、搬送車Aの目的地はポイントP1で、搬送車Bの目的地はポイントP2である。S4は搬送車Aの強制追い出し範囲、S5は搬送車Bの強制追い出し範囲で、いずれの強制追い出し範囲S4,S5にも他の搬送車Cが存在して追い出し対象となる。そこで搬送車Aの強制追い出しリストには搬送車Cが、搬送車Bの強制追い出しリストにも搬送車Cがリストされる。強制追い出し範囲S4,S5は重複するので、これらを合体して強制追い出し範囲S6とし、搬送車Cの追い出し位置をポイントP3として、S7を搬送車Cの拡張追い出し範囲とする。   FIG. 5 shows eviction when merging is involved, and the destination of the transport vehicle A is point P1, and the destination of the transport vehicle B is point P2. S4 is a forced eviction range of the transport vehicle A, S5 is a forced eviction range of the transport vehicle B, and there is another transport vehicle C in any of the forced eviction ranges S4 and S5. Therefore, the transport vehicle C is listed in the forced eviction list of the transport vehicle A, and the transport vehicle C is also listed in the forced eviction list of the transport vehicle B. Since the forced eviction ranges S4 and S5 overlap, they are combined to be the forced eviction range S6, the eviction position of the transport vehicle C is the point P3, and S7 is the extended eviction range of the transport vehicle C.

搬送車Cは、搬送車A,Bのいずれからも、合流部等の下流側に位置するので、搬送車A,Bのいずれかに対して、合流部等がブロッキングされるまで、追い出す必要はない。即ち合流部等をいつ通過するか不明な搬送車のために、追い出しは行わない。そして搬送車A,Bのいずれかに対してブロッキングされ、搬送車CがポイントP3へ先着し得ると判断した時点で追い出しを指令する。ここで搬送車Bが先に合流部へ進入すると、搬送車BはポイントP2へ、搬送車AはポイントP1へ移動する。搬送車Aが先に合流部へ進入すると、搬送車BがポイントP2へ移動できるようにするため、搬送車AをポイントP3等へ追い出す必要がある。なお搬送車A,Bへのブロッキングの順序は、ブロッキング制御のアルゴリズムに委ね、例えば先にブロッキングを要求したものに先にブロッキング許可を与える。あるいはブロッキングの制御ではなく、先に合流部等へ進入できると判断した搬送車が進入し、他の搬送車は進入を控えるアルゴリズムでも良い。搬送車Cが追い出しを実行する回数は1回で、必要最小限の追い出しで良い。   Since the transport vehicle C is located downstream from the transport vehicles A and B, such as the merging portion, it is not necessary to drive the transport vehicle C until either the transport portion A or B is blocked. Absent. In other words, no eviction is performed for a transport vehicle in which it is unclear when it will pass the junction. Then, when one of the transport vehicles A and B is blocked and it is determined that the transport vehicle C can arrive at the point P3 first, a command is issued. Here, when the transport vehicle B first enters the junction, the transport vehicle B moves to the point P2, and the transport vehicle A moves to the point P1. When the transport vehicle A first enters the junction, it is necessary to drive the transport vehicle A to the point P3 or the like so that the transport vehicle B can move to the point P2. The order of blocking the transport vehicles A and B is left to the blocking control algorithm, and for example, blocking permission is given to the one that has previously requested blocking. Alternatively, instead of blocking control, an algorithm may be used in which a transport vehicle that has been determined to be able to enter the junction or the like first enters and other transport vehicles refrain from entering. The transportation vehicle C performs the eviction only once, and the minimum eviction is required.

図6は合流部等が追い出しに関係し、かつ搬送車Cの追い出しに伴って、搬送車Dの追い出しが追加的に必要になる例である。搬送車Aの目的ポイントはP1、搬送車Bの目的ポイントはP4で、合流部P2は追い出し位置とはならないものとする。搬送車Aの強制追い出し範囲がS8で、その拡張追い出し範囲がS10で、搬送車Cの追い出し位置はポイントP3である。搬送車Bの目的ポイントはP4で、強制追い出し範囲はS9であり、強制追い出し範囲S8,S9は重複しないのでこれらは合体しない。このため搬送車Aの追い出しリストには搬送車Cが含まれ、搬送車Bの追い出しリストは空である。ここで仮に搬送車Bが先に合流部P2を通過すると、搬送車BがポイントP3を先に通過することが分かるので、搬送車CはポイントP3に先着すると判断できる。そこで搬送車CへポイントP3への移動を指示し、これに伴い搬送車Aは、追い出しリストが空になり、ポイントP1への移動を開始できる。ここでは搬送車Bのためには、搬送車Cを追い出していないことが重要である。   FIG. 6 shows an example in which the junction or the like is related to the eviction and the eviction of the transport vehicle D is additionally required as the evacuation of the transport vehicle C is performed. It is assumed that the destination point of the transport vehicle A is P1, the destination point of the transport vehicle B is P4, and the junction P2 does not become the eviction position. The forced eviction range of the transport vehicle A is S8, its extended eviction range is S10, and the eviction position of the transport vehicle C is the point P3. The destination point of the transport vehicle B is P4, the forced eviction range is S9, and the forced eviction ranges S8 and S9 do not overlap with each other, so they do not merge. Therefore, the eviction list of the transport vehicle A includes the transport vehicle C, and the eviction list of the transport vehicle B is empty. Here, if the transport vehicle B passes the junction P2 first, it can be seen that the transport vehicle B passes the point P3 first, so that it can be determined that the transport vehicle C arrives at the point P3 first. Accordingly, the transport vehicle C is instructed to move to the point P3, and accordingly, the transport vehicle A becomes empty in the eviction list and can start moving to the point P1. Here, for the transport vehicle B, it is important that the transport vehicle C is not driven out.

逆に搬送車Cが先に合流部P2を通過できる場合、即ち搬送車Cが先に合流部P2のブロッキングを許可された場合、搬送車Aは合流部P2の手前の目的ポイントP1へ移動する。搬送車Bの強制追い出し範囲S9内に搬送車Cが出現したので、拡張追い出し範囲S12が必要になり、これに伴って搬送車DをポイントP5から移動させる。そしてポイントP5へ搬送車Cが先着できると判断した時点で、搬送車Cを移動させる。このため搬送車BはポイントP4へ移動できる。追い出し範囲S8,S9を合体しないことにより、図6の2)では搬送車Cを搬送車Dが占めているポイントP5まで追い出す必要が無くなった。また搬送車Cを追い出す場合でも、正確な追い出しが行われている。   Conversely, if the transport vehicle C can first pass through the junction P2, that is, if the transport vehicle C is first allowed to block the junction P2, the transport vehicle A moves to the target point P1 before the junction P2. . Since the transport vehicle C appears in the forced eviction range S9 of the transport vehicle B, the extended eviction range S12 is required, and the transport vehicle D is moved from the point P5 accordingly. When it is determined that the transport vehicle C can arrive first at the point P5, the transport vehicle C is moved. For this reason, the transport vehicle B can move to the point P4. By not combining the eviction ranges S8 and S9, in 2) in FIG. 6, it is no longer necessary to drive the conveyance vehicle C to the point P5 occupied by the conveyance vehicle D. In addition, even when the vehicle C is driven out, the vehicle is accurately driven out.

図7は周回ルートでの追い出しを示す。走行ルートは周回ルートを含むことが多く、周回ルート内の搬送車を周回ルートの外部へ追い出すと、周回ルート内で新たな搬送物品が出現する可能性が高い場合に非効率である。図7の1) では、搬送車AはポイントP1を目的ポイントとし、強制追い出し範囲はS13となるので、一見したところ搬送車Bの追い出し位置が存在しない。ここで追い出し範囲S13を1周目の追い出し範囲と考える。搬送車Bは搬送車Aよりも先行しているので、搬送車Aが通過した後のポイントを2周目のポイントと見なすことにより、搬送車Bの追い出し位置とすることができる。そこで2周目のポイントP2を搬送車Bの追い出し位置とすると、図7の3) のように移動できる。搬送車Aは1周目でポイントP2を通過済みなので、搬送車Bは2周目のポイントP2に先着できると判断できる。周回ルートでの追い出しでは、同じ位置を1周目のポイントか2周目のポイントか、3周目のポイントか、4周目のポイントか等、周回数により区別することにより、追い出し位置の選択範囲を拡げることができる。   FIG. 7 shows the eviction on the round route. In many cases, the travel route includes a round route, and if a transport vehicle in the round route is driven out of the round route, it is inefficient when a new transport article is likely to appear in the round route. In 1) of FIG. 7, since the transport vehicle A has the point P1 as the target point and the forced eviction range is S13, the eviction position of the transport vehicle B does not exist at first glance. Here, the eviction range S13 is considered as the eviction range of the first lap. Since the transport vehicle B is ahead of the transport vehicle A, the point after the transport vehicle A has passed is regarded as the point of the second lap, so that the transport vehicle B can be set as the eviction position. Therefore, if the point P2 in the second lap is set as the eviction position of the transport vehicle B, it can move as shown in 3) of FIG. Since the transport vehicle A has already passed the point P2 in the first lap, it can be determined that the transport vehicle B can arrive at the point P2 in the second lap. For eviction on the lap route, select the eviction position by distinguishing the same position according to the number of laps, such as the first lap, the second lap, the third lap, or the fourth lap. The range can be expanded.

図8は追い出し位置の決定に分岐部が関係する場合を示し、搬送車Aの目的ポイントはP1で、S14が強制追い出し範囲となり、搬送車B,Cを追い出す必要がある。ここで例えばポイントP2を搬送車C,Bの共通の追い出し位置とすると、追い出し位置が重複する。搬送車Cの追い出し位置をポイントP2の次のポイントP4とするのではなく、2)のようにロードポートのあるポイントP3とすると、追い出し位置を分散させることができ、また荷積み要求を速やかに処理できる。またポイントP4を追い出し位置とする場合に対し、ポイントP3を追い出し位置とすることにより、移動距離を短縮できる。図8の2)のように追い出し位置を決定するアルゴリズムとしては、
・ ポイントP2が搬送車B,Cの追い出し位置として重複した際に、追い出し位置をポイントP4からポイントP3へ分岐を利用して振り替える、
・ もしくは追い出し位置と現在位置との間に分岐が存在する場合、追い出し位置を分岐の両側に分散させる、などのようにすると良い。
FIG. 8 shows a case where a branching portion is involved in determining the eviction position. The destination point of the transport vehicle A is P1, and S14 is the forced eviction range, so that the transport vehicles B and C need to be driven out. Here, for example, if the point P2 is a common eviction position for the transport vehicles C and B, the eviction positions overlap. Rather than using the point P4 next to point P2 as the eviction position of the transport vehicle C, the point P3 with load ports as in 2) can be used to distribute the eviction positions and promptly load requests. It can be processed. Further, when the point P4 is set as the eviction position, the movement distance can be shortened by setting the point P3 as the eviction position. As an algorithm for determining the eviction position as shown in 2) of FIG.
・ When point P2 overlaps as the eviction position of vehicles B and C, transfer the eviction position from point P4 to point P3 using a branch.
-Or, if there is a branch between the eviction position and the current position, it is better to distribute the eviction position on both sides of the branch.

実施例では以下の効果が得られる。
1) 先着し得ると判断した際に追い出しを実行することにより、無駄な移動を減らす。
2) 複数台の搬送車を追い出す必要がある場合でも、効率的に処理できる。
3) 合流が追い出しに関係する場合でも、正確に追い出しの制御ができる。
4) 周回ルートでの追い出し位置を、1周目のポイントと2周目のポイントとに区別することにより、追い出し位置の選択範囲を拡張することができる。
5) 合流部等から下流側での追い出しを、合流部等のブロッキングが許可されるまで実行しないので、早過ぎる追い出しを実行することがない。
6) 追い出し位置までの間に分岐がある場合、分岐を利用して追い出し位置を分散させることができる。
In the embodiment, the following effects can be obtained.
1) Reduce unnecessary movement by executing eviction when it is determined that it can arrive first.
2) Even when it is necessary to drive out several transport vehicles, it can be processed efficiently.
3) Even if the merger is related to eviction, the eviction can be controlled accurately.
4) The selection range of the eviction position can be expanded by distinguishing the eviction position on the lap route into the first lap point and the second lap point.
5) Since eviction downstream from the merging section is not executed until blocking of the merging section is permitted, eviction is not performed too early.
6) If there is a branch between the eviction positions, the eviction positions can be distributed using the branches.

2 搬送車システム
4 走行ルート
6 合流部
8 分岐部
10 搬送車
12 ロードポート
14 コントローラ
15 通信部
16 搬送車ファイル
18 搬送指令ファイル
20 ルートマップ
22 ブロッキングデータファイル
24 追い出しファイル
26 搬送制御部
28 ブロッキング制御部
30 追い出し制御部
31 配車制御部
32 荷物

P ポイント
S1 強制追い出し範囲
S2,S7 拡張追い出し範囲
S4〜S6 強制追い出し範囲
S8,S9 強制追い出し範囲
S10, S12 拡張追い出し範囲
S13 1周目の強制追い出し範囲
S14 強制追い出し範囲
2 Transport vehicle system 4 Travel route 6 Junction unit 8 Branch unit 10 Transport vehicle 12 Load port 14 Controller 15 Communication unit 16 Transport vehicle file 18 Transport command file 20 Route map 22 Blocking data file 24 Eject file 26 Transport control unit 28 Blocking control unit 30 eviction control unit 31 dispatch control unit 32 luggage

P point
S1 Forced eviction range
S2, S7 Extended eviction range
S4 to S6 forced eviction range
S8, S9 Forced eviction range
S10, S12 Extended eviction range
S13 Forced expulsion range on lap 1
S14 Forced eviction range

Claims (3)

予め定められた走行ルートを走行する複数の搬送車と、複数の搬送車を制御するコントローラとを備え、かつ搬送車が目的地まで走行できるように他の搬送車を目的地までの走行ルートから追い出す搬送車システムにおいて、
前記コントローラは、
複数の搬送車の現在位置を把握する現在位置把握手段と、
搬送車への移動指令の有無を把握する指令把握手段と、
移動指令を有する搬送車の目的地を把握する目的地把握手段と、
移動指令を有する第1の搬送車の現在位置から所定の範囲内で、かつ目的地を越えない追い出し範囲内に位置し、移動指令を有さない第2の搬送車を検出して追い出し先を決定すると共に、前記第2の搬送車の現在位置から追い出し先までの範囲内に位置し、かつ移動指令を有さない第3の搬送車を検出して追い出し先を決定する追い出し位置決定手段と、
前記第3の搬送車が追い出し先へ先着でき、かつ前記第2の搬送車が、前記第3の搬送車を除いて、追い出し先へ先着できるか否かを判断する先着判断手段とを備えて、
先着できると判断された場合に、前記第2の搬送車及び前記第3の搬送車に追い出し先への移動を指令するようにしたことを特徴とする、搬送車システム。
A plurality of transport vehicles that travel a predetermined travel route and a controller that controls the plurality of transport vehicles, and other transport vehicles from the travel route to the destination so that the transport vehicle can travel to the destination. In the eviction vehicle system,
The controller is
Current position grasping means for grasping current positions of a plurality of transport vehicles;
Command grasping means for grasping the presence or absence of a movement command to the transport vehicle;
Destination grasping means for grasping the destination of the transport vehicle having the movement command;
A second transport vehicle that is located within a predetermined range from the current position of the first transport vehicle having the movement command and that does not exceed the destination and that does not have the movement command is detected and the displacement destination is determined. And a displacement position determining means for determining a displacement destination by detecting a third transportation vehicle that is located within a range from the current position to the displacement destination of the second conveyance vehicle and has no movement command. ,
First arrival judging means for judging whether or not the third transport vehicle can arrive first at the ejection destination and the second transport vehicle can arrive first at the ejection destination except for the third transport vehicle. ,
A transport vehicle system, characterized in that, when it is determined that the first transport can be made, the second transport vehicle and the third transport vehicle are instructed to move to a discharge destination.
前記第1の搬送車の現在位置から見て、合流部の下流側に位置する第2の搬送車及び第3の搬送車に対して、第1の搬送車が合流部の通過を前記コントローラから許可されるまで、追い出し先へ先着できるか否かの判断に係わらず、追い出し先への移動を指令しないようにしたことを特徴とする、請求項1の搬送車システム。   From the controller, the first transport vehicle passes through the junction with respect to the second transport vehicle and the third transport vehicle that are located on the downstream side of the junction portion as viewed from the current position of the first carrier vehicle. 2. The transport vehicle system according to claim 1, wherein the movement to the eviction destination is not instructed until it is permitted regardless of whether or not it is possible to arrive at the eviction destination. 前記第1の搬送車が周回ルートを走行する際に、前記第2及び第3の搬送車の追い出し先として、第1の搬送車の現在位置及びその下流側で目的地よりも上流側の位置を指定自在にしたことを特徴とする、請求項1または2の搬送車システム。   When the first transport vehicle travels on the route, the current position of the first transport vehicle and the position downstream of the first transport vehicle and upstream of the destination as the destination of the second and third transport vehicles The transport vehicle system according to claim 1 or 2, characterized in that:
JP2011174230A 2011-08-09 2011-08-09 Guided vehicle system Pending JP2013035670A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP2011174230A JP2013035670A (en) 2011-08-09 2011-08-09 Guided vehicle system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP2011174230A JP2013035670A (en) 2011-08-09 2011-08-09 Guided vehicle system

Publications (1)

Publication Number Publication Date
JP2013035670A true JP2013035670A (en) 2013-02-21

Family

ID=47885648

Family Applications (1)

Application Number Title Priority Date Filing Date
JP2011174230A Pending JP2013035670A (en) 2011-08-09 2011-08-09 Guided vehicle system

Country Status (1)

Country Link
JP (1) JP2013035670A (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2019104581A (en) * 2017-12-12 2019-06-27 村田機械株式会社 Carrier vehicle system and method for deploying carrier vehicle in carrier vehicle system
CN111232576A (en) * 2018-11-28 2020-06-05 村田机械株式会社 Transport vehicle system
CN111268378A (en) * 2018-12-05 2020-06-12 村田机械株式会社 Transport vehicle system
KR20200116999A (en) * 2018-05-01 2020-10-13 무라다기카이가부시끼가이샤 Return system
WO2022158098A1 (en) 2021-01-20 2022-07-28 村田機械株式会社 Transport cart system

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH032906A (en) * 1989-05-30 1991-01-09 Shinko Electric Co Ltd Drive control method for mobile robot
JPH07334240A (en) * 1994-06-09 1995-12-22 Ishikawajima Harima Heavy Ind Co Ltd Expelling control method for automated guided vehicle
JPH11143538A (en) * 1997-11-07 1999-05-28 Murata Mach Ltd Automatic guided vehicle system
JP2005173779A (en) * 2003-12-09 2005-06-30 Asyst Shinko Inc Unit and method for controlling truck

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH032906A (en) * 1989-05-30 1991-01-09 Shinko Electric Co Ltd Drive control method for mobile robot
JPH07334240A (en) * 1994-06-09 1995-12-22 Ishikawajima Harima Heavy Ind Co Ltd Expelling control method for automated guided vehicle
JPH11143538A (en) * 1997-11-07 1999-05-28 Murata Mach Ltd Automatic guided vehicle system
JP2005173779A (en) * 2003-12-09 2005-06-30 Asyst Shinko Inc Unit and method for controlling truck

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2019104581A (en) * 2017-12-12 2019-06-27 村田機械株式会社 Carrier vehicle system and method for deploying carrier vehicle in carrier vehicle system
KR20200116999A (en) * 2018-05-01 2020-10-13 무라다기카이가부시끼가이샤 Return system
KR102389724B1 (en) 2018-05-01 2022-04-21 무라다기카이가부시끼가이샤 conveying system
CN111232576A (en) * 2018-11-28 2020-06-05 村田机械株式会社 Transport vehicle system
US11217092B2 (en) 2018-11-28 2022-01-04 Murata Machinery, Ltd. Transport vehicle system
CN111232576B (en) * 2018-11-28 2023-03-14 村田机械株式会社 Transport vehicle system
CN111268378A (en) * 2018-12-05 2020-06-12 村田机械株式会社 Transport vehicle system
CN111268378B (en) * 2018-12-05 2023-02-21 村田机械株式会社 Transport vehicle system
WO2022158098A1 (en) 2021-01-20 2022-07-28 村田機械株式会社 Transport cart system

Similar Documents

Publication Publication Date Title
JP6172554B2 (en) Transport vehicle system and transport method
JP5743169B2 (en) Transportation vehicle system and method of generating traveling schedule of transportation vehicle
JP5754604B2 (en) Transport vehicle system and transport vehicle control method
JPH0719177B2 (en) Operation management method for mobile
JP2013035670A (en) Guided vehicle system
CN114035522A (en) Anti-deadlock scheduling method for OHT (overhead hoist transport) system
CN115237137A (en) Multi-AGV scheduling and collaborative path planning method and device
JPH11143537A (en) Automatic guided vehicle system
KR102384236B1 (en) Carrier system and carrier control method
JP5402943B2 (en) Transport vehicle system and transport vehicle control method
JP5360034B2 (en) Transport vehicle system
JP5454512B2 (en) Transport vehicle system
CN115630895A (en) Cargo management method and device, carrying equipment and computer readable storage medium
CN112193952B (en) Elevator resource scheduling method and device
JP5278736B2 (en) Transport vehicle system
JP6516273B2 (en) Handling work assignment system
JPH11327644A (en) Allocation control method for automated guided carrier
JP6973362B2 (en) Transport vehicle system
JP4296351B2 (en) Travel control device
JP6926963B2 (en) Transport vehicle system
JP5229622B2 (en) Transport vehicle system
US20240158169A1 (en) Shuttle system, and method for operating a shuttle system
WO2023047829A1 (en) Transport system
CN113848929B (en) AGV carrier scheduling method and device
JPH10297719A (en) Conveyance vehicle allocation method

Legal Events

Date Code Title Description
A621 Written request for application examination

Free format text: JAPANESE INTERMEDIATE CODE: A621

Effective date: 20140624

A131 Notification of reasons for refusal

Free format text: JAPANESE INTERMEDIATE CODE: A131

Effective date: 20150313

A977 Report on retrieval

Free format text: JAPANESE INTERMEDIATE CODE: A971007

Effective date: 20150319

A02 Decision of refusal

Free format text: JAPANESE INTERMEDIATE CODE: A02

Effective date: 20150630