PROCEDURE FOR CONTROLLING AN ELEVATOR GROUP WHERE VIRTUAL PASSENGER TRAFFIC IS GENERATED

Abstract: An elevator group comprising at least two elevator cars (Car1, Car2) is controlled using a group control unit which allocates the calls to different elevators. Based on statistical data and/or statistical forecasts, a virtual passenger traffic is generated and simulation is applied to create events in the virtual passenger traffic, on the basis of which an elevator-specific cost is computed for each call to be allocated. Based on the costs, the best elevator is selected to serve the call.

Description: PROCEDURE FOR CONTROLLING AN ELEVATOR GROUP WHERE VIRTUAL PASSENGER TRAFFIC IS GENERATED The present invention relates to a procedure for controlling an elevator group as defined in the preamble of claim 1. The function of elevator group control is to allocate the landing calls to the elevators in the group. The allocation of landing calls in group control may depend on fac- tors such as load situation of the elevator group, number and disposition of calls, and instantaneous load, position and travelling direction of the elevators . In modern group control, attention is also paid to controlling passenger behaviour. Call allocation in group control is the result of an optimisation task in which various parameters related to travelling comfort and other aspects of elevator use are optimised. Such parameters include e.g. waiting time, advance signalling capability, energy consumption, transport capacity, travelling time and equali- sation of car load. In modern microprocessor based control systems it is possible to optimise several parameters simultaneously. Advance signalling is an important part of passenger guidance. Advance signalling is used to guide the passengers at a timely stage to the vicinity of the doors of an elevator arriving at a floor. Advance signalling does not require the use of extraordinary call button arrangements at the landing. Timely advance signalling or immediate assignment of the elevator to be allocated to the call can be best accomplished by using a control system with future-oriented simulation in which possible future situations have already been taken into account when signalling is being given or an elevator is being assigned to a call. EP patent specification 568 937 presents a procedure for controlling an elevator group in which future situations are taken into account. This procedure uses a decision analysis which is executed each time when an elevator ar- rives at a point where the system has to decide which one of alternative solutions is to be selected (e.g. passing by or stopping at a floor) . The decision analysis examines the effects resulting from different alternative control actions by simulating the behaviour of the system in the situation after the decision. In this procedure, a decision is made at two different terminations: At the starting point, where the elevator is standing at a landing with doors closed and ready to depart, and at the stopping point, where the elevator is moving and arrives at the deceleration point of the destination floor. GB patent specification 2 235 311 presents a group control method for an elevator system in which a suitable control algorithm is selected by simulating different control modes and selecting control parameters corresponding to specified target values. In this method, statistics are maintained about the distribution of car calls issued for a given floor. This information is utilised in predicting stoppages due to car calls. However, the prediction ends with the call being served and does not actually take into account any events subsequent to the point of time when the calls are served. The object of the present invention is to improve the ex- isting group control procedures. Among other things, it is an object of the invention to achieve a better ability to anticipate future situations so as to facilitate advance signalling and allocation of calls to the elevators. It is also an object of the invention to ensure better consideration of both the states of the elevators and the situation regarding landing calls when allocating elevators to landing calls . In the procedure of the in- vention, the instant of decision is associated with the activation of a new landing call. In other words, primarily no decisions are made when there are no active landing calls. At the instant of decision, probable future landing calls are simulated, and these are allocated to the elevators in accordance with an optimum policy by calculating simulated costs and a new call is allocated to the one of the elevators whose use will result in the lowest cost on an average. In simulating the future, pas- sengers are generated for different floors in proportion to arrival intensity and distribution; similarly, car commands are generated in accordance with probable intensities of passengers leaving the elevators. A call is not finally reserved until in a certain time window. The fea- tures characteristic of the invention are presented in the attached claims. In practice, thanks to improved forecasts of future situations, the invention makes it possible to achieve an improved accuracy and stability of call allocation in group control. According to the invention, simulation and call re- allocation can be performed even for old calls that are only going to be served after a certain length of time, which means that the simulation of future operation re- garding these calls can be performed using even calls that in reality have been registered only after this call. In the following, the invention will be described in de- tail by the aid of an example by referring to the attached drawings, wherein Fig. 1 presents a tree diagram of decisions in an elevator group comprising two elevators, Fig. 2 presents landing calls on a time axis, Fig. 3 presents a time window, Fig. 4 presents a block diagram applicable for implementing the procedure of the invention, and Fig. 5 presents a block diagram representing the simulation of future costs . Fig. 1 shows a tree diagram of decisions for N calls in an elevator group comprising two elevators. Each car in the group, Carl and Car2 , travels in its own elevator shaft, suspended on hoisting ropes. The elevators are driven by hoisting motors. The motors are controlled by a microprocessor-based regulating unit in accordance with commands issued by an elevator control unit. Each control unit is further connected to a microprocessor-base group control unit, which distributes the control commands to the elevator control units. Placed inside the elevator cars are car call buttons and possibly also display de- vices for the display of information for passengers. Correspondingly, the landings are provided with landing call buttons and display devices as appropriate. For control of the elevator group, the call buttons are connected via a communication bus to the elevator control units to transmit call data to the elevator control units and further to the group control unit . All calls (CallN, CallN-1, CallN-2) are allocated to the elevators and the costs for each decision (DecisionN, De- cisionN-1) are calculated. The route involving the lowest cost yields an optimal call allocation. When there are N calls and the number of elevators is 1, the decision tree comprises l" route combinations to be computed. Fig. 2 presents the existing landing calls (hall calls) C - C 3 and simulated landing calls (hall calls) C, , C 5 after the lapse of T on a time axis t where the current instant is represented by T . A landing call is removed from the call queue when the elevator serving the call arrives at the floor concerned. In the solution of the invention, the call is not finally allocated until in a given time window (Fig. 3) T w , where the travel time (ETA, Estimated Time of Arrival) of the elevator for the call is shorter than a preselected time T. . In the si u- lation of the future, persons are generated for different floors in proportion to the arrival intensities and dis- tribution, and car commands are similarly generated according to probable intensities of passengers leaving the elevator, in other words, according to predictions regarding passengers arriving at each destination floor and leaving the elevator car. The forecasts for the intensities of passengers arriving and leaving the elevator are obtained for each floor and each direction by using a so-called traffic predictor. Statistics representing intensities of passengers arriv- ing and leaving the elevator, measured e.g. from the load weight and photocell data, are accumulated in the traffic predictor. Using the statistics, an arrival time, arrival floor and destination floor are assigned for each simulated person. The simulated persons press simulated land- ing call buttons, and elevator traffic is simulated according to the next stopping floor used in the simulation, selected by the control system. The simulation is repeated in the same way for each decision alternative. Simulated calls can be allocated by using known control principles, such as collective control or an ACA algorithm (ACA = Adaptive Call Allocation) . Each time a new call is registered, simulation is immedi- ately performed for different elevators and the call is allocated to the one that can serve it at minimum costs. Simulation and call re-allocation can also be performed for old calls (Fig. 3) which are only to be served after the lapse of T Lιm . Therefore, calls that have actually been registered after this call can initially be used in the simulation of future operation regarding these calls. Figures 4 and 5 present block diagrams representing an embodiment of a solution according to the invention. The system illustrated by Fig. 4 works as follows: After the start 100, the elevator states L s , landing call states C. and the time T are updated (block 101). Next, the landing calls L0 are checked (block 102) one by one to determine whether the call is a 'fixed' one (block 103) . If it is not, then the procedure is resumed from block 102. At the same time, the estimated remaining travelling time or time of arrival ETA to/at the floor of the call for fixed calls is updated (block 199). On the other hand, if the call has been fixed, the elevator to serve the call is specified as L=l and the number of ele- vators is determined (block 104). After this, the landing call table C 0 to C N and the elevator states L s to L N are copied (block 105) . Next, the time is set to T=T 0 (block 106) and an unfixed call is allocated to elevator L (block 107) . After this, the future costs J h (block 108) are simulated, the optimum J L * is selected (block 109) and the call is allocated to the preferable elevator L* in state C (block 110) . Next, to determine whether the landing call for elevator L* falls within the time window T w , the estimated time of arrival of the elevator is compared with the call C. and the time limit T Lιrn (block 111) . If the time of arrival is greater than the time limit T Lιm , then the procedure is resumed from block 102. If it is lower or equal to the time limit T Lιιn , then the call reservation for elevator is fixed in landing call state C. (block 112) . Finally, old fixed calls are checked. If the call is not served within a certain time (the certain time is T Lιιn multiplied by a given coefficient; the value of the coefficient being at least one) , then the call state is changed to unfixed (block 113) before the proce- dure is ended 114. The procedure represented by Fig. 4 is repeated at least once in each group control cycle. Fig. 5 is a block diagram giving a more detailed illustration of the simulation of future costs J L (block 108) . In this procedure, the time T of simulation is first computed as the sum of the current instant T, and an incremental time ΔT (block 115) . After this, the elevator states L 1T are simulated and updated (block 116) and random arrivals of passengers are generated in accordance with a traffic flow forecast (block 117) . Next, the landing call table C N is updated (block 118), the landing calls C N are allocated to the best elevator cars according to the allocation policy (block 119) and the cost function J L is updated (block 120). Finally, a check is carried out to determine whether the time T is greater than the sum of the simulation time T and the starting instant T n , this sum corresponding to the maximum simulation time (block 121) . If it is, then the procedure is ended (block 122) . If not, the procedure is resumed from block 115. It is obvious to a person skilled in the art that different embodiments of the invention are not restricted to the examples presented above, but that they may be varied within the scope of the claims presented below.

