JPS6137187B2 - - Google Patents

Description

【発明の詳細な説明】[Detailed description of the invention]

この発明はエレベータのかごを一群として管理
する装置の改良に関するものである。 エレベータの群管理方式の一つに割当て方式と
呼ばれるものがある。これは、乗場呼びが登録さ
れたとき、その呼びに応答するのに最適のかごを
それに割り当てるものである。そして、これを更
に効率よくするため、かごをあらかじめ各帯域に
分散待機させることが提案されている。これには
次のようなものがある。 (ア) エレベータのサービス階床を１階床または連
接する複数の階床からなる複数の帯域に分割
し、各帯域にそれぞれかごを分散待機させる。 (イ) 主階床と主階床以外の特定階を分散待機階と
して指令し、各分散待機階にそれぞれかごを分
散待機させる。 しかし、いずれの場合も、分散待機階に、それ
に対応した待機かごが１台（階床によつては複数
台）いないと他の階に待機しているかごを引き寄
せるため、その待機階の近くにかごがいても、わ
ざわざ待機階までかごを走行させることになる。
これはむだ走行となり、無用な電力消費をもたら
す。 この発明は上記欠点を改良するもので、むだ走
行を減少させるような分散待機を行うことのでき
るエレベータの群管理装置を提供することを目的
とする。 以下、第１図および第２図によりこの発明の一
実施例を説明する。 第１図中、ａは１階で待機中の利用可能かご
（サービスすべき呼びにすべての応答し終わつた
かご）となつたいるａ号機のかご、ｂ，ｃはそれ
ぞれ３階および２階で利用可能かごになつたばか
りのｂ号機およびｃ号機のかごである。 第２図中１Aaはａ号機のかごａが現在いる位
置から走行して１階へ直行到着するまでに要する
時間を表す到着予想時間信号で、これはかごａが
１階床を走行するに要する時間と１階までの階床
数の積から演算されるが、これは既に公知となつ
ている。１Ab，１Acは同じくｂ号機およびｃ号
機用の１階到着予想時間信号、７Aa〜７Acは同
じくａ号機〜ｃ号機用の７階到着予想時間信号、
９Aa〜９Acは同じく９階到着予想時間信号で、
この外、３階および５階用の到着予想時間信号も
設けられているが図示は省略してある。１Ｂは待
機すべきかごを要求する階を判定する判定回路、
３Ｂ，５Ｂ，７Ｂ，９Ｂは同じく３階、５階、７
階および９階（３階および５階は図示しない以下
同様）用判定回路、１Baは１階のａ号機用演算
回路、１Ab，１Bcは同じくｂ号機およびｃ号機
用演算回路３Ｃ，５Ｃ，７Ｃ，９Ｃはそれぞれ３
階，５階，７階および９階待機かご判定信号、３
Ｄ，５Ｄ，７Ｄ，９Ｄはインバータゲート、３
Ｅ，５Ｅ，７Ｅ，９ＥはANDゲート、１Ｆ，３
Ｆ，５Ｆ，７Ｆ，９Ｆはそれぞれ１階、３階，５
階，７階および９階待機かご要求信号、１Ｃは１
階に対して定められた所定時間信号、３Ｇ，５
Ｇ，７Ｇ，９Ｇは同じく３階，５階，７階および
９階用所定時間信号、１１は入力Ｘ＞入力Ｙのと
き出力Ｚ＝「Ｏ」となり、入力Ｘ≦入力Ｙのとき
出力Ｚ＝「１」となる比較器、１２はANDゲー
ト、１３はNORゲート、１４ａはａ号機が待機
状態にあるとき「１」となり、他の状態のとき
「Ｏ」となる待機信号、１４ｂ，１４ｃは同じく
ｂ号機およびｃ号機用待機信号である。 次に、この実施例の動作を説明する。 今、各かごａ〜ｃの位置は第１図に示すとおり
This invention relates to an improvement in a device for managing elevator cars as a group. One of the elevator group management methods is called the allocation method. This assigns when a hall call is registered the best car to answer that call. In order to make this process even more efficient, it has been proposed that the cars be placed on standby in advance in each band. These include: (a) Divide the service floor of the elevator into a plurality of bands each consisting of one floor or a plurality of connected floors, and have the cars stand by distributed in each band. (a) The main floor and specific floors other than the main floor are designated as distributed waiting floors, and the cars are distributed to each distributed waiting floor. However, in either case, if there is not one corresponding waiting car (or more depending on the floor) on the distributed waiting floor, the waiting cars on other floors will be drawn to the nearby waiting floor. Even if there is a car, the car must be run all the way to the waiting floor.
This results in wasteful running and unnecessary power consumption. SUMMARY OF THE INVENTION The present invention aims to improve the above-mentioned drawbacks and provides an elevator group management system that can perform distributed waiting to reduce wasteful running. An embodiment of the present invention will be described below with reference to FIGS. 1 and 2. In Figure 1, a is the available car waiting on the 1st floor (the car that has answered all the calls to be serviced) and the car of car A is waiting, and b and c are on the 3rd and 2nd floors, respectively. These are cars No. B and No. C which have just become available cars. In Figure 2, 1Aa is an expected arrival time signal that represents the time required for car a of car a to travel from its current position to the first floor directly. It is calculated from the product of time and the number of floors up to the first floor, and this is already known. 1Ab and 1Ac are the 1st floor expected arrival time signals for cars B and C, 7Aa to 7Ac are the expected 7th floor arrival time signals for cars A to C,
9Aa~9Ac are also the expected arrival time signals on the 9th floor.
In addition to this, expected arrival time signals for the third and fifth floors are also provided, but are not shown. 1B is a determination circuit that determines the floor on which a waiting car is requested;
3B, 5B, 7B, and 9B are also on the 3rd floor, 5th floor, and 7th floor.
Judgment circuit for floor and 9th floor (3rd and 5th floors are not shown), 1Ba is an arithmetic circuit for car a on the 1st floor, 1Ab, 1Bc are arithmetic circuits for car b and c, 3C, 5C, 7C, 9C is 3 each
floor, 5th floor, 7th floor and 9th floor standby car determination signal, 3
D, 5D, 7D, 9D are inverter gates, 3
E, 5E, 7E, 9E are AND gates, 1F, 3
F, 5F, 7F, and 9F are the 1st floor, 3rd floor, and 5th floor, respectively.
floor, 7th floor and 9th floor standby car request signal, 1C is 1
Predetermined time signal determined for each floor, 3G, 5
G, 7G, and 9G are the same predetermined time signals for the 3rd, 5th, 7th, and 9th floors, and 11 is the output Z = "O" when input X > input Y, and the output Z = when input X≦input Y. A comparator that becomes "1", 12 is an AND gate, 13 is a NOR gate, 14a is a standby signal that becomes "1" when machine a is in a standby state, and becomes "O" in other states, 14b and 14c are This is also the standby signal for cars B and C. Next, the operation of this embodiment will be explained. Now, the positions of each car a to c are as shown in Figure 1.

