JP2601500B2 - Elevator control device - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION [Industrial Application Field] The present invention relates to a control device for an elevator, and more particularly, to shortening a time required for a car to carry a generated hall call and making a round time of the elevator uniform. The present invention relates to a control device for an elevator suitable for assigning to an elevator.

[Conventional technology]

Conventionally, waiting time at a landing has been emphasized as an evaluation index of an elevator, and the time from getting on the elevator to arriving at a destination floor (hereinafter referred to as a riding time) has not been given much importance. This is because the human sensation is annoying while waiting for the elevator at the landing, but once you get on the elevator, you will eventually feel you will arrive at the destination floor and you will feel relieved. However, for those who are in a hurry to the destination floor, the ride time to reach the destination floor is very important. These people are very dissatisfied with having to stop multiple times on the way to the destination floor to get on and off others, use the elevator to get to the next floor, and take time to get on and off. The dissatisfaction increases at a stretch when there are people.

Apart from this situation, when two people go from the bottom floor to the top floor and ride in separate elevators, the elevator of the later rider overtakes the elevator of the earlier rider. When you first arrive on the top floor, you feel emotionally uninteresting. If such an experience is repeated many times, if the elevator arriving first is crowded, it will be overlooked, and it will be used as if you press the hall call again and wait for the next elevator, driving by wasteful stop This leads to a decrease in efficiency. This occurs because there is a large variation in the round trip time of the elevator.

With the rise of buildings in recent years, the number of floors at which elevators are stopped has increased, and as a result, riding times and round trip times have become longer, and the adverse effects of variations have become noticeable. In Japanese Patent Application Laid-Open No. 53-140748, as a method of equalizing the boarding time, the car call duration of each floor of each elevator is monitored, and the elevator is in charge of a floor having a long car call duration. A method is disclosed for limiting the allocation of new hall calls.

[Problems to be solved by the invention]

However, this method can make the riding time uniform, but cannot make one round time uniform.

Further, this method treats the boarding time and the registered time of the car call as being the same, but these two are not actually the same. Specifically, since a person who gets on a crowded elevator goes to the end floor (a person who takes a long time) cannot reach the car call button, a car call is made immediately after getting on the elevator. There is a person who pushes the car call button after operating near the end of the car without operating the button and opening the car. In this case, the time for which the car call is registered is short even though the time for actually taking the elevator is long. Therefore, if the user operates the car call button at the same time as getting on the elevator, an appropriate evaluation is received,
There is a problem in that a car call created after a while in the elevator is not evaluated as appropriate.

SUMMARY OF THE INVENTION An object of the present invention is to solve the above-mentioned problems and to provide an elevator control device capable of equalizing the riding time and, at the same time, equalizing the round trip time of the elevator.

[Means for solving the problem]

The object is to calculate the number of stops during continuous operation in one direction for each elevator, and to limit the allocation of the generated hall calls to elevators in which the number of stops in the same direction as the generated hall calls is equal to or greater than a predetermined value. This is achieved as a configuration provided with a limiting means.

[Action]

A specific example of the operation of the above configuration will be described with reference to FIG. It is assumed that the group has 15 floors and 3 elevators for group management operation. Unit 1 is operating uphill on the third floor, Unit 2 is operating downhill on the second floor, Unit 3 is operating downhill on the 14th floor, and the symbols in the figure have the following meanings.

(1) Black triangles ▲ and ▼ are hall calls that have responded to the current time since the direction of the elevator was reversed immediately before.

(2) Black circle ● indicates a car call that has responded to the current time after the relevant elevator reversed direction immediately before.

(3) White triangles △ and ▽ are unanswered hall calls assigned to the elevator.

(4) A white circle ○ indicates an unanswered car call of the elevator.

(5) White squares □ are car calls predicted to be created by unanswered hall calls assigned to the elevator.

