JPS59138580A - Controller for group of elevator - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

[Detailed Description of the Invention] [Field of Application of the Invention] The present invention relates to a group management control device for elevators, and particularly to a group management control device suitable for performing distributed waiting that can improve serviceability. .

[Prior art]

When controlling elevators by group control, if the cars that have finished their service are kept on standby at the floor where they have been serviced until a new hall call is made, then when new hall calls are concentrated on a certain floor, the service will be immediately started to respond to the new hall calls. There are some things you cannot do. For this reason, various distributed standby systems have been proposed in the past. For example, a system in which the car is moved upward or downward at regular intervals;
Divide the Elechetano Sahis floor into multiple blocks,
Have one or two elevators waiting for each flock, or one elevator for a particular floor with the highest average number of calls? For example, the system is put on standby.

However, in any of the above systems, there is a problem in that although there is a lot of unnecessary driving, the service to passengers is not necessarily improved.

[Purpose of the invention]

The present invention has been made in view of the above, and its purpose is to manage groups of elevators that can calculate the number of waiting elevators on a waiting floor according to traffic demand and perform optimal distributed timing control. The purpose is to provide a control device.

[Summary of the invention]

A feature of the present invention is that the collection and storage means for collecting and storing traffic volume within the pill is configured to collect and store the number of people getting on and off each floor, and the collection and storage means collect and store the number of people getting on and off each floor. Waiting number calculating means for calculating the waiting floor for waiting elevators and waiting number calculating means for calculating the number of waiting elevators to be made to wait at the waiting floor, and calculating results of the two calculating means. The present invention is based on the structure in which the above-mentioned 2V beta is dispersed and expected.

[Embodiments of the invention]

The present invention will be explained in detail below with reference to the embodiments shown in FIGS. 1, 2, 4 to 11, and FIG. 3.

FIG. 1 is an overall hardware configuration diagram showing one embodiment of the group management control system for an industrial V-beta according to the present invention. In FIG. 1, the group management control device MAVC includes a microcomputer Ml (hereinafter abbreviated as microcomputer) that controls the operation of the 2V beta, and a microcomputer M that controls the simulation.
2, and data communication is performed between the microcomputers M1 and M2 via the communication line CMc' by the respective serial communication processors S])Ac. The detailed configuration and operation of the serial communication processor SDAc are disclosed in Japanese Patent Application Laid-open No. 56-37972 and Japanese Patent Application Laid-Open No. 56-37973, so a description thereof will be omitted here.

1 The microcomputer M1, which controls the operation of the L/heater, receives the call signal HC from the hall call device HD via the parallel input/output circuit PIA'e, and also sends commands such as door opening/closing, acceleration/deceleration commands, etc. Individual engineer V beta? The control microcomputers E1 to En (in this case, it is assumed that there is an n-th machine) are the same series communication processors SDA and -8DAn as above, and the communication line CM,
-Connected via CMn1.

On the other hand, the microcomputer M2 has a setting device P that provides the information necessary for determining the optimum operation control parameters of SI, MI>V-JON.
Signal PM from D is input via parallel input/output circuit PIA.

In addition, the machine control microcomputers E1 to En have information 11. Control input/output element E consisting of various safety limit switches, subv, and response rungs for the envator 10. ~E,,I On is the communication line S10+~S
IO,,' are connected via a parallel input/output circuit PIA.

Figure 2 is an explanatory diagram of the overall configuration of the 2V Beta, WH, ~W
Hn is the drive device, CG1 to CG11 are the riding positions, WC1
~WC0 is a counterweight, car CG, ~CGI
The load detectors VVK, ~WK, installed in , are connected to the group management control device MA or the machine control microcomputers E1 to EI in FIG. 1 through communication lines.

It is connected to the. Note that FL1 to FL□ indicate each floor.

Is Fig. 3 an example of the pressure waveforms of the load detectors WK and -WK in Fig. 2? FIG. In Figure 2, the output voltage δ1
is proportional to the number of passengers VC, and the output voltage δ2 is adjusted to be proportional to the number of passengers getting off the train.

Now, when an arbitrary 2V beta stops at an arbitrary floor in response to a hall call or an idiot call on each floor PL, -FLm, the number of incoming passengers and the number of passengers a is expressed by the following formula. .

Here, WAWR: average load of one passenger Next, a method of determining the number of waiting elevators for a crowded floor (which becomes a waiting floor) will be explained.