【表】 また、かごａ〜ｃの到着予想時間は下記のよう
に演算されているものとする。[Table] It is also assumed that the expected arrival times of cars a to c are calculated as follows.

【表】 さて、１階用判定回路１Ｂにおいて、１階到着
予想時間信号１Aaは零秒、所定時間信号１Ｇは
４秒であるから、比較器１１の出力Ｚ＝「１」と
なる。また待機信号１４ａは「１」であるから、
ANDゲート１２の出力は「１」となる。一方、
待機信号１４ｂ，１４ｃはともに「０」であるか
ら、演算回路１Bb，１Bcの出力はともに「０」
となり、NORゲート１３の出力、つまり１階待
機かご要求信号１Ｆは「０」となる。すなわち、
１階に対して既に所定時間内に到着可能な待機か
ごａがいるので、新たに待機かごを要求すること
をしないわけである。 優先順位が２番目の９階用判定回路９Ｂにおい
て、到着予想時間信号９Aaは16秒、所定時間信
号９Ｇは６秒であるから、比較器（図示しない）
の出力Ｚ＝「０」となり、演算回路９Ba（図示し
ない）の出力は「０」となる。一方、特機信号１
４ｂ，１４ｃはともに「０」であるから、演算回
路９Bb，９Bc（図示しない）の出力はともに
「０」となる。そのため、９階用判定回路９Ｂの
出力、すなわち９階待機かご判定信号９Ｃは
「１」となる。１階待機かご要求信号１Ｆは
「０」でインバータゲート９Ｄの出力は「１」で
あるから、ANDゲート９Ｅの出力、すなわち９
階待機かご要求信号９Ｆは「１」となる。同様に
このとき５階、３階および７階待機かご要求信号
５Ｆ，３Ｆ，７Ｆはいずれも「０」となつてい
る。その結果９階待機かご要求信号９Ｆによつ
て、待機中でない利用可能かごｂ，ｃのうち、９
階に近い方のかごｂに９階への待機指令を出す
（回路は省略する。）。 かごｂが走行して９階に到着して待機状態にな
ると、待機信号１４ｂは「１」となる。このとき
かごｂの到着予想時間は、１階へは16秒、９階へ
は零秒、５階へは３秒、３階へは12秒、７階へは
４秒とそれぞれ演算されよとする。その結果、既
述と同様の動作により、５階待機かご要求信号５
Ｆだけ「１」、他階の要求信号１Ｆ，９Ｆ，３
Ｆ，７Ｆはすべて「０」となる。これで、かごｃ
に対して５階への待機指令が出され、かごｃは走
行して５階に到着して待機する。そして、待機信
号１４ｃは「１」となる。このときかごｃの到着
予想時間は、１階へは８秒、９階へは８秒、５階
へは零秒、３階へは４秒、７階へは４秒とそれぞ
れ演算されたとすると、待機かご要求信号１Ｆ，
９Ｆ，５Ｆ，３Ｆ，７Ｆはいずれも「０」とな
る。そして、最終的な各かごａ〜ｃの位置は第１
図の破線（かごａは実線）で示すようになる。 このようにして、判定回路１Ｂ，９Ｂ，５Ｂ，
３Ｂ，７Ｂによつて、所定時間内にかごが待機し
ていない階床が判定される。そして更にその優先
順位の最も高い階床が選択されて待機かご要求信
号１Ｆ，９Ｆ，５Ｆ，３Ｆ，７Ｆが出され、各か
ごａ〜ｃを分散待機させるようにしてある。 なお、実施例では、判定回路１Ｂ，９Ｂ，５
Ｂ，３Ｂ，７Ｂを１階，９階，５階，３階および
７階に設ける場合について説明したが、他の階に
設けることももちろん可能である。 また、上記実施例では待機かご要求信号１Ｆ，
３Ｆ，５Ｆ，７Ｆ，９Ｆが「１」となつた特定階
でかごを待機させるように待機指令を出したが、
必ずしも上記特定階に待機させる必要はない。上
記特定階に所定時間内で到着可能な階床であれ
ば、どの階床で待機させてもよい。このようにす
ればさらにむだ走行が減少することは明らかであ
る。 以上説明したとおり、この発明では、特定階に
対するかごの到着予想時間と、その特定階に対応
して設定された所定時間との比較により所定時間
内に到着可能でかつ待機中のかごがいるかどうか
を判定し、上記待機中のかごがいなければ上記特
定階に上記所定時間内に到着可能なように、待機
指令を所定の条件に応じて利用可能かごに対して
発することによりかごを分散待機させるようにし
たので、特定階の乗場呼びに対して所定時間内に
応答可能で、しかもむだ走行を減少させるような
分散待機を行わせることができる。[Table] Now, in the first floor determination circuit 1B, the first floor expected arrival time signal 1Aa is 0 seconds and the predetermined time signal 1G is 4 seconds, so the output Z of the comparator 11 becomes "1". Also, since the standby signal 14a is "1",
The output of the AND gate 12 becomes "1". on the other hand,
Since the standby signals 14b and 14c are both "0", the outputs of the arithmetic circuits 1Bb and 1Bc are both "0".
Therefore, the output of the NOR gate 13, that is, the first floor standby car request signal 1F becomes "0". That is,
Since there is already a waiting car a that can arrive at the first floor within the predetermined time, no new request for a waiting car is made. In the determination circuit 9B for the ninth floor, which has the second priority, the expected arrival time signal 9Aa is 16 seconds and the predetermined time signal 9G is 6 seconds, so a comparator (not shown)
The output Z becomes "0", and the output of the arithmetic circuit 9Ba (not shown) becomes "0". On the other hand, special equipment signal 1
Since 4b and 14c are both "0", the outputs of arithmetic circuits 9Bb and 9Bc (not shown) are both "0". Therefore, the output of the ninth floor determination circuit 9B, that is, the ninth floor standby car determination signal 9C becomes "1". Since the first floor standby car request signal 1F is "0" and the output of the inverter gate 9D is "1", the output of the AND gate 9E, that is, 9
The floor standby car request signal 9F becomes "1". Similarly, at this time, the waiting car request signals 5F, 3F, and 7F on the 5th, 3rd, and 7th floors are all "0". As a result, based on the 9th floor standby car request signal 9F, 9 of the available cars b and c that are not on standby are
A standby command to the 9th floor is issued to car b, which is closer to the floor (the circuit is omitted). When the car b travels and reaches the 9th floor and enters the standby state, the standby signal 14b becomes "1". At this time, the expected arrival time of car B is calculated as 16 seconds for the 1st floor, 0 seconds for the 9th floor, 3 seconds for the 5th floor, 12 seconds for the 3rd floor, and 4 seconds for the 7th floor. do. As a result, the 5th floor standby car request signal 5 is generated by the same operation as described above.
Only F is “1”, request signals for other floors 1F, 9F, 3
F and 7F are all "0". Now, the basket c
A standby command to the 5th floor is issued to the car, and the car C travels, arrives at the 5th floor, and waits. Then, the standby signal 14c becomes "1". At this time, assume that the expected arrival time of car c is calculated as 8 seconds for the 1st floor, 8 seconds for the 9th floor, 0 seconds for the 5th floor, 4 seconds for the 3rd floor, and 4 seconds for the 7th floor. , standby car request signal 1F,
9F, 5F, 3F, and 7F are all "0". Then, the final position of each car a to c is
This is shown by the broken line in the figure (the car a is a solid line). In this way, the determination circuits 1B, 9B, 5B,
3B and 7B are used to determine the floor where no car is waiting within a predetermined period of time. Further, the floor with the highest priority is selected and waiting car request signals 1F, 9F, 5F, 3F, and 7F are issued, so that the cars a to c are placed on standby in a distributed manner. In addition, in the embodiment, the determination circuits 1B, 9B, 5
Although the case where B, 3B, and 7B are provided on the 1st floor, 9th floor, 5th floor, 3rd floor, and 7th floor has been described, it is of course possible to provide them on other floors. Further, in the above embodiment, the standby car request signal 1F,
A standby command was issued to have the car wait on a specific floor where 3F, 5F, 7F, and 9F became "1", but
It is not necessarily necessary to have them wait on the above-mentioned specific floor. The robot may be made to wait at any floor as long as it can arrive at the specific floor within a predetermined time. It is clear that this will further reduce wasteful running. As explained above, in this invention, by comparing the expected arrival time of a car to a specific floor and a predetermined time set corresponding to that specific floor, it is possible to determine whether there is a car that can arrive within a predetermined time and is waiting. and if there is no car on standby, a standby command is issued to the available cars according to predetermined conditions so that the cars can arrive at the specific floor within the predetermined time, thereby making the cars stand by in a distributed manner. As a result, it is possible to respond to a hall call on a specific floor within a predetermined time, and moreover, it is possible to perform a distributed standby that reduces wasteful running.

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