Here, the number of stops for each elevator in each driving direction will be obtained. First, the number of stops in the ascending direction of Unit 1 is based on the calls that have already been answered (1st and 2nd floors), calls that will be determined to be stopped in the future (5th, 7th, 8th and 15th floors) and 5th floor. It is calculated as the total number of car calls (14th floor) considered to be possible to be derived by hall calls. The number of stops in the ascending direction of Unit 2 is obtained by combining the call that is determined to be stopped in the future (1st floor) and the car call (5th floor) that can be derived from the hall call on the 1st floor. Becomes Similarly,
The number of stops for Unit 3 in the ascending direction is 0, the number of stops for Unit 1 in the descending direction is 0, and the number of stops for Unit 2 in the descending direction is 3.
The number of times that the No. 3 and Unit 3 stops in the descending direction is required to be two.
Now, assuming that the person who goes to the 15th floor of Unit 1 is the person who got on from the 1st floor, the number of stops obtained is 5 extra stops compared to when going straight from the 1st floor to the 15th floor (2nd floor, 5th floor) , 7F, 8F, 14F)
It means to do.

Assume that a new hall call in the upward direction on the sixth floor occurs in such a situation. The waiting time for this call is 2 hours on the first floor
If the first floor stop time is calculated as 10 seconds, the waiting time when assigned to the first unit is 16 seconds, the waiting time when assigned to the second unit is 32 seconds, and the waiting time when assigned to the third unit is 56 seconds. Considering only the ascending call, it is best to assign the first waiting time to the first car. However, when assigned to the first car, the ride time of those who go to the seventh, eighth, and fifteenth floors on the first car stops at the sixth floor, so that at least 10 seconds is longer. It will be longer depending on how the car call is made by the person on the 6th floor. On the other hand, when assigned to the second car, there is no increase in the boarding time.

Therefore, in order to evaluate the increase in the boarding time due to such a halfway stop, the number of stops during continuous operation in one direction is incorporated into the evaluation value, and the boarding time is extremely long compared to the local machine. Restrict quotas. Specifically, the estimated number of extra stops in the ascending direction of Unit 1 is 5
Each time (7-2 times), the estimated number of extra stops 0 times (2-2 times) of the second machine in the ascending direction is weighted by 10 seconds and added to the previously obtained waiting time. Then, the evaluation value of Unit 1 is 66 seconds (16 + 50 seconds), and the evaluation value of Unit 2 is 32 seconds (32+
0 second), and the hall call on the 6th floor is assigned to Unit 2. By allocating the six hall calls to the second car in this way, it is possible to prevent a person riding on the first car from taking longer time.

Further, since the number of stops in the ascending direction is suppressed, 1
It is possible to reduce the length of one round of the Unit.

〔Example〕

Hereinafter, the present invention will be described in detail with reference to the embodiment shown in FIGS.

FIG. 1 is an overall configuration diagram showing an embodiment of an elevator control device according to the present invention. The elevator group management control device 1 is a signal for hall call buttons 1H to 15H at each floor landing 1F to 15F.
HC is input, and the car call button signal CC of the operation panel 12, 22, 32 of each elevator car 11, 21, 31 from each unit control device 10, 20, 30, the driving direction CD, the floor position CP, etc. Is input by communication. The group management control device 1 assigns a newly generated hall call to any of the above elevators and transmits the assigned signal HA to the assigned device control device. Each car control device performs travel control, door opening / closing control, and the like to respond to the assigned hall call and car call. Here, the group management control device and each unit control device are of a known microcomputer control system.

