JPS5945591B2 - Elevator landing notification device - Google Patents
Elevator landing notification deviceInfo
- Publication number
- JPS5945591B2 JPS5945591B2 JP51139246A JP13924676A JPS5945591B2 JP S5945591 B2 JPS5945591 B2 JP S5945591B2 JP 51139246 A JP51139246 A JP 51139246A JP 13924676 A JP13924676 A JP 13924676A JP S5945591 B2 JPS5945591 B2 JP S5945591B2
- Authority
- JP
- Japan
- Prior art keywords
- car
- signal
- floor
- cars
- rhj
- 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.)
- Expired
Links
Landscapes
- Elevator Control (AREA)
- Indicating And Signalling Devices For Elevators (AREA)
Description
【発明の詳細な説明】
この発明は乗場呼びにサービスするかごをかごの到着以
前に報知する装置の改良に関するものである。DETAILED DESCRIPTION OF THE INVENTION The present invention relates to an improvement in a device for notifying a car that is servicing a hall call before the car arrives.
エレベータの乗場で呼びが登録されると、それに応答す
ると思われるかごを、かごの到着以前に到着予報灯等に
より報知することが、近来性なわれるようになった。When a call is registered at an elevator landing, it has become common practice to use an arrival warning light or the like to notify the car that is expected to respond to the call before the car arrives.
通常、それは、応答するよう割り当てられたかと(以下
割当かごと言う)を1台報知するものである。Usually, it announces whether one device has been assigned to respond (hereinafter referred to as the assigned car).
ところが、出動時の玄関階、昼食時の昼食堂のある階、
集会終了時の集会室のある階等のエレベータ乗場には相
当多くの乗客が集まることになる。However, the entrance floor at the time of dispatch, the floor where the lunch cafeteria is at lunch time,
At the end of the meeting, a considerable number of passengers will gather at the elevator landing on the floor where the meeting room is located.
サービスするかごを1台だけ報知する方式では、このよ
うな場合、乗客がその報知かどの前に集まっても全員は
乗れない。In a system where only one car is in service, in such a case, even if passengers gather in front of the car that is being serviced, not all of them will be able to board the car.
したがって、乗れないとあきらめた客は自分が乗れるか
ごがどれか分らないまま、いらいらしながら待つことに
なる。Therefore, customers who have given up on not being able to ride are forced to wait impatiently, not knowing which car they can ride.
また、1台かとが到着して、次に到着するかごが報知さ
れると、また乗客はそのかごに集まるが、この場合、先
にエレベータ乗場に到着した乗客が、そのかごに優先的
に乗れるとは限らず、不公平だといういらだちが起こり
やすい。Also, when one car arrives and the next car is announced, passengers will gather in that car again, but in this case, passengers who arrive at the elevator hall first will have priority in boarding that car. It's easy to feel frustrated that it's not always fair.
これに対し、常に複数台のかごを報知する方式や、割当
かごをすべて報知する方式も考えられているが、乗場が
混雑していないのに、複数台のかごを報知するのは、乗
場に待っている乗客にとってどちらのかごに乗るべきか
不明で、混乱の原因になるし、全体の運転効率からいっ
ても良くない。On the other hand, methods have been considered to always notify multiple cars or to notify all assigned cars, but it is difficult to notify multiple cars even when the landing area is not crowded. This creates confusion for waiting passengers, as it is unclear which car they should board, and is not good for overall operational efficiency.
また、長時間登録された呼びゃ、特定階の呼びに優先的
に答えるため、複数台のかごにサービスするよう指定す
るとしても、報知するのは1台の方が良いはずである。Also, if a call has been registered for a long time, calls on a specific floor will be answered preferentially, so even if multiple cars are designated to be serviced, it would be better to notify only one car.
更に、満員となる可能性が少しある場合でさえ、かごが
到着しないと分らないから複数台のかごを報知するのは
考えものである。Furthermore, even if there is a slight possibility that the car will be full, it is not a good idea to notify multiple cars because it will not be known until the car arrives.
この発明は上記欠点を改良するもので、乗場に待ってい
る乗客に対して親切な案内をする報知装置を提供するこ
とを目的とする。This invention aims to improve the above-mentioned drawbacks, and aims to provide a notification device that provides friendly guidance to passengers waiting at the landing.
以下、図によりこの発明の一実施例を説明する。An embodiment of the present invention will be described below with reference to the drawings.
ここでは10階建ての建物の9階に集会室があり、集会
終了時には9階から降り方向の乗客によりエレベータ乗
場は満員となるものとし、図は9階降り方向のサービス
かとを報知する回路を示す。Here, there is a meeting room on the 9th floor of a 10-story building, and at the end of the meeting, the elevator hall is assumed to be full with passengers descending from the 9th floor.The figure shows a circuit that notifies whether there is a service going down to the 9th floor. show.
図中、1A〜1CはそれぞれかごA−Cが9階に降り方
向で到着しているときrHJとなる9階降りかご位置信
号、2A〜2Cは各かごの戸が閉じられているとき「H
」となる戸閉信号、3A〜3Cは各かごが停止している
ときrHJとなる停止信号、4A〜4Cは各かご内の負
荷が所定値の80%以上になるとrHJとなる重負荷信
号、5八〜5Cは各かご内の負荷が所定値の40係未満
となったときrHJとなる軽負荷信号、6A〜6Cは9
階降り呼びにかごが割り当てられているときrHJとな
る割当信号、7A〜ICは各かごが9階降り呼びに応答
したときの9階降り方向の予想待時間を示す予想待時間
信号、8A〜8Cは各かごが9階降り呼びに応答するこ
とを9階乗場に報知するときrHJとなる報知信号、1
1A〜11C212A〜12C,13A〜13Cはアン
ドゲート、14.15はオアゲート、16はS側の信号
がrHJのときセットされて出力信号をrHJとし、S
側の信号がrLJでR側の信号がrHJのときリセット
されて出力信号をrLJとする記憶回路で、アンドゲー
ト11A〜11C,12A〜12C213A〜13C1
オアゲ′−ト14,15及び言ゴ回路16により混雑度
検出回路が構成されている。In the figure, 1A to 1C are the 9th floor downbound car position signals that are rHJ when the cars A to C arrive at the 9th floor in the downhill direction, and 2A to 2C are the 9th floor downbound car position signals that are "H" when the doors of each car are closed.
”, 3A to 3C are stop signals that become rHJ when each car is stopped, 4A to 4C are heavy load signals that become rHJ when the load in each car becomes 80% or more of a predetermined value, 58 to 5C are light load signals that become rHJ when the load in each car is less than the predetermined value of 40, and 6A to 6C are 9
An assignment signal that becomes rHJ when a car is assigned to a downstairs call; 7A-IC is an expected waiting time signal indicating the expected waiting time in the direction of going down the 9th floor when each car responds to a 9th-floor downcall; 8A- 8C is a notification signal that becomes rHJ when notifying the 9th floor landing that each car responds to the 9th floor alighting call, 1
1A to 11C212A to 12C, 13A to 13C are AND gates, 14.15 is an OR gate, 16 is set when the S side signal is rHJ, and the output signal is rHJ, and S
This is a memory circuit that is reset when the side signal is rLJ and the R side signal is rHJ, and the output signal is rLJ.
The OR gates 14, 15 and the word/go circuit 16 constitute a congestion level detection circuit.
17A〜17CはGと記した入力信号がrHJのとき、
左側から入る信号の値をそのまま出力し、入力信号がr
LJのとき、非常に大きな値、例えば「999」を出力
するゲート回路、18は入力信号のうち最も小さな値の
入力線に対応した出力信号を「H」とする最小値演算回
路で、例えば入力信号のうち図で一番上に位置している
線の信号値が最小ならば、出力信号のうち図で一番上に
位置している線の信号だけをrHJとする。17A to 17C are when the input signal marked G is rHJ,
The value of the signal entering from the left side is output as is, and the input signal is r
In the case of LJ, a gate circuit outputs a very large value, for example "999", and 18 is a minimum value calculation circuit which sets the output signal corresponding to the input line with the smallest value among the input signals to "H". If the signal value of the line located at the top of the diagram among the signals is the minimum, only the signal of the line located at the top of the diagram among the output signals is set as rHJ.
19A〜19Cは禁止ゲート、20A〜20Cはオアゲ
ート、21A〜21Cはゲートで、ゲート回路17A〜
17C1最小値演算回路18、禁止ゲート19A〜19
C1オアゲート20A〜20C及びアントゲ−1−21
A〜21Cにより報知信号発生回路が構成されている。19A-19C are inhibit gates, 20A-20C are OR gates, 21A-21C are gates, and gate circuits 17A-
17C1 Minimum value calculation circuit 18, inhibition gates 19A to 19
C1 or gate 20A-20C and Antogame-1-21
A to 21C constitute a notification signal generation circuit.
今、集会室階(9階)は混雑していないとする。Assume that the meeting room floor (9th floor) is not crowded now.
通常9階降り呼びに割り当てられているかごは1台であ
るが、その呼びが長時間待たせられていて、とにかくど
ちらか先に到着するかごがサービスできるよう、かごA
1かごBが両方共割り当てられたとする。Normally, only one car is assigned to a call to get off the 9th floor, but if that call has been kept waiting for a long time, car
Assume that both cars are assigned to car B.
割当信号6Aと6Bが「H」、割当信号6CがrLJと
なるため、ゲート回路17A。Since the assignment signals 6A and 6B are "H" and the assignment signal 6C is rLJ, the gate circuit 17A.
17Bは左側からの入力信号をそのまま出力し、ゲ゛−
ト回路17Cは999秒を出力する。17B outputs the input signal from the left side as it is, and outputs the input signal from the left side as is.
The output circuit 17C outputs 999 seconds.
かごAの予想待時間信号7Aの値を40秒、かごBの予
想待時間信号7Bの値を30秒とすれば、最小値演算回
路18の出力信号のうち、かごBに関するもの、すなわ
ち禁止ゲート19Bに入力される信号のみrHJとなる
。If the value of the expected waiting time signal 7A for car A is 40 seconds and the value of the expected waiting time signal 7B for car B is 30 seconds, then among the output signals of the minimum value calculation circuit 18, the one related to car B, that is, the prohibited gate. Only the signal input to 19B becomes rHJ.
混雑していない場合、記憶回路16の出力はrLJとな
るので(後に説明する。If it is not crowded, the output of the memory circuit 16 will be rLJ (this will be explained later).
)、禁止回路19Bの出力はrHJとなり、オアゲート
20B1アンドゲート21Bを通して報知信号8Bが「
H」となる。), the output of the inhibition circuit 19B becomes rHJ, and the notification signal 8B becomes "
H”.
したがって、かごBが報知されることになる。Therefore, car B will be notified.
他のかごはオアゲート20A、20Cの入力が両方とも
rLJであるため報知されない。The other cars are not notified because the inputs of the OR gates 20A and 20C are both rLJ.
次に、集会室階(9階)が混雑している場合を考える。Next, consider a case where the meeting room floor (9th floor) is crowded.
今、かごCが9階に降り方向に到着して、客を乗せ、戸
が閉まると、9階降りかご位置信号IC1戸閉信号2C
,停止信号3Cが共に「H」となるので、アントゲ−N
ICの出力はrHJとなる。Now, when car C arrives at the 9th floor in the direction of descent, picks up a passenger, and closes the door, the 9th floor alighting car position signal IC1 door close signal 2C
, stop signal 3C both become "H", so the Antogame N
The output of the IC becomes rHJ.
このとき、かご内の負荷が所定値の80係以上になり、
重負荷信号4CがrHJとなると、アントゲ−N2C,
オアゲート14を通して記憶回路16をセットする。At this time, the load in the car exceeds the predetermined value of 80 coefficients,
When the heavy load signal 4C becomes rHJ, Antoge-N2C,
The memory circuit 16 is set through the OR gate 14.
そうなると、オアゲート20A〜20Cの出力はすべて
「H」となり、割当信号が「H」となるかごはすべて報
知することになる。In this case, the outputs of the OR gates 20A to 20C will all become "H", and all the cars whose assignment signals will be "H" will be notified.
割り当てられているのは、やはりかごAとかごBだとす
ると、アンドゲート21A、21Bを介して、報知信号
8A、8BがrHJとなる。If the assigned cars are car A and car B, the notification signals 8A and 8B become rHJ via AND gates 21A and 21B.
記憶回路16は1台のかごが所定値の40%未満で客を
乗せ、戸を閉めるとリセットされる。The memory circuit 16 is reset when one car is loaded with less than 40% of the predetermined value and the door is closed.
例えば、それがかごAとすれば、9階降りかご位置信号
I A、戸閉信号2A1停止信号3A、軽負荷信号5A
がすべて「H」となり、アントゲ−hllA。For example, if it is car A, the 9th floor down car position signal I A, the door close signal 2 A, the stop signal 3 A, and the light load signal 5 A.
are all "H", and Antogame hllA.
13Aを通してオアゲ゛−ト15の出力が「H」となっ
て記憶回路16をリセットすることになる。The output of OR gate 15 becomes "H" through 13A, and the memory circuit 16 is reset.
このように、かごA1かごBの両方が割り当てられてい
る場合、混雑していない場合は、先に到着すると予想さ
れるかごBの1台だけを、混雑している場合は、かごA
とかごBを両方共、すなわち割り蟲てられているかごす
べてを報知するわけである。In this way, if both cars A and B are allocated, if it is not crowded, only one car, B, which is expected to arrive first, will be allocated, and if it is crowded, car A will be allocated.
This means that both the car and the car B are notified, that is, all the cars that have been broken.
なお、この実施例で割当信号6A〜6C,予想待時間信
号7A〜ICを周知のものとして述べたが、例えば下記
のような式により求めることができる。In this embodiment, the allocation signals 6A to 6C and the expected waiting time signals 7A to IC have been described as well-known signals, but they can be determined by, for example, the following equations.
〈予想待時間〉=〈待時間を求めようとしている乗場と
かごの間の階床間隔〉×〈1階床あたりの平均走行時間
〉+〈上記乗場とかごの間にあり、かごが停止すべき階
床の数〉×〈1階床あたりの平均停止時間〉+〈上記乗
場に登録されている呼びの登録時間〉
〈割当〉−<予想待時間の最小値が所定値以下のとき、
予想待時間が最小のかごのみ「H」、所定値以上のとき
、予想待時間が2番目に小さいかごまで「H」〉
また、混雑度の判定はこの実施例に述べた方式に限らな
い。〈Estimated waiting time〉 = 〈Floor spacing between the landing and the car for which waiting time is to be calculated〉 x 〈Average travel time per floor〉 + Number of floors to be expected〉×〈Average stopping time per floor〉+〈Registered time of calls registered at the above landing〉〈Allocation〉−〈When the minimum value of expected waiting time is less than a predetermined value,
Only the car with the minimum expected waiting time is "H"; when the expected waiting time is equal to or greater than a predetermined value, the car with the second smallest expected waiting time is also "H"> Furthermore, the determination of the degree of congestion is not limited to the method described in this embodiment.
正確に判定したければ乗場待客数検出装置を使用する必
要がある。If you want to make an accurate determination, it is necessary to use a detection device for the number of passengers waiting in the hall.
更に、この実施例のように混雑していないときは割当か
ごのうち1台を、混雑しているときは割°当かごすべて
を報知するのではなく、他の理由で報知したくないとき
、例えば予想待時間が所定値以上のときはこの実施例の
条件を満足しても報知しないようにしてもよい。Furthermore, instead of notifying one of the allocated cars when it is not crowded and all allocated cars when it is crowded as in this embodiment, when the notification is not desired for other reasons, For example, if the expected waiting time is greater than or equal to a predetermined value, the notification may not be made even if the conditions of this embodiment are satisfied.
以上説明したとおりこの発明では、乗場呼びにサービス
するため選択されたかごのうち乗場の混雑度に応じた数
だけ報知するようにしたので、乗場に待っている乗客に
対して乗るべきかごを明確に指示し、親切なサービスを
行なうことができる。As explained above, in this invention, the number of cars selected to serve the hall call is notified according to the congestion level of the hall, so it is clear to the passengers waiting at the hall which car they should board. be able to give instructions and provide friendly service.
図はこの発明によるエレベータの乗場報知装置の一実施
例を示す論理回路図である。
1A〜1C・・・・・・A−C号機9階降りかご位置信
号、2A〜2C・・・・・・同左戸閉信号、3A〜3C
・・・・・・同左停止信号、4A〜4C・・・・・・同
左重負荷信号、5A〜5C・・・・・同左軽負荷信号、
6A〜6C・・・・・・同左割当信号、7A〜7C・・
・・・・同左予想待時間信号、8A〜8C・・・・・・
同左報知信号、11A〜11C212A〜12C,13
A〜13C・・・・・・アンドゲート、14.15・・
・・・・オアゲ゛−ト、16・・・・・・言d意回路、
17A〜17C・・・・・・ゲート回路、18・・・・
・・最小値演算回路、19A〜19C・・・・・・禁止
ゲート、20A〜20C・・・・・・オアゲート、21
A〜21C・・・・・・アンドゲート。The figure is a logic circuit diagram showing an embodiment of an elevator hall notification device according to the present invention. 1A~1C...A-C 9th floor down car position signal, 2A~2C...Same left door close signal, 3A~3C
...Same left stop signal, 4A to 4C...Same left heavy load signal, 5A to 5C...Same left light load signal,
6A to 6C...Same assignment signal on the left, 7A to 7C...
...Same expected waiting time signal on the left, 8A to 8C...
Same as left notification signal, 11A-11C212A-12C, 13
A~13C...and gate, 14.15...
...orgate, 16...word circuit,
17A-17C...Gate circuit, 18...
...Minimum value calculation circuit, 19A-19C...Prohibition gate, 20A-20C...OR gate, 21
A~21C...and gate.
Claims (1)
記選択されたかごの一部又は全部が上記乗場呼びの登録
された階に到着する前に報知信号を発して、それに対す
る上記かどの到着を上記階の乗場に報知するものにおい
て、上記乗場の混雑度を検出する混雑度検出回路、及び
上記選択されたかごのうち上記混雑度検出回路の出力に
応じた数のかごについてだけ上記報知信号を発する報知
信号発生回路を備えたことを特徴とするエレベータの乗
場報知装置。1 Select a plurality of cars that respond to a hall call, emit a notification signal before some or all of the selected cars arrive at the registered floor of the hall call, and respond to one of the above cars. In the device that notifies the landing area of the above-mentioned floor of the arrival, the above-mentioned notification is made only for the congestion degree detection circuit that detects the congestion degree of the said landing area, and the number of cars corresponding to the output of the congestion degree detection circuit among the selected cars. An elevator landing notification device characterized by comprising a notification signal generation circuit that emits a signal.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP51139246A JPS5945591B2 (en) | 1976-11-19 | 1976-11-19 | Elevator landing notification device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP51139246A JPS5945591B2 (en) | 1976-11-19 | 1976-11-19 | Elevator landing notification device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| JPS5364346A JPS5364346A (en) | 1978-06-08 |
| JPS5945591B2 true JPS5945591B2 (en) | 1984-11-07 |
Family
ID=15240845
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| JP51139246A Expired JPS5945591B2 (en) | 1976-11-19 | 1976-11-19 | Elevator landing notification device |
Country Status (1)
| Country | Link |
|---|---|
| JP (1) | JPS5945591B2 (en) |
-
1976
- 1976-11-19 JP JP51139246A patent/JPS5945591B2/en not_active Expired
Also Published As
| Publication number | Publication date |
|---|---|
| JPS5364346A (en) | 1978-06-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2019087249A1 (en) | Elevator operation management system, and elevator operation management method | |
| JP6143599B2 (en) | Elevator operation apparatus and elevator operation method | |
| CN101670960B (en) | Group Management Elevator | |
| JP2633681B2 (en) | Elevator group control device | |
| US3625311A (en) | Controls for multicompartment elevators | |
| CN101641274A (en) | Method for operating a lift unit and corresponding lift unit | |
| JPH04153169A (en) | Group control unit for elevator | |
| JP6071160B1 (en) | Elevator system | |
| JPS5945591B2 (en) | Elevator landing notification device | |
| JPS62121186A (en) | Group control method of elevator | |
| JPH04317968A (en) | Method for calculating arrival time of incoming passenger in elevator | |
| Gerstenmeyer et al. | Departure Delays in Lift Systems | |
| US2775312A (en) | Up by-pass during down peak traffic condition | |
| JPS59190171A (en) | Register for calling of elevator | |
| JPS6158393B2 (en) | ||
| JPS623074B2 (en) | ||
| KR20260047812A (en) | System and method for managing elevator group | |
| JPS6124295B2 (en) | ||
| KR20260057728A (en) | System and method for managing elevator group | |
| KR20260058117A (en) | System and method for managing elevator group | |
| JPH0120370Y2 (en) | ||
| US2699227A (en) | Elevator system having plural operating modes | |
| JPS6147793B2 (en) | ||
| JPS6251860B2 (en) | ||
| JPS6123156B2 (en) |