JPH01261176A - Group control device for elevator - Google Patents

Abstract

PURPOSE:To perform flexible and effective service by catching present and near future traffic conditions, when each elevator is assigned for a hall call, as a fuzzy amount and selecting a rule, most suited for each condition, by an on-line and an assigned cage by that rule. CONSTITUTION:An estimation arithmetic means 4 calculates arrival estimated time to each floor and a passenger load in each boarding floor to be estimated of two or more elevators when a hall call is generated. An evaluation item arithmetic means 5, being based on the estimation arithmetic result, calculates various evaluation items serving for an evaluation index of present and near further traffic conditions when the two or more elevators are selected respectively as the assigned cage. A rule selecting means 6 calculates a fuzzy amount for the traffic condition in that time from the arithmetic result of the evaluation item, and being based on this fuzzy amount, an adequate rule is selected from a group control rule base 3. A proposed cage selecting means 7 selects a proposed cage being based on the selected rule, and an assigned cage selecting means 8 selects the adequate cage of the proposed cages.

Description

[Detailed Description of the Invention] [Industrial Application Field] This invention relates to an elevator group management control device, and in particular, to an elevator group management control device that manages a group of elevators in response to the ever-changing traffic in a building. It is related to the device.

[Prior Art] Recent elevator group management involves predictive calculations such as the predicted arrival time at each hall when each elevator is provisionally assigned and when it is not assigned, when a hall call is generated by operating a hall button at an elevator hall. The mainstream control method is to select the assigned car by selecting the assigned car, and then turn on the indicator lights in the hall to guide waiting passengers.

As the assigned car selection method in the conventional elevator group management method, the method described below is adopted.

That is, based on the above prediction calculation results, the service status at the time when the latest call occurs when each elevator is selected as an assigned car is calculated using a predetermined evaluation function as shown in equation (1). This is a method of evaluating and selecting the one with the best evaluation value.

J(e)=min[J(1), J(2), −, J
(N)] (1) J(i)=f (xik, yi
k, zik, ....

xik, yik, zik, -) However, e: Damaged car N: Total number of elevators J(i): Evaluation value of elevator i xik: Hall call k when elevator i is assigned to the latest hall call Waiting time yik: Probability of forecast failure for hall call k when elevator i is assigned to the latest hall call ztk: Probability of forecast change for hall call k when elevator i is assigned to the latest hall call xik :Waiting time for hall call k when elevator i is not assigned to the latest hall call yik :Probability of forecast failure for hall call k when elevator i is not assigned to the latest hall call zik :ftz new hall In this way, in the conventional method, the forecast change probability of hall call k when elevator i is not assigned to the call [Problem M to be solved by the invention] Since it only evaluates hall calls that have occurred, it does not take into account hall calls that may occur in the future. Therefore, even if the current evaluation is good, it may be Inconvenient situations such as drunken driving occur, resulting in a decline in service.

Further, the conventional method described above is a control method using a preset evaluation function, but in other words, control is performed using a fixed allocation logic. However, because the traffic conditions in buildings change extremely dynamically with each call at a boarding point, there are times when situations cannot be contained using fixed allocation logic, causing a decline in service.

This invention was made in view of the above-mentioned circumstances, and takes into consideration not only the current traffic conditions but also the near future traffic conditions, and enables elevator group management that enables efficient elevator service that responds to the ever-changing traffic demand within buildings. The purpose is to serve the control device.

[Means for Solving the Problems] An elevator group management control device according to the present invention performs calculations to predict the arrival time of a plurality of elevators to each floor and the passenger load at each landing when a hall call occurs. A prediction calculation means, an evaluation item calculation means that is an evaluation index of current and near future traffic conditions when a plurality of elevators are respectively selected as assigned cars based on the prediction calculation results, Calculates fuzzy quantities corresponding to traffic conditions in the near future, and uses a group management rule base that stores rules that describe appropriate allocation methods for various traffic conditions in a conditional execution format to best match the traffic conditions at that time. The elevator is equipped with a rule selection means for selecting a rule, a candidate car selection means for excluding inappropriate elevators based on the selected rule, and an assigned car selection means for selecting an appropriate assigned car from the candidate cars. be.

[Function] In the present invention, the prediction calculation means performs prediction calculation of the predicted arrival time to each floor of a plurality of elevators when a hall call occurs and the passenger load at each landing, and the evaluation item calculation means predicts Based on the calculation results, various evaluation items are calculated as evaluation indicators of the current and near future traffic conditions when multiple elevators are selected as assigned cars.
The rule selection means calculates a fuzzy quantity corresponding to the current traffic condition from the calculation results of the evaluation items, and selects an appropriate rule from the group management rule base based on the fuzzy quantity,
The candidate car selection means selects a candidate car by eliminating inappropriate elevators based on the selected rule, and the allocated car selection means selects an appropriate elevator from among the selected candidate cars based on the selected rule. The user will select the assigned basket.