FIG. 2 is a software table configuration diagram of a part related to the present invention of the group management control device 1 of FIG. Hall call signal HC goes up (UP) and descends (DN) from 1st floor to 15th floor.
The place where the hall call is registered for each bit and registered is “1”. The car call signal CC is "1" where the first to fifteenth floors are assigned to each signal for each bit and the car call is registered. The allocated hall call signal HA is allocated to the first floor to the fifteenth floor for each bit in ascending and descending directions. The driving direction signal CD is assigned one bit each for UP and DN for each car. In the floor position signal CP, the first floor to the fifteenth floor are assigned to each unit for each bit, and the floor where the elevator is located is "1". In the stop floor table CS, the 1st to 15th floors are assigned for each bit for each operation direction and for each unit, and the table in the same direction as the elevator operation direction is the floor that has already stopped so far, and is expected to stop in the future The floor to be performed is “1”
In the table in the direction opposite to the driving direction of the elevator, only floors expected to stop in the future are "1". In addition to the details described above, an estimated arrival time table TA that records the estimated arrival time of each floor, a call duration table TB that records the elapsed time from the occurrence of the hall call / car call to the present time, and other tables TC is there.

FIGS. 3 to 5 are flowcharts showing an embodiment of software of a part related to the present invention of the group management control device 1 of FIG. It is assumed that the software described below is divided into a plurality of tasks and is controlled by an operation system program OS that efficiently controls the program.

FIG. 3 is a flowchart of a program for creating a stop floor table CS, which is started periodically every second. Steps S10 and S130 indicate that all units (K elevators) are to be processed. First, in step S20, it is determined whether or not the elevator has a driving direction. If there is no driving direction, that is, if the vehicle is on standby, the process jumps to step S120 to clear the stop floor tables of all floors in both directions of UP and DN. If there is a driving direction, it is determined in step S30 whether the driving direction has been reversed. This determination is made by storing the driving direction one second before and comparing it with the current driving direction. When the driving direction is reversed, the process jumps to step S90 to perform a direction reversing process. If the vehicle is operating in the same direction, it is determined in step S40 whether the elevator is stopped. If the vehicle is stopped, "1" is set in the bit of the floor corresponding to the elevator position in the driving direction in step S50. Next, in step S60, "1" is set to the bit corresponding to the car call registration floor in the driving direction. In step S70, the hall call assigned to the elevator is set to "1" in the bit of the corresponding floor in the corresponding direction. Then, in step S80, "1" is set to the corresponding bit of the floor predicted to be stopped by the car call derived from the assigned hall call, and the process jumps to step S130. On the other hand, in the direction reversing process, it is determined in step S90 whether the direction is reversed from UP to DN or vice versa. If the direction is reversed from UP to DN, the bits of all floors in the UP direction are cleared in step S100. DN
If the direction is reversed from UP to UP, the bits on all floors in the DN direction are cleared in step S110. After the direction reversal process is over, the process jumps to step S60.

The stop floor table created in this way is always
In the table in the same direction as the elevator operation direction, the floor that has been stopped so far and the floor that is expected to stop in the future are "1", and the table in the direction opposite to the elevator operation direction will stop in the future Is only "1". As exceptional processing, when there is a change in assignment or when there is a change in the predicted occurrence of a derived car call, the stop floor table is corrected each time, but detailed description is omitted.

FIG. 4 is a flowchart of the hall call assignment process, in which a total evaluation value for each car is obtained and a hall call is assigned to a car having an optimum evaluation value. The hall call allocation process is started in a timely manner when a new hall call is generated, when a full capacity or long wait occurs. Step P1
0 and P70 indicate that all units are processed. First,
In step P20, the waiting time evaluation value TT is obtained. There are many methods for obtaining the waiting time evaluation value, such as a method using the maximum waiting time as the evaluation value, a method using the average waiting time as the evaluation value, and a method using the square of the waiting time as the evaluation value. It may be a method. Next, in step P30, the number of stops TC in the same direction as the direction of the generated call of the car is counted. This processing is "1" in the same direction as the direction of the generated call of the relevant machine on the stop floor table.
This is a process of counting the number of bits in the form. In step P40, it is determined whether or not the counted number of stops is equal to or greater than a predetermined value HC [M, J] for each traffic demand and each driving direction. Here, M indicates traffic demand, and J indicates the driving direction. If the value is equal to or more than the predetermined value, the total evaluation value TK of the unit is obtained in step P50 as TK = TT + C1 × (TC−HC [M, J]) (1). Here, C1 is a constant. If the value is equal to or less than the predetermined value, in step 60, TK = TT (2) is obtained. When the processing for all the units is completed in this way, the process proceeds to step P80, and the call that has occurred is assigned to the elevator having the smallest overall evaluation value.