Now, the total number of engineering V betas is n, and any floor! .

When the number of service elevators at a certain time of traffic demand (for example, when dispatched) is k nm, n□ is here, S
81; Learned number of boarders on all floors α; Coefficient C1; Capacity of boarding corner Tf, predetermined time Ill, Learned one-round time of the car, nm; Obtained from an arbitrary number of cars. Then, the number of elevators to wait on a crowded floor (n+t) is determined by the following formula.

Here, b, 11; The learned number of people boarding each floor Now, for example, the number n□ of one Service Evatave at the time of traffic demand calculated by equation (3) is 4, and the number of passengers boarding from the 1st floor is 4. In the case of 70% of all floors, the number of V-beta machines to be kept on standby on the first floor, n, is given by equation (4), n+ =
0.7 x 3 out of 4 (units).

FIG. 4 is an explanatory diagram showing one embodiment of the overall software configuration of the group management control device of the present invention. The software is roughly divided into operation control system software SF1 and CIMIE hV-John system software 8F2.

The operation control system software S Fi is composed of an operation control program 5F14 that directly commands and controls elevator group management control such as call assignment processing and disassembly standby processing of the two-volt elevator that is the subject of the present invention. As input information for this program 8F14, the machine control microcontroller E1~
Elevator control cheetah table 5FII and hall call table 5F12. which store the position, direction, car call, etc. of the elevator, which are transmitted by the processing of the machine control program of En. Envelopes such as the number of managed enva- tors
The data of the motor specification table 5F13 as well as the optimum operation control parameters calculated and output by the computer system software S12 are input.

On the other hand, the Shimmer 4V-Zion software SF2 consists of the following processing programs.

(1) Data collection program 5F20 This is a program that collects data for shimmy L union by sampling the contents of hall calls and 2V beta control cheetah tables 8F12 and 5FII online at regular intervals. Mainly collect demand.

(2) Simulation V-simulation data calculation program F22 This takes into account the contents of the sampling data table 5F21 that stores online sampling data collected by the data collection program 5F20 and the contents of the table SF21 of the past time period. This is a program that calculates simulation V-simulation data.

(3) Traffic demand classification program 8F23 This inputs the destination-specific traffic demand and time information obtained from the Cheetah table 5F24 for Simulation V-John and calculates the traffic volume within the building, before lunch.

The program divides traffic demand into eight categories: during lunch, after lunch, normal, normal congestion, leaving work, and quiet.

(4) Simulation V-simulation execution Grodarum 5F35 This includes the simulation data table 5F24, the traffic demand classification table 5F34, and the engineering V beta specification table 8F.
Enter the contents of 25 and execute the simulation V-simulation, and use the simulation V-simulation to process the congestion floor f-ta f.
- This is a program that is output to the pull SF 36.

(5) Crowded floor calculation program SF 37 This is a crowded floor processing data table SF based on simulation.
Congested floor calculations are all performed according to the contents of 36, crowded floor table S
This is a program that outputs to F38.

An embodiment of the overall software configuration of the present invention has been described above. Next, a calculation method for the crowded floor waiting process using simulation will be explained.

FIG. 5 is an explanatory diagram showing an example of the table configuration of the operation control system software S) i"l shown in FIG.
control data table S F 11 .

Consists of three blocks: hall call table 8F12 and engineering V beta specification table 8F13.
The tables in each block will be described each time the operation control program is explained.

Below, we will first explain the operation control system program.
After that, we will explain the simulation system grogram. The program described below is a system program that divides a program into multiple tasks and performs efficient control, that is, an operating system (Operating System).
8). Therefore, the program can be started freely by the system timer or by another program.

Next, the enovator call assignment program and arrival estimate u11] time table calculation program, which are particularly important in the operation control program 5F14, will be explained.

FIG. 6 is a flowchart showing an embodiment of a call allocation program for two V betas waiting on a crowded floor, and this program is started every certain period (for example, every 5 seconds).

In step AIO, the congested floor (which will be a waiting floor) and the number of waiting elevators obtained from the congested floor table 5F38 are specified. The calculation method in this case will be explained in detail when the simulation system is described later. In steps A20 to A40, all loose processing is performed, and this is repeated until a specified number of V-betters are waiting on the specified waiting floor. In step A30, the predicted arrival time of each worker V beta to the waiting floor is calculated, and in step A40, the two V betas with the smallest predicted arrival time are selected. If it is determined in step A20 that the specified number of 2V betas are waiting on the waiting floor, this program is terminated.

