KR900008017Y1 - Elevator devices for casting watching time - Google Patents

Abstract

No content.

Description

Elevator waiting time prediction device

1 is a block diagram showing the configuration of an embodiment of an elevator waiting time predicting apparatus of the present invention.

2 is a system configuration display diagram of call registration time counting means, passenger counting means, call recording means and passenger counting time predicting means in the elevator waiting time predicting apparatus of FIG.

3 is a flowchart showing the structure of a program incorporated in the ROM in FIG.

4 is a graph showing the call registration time T, the average number of passengers APASS (T) and the estimated total passenger waiting time WTIME (T).

5 is a block diagram showing the configuration of a conventional waiting time predicting apparatus.

* Explanation of symbols for main parts of the drawings

1: call registration device 2: elevator

3: call registration time counting means 4: passenger number detecting means

5: call information recording means 6: passenger waiting time prediction means

11: CPU 12: ROM

13: RAM 14: Timer

15: input circuit 16: output circuit

And the same symbols in the middle indicate the same or equivalent parts.

The present invention relates to an elevator waiting time predicting apparatus for predicting waiting time of passengers waiting at an elevator platform which is effective information for controlling an elevator.

In order to efficiently operate the elevator as a group and provide good passenger service, it is important to predict the waiting time of passengers waiting at the elevator platform. However, in general, it is difficult to consider the waiting time for each passenger, so it is often substituted by the time (call registration time) from when the call is registered until the elevator arrives and is erased.

However, this is the same as waiting for one person or twenty people in the platform, and in a true sense it does not take into account the waiting time of each person. Therefore, it has been considered to predict the number of waiting passengers when they arrive at an elevator and to use them for military management by adding weights corresponding to waiting numbers for call registration times. As an example of waiting passenger forecasts, there is Japanese Unexamined Patent Application Publication No. 57-16067. Also, the weighted waiting number is added by Japanese Unexamined Patent Application Publication No. 59-24061.

Fig. 5 shows a block diagram incorporating the above two examples.

In FIG. 5, reference numeral 101 denotes a service predicted time calculating device for calculating a time from when a call is registered until an elevator arrives, 102 denotes a waiter number generation that presets a waiting number of occurrences per unit time; The predicted waiting number calculating device for predicting the waiting number arriving after the call registration from the output of the service predicting time calculating device 101 and the setting of the waiting number setting unit 102, 104 is a waiting number measuring the waiting number at the time of call registration. It is a detection device.

The outputs of the waiting number detecting device 104 and the predicted waiting number calculating device 109 are added to the adder 105 to multiply the result of the addition and the output of the service prediction time calculating device 101 by the multiplier 106. It is.

In FIG. 5, for example, an ascending call on the first floor is registered.

If it is predicted that the service elevator arrives after 34 seconds with this call, the output of the service predicted time computing device 101 is 34.

In addition, when it is known that one passenger is generated for 10 seconds in the upward direction of the first floor, the waiter generator is set to 1 (in) / 10 (second) and the output becomes 0.1. As a result, it is expected that 0.1 (person / second) x 34 (second) = 3.4 (person) waiters will be generated after the call registration, so that the output of the predicted wait-count operator 103 becomes 3.4.

If there is only one person who has registered the call, the waiting number detector 104 outputs 1 and the output of the adder 105 becomes 4.4.

In other words, 4.4 passengers are expected when the elevator arrives.

The output of the multiplier 106 is 34 x 3.4 = 149.6. This indicates that in the case of military administration, the rise call on the first floor is not treated as 34 seconds but is evaluated as the weight of the call by 4.4 times by evaluating the waiting time of each person.

For example, in a system that assigns elevators so that the total waiting time of the entire building is reduced, the waiting time is only 149.6 seconds on the first floor.

But even in this way, it does not really take into account the waiting time of each person.

Because the waiting time of the person who registered the call is 34 seconds, the other 3.4 people will arrive later, so the waiting time will be less than 34 seconds.

To the extreme, there may be some people who have arrived at the platform just before the elevator arrives, and their waiting time will be approximately zero seconds.

Considering this, it is also possible to consider the weight to be smaller, but the waiters are not necessarily arriving at equal intervals, and usually arrive in groups, so it is not very meaningful.

As a result, it is not possible to calculate the exact waiting time of each person without predicting the waiting time other than the person who registered the call, and in the true sense, there is a problem that military management is not performed in which the waiting time of each passenger is small in total. . The present invention aims to provide an elevator waiting time prediction device capable of predicting the total sum of waiting time of each passenger waiting at the platform and performing good military management.

An elevator waiting time predicting apparatus according to the present invention is provided with a means for recording a call registration time and the number of passengers corresponding to the call and grabbing the record to predict the passenger waiting time. In the present invention, a function indicating the relationship between the call registration time and the number of passengers is obtained, and the predicted time is obtained by integrating the number of passengers over time with this function.