第１図はエレベータのかごの状態説明図、第２
図はこの発明によるエレベータの群管理装置の一
実施例を示すブロツク回路図である。 ａ〜ｃ……ａ号機〜ｃ号機のかご、１Aa〜１
Ac〜ａ号機〜ｃ号機の１階到着予想時間信号、
７Aa〜７Ac……同左７階到着予想時間信号、９
Aa〜９Ac……同左９階到着予想時間信号、１
Ｂ，７Ｂ，９Ｂ……１階，７階および９階用判定
回路、１Ba〜１Bc……ａ号機〜ｃ号機用演算回
路、７ｃ，９ｃ……７階および９階待機かご判定
信号、７Ｄ，９Ｄ……インバータゲート、７Ｅ，
９Ｅ……ANDゲート、１Ｆ，７Ｆ，９Ｆ……１
階，７階および９階待機かご要求信号、１Ｇ，７
Ｇ，９Ｇ……同左所定時間信号、１１……比較
器、１２……ANDゲート、１３……NORゲー
ト、１４ａ〜１４ｃ……ａ号機〜ｃ号待機信号。 Figure 1 is an explanatory diagram of the state of the elevator car, Figure 2
The figure is a block circuit diagram showing an embodiment of an elevator group management system according to the present invention. a~c...cars from a to c, 1Aa to 1
Ac ~ Estimated arrival time signal on the 1st floor of units a to c,
7Aa~7Ac... Estimated arrival time signal on the 7th floor on the same left, 9
Aa～9Ac……Estimated arrival time signal on the 9th floor on the same left, 1
B, 7B, 9B...Judgment circuit for the 1st, 7th and 9th floors, 1Ba to 1Bc...Arithmetic circuit for cars a to c, 7c, 9c...7th and 9th floor standby car judgment signals, 7D, 9D...Inverter gate, 7E,
9E...AND gate, 1F, 7F, 9F...1
floor, 7th floor and 9th floor standby car request signal, 1G, 7
G, 9G...Same predetermined time signal on the left, 11...Comparator, 12...AND gate, 13...NOR gate, 14a-14c...A-to-c standby signals.