FIG. 7 is a flowchart showing an example of a program for processing at step A30 in FIG.

k in step A30-1 is an arbitrary encoder number, n
is the number of one 2V Beta. In step A30-2,
This V-Beta determines whether it is in service (being sent on its way due to a hall call or car call) or if it is waiting on a designated waiting floor. If ``YES'' in step A30-8, the envelope is updated. If ``NO'' in step A30-2, initialization (uM, uM,
k, and set it in the "Tk arrival pre-pickup" time table. In step A30-4, proceed one floor. In step A30-5, it is determined whether or not the floor has become the designated waiting floor. If "YES", step A30-
Jump to 8, update the engineering V beta, if “NO”
"If so, in steps A30-6 and A30-7, the time T required for traveling on the first floor is added to the time table T, and it is set in the entire predicted arrival time table. Returning to step A30-4, the time T required for traveling on the first floor is added to the time table T. When the above process is executed for all the elevators k, the number n of elevators to be waited on the waiting floor is determined from equation (4), and in step A40 of FIG. The most suitable elevator-k for waiting can be selected.

Next, the table configuration in the simulation software SF2 will be explained. FIG. 8 shows sampling data table 5F21. Simulation data table 5F24. Elevator-specification table 8F25
(This is the same as Figure 5, so illustration is omitted.)
, is a table configuration diagram showing an example of a traffic demand classification table 5F34. Further, FIG. 9 shows an example of the configuration of the crowded floor processing data table 5F36, which includes a boarding number table Th for each floor, a boarding number table Ill for all floors by direction, a boarding number ratio table TR for each floor It is composed of

Next, the program of the simulation software 8F2 will be explained. First, data collection program 5
F20 is activated at regular intervals (for example, 1 second), and when data is collected for a certain period of time (for example, 10 minutes), it is stored in the sampling data table 5F21 in FIG. There are various data collection items, but in this invention 10 crumbs is d
, especially the destination traffic volume Q, the first floor running time of the elevator t
Collect data such as standard stopping time t once.

The first floor running time tr of the elevator and the one-time standard stop time 48 are calculated using the running time mJ after the sampling time.
By dividing wo by the number of floors traveled, the traveling time t for the first floor is ′
01i can be calculated, and the standard stopping time Ta can be calculated once from the number of times the elevator stops and the time between doors (stopping time).

In addition, when the collected data reaches the end of the Sunblink time, the above calculation is performed and the collected data is stored in the online measurement table and the past time period table of the Samblink Cheetah Table SF21 shown in Figure 8. .In the online measurement table, QnlllF, L r n@W
Add a new subscript to the item name like + L Rn@W, and add Q odd to the past time zone table.
+ t otd, t@old, etc. are written by adding the ``Otd'' character to the item name.

Shimiz L/- John data calculation grogram 5F22
is activated periodically, and performs predictive calculations by adding and subtracting an appropriate combination variable γ between online measured data for simulation V-simulation and past data.

For example, the destination traffic volume is calculated using the following formula.

Qpra-γQn, -Z1-γ) Q ota -
(5) Therefore, the larger the coupling variable γ, the greater the weight of the destination traffic volume data measured online.

Note that the suffix "pre" is added to the predicted data. Similarly to the above, the prediction d(redata "Tpr@+"@prll) of the first floor running time and one standard stop time is also calculated.If the data of trp*r, ts pr.
The predicted first floor running time and one stop time table of the Cheetah Tape 5F24 for simulation V-simulation shown in FIG. 8 are set. Then, based on the predicted data performed by this program, the simulation execution program SI
i'35'. In addition, based on the above forecast data and time information, the traffic demand classification program SF
33, the destination traffic forecast data is dispatched, before lunch, during lunch, after lunch, normal, and normal congestion.

Divided into eight types of traffic demand: leaving work and off-duty traffic.

Figure 10 shows the simulation execution globulum 5 of Figure 4.
It is a flowchart which shows one example of F35. In step C70, the output section pressures of the load detectors WK, ~WK, of the rides and CG1~CG, , in FIG.
The number of people boarding the elevator is collected by traffic demand (S), direction (J), and 7th floor (1) (■□X is the total number of floors) through the D converter. Congested floor handling table T for the number of people boarding each floor in Cheetah Table SF 36 shown in the figure
In step C80, the number of boarders on all floors is calculated by traffic demand and direction, and collected in the number of boarders on all floors by direction table T6 in FIG. Furthermore, in step C85, the ratio of the number of people boarding on each floor is calculated by traffic demand and direction. collect.