Hereinafter, an embodiment of an elevator wait time predicting apparatus of the present invention will be described with reference to FIGS.

1 is a configuration diagram of one embodiment, where 1 is a call registration device for registering a call in a platform, 1a is a call registration signal as its output, 2 is an elevator, and 2a is an output signal indicating its state. Elevator status signal for passengers, car position and direction. Reference numeral 3 is a call registration time counting means for counting the time at which the call is registered, and outputs the call registration time 3a to the call information recording means 5.

Reference numeral 4 is a passenger counting means for counting passengers aboard the elevator serving the call, and outputs the passenger number 4a to the call information recording means 5.

The call information recording means 5 records the call registration time 3a and the number of passengers 4a in correspondence. The call information recording means 5 predicts the sum of waiting times for each passenger by the passenger waiting time predicting means 6 and outputs the predicted passenger waiting time 6a. That is, the function Y = f (X) is obtained based on the relationship between the call registration time (X) and the number of passengers (Y), and -scan-f (X) dx is summed of the waiting times for each passenger for a predetermined time t. It is to be predicted as.

2 shows the system configuration of the call registration time counting means 3, the passenger counting means 4, the call information recording means 5, and the passenger waiting time dP means 6, wherein 11 represents the microprocessor. The central processing unit (CPU) used, 12 is a read only memory (ROM) storing processing programs for controlling this system, 13 is a random access memory (ROM) storing processing data, 14 is a CPU after a prescribed time A timer for interrupting (11), an input circuit for inputting a call registration signal (1a) or an elevator status signal (2a), and an output circuit for outputting a prediction floor passenger waiting time (6a). Circuit.

3 shows the structure of the program incorporated in the ROM 12, and 21 to 47 are steps of a flowchart.

The first table shows an example of recording the call registration time 3a and the number of passengers 4a. FIG. 4 shows the call registration time T, the average passenger number APASS (T), and the predicted floor passenger waiting time WTIME (T). It is a graph.

TABLE 1

Next, the operation of the above embodiment will be mainly described with reference to FIG.

First, the variable command used in FIG. 3 and its contents are shown below in alphabetical order.

APASS (i): Average waited number of call registration time i seconds (i = integer and less than), CALL: Call duration time, 0 when there is no call, CSTP: Elevator responds to call during ascending service 1 "1" until departure from the floor. Others include "0", K: integer, L: integer, M: integer, NO (i): Call registration time i seconds number of calls, PASS (i): Calling order i Number of passengers in call order PTIME (i): Call registration time of call occurrence sequence i, SPASS (i): Call registration time i seconds of the number of passengers in the call, T: Call registration time to output the total of waiting time for each passenger, WTIME (i): Call registration time i The total of waiting time per passenger in the case of seconds, starting from step 21, in step 22, variables other than K are set to "0" and K is set to 1 so that the timer interrupt is set to 1 second.

In step 23, it is checked whether the call registration signal 1a output from the call registration device 1 is input through the input circuit 15.

In this case, think about only the first floor upcall. If there is no call, see Step 24 to see if there was a call during the entire cycle. If there is no call in the entire cycle, the flow advances to step 46 and the program loops in step 47.

(More about step 46 later).

If the interrupt signal is input after 1 second from the timer 14, the program is started in step 25.

If a call has occurred in step 23, the flow advances to step 26a to increase the call duration time by " 1 ". In the initial setting, CALL is set to 0, so the first cycle from the call occurrence becomes "1" and the flow proceeds to step 46.

In this way, as long as there is a call, the CALL indicating the call duration is incremented by one.

In the 35th cycle, when the elevator completes the call and there is no call, the elevator advances to step 24. However, since the CALL is not "0" in the previous cycle, the process proceeds to step 26 and the CALL value is inputted as RTIME (K).

Now K = 1, so RTIME (1) = 34.

That is, the first call registration time is 34 seconds.

Subsequently, CALL is set to "0" in step 27 and the call busy signal CSTP is set to "1" in step 28 for the next operation.

This indicates that the elevator arrives and services the first floor upcall.

Next, in step 29, it is detected by inputting the elevator state signal 2a from the elevator 2 through the input circuit 15 whether or not the elevator car (hereinafter referred to as car) rises on the first floor.

If the passenger is on board the flight is "NO", but when departing, go to Step 30 with "yes". In step 30, it is checked whether the elevator has really serviced the call, and if "yes", the CSTP is set to "0" in step 31. Then, in step 32, the elevator status signal 2a is sent from the elevator 2 to the number of passengers. Detection by input via the input circuit 15 is performed.

Passenger numbers are normally checked by detecting the weight by means of a scale installed at the bottom of the car.

In this example, if there is no basement level on the first floor, the number of passengers in the car can be taken as the person on the first floor.