Therefore, according to the present invention, it is possible to provide an efficient elevator service that can immediately respond to ever-changing traffic demands within a building.

[Embodiments] Hereinafter, embodiments of the present invention will be described in detail based on the drawings.

FIG. 1 is an overall configuration diagram of an elevator group management control device in an embodiment of the present invention.

In the figure, the operation control unit l-1 includes elevator control devices 91 to 911 corresponding to each car and hall control devices 10. ~ Ion takes in information regarding their status, and commands regarding operation are sent to the control devices 91 ~ 9 - and 10 . ~10n.

When a hall call occurs, the call assignment control unit 2 selects and assigns an appropriate assignment car to the hall call.

The group management rule base 3 stores elevator assignment methods and conditional execution formats necessary for group management.

The call allocation control unit 2 includes a prediction calculation subunit 4 that calculates the predicted arrival time of each elevator at each landing and the passenger load at each landing; an evaluation item calculation subunit 5 that calculates various evaluation items that serve as evaluation indicators of current and near future traffic conditions when an elevator is selected as an assigned car; and an evaluation item calculation subunit 5 that calculates fuzzy quantities regarding traffic conditions from the calculated evaluation items , a rule selection subunit 6 that selects the rule that best matches the traffic condition from the group management rule base 3, and a candidate car that eliminates inappropriate elevators based on the selected rules and selects an elevator group that is a candidate for allocation. It includes a selection subunit 7 and an assigned car determining subunit 8 that determines a final assigned car from among the selected candidates based on the selected rule.

Next, the operation of this embodiment configured as described above will be explained with reference to the flowchart of FIG.

First, when a hall call occurs at a certain boarding point (step SO
), information regarding the operation status of each elevator and the generation status of each hall call up to that point is transmitted to the call allocation control unit 2 via the operation control unit 1 (step Sl).

In step S2, the prediction calculation subunit 4 performs prediction calculation of the expected arrival time of each elevator at each landing and the passenger load of each elevator at each landing. That is, when a hall call occurs, the predicted arrival time for each elevator from the current floor to each floor is calculated. The passenger load prediction calculation is performed by calculating the number of passengers in the elevator.

For example, if an elevator carrying X people is scheduled to stop at floor f, and it is predicted that y people will get off and 2 people will get on at floor f, the predicted passenger load on the first floor of this elevator The value is (x-y+z). This passenger load prediction calculation is performed for each elevator and each landing.

In the next step S3, the evaluation item calculation subunit 5 performs various evaluations as evaluation indicators on the current and near future traffic conditions when each elevator is selected as an assigned car based on the prediction calculation results of the prediction calculation subunit 4. Perform calculations on items. That is, it is expected when each elevator is selected as an assigned car.

Calculate the waiting time at each landing, the probability of forecast change or forecast failure for registered hall calls, the position of each elevator in the near future and their correlation, and the maximum and average values of these. conduct.

In step S4, the rule selection subunit 6 uses fuzzy inference from the rule group stored in the group management rule base 3 to calculate the fuzzy amount for each rule with respect to the traffic condition using the evaluation item calculation results of the evaluation item calculation subunit 5. , select the rule with the largest amount of fuzzyness, that is, the rule that best fits the traffic condition.

The rule group stored in the group management rule base is described in the condition-execution (IF2TIIEN) format as shown below.