Figure 11 shows the crowded floor waiting drop shortening program 5F37 in Figure 4.
3 is a flowchart showing one embodiment of the present invention.

Number of people boarding at step D5: 8819 Car capacity Ca
, a predetermined coefficient α9 time Tt, etc. are set, and in step D10 it is determined whether the traffic demand is the same as 5 seconds ago.
Terminate the program with 'S'. If 'N
If it is t1.O'', set the next traffic demand S (~ (step D20), by direction j.

Separate step L)60. At D70, calculations are performed as shown in the figure, and the results are collected from the crowded floor table 5F38i/ in FIG. 1- That is, in step D60, the number of service F betas is calculated, and in step D70, the table TRO Uchitani and step D60 are calculated.
The number of service 2V beta units calculated by n. The number of waiting machines nt' is determined by multiplying by .

After performing the above processing, these values are sent to the operation control program 8.
Use with F14.

According to the embodiment of the present invention described above, simulation software SF2' is provided to collect and store the number of people getting on or off at least for each floor, and wait according to the stored traffic demand for each floor and direction. Since the floors are determined and the number of standby 2V betas is determined and the units are placed on standby in a distributed manner, group management control with good serviceability becomes possible.

In the above embodiment, the waiting floor and the number of waiting cars are determined according to the past take, especially the number of people boarding each floor and direction. That is, it goes without saying that control may be performed according to the current number of people on the floor.

〔Effect of the invention〕

As explained above, according to the present invention, the waiting floors and the number of waiting V-beta cars are calculated according to traffic demand, so it is possible to perform optimal distributed timing control and improve serviceability. This has the advantage that group management control is possible.

[Brief explanation of drawings]

Figure 1 is an overall hardware configuration diagram showing an embodiment of the V-Beta group management and control device of the present invention, Figure 2 is an explanatory diagram of the overall configuration of the V-Beta group, and Figure 3 is the load detector shown in Figure 2. FIG. 4 is an explanatory diagram showing an example of the overall software configuration of the group management control device for the V-Beta of the present invention, and FIG. 5 is the operation control system of FIG. 4. An explanatory diagram showing an example of the software's full configuration; FIG. 6 is a flowchart showing an example of the call allocation program for the two V betas waiting on the crowded floor in the operation control program of FIG. 4; FIG. 6 is a flowchart showing an example of the program for processing in step A30, FIG. 8 is a table configuration diagram showing an example of the simulation software chiful shown in FIG. 4, and FIG. FIG. 10 is a flowchart showing an example of the simulation V-simulation execution program shown in FIG. 4; FIG. 11 is a table configuration diagram showing an example of the floor processing cheetah table; FIG. It is a flowchart showing one embodiment. MA... Engineering V beta group management control device, HD... Hall call device, PD... setting device, Δ41... microcomputer for controlling the envator operation, M2...Simulation microcomputer, El "E n...-j [? Itl microcomputer, E I O+ ~E I On...tt+
+Control input/output element, CG, ~CGrl...Next car,
WK, ~WK11...Load detector. No Z side sootm

Claims (1)

[Scope of Claims] 1. A plurality of operators serving multiple floors, a hall calling means provided on each floor, a means for collecting and storing traffic in the building, and an elevator serving hall calls. An elevator group management control device comprising a selection means and a group management control means for allocating the hall call to an elevator selected by the selection means among the plurality of elevators. The collecting and storing means is configured to collect and store the number of people coming and going to and from each floor, and the waiting floor is configured to time the elevator according to the traffic demand on the floor stored in the collecting and storing means. Waiting floor calculation means for calculating the floor and waiting number calculation means for calculating the number of waiting elevators to be made to wait at the waiting floor, and based on the calculation results of the two calculation means, the number of waiting elevators is calculated. - A group management control device for an elevator, characterized in that it is configured to disperse timing of -. 2. The elevator group management control device according to claim 1, wherein the waiting floor calculation means is configured to calculate the waiting floor from past data. 3. The elevator group management control device according to claim 2, wherein the past data is at least the number of people riding on the elevator from each floor. 4. The elevator group management control device according to claim 1, wherein the waiting floor calculation means is configured to calculate the waiting floor based on the number of people on the floor measured online.