JP4720126B2 - Neckwork type elevator group management control device - Google Patents

Description

  The present invention relates to an improvement of an elevator apparatus that automatically generates a network type group management control mechanism.

Recently, a control rule that can be understood by experts and users by using “GNP” (Genetic network programming) as a control mechanism of an elevator group management system has been proposed.
“Elevator Group Supervisory Control Systems Using Genetic Network Programming” (Papers presented at CEC 2004)

Since the elevator car number is directly used for the determination node and the processing node constituting the GNP, if the number of elevator cars is increased, the number of processing steps will be greatly increased, and the scale of the network will be rapidly expanded.
Furthermore, in the process of automatically forming a network, only a small part of many paths on the network is executed, and it is difficult to accurately evaluate the entire network.

The present invention provides, as means for allocating a hall call to an elevator car, a plurality of determination nodes that perform determination processing relating to the state of an elevator group and a car assignment process that selects one car from a plurality of cars based on the determination process. In an elevator equipped with a plurality of processing nodes to be executed and a network in which a connection is automatically formed, a processing node to which a call is assigned is determined based on the plurality of determination nodes, and the ranking of the processing nodes is determined. The elevator car is indirectly designated and assigned based on the ranking data .

Advanced control rules can be realized with a relatively small number of nodes, and the processing time of GNP can be greatly reduced as compared with the conventional configuration. In addition, since the elevator car is indirectly designated, the completed GNP network can perform correct control even if the operation mode of the elevator changes partially regardless of the number of elevator cars. On the other hand, it is possible to exchange and compare with other on-site GNP, and the initial setting at the time of shipment can be simplified.
Furthermore, since the scale of GNP is reduced, accurate evaluation can be performed during automatic generation, and a high-performance GNP can be constructed efficiently. In addition, there is an advantage that it is easy to understand the control law expressed by the automatically generated GNP network.

According to the present invention, an elevator car is designated / assigned to a new hall call based on a predetermined ranking using a GNP network.

Embodiments of the present invention will be described below with reference to the drawings. FIG. 1 is an overall configuration diagram showing an embodiment of the present invention, and FIG. 2 is a flowchart showing an example of the GNP network shown in FIG.

 In the figure, 1 is an elevator group indicating a plurality of elevators, and 2 is an elevator state monitoring unit that monitors the state of the elevator group 1, and outputs various types of elevator information 3. Reference numeral 4 denotes an elevator rank calculation unit that calculates the rank of traffic conditions TR such as waiting time D, elevator load L, UP peak / DOWN peak, and the like, and outputs ranking data 5. Reference numeral 6 denotes a GNP network to be described later according to the present invention, which outputs a control determination signal 7. Reference numeral 8 denotes a control command calculation unit which receives the control determination signal 7 and outputs an allocation command 9 to the elevator group 1.

Here, as shown in FIG. 2, the GNP network 6 is composed of four determination nodes, four processing nodes, and a START node. For indirect designation of the elevator, for example, 2 of “waiting time D” and “elevator load L” are used. Use street ranking.

When the assignment determination is requested from the elevator group 1, the following operation is performed.
First, a signal 3 indicating the state of the elevator group 1, for example, the current floor, direction, traveling state, registered call, etc. of each car is collected by the elevator state monitoring unit 2 and transferred to the elevator rank calculation unit 4. Next, from the signal 3, the operation of each elevator car is predicted by the elevator rank calculation unit 4, the waiting time when the generated call is assigned is calculated, and ranking is performed based thereon. The car whose waiting time is likely to be minimized is determined as “D1”, the next is “D2”, and so on. Similarly, ranking of “load L” (L1 is the car with the smallest load, L2 is the next car, L3 is...) Is also performed based on the number of calls assigned to each elevator car.

  Next, the ranking data 5 is transferred from the elevator rank calculation unit 4 to the GNP network 6, and the GNP network 6 performs the determination by tracing the determination nodes in order from the previous processing node (initially from the START node). When the GNP network 6 arrives at the processing node, the indirect car designation indicated by the node is sent as a control determination signal 7 to the control command calculation unit 8.

The control command calculation unit 8 determines the allocation command 9 by combining the ranking data 5 and the control determination signal 7 and inputs them to the elevator group 1. The elevator group 1 designates the elevator car based on the assignment command 9 and performs the assignment.

  The flowchart shown in FIG. 2 will be described in more detail. First, it is determined whether the traffic situation TR is “TR = UP?”, And if it is not an UP peak, the processing node “D1” immediately means “D1”. The elevator car with the minimum waiting time is determined, and the process ends. If the traffic situation is UP peak, a determination of “D1 = L1?” Is made, that is, “Is the elevator car that can be serviced fastest is the least loaded?” If so, “D1” It is determined and assigned to the elevator car with the minimum waiting time.

  If the above determination is “NO”, then the determination of “D2 = L1?” Is made, and if “the elevator car that arrives second fastest has the minimum load?” Is “YES”. , That elevator car is decided. Thereafter, determination and determination are repeated in the same manner, and when one of the processing nodes is reached, the processing ends there.

In the above description, the basic concept and one embodiment of the present invention have been described. However, in addition to the node that makes the final decision in the processing node, temporary values are stored and can be used for subsequent determinations and the like. You may make it add the substitution node to do. That is, it is conceivable that “A No. A” and “No. B B” are determined during the GNP network processing and used later such as “A = L1?”. Further, a fuzzy operation other than a logical operation may be introduced into the conditional statement of the determination node.

It is the whole block diagram which shows one Example of this invention. It is a flowchart figure which shows an example of the GNP network shown in FIG.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 Elevator group 2 Elevator state monitoring part 4 Elevator order | rank calculating part 6 GNP network 8 Control command calculating part

Claims (1)

As means for allocating a hall call to an elevator car, a plurality of determination nodes for performing a determination process on the state of the elevator group and a plurality of car allocation processes for selecting one car from a plurality of cars based on the determination process In an elevator equipped with a processing node and a network in which a connection between them is automatically formed, a processing node to which a call is assigned is determined based on the plurality of determination nodes, and the ranking of the processing node and the ranking data of the car Network type elevator group management control device characterized in that an elevator car is indirectly designated and assigned based on the above .

Images