JPH0452808A - Method for controlling unmanned truck - Google Patents

Method for controlling unmanned truck

Info

Publication number
JPH0452808A
JPH0452808A JP2155216A JP15521690A JPH0452808A JP H0452808 A JPH0452808 A JP H0452808A JP 2155216 A JP2155216 A JP 2155216A JP 15521690 A JP15521690 A JP 15521690A JP H0452808 A JPH0452808 A JP H0452808A
Authority
JP
Japan
Prior art keywords
queue
unmanned
truck
queues
unmanned trolley
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
JP2155216A
Other languages
Japanese (ja)
Inventor
Yasuto Iwasaki
岩崎 靖人
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.)
Hitachi Ltd
Hitachi Kasado Engineering Co Ltd
Original Assignee
Hitachi Ltd
Hitachi Kasado Engineering Co 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 Hitachi Ltd, Hitachi Kasado Engineering Co Ltd filed Critical Hitachi Ltd
Priority to JP2155216A priority Critical patent/JPH0452808A/en
Publication of JPH0452808A publication Critical patent/JPH0452808A/en
Pending legal-status Critical Current

Links

Landscapes

  • Control Of Position, Course, Altitude, Or Attitude Of Moving Bodies (AREA)

Abstract

PURPOSE:To optimize the arrangement of an unmanned truck by applying an inter-queue moving instruction to an idle queue. CONSTITUTION:Respective queues are controlled based upon the queue arrangement schedule results of respective unmanned trucks and the departure information of the trucks, and when an idle queue is generated at the time of outputting a carrier request from a certain unmanned carrier truck, the queue 20 including the truck having the maximum rate of each queue to the regulated number of queuing trucks is selected and an inter-queue moving instruction to the idle queue 10 is applied to the leading truck 15b, so that rearrangement of carrying media can be automatically optimized.

Description

【発明の詳細な説明】 〔産業上の利用分野〕 本発明は、無人台車による物流搬送システムにおける無
人台率配置スケジュール方法に関するものである。
DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to an unmanned vehicle rate placement scheduling method in a logistics transportation system using unmanned vehicles.

〔従来の技術〕[Conventional technology]

無人台車を用いた搬送システムにおいて、無人台車はル
ープ状の搬送経絡を走行し、この間に荷役を行う。荷役
作業が無くなると所定位置で待機する。
In a transport system using an unmanned trolley, the unmanned trolley travels along a loop-shaped transport meridian and performs cargo handling during this time. When there is no more cargo handling work to be done, it waits at a predetermined position.

この場合、少数の無人台車で効率良(荷役を行うように
している。(特開昭62−24311号公報、特開昭6
2−50912号公報)〔発明が解決しようとする課題
〕 従来の搬送媒体の装置スケジュールは、搬送媒体に対し
搬送作業発生後に、各待行列で発生する作業量をプログ
ラムにより分析推論し、待行列間移動指示を行わせてい
た。
In this case, a small number of unmanned trolleys are used to carry out cargo handling efficiently.
2-50912 Publication) [Problems to be Solved by the Invention] Conventional apparatus schedules for conveyance media are based on a program that analyzes and infers the amount of work that occurs in each queue after a conveyance operation is performed on the conveyance medium. He was giving instructions to move between locations.

上述した方法の搬送作業発生後の特待列間移動では搬送
要求に対するサービスが低下し、また搬送作業が偶発的
に発生する搬送システムにおいて複雑なプログラムによ
る搬送作業発生の予測は困難であり、システムの柔軟性
に欠けるため、限られた無人台車数での運用条件下では
搬送条件毎のプログラムを厳密に作成する必要があるな
ど、保守性も悪いという欠点があった。
In the above-mentioned method, moving between special queues after a transportation task occurs degrades the service for transportation requests, and in a transportation system where transportation tasks occur accidentally, it is difficult to predict the occurrence of transportation tasks using a complicated program, and the system Due to its lack of flexibility, it also had the disadvantage of poor maintainability, such as the need to create programs strictly for each transportation condition under operating conditions with a limited number of unmanned trolleys.

〔課題を解決するための手段〕[Means to solve the problem]