By controlling in this manner, the overall evaluation of an elevator that stops frequently during operation in the same direction as the call generation floor increases, and the call assignment is controlled. This eliminates an abnormally large number of stops due to other elevators during driving in the same direction. That is, it is possible to prevent the riding time from being abnormally long. Further, by changing the value of the constant C1, it is possible to switch between waiting time priority and boarding time priority. Further, if the value of C1 is made sufficiently large, it is possible to prohibit the allocation of a new call to an elevator scheduled to stop more than a predetermined value in operation in the same direction.

FIG. 5 is a diagram for explaining the predetermined value HC [M, J] used for the determination of the number of calls to be stopped in step P40 of FIG. FIG. 5A is an explanatory diagram of the table configuration of the predetermined value table HCT. This table has the traffic demand M in the vertical direction and the driving direction J in the horizontal direction. When the demand for UP traffic is high and the demand for DN traffic is low, such as when going to work, the predetermined value of UP is large (8) and the predetermined value of DN is small (3). In the case of medium traffic demand, the predetermined value is also the same for both UP and DN, and is a medium value (5). Since the elevator always stops when the direction is reversed, the predetermined value is set to a value of 2 or more. This table
In the HCT, the constant C1 for switching between the priority of the waiting time and the priority of the riding time is also changed according to the traffic demand and the driving direction. FIG. 5B is a schematic flowchart of a data set program of the predetermined value table HCT.
The number of continuous stops in one direction, that is, the one corresponding to the riding time, changes depending on the allowable limit of the user. Therefore, a user's request can be instructed from an external input device (not shown) in the form of a permissible limit value or directly a spec value of HC [m, J]. The program first determines in step Q10 whether there is an input from an external input device. If not, the average number of stops in the case of the same traffic demand in the past is calculated in step Q20, and the value is set in the table. If there is an input from the external input device, the input form is determined in step Q30. When the spec value is directly input, the input value is set in a table in step Q40. When the allowable limit value is input, the simulation is performed while changing the predetermined value in step Q50, a value that satisfies the allowable limit value is obtained, and a value that minimizes the waiting time is selected from among the values and entered in the table. Set. The method of determining the average number of times of stoppage in the past and the basic concept of the method of performing simulation are described in JP-A-59-48369 and the like, and can be easily applied to the present invention.

FIG. 6 is a flow chart showing another embodiment of the present invention, which is a variation of FIG. The same processes as those in FIG. 4 are denoted by the same reference numerals. Here, only the partial step R60 different from FIG. 4 will be described. Step R60 is
This processing is performed when the number of stops in the same direction as the generated hall call is less than a predetermined value HC [M, J] for each traffic demand and each driving direction. The total evaluation value at this time is TK = TT−C2 × (HC [M, J] −TC) (3) Note that C2 is a constant like C1. This makes it easier to assign a new call to an elevator in which the number of stops in the same direction as the generated hall call is less than a predetermined value, and it is difficult to assign a new call to an elevator in which the number of stops is equal to or more than the predetermined value. Be uniformed. This indicates that, in addition to the effect of making the riding time uniform, the one-turn time of the elevator is made uniform.

In FIGS. 4 and 6, a description has been given of the system in which the total evaluation value is obtained for each car and the call is allocated to the car which gives the minimum value. However, the call allocation system for implementing the present invention uses an evaluation formula. It is not limited to the allocation method. The present invention can also be implemented by a method of allocating calls using knowledge processing that has recently been in the spotlight.
In other words, the rule of call assignment employs a condition part of "there are many stops during continuous operation in the same direction." And an execution part of "make call assignment difficult." An ambiguous expression such as "difficult to apply" can be easily implemented by expressing it using a fuzzy quantity.