Claims: CLAIMS 1. Procedure for controlling an elevator group comprising at least two elevators and their elevator cars (Carl, Car2 ) , which are driven by hoisting machines and whose movements are controlled in accordance with commands issued by elevator control units, said control units being further connected to a group control unit, which allocates the calls to different elevators, characterised in that a virtual passenger traffic is generated on the basis of statistical data and/or statistical forecasts and simulation is applied to create events in the virtual passenger traffic, said events being used as a basis on which an elevator-specific cost is computed for each call to be allocated, and, based on said costs, the best elevator is selected to serve the call. 2. Procedure as defined in claim 1, characterised in that the virtual passenger traffic is generated on the basis of distribution and intensity of the passenger traffic prevailing at the moment. 3. Procedure as defined in claim 1 or 2 , characterised in that the events created via simulation in the virtual passenger traffic are calls, car commands, elevator states and elevator movements. 4. Procedure as defined in claim 1 or 2 , characterised in that the elevator-specific cost computed for the call consists of a predicted cost of serving the call and an additional cost due to the virtual traffic. 5. Procedure as defined in one or more of the preceding claims, characterised in that a call simulated for the virtual passenger traffic is allocated by a selected allocation method known in itself. 6. Procedure as defined in one or more of the preceding claims, characterised in that simulation and call re- allocation are performed even for old calls that are only going to be served after a certain length of time (T Llm ) , the simulation of future operation regarding these calls being performed using even calls that in reality have been registered only after this call. 7. Procedure as defined in claim 3, characterised in that, in the simulation, passengers are generated for different floors in proportion to the arrival intensities and distributions, car commands are generated in accordance with probable intensities of passengers leaving the elevators, an arrival time, arrival floor and destination floor are assigned for each simulated person, the simulated persons give simulated landing calls and car commands, and elevator traffic is simulated according to the next stopping floor used in the simulation, selected by the control system. 8. Procedure as defined in claim 7 t characterised in that each time a new call is registered, simulation is immediately carried out for different elevators and the call is allocated to the one that gives minimum costs.

Inventors: SIIKONEN MARJA-LIISA, SIIKONEN, MARJA-LIISA
Applicants: KONE CORP, SIIKONEN MARJA LIISA, KONE CORPORATION, SIIKONEN, MARJA-LIISA
Application year: 1998
Main classification: B66B1
IPC codes: B66B1, B66B3