上記目的を達成するために、無人台車の待行列配置スケ
ジュール結果と無人台車の出発報告により、それぞれの
待行列数の管理を行っておき、少な(とも無人台車によ
る搬送要求時点で待行列に空きが発生した場合に、それ
ぞれの待行列で各行列の規定待機台数に対する比率が最
大の無人台車体を有する待行列を選択し、その先頭の無
人台車に対し、空きとなった待行列への待行列間移動指
示を行い、無人台車配置の最適化を図ったものである。
In order to achieve the above purpose, the number of queues for each unmanned trolley is managed based on the queue placement schedule results of unmanned trolleys and the departure reports of unmanned trolleys. When this occurs, the queue with the unmanned trolley body that has the largest ratio to the specified number of waiting vehicles in each queue is selected, and the leading unmanned trolley is assigned to wait in the empty queue. This system provides instructions for moving between queues and optimizes the placement of unmanned trolleys.

〔作  用〕[For production]

本発明による無人台車の再配置スケジュールは、無人台
車の出発報告時の待機していた待行列が空になった状況
のみで行うため、搬送作業が偶発的に発生する搬送シス
テムや、搬送条件の変更が行われた場合も自動的に無人
台車の再配置の最適化が行われ、搬送条件毎の複雑なプ
ログラム作成が不要となり、これによりシステムの保守
性も向上する。
The relocation schedule of unmanned trolleys according to the present invention is performed only when the queue in which the unmanned trolley was waiting at the time of the departure report is empty, so it is difficult to use a transport system where transport work occurs accidentally or due to transport conditions. Even when changes are made, the relocation of unmanned carts is automatically optimized, eliminating the need to create complex programs for each transport condition, thereby improving the maintainability of the system.

〔実 施 例〕〔Example〕

次に、本発明の一実施例について図面を参照して詳細に
説明する。
Next, one embodiment of the present invention will be described in detail with reference to the drawings.

第1図において、10.20は無作業中の無人台車が待
機する所定位置(以下、待行列位置という)である。そ
れぞれの待行列位置の無人台車の搬送作業範囲はA、B
であり、一部が重なっている。
In FIG. 1, 10.20 is a predetermined position (hereinafter referred to as a queue position) where unmanned carts that are not working are waiting. The transport work range of unmanned trolleys at each queue position is A and B.
and some overlap.

巧、25は無人台車であり、15a、25aは搬送作業
中を示し、15b、25bは待行列位置10.20の無
人台車を示す。
25 is an unmanned trolley, 15a and 25a are in transport operation, and 15b and 25b are unmanned trolleys at queue position 10.20.

ここで、作業範囲1j待行列位1i10で待機中の無人
台稟巧が搬送作業中となった時、作業範囲人の特待利付
1110の待行列は′m1″を減じた値となる。
Here, when the waiting unmanned platform Rinku at the work area 1j queue position 1i10 is in the process of being transported, the queue of the special benefit interest rate 1110 for the work area person becomes the value obtained by subtracting 'm1''.

ここでは零(空)になったとすると、搬送作業範囲Aは
作業頻度が高いと考えられる。また1作業範囲Aで作業
中の無人台車巧は作業終了後、作業範囲人の特待利付!
ilOへ戻り待行列を形成する。
Here, if the number is zero (empty), it is considered that the transport work range A has a high work frequency. In addition, the unmanned trolley Takumi working in 1 work area A will receive special benefits for those in the work area after the work is completed!
Return to ilO and form a queue.

この間(待行列が空の状1!りに搬送作業範囲人で新た
に搬送作業の発生があった場合、搬送作業範囲Bの待行
列位置Iで待機中の無人台車(2台)15を利用するの
か好都合である。
During this time (when the queue is empty and a new transport work occurs in the transport work area), the unmanned trolleys (2 units) 15 waiting at queue position I in the transport work range B will be used. It's convenient to do so.

そこで、搬送開始で待行列が空となったタイミングで、
第2図の無人台車の再配置スケジュールを行う。
Therefore, at the timing when the queue was empty at the start of transportation,
Perform the relocation schedule for the unmanned trolleys shown in Figure 2.

各特待利付1を毎に待行列数の計数が行なわれているの
で、各待行列位置毎に搬送要求があったときに待行列が
空であるか否かを判断する(ステップ81)。
Since the number of queues is counted for each benefit coupon 1, it is determined whether or not the queue is empty when a transport request is made for each queue position (step 81).

待行列の初定か空の場合は、他の待行列位置毎に規定待
機台数(0以上)に対して最大の待行列位置を求める(
ステップ83)。
If the queue is initially determined or empty, find the maximum queue position for the specified number of waiting cars (0 or more) for each other queue position (
Step 83).

次に、求めた待行列位置の先頭の無人台車≦こ対して搬
送要求のあった位置に向けての移動を指示する(ステッ
プ85)。
Next, the unmanned cart at the head of the determined queue position is instructed to move toward the position requested for transportation (step 85).

これにより、搬送INA度が高くなった搬送作業範囲人
の搬送が円滑に行われることになる。
As a result, people can be smoothly transported within the transport work area where the transport INA degree is high.

この時、搬送作業範囲Bの待行列の無人台車が1台の場
合は、侍行列間移動指示は行わないようにする必要があ
る。
At this time, if there is only one unmanned cart in the queue for transport work range B, it is necessary not to issue an instruction to move between samurai lines.

また、搬送の頻度が落ちると無人台車は自動的に待行列
に規定台数ごとに待機するため、再度配置変更指示の必
要が無い。
Furthermore, when the frequency of transportation decreases, the unmanned carts automatically wait in the queue at a predetermined number, so there is no need to issue a rearrangement instruction again.

以上のように、状況により自動的に無人台車は配置され
、待行列へ帰属するため、最適な配置制御が行える。
As described above, unmanned carts are automatically placed depending on the situation and assigned to the queue, so optimal placement control can be performed.

なお、上記実施例では待行列間の移動は最大待行列数で
選択しているが、待行列間の移動量を加味して選択して
もよい。
In the above embodiment, the movement between queues is selected based on the maximum number of queues, but the movement between queues may be selected in consideration of the amount of movement between queues.

なお、規定待機台数は待行列位置毎に異っていてもよい
。この場合は規定待機台数に対する待行列数の比率によ
って選択する。
Note that the prescribed number of waiting machines may differ depending on the queue position. In this case, selection is made based on the ratio of the number of queues to the specified number of waiting machines.

〔登明の効果〕[Effect of climbing]

本発明は、以上説明したように搬送媒体の再配置スケジ
ュールを搬送作業の状況のみで行っており、ll11送
作業が偶発的に発生する搬送システムや、搬送条件の変
更が行われた場合も自動的に搬送媒体の再配置の最適化
が行われるものである。
As explained above, the present invention performs the relocation schedule of the conveyance medium only based on the status of the conveyance work, and automatically performs the relocation schedule for conveyance media even when the conveyance work occurs accidentally or when the conveyance conditions are changed. The relocation of the transport medium is optimized accordingly.

また、本発明により搬送条件毎の複雑なプログラム作成
が不用となり、これによりシステムの保守性も向上する
Furthermore, the present invention eliminates the need to create complicated programs for each transport condition, thereby improving the maintainability of the system.

【図面の簡単な説明】[Brief explanation of the drawing]

第1図は本発明の一実施例を示す時打列間移動指示の概
念図、第2図は第1図の待行列間移動指示の処理の一実
施例のフローチャートである。 A、B・・・・・・搬送作業範囲、10.20・・・・
・・待行列位置、15 a 、 15 b 、 25 
a 、 25 b−・−無人台車代理人 弁理士  小
 川 勝 男
FIG. 1 is a conceptual diagram of an instruction to move between queues according to an embodiment of the present invention, and FIG. 2 is a flowchart of an embodiment of the processing of an instruction to move between queues shown in FIG. A, B...Transportation work range, 10.20...
...Queue position, 15 a, 15 b, 25
a, 25 b-・-Unmanned trolley agent Patent attorney Katsuo Ogawa

Claims (1)

【特許請求の範囲】 1、無人台車が搬送作業後に複数の特定の定位置で待行
列を形成し、それぞれの待行列が特定の搬送作業範囲を
持つ無人台車の制御方法において、 無人台車の待行列配置スケジュール結果と無人台車の出
発報告により、それぞれの待行列数の管理を行っておき
、少なくとも無人搬送台車による搬送要求時点で待行列
に空きが発生した場合に、それぞれの待行列の規定待機
台数に対する比率が最大の無人台車を有する待行列を選
択し、その先頭の無人台車に対し、空きとなった待行列
への待行列間移動指示を行うこと、を特徴とする無人台
車の制御方法。
[Claims] 1. In an unmanned trolley control method, the unmanned trolley forms queues at a plurality of specific predetermined positions after a transport operation, and each queue has a specific transport work range. The number of each queue is managed based on the queue placement schedule results and the departure report of the unmanned trolley, and if there is an empty queue at least at the time of request for transportation by an unmanned guided vehicle, the specified waiting time for each queue is performed. A method for controlling an unmanned trolley, comprising: selecting a queue having an unmanned trolley with the largest ratio to the number of vehicles; and instructing the leading unmanned trolley to move between the queues to an empty queue. .
JP2155216A 1990-06-15 1990-06-15 Method for controlling unmanned truck Pending JPH0452808A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP2155216A JPH0452808A (en) 1990-06-15 1990-06-15 Method for controlling unmanned truck

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP2155216A JPH0452808A (en) 1990-06-15 1990-06-15 Method for controlling unmanned truck

Publications (1)

Publication Number Publication Date
JPH0452808A true JPH0452808A (en) 1992-02-20

Family

ID=15601057

Family Applications (1)

Application Number Title Priority Date Filing Date
JP2155216A Pending JPH0452808A (en) 1990-06-15 1990-06-15 Method for controlling unmanned truck

Country Status (1)

Country Link
JP (1) JPH0452808A (en)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH06168025A (en) * 1992-12-01 1994-06-14 Hitachi Ltd Unmanned carrier system, and allocation processing method for unmanned carrier in unmanned carrier system
WO1996013024A1 (en) * 1994-10-24 1996-05-02 Caterpillar Inc. System and method for managing access to a resource in an autonomous vehicle system
JPH10187240A (en) * 1996-12-18 1998-07-14 Caterpillar Inc Simultaneous resource access method for a group of mobil machines and device therefor
JPH10187238A (en) * 1996-12-19 1998-07-14 Caterpillar Inc System and method for managing a group of mobile machines to let them pump at plural dumping points
JPH10187239A (en) * 1996-12-19 1998-07-14 Caterpillar Inc System and method for managing access of a group of mobile machines to resources having plural entering points
JPH11134027A (en) * 1996-12-19 1999-05-21 Caterpillar Inc System and method for managing access to service resource by group of moving machines
JPH11212643A (en) * 1998-01-26 1999-08-06 Shinko Electric Co Ltd Method and device for controlling automated guided vehicle
JP2019516169A (en) * 2016-03-25 2019-06-13 ローカス ロボティクス コーポレーションLocus Robotics Corp. Queue robot in order fulfillment operation

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH06168025A (en) * 1992-12-01 1994-06-14 Hitachi Ltd Unmanned carrier system, and allocation processing method for unmanned carrier in unmanned carrier system
WO1996013024A1 (en) * 1994-10-24 1996-05-02 Caterpillar Inc. System and method for managing access to a resource in an autonomous vehicle system
JPH09508740A (en) * 1994-10-24 1997-09-02 キャタピラー インコーポレイテッド System and method for managing access to resources in an autonomous vehicle system
JPH10187240A (en) * 1996-12-18 1998-07-14 Caterpillar Inc Simultaneous resource access method for a group of mobil machines and device therefor
JPH10187238A (en) * 1996-12-19 1998-07-14 Caterpillar Inc System and method for managing a group of mobile machines to let them pump at plural dumping points
JPH10187239A (en) * 1996-12-19 1998-07-14 Caterpillar Inc System and method for managing access of a group of mobile machines to resources having plural entering points
JPH11134027A (en) * 1996-12-19 1999-05-21 Caterpillar Inc System and method for managing access to service resource by group of moving machines
JPH11212643A (en) * 1998-01-26 1999-08-06 Shinko Electric Co Ltd Method and device for controlling automated guided vehicle
JP2019516169A (en) * 2016-03-25 2019-06-13 ローカス ロボティクス コーポレーションLocus Robotics Corp. Queue robot in order fulfillment operation

Similar Documents

Publication Publication Date Title
JPH11134027A (en) System and method for managing access to service resource by group of moving machines
JPH0452808A (en) Method for controlling unmanned truck
Fedtke et al. A comparison of different container sorting systems in modern rail-rail transshipment yards
Li et al. Design and simulation analysis of PDER: A multiple-load automated guided vehicle dispatching algorithm
Stevens et al. Scheduling a two-machine flowshop with travel times to minimize maximum lateness
JPH11119829A (en) Vehicle navigation management system
JP4182874B2 (en) Dolly control device and control method
JPH11143533A (en) Carrier control system
JPS63255711A (en) Carrying control system for unattended carriage
JP3373447B2 (en) Unmanned carrier transport system
JPH02277106A (en) Operation controller for unmanned carrier
JPH08282968A (en) Operation control device for plural sets of cranes
JP2581704B2 (en) Dispatch control device for loop bogie
JPH0834349A (en) Operation control method of transport vehicle
JP3619900B2 (en) Transport control method, transport control device, and transport device
JPH10297719A (en) Conveyance vehicle allocation method
JP2000293228A (en) Method for controlling operation of carrier
JPH01182161A (en) Conveyance truck device
JP4040203B2 (en) Transport vehicle operation control method
JPH029556A (en) Work indicating system
JP4449253B2 (en) Transportation planning device, method and program
JP2000293229A (en) Method for controlling operation of carrier
JPH06168025A (en) Unmanned carrier system, and allocation processing method for unmanned carrier in unmanned carrier system
JPH03231313A (en) Operation controller for plural unmanned carriers
JPH10214115A (en) Unmanned carrier controller