Since there is already a person in the car on the middle floor, the number of passengers at the time of departure is calculated by subtracting the number of passengers when the weight is lightest on the floor.

In this example, if there are four people, PASS (1) = 4.

This means that the call registration time of the first call is 34 seconds and the number of passengers at that time is four.

In step 33, K is increased to "1" and the next call is recorded again.

The call registration time of the second call is 5 seconds, and the number of passengers at that time is two, and the third call is 28 seconds at the call registration time, and the number of passengers at that time is six.

In this way, a table such as the first table can be created.

When K is 301, that is, 300 calls are recorded, the process proceeds from step 34 to step 35 to enter the waiting time prediction.

First, in step 35, K is returned to " 1 ", and the total number of passengers and the number of calls for each call registration time are obtained.

That is, the constant L is made "1" in step 36, and the number of passengers is added in step 37. FIG.

Since the call registration time RTIME (1) is 34 and the number of passengers PASS (1) is 4, the 4 is first input to the SPASS 34.

Step 38 adds the number of calls and enters "1" into No 34 first.

Since 300 calls are made in this way, if L = 300 is not reached in step 39, the process proceeds to step 39a, where "L" is increased to "I" to process the next call.

When 300 call processing ends, the process proceeds from step 39 to step 40.

In step (0), the average number of passengers by call registration time is calculated in step 41, with the constant M being " 1 ".

If the number of calls for one second of call registration time is "10" and the total number of passengers is "12", SPASS (1) / NO (1) = 1.2, and the average number of passengers APASS (1) is 1.2.

In step 42, SPASS (M) and NO (M) are reset to " 0 " for the next 300 call operations. In step 43, the waiting time for each passenger by call registration time is calculated.

When the call registration time is 1 second, WTIME (1) = WTIME (0) + APASS (1) × 1 = 0 + 1.2 (seconds).

This is because "L" to be multiplied by APASS (1) is in units of 1 second.

If the average number of passengers is 1.3 when the call registration time is 2 seconds, the waiting time for each passenger will be WTIME (2) = WTIME (1) + APASS (2) × 1 = 1.2 + 1.3 (seconds). This continues at step 44 and step 45 until M = 100.

"100" is only 100 seconds long and does not mean much.

In this way, if the relationship between the call registration time and the average number of passengers is equal to the fourth degree, the area of the oblique line becomes WTIME (T). In other words, it is an integral value when the relationship between the call registration time and the average number of passengers is a function.

This is because if the WTIME (T) is cut off laterally as shown in Fig. 4, the number of passengers in the height in the longitudinal direction can be indicated by the call waiting time in the transverse direction.

That is, in the thick strip of FIG. 4, the unit argument (0.2 in this case) is about 13 seconds of waiting time, and when 0.2 recognition with various waiting times is collected, the waiting time of each passenger at 20 seconds of call registration time can be obtained. Will be. Step 46 outputs the talk WTIME (T) of the waiting time for each passenger to the call registration time T through the output circuit 16 to reach step 47. "T" is normally given as an argument in the program that actually makes the call allocation. In the above embodiment, the one-second ascending call has been described, but of course, the other call is also processed.

The call is checked every 1 second so that the registration time is recorded in 1 second units. However, the time can be changed.

For example, the call may be checked every 0.1 seconds and the registration time may be recorded every 5 seconds.

In addition, the apparatus for detecting the number of passengers can be considered in various ways, such as a device that counts the number of people at the entrance and exit of the car by ultrasonic waves or a device that counts the waiting number of the platform by infrared rays.

Furthermore, when predicting the number of passengers at the time of arrival of an elevator given a service prediction time different from the object of the present invention, using the graph of FIG. 4, more accurate information is obtained than in the conventional known example.

As described above, the call registration time and the number of passengers are recorded and the waiting time of the passenger is predicted based on the statistical results. Therefore, the waiting time for each passenger can be predicted and the military management performance can be improved.

Claims (3)

A call registration time counting means (3) for counting a call registration time registered to dispatch an elevator, a passenger counting means (4) for counting the number of people aboard an elevator serving the call, the call registration time and the call for each call An elevator waiting time predicting device comprising a call information recording means (5) for recording the number of passengers and a passenger waiting time predicting means (6) for predicting the waiting time of the passenger by the output of the call information recording means (5). 2. The elevator waiting time predicting apparatus according to claim 1, wherein the passenger waiting time predicting means (6) predicts a total of waiting times for each passenger. 2. A passenger waiting time predicting means (6) according to claim 1, wherein the passenger waiting time estimation means (6) finds a function y = f (x) based on the relationship between the call registration time (x) and the number of passengers (y), and for a predetermined time t, An elevator waiting time predicting apparatus, characterized in that f (x) dx is predicted as a total of waiting times for each passenger.