Claims (1)

【特許請求の範囲】 １ 複数のかごを複数の階床の乗場呼びにそれぞ
れ応答させるとともに応答すでき乗場呼びに全て
応答し終つた空かごが生じると、空かごに待機指
令を与え、上記階床のうちの所定の階に待機させ
るようにしたものにおいて、上記階床のうち特定
の階床を予め設定する特定階設定手段、上記特定
階に対応して設定され、上記特定階までの時間的
距離に対応した規定時間を予め設定する規定時間
設定手段、上記かごが上記特定階に到着するまで
の所要時間の予測値をそれぞれ演算する到着予想
時間演算手段、上記特定階に対応して上記到着予
想時間と上記規定時間とを比較し、上記規定時間
より小さい到着予想時間をもつかごがいないこと
を検出すると待機かごを要求する出力を発する判
定手段、上記判定手段により待機かご要求が出力
されている上記特定階及び上記特定階に上記規定
時間以内に到着可能な階床のうちのいずれかの階
床に待機させるべく上記空かごに待機指令を発す
る待機指令手段を備えてなるエレベータの群管理
装置。 ２ 上記待機指令手段は、待機かご要求が出力さ
れている特定階が複数階ある場合には、予め特定
階ごとに定められた優先順位の高い順に空かごに
待機指令を発するようにしたことを特徴とした特
許請求の範囲第１項記載のエレベータの群管理装
置。[Scope of Claims] 1 A plurality of cars are made to respond to the hall calls of a plurality of floors, and when an empty car is generated which has responded to all the hall calls, a standby command is given to the empty car and the car is sent to the above floor. A specific floor setting means for presetting a specific floor among the floors, a time set corresponding to the specific floor, and a time required to reach the specific floor. a prescribed time setting means for presetting a prescribed time corresponding to the target distance; an expected arrival time calculation means for calculating a predicted value of the time required for the car to arrive at the specific floor; A determining means that compares the expected arrival time with the specified time and outputs an output requesting a waiting car when it is detected that there is no car with an expected arrival time smaller than the specified time, and the determining means outputs a request for a waiting car. a group of elevators comprising a standby command means for issuing a standby command to the empty car to make it wait at any one of the specific floor where the empty car is located and the floor where it can arrive at the specific floor within the specified time; Management device. 2. The above-mentioned standby command means is configured to issue a standby command to empty cars in order of priority predetermined for each specific floor when there are a plurality of specific floors to which standby car requests are output. An elevator group management device according to claim 1.