According to the embodiment of the present invention, a car call that has not been used as control information and has already been answered, and hall call information (operation history) are recorded while the elevator is operating in the same direction, By combining this information with information expected to respond to a car call and a hall call while driving in the same direction in the future, the number of stops during driving in one direction is determined. Has a unique effect that the expected number of stops in the future can limit the allocation of new calls to elevators that have already stopped many open at least.

Further, the use of the recorded operation history is not limited to only the call assignment control. It can also be used to shorten the door opening time of an elevator that has stopped driving in the same direction more often to promote door closing, or to provide guidance for the elevator that will arrive next. Conversely, in an elevator with a small number of stops, it can be used for control such as making the door open time longer and disabling the door close button. In the call assignment control, an elevator in which the first floor operation is continuous can be detected and used to control a new call assignment to the elevator.

〔The invention's effect〕

As described above, according to the present invention, a means for calculating a stop circuit for each elevator during continuous operation in one direction, and a new method for an elevator in which the number of stops in the same direction as the generated hall call is equal to or more than a predetermined value. The provision of the restriction means for restricting the allocation of hall calls makes it possible to equalize the riding time and also equalize the round time of the elevator.

[Brief description of the drawings]

FIG. 1 is an overall configuration diagram showing an embodiment of an elevator control device of the present invention, FIG. 2 is a software table configuration diagram of a part related to the present invention of the group management control device of FIG. 1, and FIG. 5 to 5 are flowcharts showing an embodiment of software of a part related to the present invention of the group management control device of FIG. 1, FIG. 6 is a flowchart of another embodiment of the present invention, and FIG. It is an explanatory view for explaining an operation of the present invention. 1 ... Group management control device, 10, 20, 30 ... Unit control device, 1
1,21,31 …… Car, 12,22,32 …… Operation board, 1H to 15H…
… Hall call button.

 ──────────────────────────────────────────────────続 き Continued on the front page (72) Inventor Soshiro Katsunuki 4026 Kuji-cho, Hitachi City, Ibaraki Prefecture Inside Hitachi, Ltd. In the laboratory (72) Inventor Yuzo Morita 4026 Kuji-cho, Hitachi City, Ibaraki Prefecture Inside the Hitachi Research Laboratory, Hitachi, Ltd. (56) References JP-A-55-161760 (JP, A) JP-A-53-55844 (JP, A )

Claims (3)

(57) [Claims] 1. A plurality of elevators serving a plurality of floors, a hall call device for calling the elevator, a car call device for indicating a destination in a car, and a generated hall call to one of the elevators. In the one provided with the operation control device to be assigned, the number of times that the driving direction has been already reversed after reversing the driving direction based on the current time, the number of times that it is determined to stop before reversing the driving direction, Means for calculating the sum of the number of times that a new stop is predicted, and calculating the number of times the elevator stops during continuous operation in one direction for each elevator;
An elevator control device comprising: an elevator in which the number of stops in the same direction as the generated hall call is equal to or greater than a predetermined value, and limiting means for limiting the allocation of the generated hall call. 2. The means for calculating the number of stops during continuous operation in one direction for each elevator, wherein when calculating the number of stops in the operation direction of the elevator, the driving direction is inverted with respect to the current time. Has already stopped from
Next, when calculating the sum of the number of stops determined to reverse the driving direction and the number of times a new stop is predicted, and calculating the number of stops in the reverse direction of the driving direction, The sum of the number of times it is determined to stop between the next reversal of the driving direction and the next reversal based on the current time and the number of times a new stop is predicted during that time The control device for an elevator according to claim 1, wherein the control is performed. 3. The elevator control device according to claim 1, wherein said predetermined value is variable according to traffic demand.