(RULE N) IF ((condition-Nl) or (con
dition-N2)) and (condition
n-N3) and (condition-Nn)I
IBN (Procedure-N) Here, the V condition (IF section) 1 indicates the degree of suitability of each rule to the traffic condition, and is connected by and and or connection branches of each (condition). Also, each (
Each condition) indicates a suitable condition for the traffic condition at that time.For example, the maximum waiting time that occurs when r elevator A is allocated is 1 second or less.wax-wait (A), It is written as LT, [TIbl. The suitability of each of these suitability conditions is expressed by a fuzzy quantity defined by associating the subjective ambiguity of a certain quantity such as 1 with r greater or 1 with t smaller with a value from 0 to 1. Specifically, the fourth
It is determined by the membership function shown in the figure. FIG. 4 shows ・GT, [Tlbl is ・LT, [Tlbl is ・EQ, and [T'lbl is respectively.

Further, the calculation of the fuzzy amount and the selection of rules for condition 1 will be explained with reference to the flowchart in FIG.

In step SAI, the rule selection subunit 6 uses the evaluation item calculation result of the evaluation item calculation subunit 5 to calculate the membership function value Cij of (condition-ij) of rule 1. That is, rule l's (
condition-11), (condition
-12),..., (condition-1k),...
..., Rule 2 (condition-21), (c
condition-22), ..., (condition
ion-2k), ..., rule m's (conditioni
on-+*1), (condition-m2),...
The membership function values for . . . , (condition-mk), .

In step SA2, the rule selection subunit 6 selects a connection branch an between (dondition) for rule i.
The fuzzy amount Ci of the rule is calculated by d and or. That is, the fuzzy amount C1 of rule 1, the fuzzy amount C2 of rule 2, and the fuzzy amount CI+ of rule m are calculated.

In this case, for example, each (condition) of rule i is (condition-il) and ((cond
ition-i2) or (condition-33)
), then Ci = sin (Cil, wax (
Ci2. The calculation procedure is as follows.

In step SA3, the rule selection subunit 6 selects the fuzzy quantities C1, C2, . . . , Cm, . . . for each rule.
Among them, the rule that provides the maximum fuzzy WkC (to ma) is selected.

In FIG. 2, in step S5, the candidate car selection subunit 7 executes the selected rule (TIIE
Part N) Execute 1 to select candidate cars.

The (Procedure) of V execution 1 of the rule is the most “
This describes the procedure to be executed when a rule that satisfies condition j, ie, a rule with the largest amount of fuzzyness, is selected.

For example, in Kokote, there is a condition in V condition 1 such as "If elevator A is allocated, there is a high possibility that a dump operation will occur in the near future", and r execution 1 has a description of 1 excluding i elevator A. If so, execute it and select one of the candidates.

In step 6', the candidate car selection subunit 7 executes r-execution 1 of the selected rule and selects the final assigned car from among the candidate cars.

For example, in r-execution 1 of the selected rule, "Select the elevator with the minimum average waiting time among candidate cars 1"
If there is a description like this, execute it and select the assigned car.

In step 7, the call assignment control unit 2 sends an operation command and a forecast command to the halls to each elevator via the operation control unit 1. These steps are done online.

Therefore, in this embodiment, not only the current traffic condition but also the near future traffic condition is recognized, and service elevators are kicked based on a set of rules that describe an appropriate allocation method. Certain inconvenient situations can be avoided, and flexible and efficient elevator service can be provided for the variously changing building environments.

[Effects of the Invention] As explained above, this invention captures the current and near future traffic conditions when each elevator is assigned to a hall call as fuzzy quantities, and selects the rule that best suits each situation online. Since the appropriate allocation basket is selected based on the selected rules, it is possible to avoid inconvenient situations that may occur not only at the moment but in the near future, and to prevent the ever-changing building environment. This has the effect of enabling flexible and effective elevator service.

[Brief explanation of the drawing]

FIG. 1 is a block diagram of the elevator group management control system according to the present invention, FIGS. 2 and 3 are flowcharts showing the operation of the elevator group management control system shown in FIG.
The figure is an explanatory diagram of membership functions. In each figure, 1 is an operation control unit, 2 is a call assignment control unit, 3 is a group management rule base, 4 is a prediction calculation subunit, 5 is an evaluation item calculation subunit, 6 is a rule selection subunit, and 7 is a candidate car selection subunit,
8 is an assigned car selection subunit. In the drawings, the same reference numerals indicate the same or equivalent parts. Agent Masuo Daikun (2 idiots) Figure 2 Figure 3 Figure 4 Procedural amendment (voluntary) Showa 1920, month 8, 2, Name of the invention Elevator group management control device 3, Person making the amendment Representative Shiki Moriya 5, Subject of amendment (1) Detailed explanation of the invention in the specification column 6, Contents of amendment (11 In the first line of page 8 of the specification, the words "assignment method" and "assignment method" should be changed to "allocation method") (2) In the 1st and 2nd lines of page 13, [Membership BIQ value C1jJ is corrected to ``Membership function value Ci jJ.

Claims (1)

[Claims] a plurality of elevators in service between each floor; a hall call means provided on each floor for calling the elevator; and an estimated arrival time of the plurality of elevators at each landing upon generation of the hall call; A predictive calculation means that performs predictive calculations of passenger loads in the event of a call, a group management rule base that describes an appropriate elevator allocation method in advance in a conditional execution format, and a fuzzy system that supports not only the time when a call occurs but also the evaluation of traffic conditions in the near future. rule selection means for calculating a fuzzy quantity and selecting an optimal rule from the group management rule base based on the fuzzy quantity; candidate car selection means for eliminating inappropriate elevators based on the selected rule; An elevator group management control device comprising an assigned car selection means for selecting an assigned car from elevators not excluded by the car selection means based on the selected rule.