AU645882B2 - Using fuzzy logic to determine the number of passengers in an elevator car - Google Patents

Description

1 845882

AUSTRALIA

PATENTS ACT 1990 COMPLETE SPECIFICATION FOR A STANDARD PATENT

ORIGINAL

Name of Applicant: *.eo 0 OTIS ELEVATOR COMPANY David J. Sirag, Jr., and Paul T. Weisser, Jr.

Actual Inventor: Address for Service: SHELSTON WATERS Clarence Street SYDNEY NSW 2000 Invention Title: "USING FUZZY LOGIC TO DETERMINE THE NUMBER OF PASSENGERS IN AN ELEVATOR CAR" The following statement is a full description of this invention, including the best method of performing it known to us:la o *ec 0r 0 0 000...

*0 0* USING FUZZY LOGIC TO DETERMINE THE NUMBER OC PASSENGERS IN AN ELEVATOR CAR TECHNICAL FIELD This invention relates to elevator control software.

BACKGROUND ART It is desirable to assign cars to service hall calls to maximize the performance of the elevator system. This involves using a number of algorithms which determine the number of passengers in the cars, determine the traffic mode of the elevator system, estimate the number of hall 10 passengers at each stop, and calculate the tradeoffs between different performance parameters. These algorithms can be implemented as a plurality of fixed rules.

However, difficulties occur at the boundary conditions for the fixed rules. For example, a rule which bases the system traffic mode determination partially on the time of day might be: "if it is between 7:00 AM and 9:00 AM and if <other conditions>, then set the system traffic mode to UP-PEAK". The difficulty with such a rule is that at 6:59 AM, all of the other conditions which cause the system traffic mode to be UP-,PEAK may already be present, but because of the fixed rule, the system cannot be deemed to be in the UP-PEAK traffic mode. The operation of the system may change abruptly depending on the traffic mode, desp-ite the fact that the input conditions, the predominant traffic patterns, probably change gradually between 6:59 AM and 7:00

AM.

Similar problems exist for the c'her car assignment related algorithms. Generally, the input conditions change Y Si 9zAi c~ii 1 2 gradually and, for the most part, continuously while the response to those changes, the reactions of the system (and ultimately the assignment of a car to a hall call), changes abruptly and discontinuously as the inputs to the system transition through boundary conditions.

DISCLOSURE OF INVENTION Objects of the invention include estimating the number of passengers in a car, include assigning a car to service a hall call, determining the assignment utility for cars in an elevator system, include determining the number of people waiting at a stop for service by a car, and determining an elevator system traffic mode.

According to the present invention, a signal indicative 15 of passenger weight in a car is used to select terms from a plurality of observed weight fuzzy sets to form a fuzzy set indicative of the number of passengers in the car, wherein each of said observed weight fuzzy sets corresponds to a particular passenger count and terms of each of said observed weight fuzzy sets have basis elements corresponding to passenger weights and (ii) degrees of membership corresponding to the frequency of observation of the weight represented by the associated basis element and number of passengers represented by the set.

25 According further to the present invention, assignment o of a car to a hall call is made by using a fuzzy set indicative of car assignment utility, said set having (a) ooo S" basis elements corresponding to each car of an elevator "system and degrees of membership corresponding to the utility of assigning the car represented by the associated basis element to the hall call.

According further to the present invention, the utility of assigning each car to service a hall call is determined by: estimating the performance of each car for each of a plurality of performance criteria, rzaling the estimated performances by values indicative of tht assigned 3 importance of each of the performance criteria, and (c) setting the utility equal to the maximum value from the scaled performance values.

According further to the present invention, the utility of assigning each car to a hall call is determined by (a) estimating the performance of each car for each of a plurality of performance criteria, scaling the estimated performances by values indicative of the assigned importance of each of the performance criteria, and choosing the minimum value from the scaled performance values.

According further to the present invention, an instantaneous passenger rate for an elevator system is calculated whenever a hall call button is pressed or whenever an elevator services a stop, said instantaneous rates 15 are then averaged in to one or more of an up rate quantity, (ii) a down rate quantity, and (iii) an off rate quantity according to the mode of the elevator system, and the number of people waiting at a stop is determined by multiplying the time since the stop was last serviced by one or more of said up, down, or off rate quantities according to the mode of the elevator system.

According further to the present invention, up-peak onset rules, up-peak termination rules, down-peak onset S 2 rules, and down-peak termination rules are evaluated 25 separately and combined to form a fuzzy logic set indicative of elevator traffic mode, said set having a term ccrresponding to up-peak, a term corresponding to down-peak, "and a term corresponding to off-peak wherein the degrees of S"membership of the terms corresponds to the degree to which the elevator system exhibits characteristics of up-peak, down-peak, and off-peak modes, respectively.

The foregoing and other objects, features and advantages of the present invention will become more apparent in light of the following detailed description of exemplary embodiments thereof, as illustrated in the accompanying drawings.

4 BRIEF DESCRIPTION OF DRAWINGS Fig. i is a perspective, partially broken away, view of an elevator system.

Fig. 2 is a data flow diagram that illustrates operation of elevator control software.

Fig. 3 is a graph illustrating empirically observed elevator weight loading data.

Fig. 4 is a flow chart illustrating operation of a weight interpretation software module.

Fig. 5 is a flow chart 120 illustrating off-line construction of a weight interpretation table.

Fig. 6 is a data flow diagram illustrating operation of a traffic module.

Fig. 7 is a flow chart illustrating operation of an up 15 calculations module.

Fig. 8 is a graph illustrating a SHORT-PERIOD fuzzy logic set.

e Fig. 9 is a graph illustrating a SEVERAL-CARS fuzzy logic set.

ree e Fig. 10 is a graph illustrating a HEAVILY-LOADED fuzzy logic set.

Fig. 11 is a data flow diagram illustrating operation 0 •"of a count estimator module.

Fig. 12 is a bar chart illustrating an average wait time performance fuzzy set.

o ""Fig. 13 is a flow chart illustrating operation of a e performance estimator module.

Fig. 14 is a bar chart illustrating a customer

I

preferences fuzzy set.

Fig. 15 is a flow chart illustrating operation of an assignment utility calculator module.

BEST MODE FOR CARRYING OUT THE INVENTION Referring to Fig. 1, an elevator system 20 is comprised of a first car 22, a second car 23, a first motor 24 having a pulley 26 attached thereto, a second motor 25 having a pulley 27 attached thereto and counterweights 28, 29. A 5 first cable 30 is threaded through the pulley 26 and attached at one end to the first car 22 and at the other end to the counterweight 28. A second cable 31 is threaded through the pulley 27 and attached at one end to the second car 23 and at the other end to the counterweight 29.

First motor 24 moves first car 22 between a plurality of building floors 32-34 in response to activation of one or more car call buttons 36 by a car passenger a passenger riding in car 22). Second motor 25 moves second car 23 between building floors 32-34 in response to activation of one or more car call buttons 37 by a car passenger. Motors 24, 25 also move cars 22, 23 between floors in response to one or more hall calls. A hall call occurs when one or more hall call buttons 38 is pressed by a hall passenger. A hall passenger is a prospective user of the elevator system 20 waiting in a hallway at one of the floors 32-34 for service by one of the cars 22, 23.

An electronic elevator controller 40 for the elevator system 20 receives electronic input signals from car call buttons 36, 37, hall call buttons 38, from a first weight sensor 42, located in the floor of first car 22 and from a second weight sensor 43, located in the floor of second car 23. The weight sensors 42, 43 each provide an electronic signal which varies according to the weight of the passengers 25 in cars 22, 23, respectively. Controller 40 provides an -output signal to first motor 24 for moving first car 22 between the various floors 30-32. The controller 40 also provides an output signal to second motor 25 for moving the second car 23 between the various floors 30-32.

The electronic hardware for the controller 40 is a conventional microprocessor system, the implementation of which is known to those skilled in the art, containing a microprocessor (not shown), one or more ROMs (not shown) for storing elevator controller software, one or more RAMs (not shown), means for providing the output signals (not shown) to the motors 24, 25, and means for receiving the input 6 signals (not shown) from the car call buttons 36, 37, the hall call buttons 38, and from the weight sensors 42, 43.

Referring to Fig. 2, a data flow diagram illustrates operation of elevator control software which is stored in the ROMs and which is executed by the microprocessor. The software causes the controller 40 to provide the output signals to direct operation of the motors 24, 25 in response to input electronic signals to the controller 40. Boxes on the diagram 50 indicate program modules (portions of the elevator control software) while cylinders indicate data elements (portions of elevator control data). Arrows between boxes and cylinders indicate the direction of tha flow of data. Unlike a flow chart, no portion of the data flow ditgram 50 indicates any temporal relationships between the various modules.

The input signals shown on the diagram 50 are summarized in the following table: Signal Name Description WEIGHT Indicates passenger weight ELPTIME Elapsed time counter DEPARTURES Indicates departures of cars from 25 various floors ARRIVALS Indicates arrivals of cars at various floors HALLCALLS Indicates hall calls made from various floors A weight interpretation module 52 is provided with a WEIGHT signal from each of the weight sensors 42, 43 and with input data from an observed weight data element 53. The weight interpretation module 52 uses the WEIGHT signals and the observed weight data element 53 to estimate the number of car passenger as cars leave the various floors. The passenger estimate is provided by the weight interpretation module 52 to a car PAssengers data element 54. Using the observed weight data element 53 and the WEIGHT signals from the weight sensors 42, 43 to estimate the number of car passengers is discussed in more detail with respect to Fig. 4, hereinafter.

The car passengers data element 54 is provided s an input to a traffic module 56, which is also provided with input from an ELPTIME input signal, a DEPARTURES input signal, and an ARRIVALS input signal. The ELPTIME signal indicates elapsed time a counter which increments at a fixed rate). The DEPARTURES signal indicates the departure of the cars 22, 23 from the various floors 32-34. The ARRIVALS signal indicates the arrival of cars 22, 23 at each floor 32-34.

There are three mode variables used by the elevator control software: UP-PEAK, DOWN-PEAK, and OFF-PEAK. The magnitude of UP-PEAK indicates the extent to which passengers are riding from the lobby to higher floors.

The magnitude of DOWN-PEAK indicates the extent to which passengers are riding from higher floors to the lobby.

The magnitude of OFF-PEAK indicates the extent to which passengers are riding between non-lobby floors. The values of UP-PEAK, DOWN-PEAK, and OFF-PEAK are stored by traffic module 56 into a traffic mode data element 58.

Operation of the traffic module 56 is described in detail with respect to Fig.6, hereinafter.

The ELPTIME, DEPARTURES and ARRIVALS signdls are provided as inputs to a count estimator module 60. A HALLCALLS signal, which indicates that any of the hall call buttons 38 has been pressed, is also provided as an input to count estimator module 60. Count estimator module 60 is also provided with input from car passengers data element 54 and from traffic mode data element 58.

Count estimator module 60 estimates the number of hall passengers at a particular stop (a particular floor for service in a particular direction) waiting for service by a car. Every floor, except the top and bottom floors, has two stops, an up stop and a down stop. The top floor A N' has only a single down stop and the bottom floor has only 8 a single up stop. Count estimator module 60 outputs the estimate to a hall passengers data element 62. Operation of count estimator module 60 is described in detail hereinafter.

A performance estimator module 64 is provided with input from the HALLCALLS signal and from traffic mode and hall passengers data elements 58, 62. Performance estimator module 64 r- -edicts the performance of each car 22, 23 in response to a particular hall call. Output from performance estimator module 64 is provided to a performance data element 66. Operation of performance estimator module 64 is described in detail hereinafter.

Performance data element 66 and a customer preferences data element 68 are provided as inputs to an assignment utility calculator module 70, which determines the utility of assigning each car 22, 23 to respond to a 0 particular b~fl call by predicting the performance of each car 22, 23 and scaling the predicted performance based on the customer preferences. Output from 20 assignment utility calculator module 70 is provided to an assignment utility data element 72. Operation of assignment utility calculator module 70 is described in e. detail hereinafter.

Assignment utility and customer preferences data 25 elements 68, 72 are provided as inputs to an uncertainty filter module 74, which assigns a particular car to service a particular hall call using preliminary assignment data of the assignment utility data element Doe**: 72. The assignment is made only when the uncertainty associated with assignment of one of the cars is below a predetermined threshold indicated by data stored in customer preferences data element 68. In situations where it is acceptable to wait until the last possible moment to assign a car to a hall call, uncertainty filter module 74 does not provide data to an assignment data element 76 until the uncertainty associated with assignment utility data element 72 is fairly low. In situations where a car assignment must be made relatively 9 quickly after a hall call, uncertainty filter module 74 provides data to assignment data element 76 even though the uncertainty associated with the assignment is relatively high. Operation of uncertainty filter module 74 is described in detail hereinafter.

Assignment data element 76 is provided as an input to a motion control system module 78, which provides the signals to motors 24, 25 to move cars 22, 23. Motion control system module 78 uses the information from assignment data element 76 to cause the assigned one of cars 22, 23 to stop at a particular one of floors 32-34 in response to a hall call. There are many types of generic elevator software motion control systems which are known to those skilled in the art and are currently in use. Many of the generic motion control systems would be suitable implementing the motion control system module 78.

Weight interpretation module 52 transforms the WEIGHT signal from each weight sensor 42, 43, one at a time, into an estimate of the number of car passengers by using fuzzy logic, a branch of mathematics closely related to basic set theory and logic. Fuzzy logic involves using sets havii:q basis elements which are only partially contained ir the sets. For example, whereas a traditional set C may hL- defined as Y, a fuzzy set F can be defined as {.3 1 X, .7 1 Y, .ljZ} j wherein the numbers which precede the vertical bars indicate the degree of membership of basis elements X, Y, and Z. The quantity .3 1 X is called a term of the fuzzy set. The basis elements X, Y, and Z can represent numeric or non-numeric quantities. In cases where the basis elements X, Y, and Z represent numbers, the basis element, or the value of a term, is simply the numerical quantity represented by X, Y, or Z. A crisp value is any value or system of values which does not employ fuzzy logic. A thorough discussion of fuzzy logic can be found in Schmucker, K. Fuzzy Sets. Natural Language Computations, and Risk Analysis, Computer Science Press, J 10 Rockville, Maryland, 1984.

Although the discussion hereinafter explains implementation details of operation of the fuzzy system, much of the implementation can be automated by tools which translate high :'evel fuzzy logic statements into compilable computer code. One such development tool is the Togai Fuzzy C Development System, manufactured by Togai InfraLogic Inc., of Irvine, California, which converts fuzzy logic statements into compilable C code.

The observed weight data element 53 shown in Fig. 2 is constructed by having an observer tabulate the number of passengers in cars 22, 23 vs. the magnitude of the WEIGHT signals provided by weight sensors 42, 43.

Ideally, this tabulation is performed at the building were the elevator system 20 is installed in order to have the data account for passenger loading and passenger weight distributions for the particular building.

However, it is possible to construct observed weight data element 53 using generic tables showing probabilities and distributions of people's weights. The tabulated data is used to construct a plurality of fuzzy sets which are stored in observed weight data element 53. Each fuzzy set corresponds to a particular passenger count. For each set, the degrees of membership of each term 25 correspond to the number of times a particular magnitude of the WEIGHT signal has been obser.ad with that number of passengers in the car, and the basis elements correspond to particular weights. Each set can be represented as FO(N) where N is a particular passenger 30 count and each element within that set be represented as FO(M, W) where W is a particular weight, and M equals number of occurrences: FO {M I W'M21M W Fig. 3 is a graph 90 illustrating a hypothetical group of histograms of fuzzy sets constructed by tabulating passenger load (counts) vs. the magnitude of the WEIGHT signal. Graph 90 is comprised of a plurality Sof plots 92-103 wherein plot 93 corresponds to the fuzzy 11 set describing the different values of the WEIGHT signal for one passenger, F0(l), plot 94 corresponds to the fuzzy set describing the different values of the WEIGHT signal for two passengers, FO(2), etc. The relativ magnitudes of plots 92-103 indicate the number of times a particular magnitude of the WEIGHT signal is observed and hence indicate the degree of membership of the terms of the fuzzy sets.

In fact, each plot has an abcissa of weight and an ordinate (not marked) of some normalized, dimensionless value, such as zero to one, which represent the relative likelihood that such number of passengers provide a weight signal of so many pounds. In a sense then, Fig. 3 is a table of twelve graphs, one per set, for sets relating to 0-11 passengers.

Fig. 4 is a flow chart 110 illustrating some of the operation of weight interpretation module 52. Processing "begins at a first step 111 where a fuzzy set FW(PC) (P representing a particular passenger count) is initialized 20 to have no terms. Following step 111 is a step 112 where a variable representing hypothetical passenger counts, PC, is initialized to 1. Following step 111 is a test 112 where a variable representing hypothetical passenger counts, PC, is initialized to zero. Following the step 25 112 is a test step 113 where the value of the variable PC is compared to PCMAX, a predetermined constant value equal to the maximum number of posoible car passengers (shown, in the example of Fig. 3) If PC is not greater than PCMAX, control passes 30 from test 113 to a step 114 where a term, taken from the fuzzy set FO(PC) stored in observed weight data element 53, is added to the fuzzy set FW. The added term corresponds to a passenger count equal to PC and a weight equal to the magnitude of the current WEIGHT signal; the added term is membership of the FO (PC, WEIGHT) term (a magnitude of 0-1 in Fig. After step 114 is a step 115 where the PC variable is incremented.

pV t eY T

J

v 12 The steps 113-115 are repeatedly executed to develop a set, which for 600 pounds might be ({00, .1I1, .212, .714, 016, etc.) for the example of Fig. 3. When PC exceeds PCMAX at the test step 113, control passes from the step 113 to a step 116, where the fuzzy set FW is normalized. Normalization of a fuzzy set involves dividing all of the degrees of membership of the terms by a constant value in order to make the sum of all the degrees of membership equal to one (the example: {.00 0, .06,1, .122, 18 3, .414, .24 5, 0 6, etc.}) After step 116 is a step 117 where the fuzzy set FW is defuzzified to produce a value equal to the passenger count. Defuzzification is a process whereby a fuzzy logic set is reduced to a crisp, single, value. FW can be defuzzified by using the value (the basis element, in :his case a number of passengers) of the term having e .the highest degree of membership (in the example 4).

FW can also be defuzzified by summing the products of the 20 degree (normalized) of membership of each term and the passenger count represented by each term (in the example After step 117 is a step 118 where the calculated value of the passenger count is stored in passenger count data element 54 shown in Fig. 2 indexed by the weight for which the module 110 (Fig. 4) was run.

Passenger count data element 54 is used by traffic module 56 and count estimator module 60, in a manner described in detail hereinafter. If it is possible for traffic module 56 and count estimator module 60 to make use of the elevator passenger count for each weight measured expressed as a fuzzy logic set rather than as a crisp value, weight interpretation module 52 does not defuzzify the set FW, but rather follows a logic path 119 around defuzzification step 117 and stores the fuzzy set FW, at a series of passenger-indexed addresses for the particular weight rather than a crisp value, at step 118.

The code illustrated by flow chart 110 of Fig. 4 is <meant to be run real time by the microprocessor of 13 elevator controller 40. If only a crisp value of car passenger count is desired, however, the code illustrated by flow chart of Fig. 4 can be executed off-line to generate a weight interpretation table, which is a table of values of the magnitude of the WEIGHT signal vs.

passenger counts, that can be indexed (accessed) by weight interpretation module 52 at run time.

Fig. 5 is a flow chart 120 illustrating off-line construction of a weight interpretation table which can be loaded into the ROMs of the elevator controller 40 and accessed by weight interpretation module 52 to provide a crisp car passenger count based upon the magnitude of the WEIGHT signal. The WEIGHT signal becomes the index to che table and the passenger count is the entry at that index. At a first step 122, two variables used only in Fig. 5, OLDPC and NEWPC, are initialized to zero.

Following first step 122 is a step 124 where a third variable, W, is initialized to zero.

After step 124 is a step 126 (which is in fact, the subroutine 110 of Fig. 4) where NEWPC is set equal to the passenger count that is calculated by the method illustrated by flow chart 110 of Fig. 4, except that the value of W is used in place of the magnitude of the WEIGHT signal. After step 126 is a test 128 where the 25 variable NEWPC is compared to the variable OLDPC. The reason for this is that only values of W, PC which differ 1 6 are put into the table. If the variables are not equal, control passes from step 128 to a step 130, where the values of OLDPC and W are entered into the weight 30 interpretation table being constructed. After step 130 is a step 132 where the variable OLDPC is set equal to the variable NEWPC. In this fashion, each calculated value of PC is compared only with the last value of PC to be stored in the table with a related value of weight.

The table thus created has indices which comprise only those values of W (analogous to the magnitude of the WEIGHT signal) which cause the entries to the table, the number of passengers, to change. At run time, weight ,01i, <2p 13a interpretation module 52 searches the table to find two adjacent indices wherein one is greater than the magnitude of the WEIGHT signal and the other is less than or equal to the magnitude of WEIGHT signal. The entry at the higher of the two table indices is the passenger count which is written to the passenger count data element 54.

Following step 132 (or following test 128 if OLDPC equals NEWPC) is a step 134 where variable W is increased by an amount WINC, a predetermined constant equal to the granularity of each with sensor 42, 43 the minimum difference between two weight measurements). After step 134 is a step 136, where W is compared to WMAX, a predetermined constant equal to the maximum possible magnitude for the WEIGHT signal, which may be 1600 or 1700 pounds in the example of Fig. 3. If W is not greater than WMAX, control passes from step 136 back to step 126. Otherwise, control passes to a step 137 where OLDPC and W are added as the last entries to the table, even though W is outside max, it provides the basis to reach a value of PC just below W. After the step 137, processing is complete.

Weight interpretation module 52 provides, to car passengers data element 54, data indicative of the number of passengers in cars 22, 23. Car passengers data element 54, the ELPTIME signal, the DEPARTURES signal, and the ARRIVALS signal are provided as inputs to traffic module 56, which determines the predominant usage pattern of elevator system 20 and provides the result to traffic 30 mode data element 58. Traffic mode of elevator system can be described as up-peak, indicating that most of the traffic is going from the lobby of the building to higher floors, down-peak, indicating that most of the traffic is going from higher floors to the lobby, or off-peak, indicating that there is no discernible predominant traffic pattern.

Referring to Fig. 6, a data flow diagram 150 illustrates operation of traffic module 56. The ELPTIME k "4 and DEPARTURES signals and data from car passengers data 13b element 54 are provided as inputs to an up calculations module 152, which uses UP-PEAK-ONSET rules (described in detail with respect to Figs. 7-10 hereinafter) to calculate a value for UP-PEAK variable, which is stored in an up-peak data element 154. The up calculations module 152 also uses UP-PEAK-TERMINATION rules (described in s* e S S l ve ^<y 14 hereinafter) to determine a value for an UP-OFF-PEAK variable which is stored in an up off-peak data element 156.

The ELPTIME and ARRIVALS signals and data from car passengers data element 54 are provided as inputs to a down calculations module 162, which uses DOWN-PEAK-ONSET rules (described in detail hereinafter) to calculate a value for the DOWN-PEAK variable, which is stored in a down-peak data element 164. Down calculations module 162 also uses DOWN-PEAK-TERMINATION rules (described in detail hereinafter) to determine a value for a DOWN-OFF-PEAK variable which is stored in a down off-peak data element 166. Up off-peak data element 156 and down off-peak data element 166 are providead as inputs to an off calculations module 170 which combines the data from elements 156, 166 (in a manner described in 15 detail hereinafter) to calculate a value for the OFF-PEAK variable, which is stored in off-peak data element 172.

SThe UP-PEAK variable stored in up-peak data element 154, the DOWN-PEAK variable stored in down-peak data element 164, and the OFF-PEAK variable st--c.a in off-peak data element 172 are provided as inputs to a mode resolver module 174, which combines the input data to provide a result to traffic mode data element 58. The result can either be a single crisp value or a fuzzy set, depending upon the nature of follow-on processes which use information from traffic mode data element 58. A crisp value a single indication of the mode) can be obtained by deeming the mode to be either up-peak, down-peak, or off-peak depending upon which of the UP-PEAK, DOWN-PEAK, or OFF-PEAK variables, respectively, is greatest.

Mode resolver module 174 can also provide a fuzzy set to indicate the traffic mode of elevator system 20. The set would hiave a term corresponding to the UP-PEAK variable, a term corresponding to the DOWN-PEAK variable, and a term corresponding to the OFF-PEAK variable where the degree of membership of each term would be proportional to the values of the UP-PEAK, DOWN-PEAK, and OFF-PEAK variables, respectively.

15 The UP-PEAK-ONSET rules used by up calculations module 152 have the form: if (DPTURE-TIME-i is SHORT-PERIOD) and (i is SEVERAL-CARS) and (DPTING-ELEVATOR-1 is HEAVILY-LOADED) and (DPTING-ELEVATOR-2 is HEAVILY-LOADED) a and (DPTING-ELEVATOR-i is HEAVILY-LOADED) then set UP-PEAK where ELEVATOR-CAR-1 is the car which has most recently departed from the lobby (eg. the car that riggers evaluating the rules at this moment), FL2VATOR-CAR-2 is the second most recently departed car and generally ELEVATOR-CAR-i is the ith most recently departed car.

DPTURE-TIME-i is defined as the elapsed time since the departure of the ith most recently departed car, and i is a number from one to N, the number of rules. The number 20 of rules, N, is set equal to the number of cars in the dispatching group, to acquire a sense of a full dispatching cycle in the group. This number N is also the number of cars that have previously departed which are examined relative to the UP-PEAK-ONSET rules.

S 25 However, N could be chosen to be either less than or greater than the number of cars.

The UP-PEAK-ONSET, UP-PEAK-TERMINATION, DOWN-PEAK-ONSET, and DOWN-PEAK-TERMINATION rules can be described generally as having the form: S 30 if <condition> then set X-PEAK where X-PEAK is either UP-PEAK, DOWN-PEAK, UP-OFF-PEAK, or DOWN-OFF-PEAK.

For a fuzzy logic conditional expression, the value of the result variable (the variable following the "then" portion of conditional expression) is set according to the va-ie ,f the conditional portion. For the above equation, therefore, X-PEAK is set to a value which Sdepends upon the value of the <condition>.

16 The conditional portion of the UP-PEAK-ONSET rule contains a plurality of simple expressions, such as (DPTURE-TIME-i is SHORT-PERIOD) and i is SEVERAL-CARS), which are connected by ANDs. The value of the conditional is the minimum value of the simple expressions. Evaluating the simple expressions requires quantifying SHORT-PERIOD, SEVERAL-CARS, and

HEAVILY-LOADED.

Referring to Fig. 8, Fig. 9 and Fig. 10 a first graph 200 illustrates a fuzzy set for representing SHORT-PERIOD, a second graph 202 illustrates a fuzzy set for representing SEVERAL-CARS, and a third graph 204 illustrates a fuzzy set for representing HEAVILY-LOADED.

The SEVERAL-CARS graph 202 is for an elevator system having several cars. A graph for the two car elevator system 20 of Fig. 1 would make it more difficult to illustrate the SEVERAL-CARS fuzzy set.

The graph 200 has a plurality of squares 210-217 superimposed thereon wherein each of the squares 210-217 S 0 represents a term of the SHORT-PERIOD fuzzy set. This 4 set can be considered to be the decimal fraction of a group of elevator experts that would respond "yes" to the question "do you think M is a short period?", where M is 0-7 minutes. It is an empirical assessment of the 25 relationship between how often cars leave the lobby, along with how many and how loaded, and the need to use :up-peak dispatching, based on historical observations or experience.

Similarly, the graph 202 has a plurality uf squares 220-227 superimposed thereon for representing terms of the SEVERAL-CARS fuzzy set ("Do you thinc i is several cars for up-peak purposes?"). The graph 204 has a plurality of terms 230-2A2 superimposed thereon for representing elements of the HEAVTLY-LOADED fuzzy set ("Do you think PC is a heavy load for dispatching purposes?") The vertical axes of the graphs 200, 202, 204 indicate the degree of membership for terms represented 17 by the squares 210-217, 220-227, 230-242 and the horizontal axes of the graphs 200, 202, 204 represent the values of the basis elements. For example, the square 210 represents a term of the SHORT-PERIOD fuzzy set having a basis element value of zero minutes and a degree of membership of 1.0 and the square 213 represents a term of the SHORT-PERiOD fuzzy set having a basis element value of three minutes and a degree of membership of approximately 0.4.

Each of the simple expressions for the UP-PEAK-ONSET rule is evaluated using the SHORT-PERIOD, SEVERAL-CARS, and HEAVILY-LOADED fuzzy sets. The value of the (DPTURE-TIME-i is SHORT-PERIOD) is the degree of membershin of the term of the SHORT-PERIOD fuzzy set having a basis element equal to DPTURE-TIME-i. For example, if the value of DPTURE-TIME-i is five minutes, the expression (DPTURE-TIME-i is SHORT-PERIOD) equals the degree of membership of the term of the SHORT-PERIOD fuzzy set having basis element equal to five minutes, which is illustrated in the graph 200 by the square 215 (and has a value of The value of the (i is SEVERAL-CARS) expression is the degree of membership of the term of the SEVERAL-CARS fuzzy set having a basis element equal to i. For 25 example, if i equals three (the car that left two cars before this one that triggered the rules), the expression (i is SEVERAL-CARS) equals the degree of membership of the term of the SEVERAL-CARS fuzzy set having a. basis element equal to three, which is illustrated in the graph 202 by the square 223 (and has a value of .81) Evaluation of the (DPTING-ELEVATOR-i is HEAVILY-LOADED) expression depends upon whether the number of passengers in elevator car i, which is an input value to the traffic module 56, is a crisp value or a fuzzy set. If the passenger count is a crisp value, the (DPTING-ELEVATOR-i is HEAVILY-LOADED) expression equals the degree of membership of a term of the HEAVILY-LOADED Sfuzzy set having a basis element value equal to the crisp 18 passenger count as shown in Fig. If the number of passengers in elevator car i is expressed as a fuzzy set a vertical slice of the Fig. 3 histograms), the (DPTING-ELEVATOR-i is HEAVILY-LOADED) expression is evaluated by taking the maximum value of the degrees of membership of the terms of a fuzzy set formed by the intersection of the passenger count fuzzy set (generated in Fig. 3) and the HEAVILY-LOADED fuzzy set (illustrated in Fig. Generally, the fuzzy set formed by the intersection of two fuzzy sets is a fuzzy set having terms whose degree of membership equals the minimum degree of membership of corresponding terms terms having the same basis element). For example, if 1A, .71C) and .21c}, then the intersection of Fl and F2 equals {.lla, .21c}. The value of the (DPTING-ELEVATOR-i is HEAVILY-LOADED) expression is the maximum degree of membership of the terms of the fuzzy set formed by intersecting the passenger count fuzzy set 20 and the HEAVILY-LOADED fuzzy set .2 in this example), and this would be used in each rule instead of the look-up values illustrated in Fig. The real-world meaning of the up-peak onset rules is that each time any car is dispatched, it will cause a 25 group of N rules (N is 7 in the example) to be evaluated.

In prose, an example might be: for i=1 1 car left in the past 2 minutes: it had passengers; for i=2 2 cars left in the past 2.5 minutes: the first one had 10 passengers, the second one had 6 passengers; for i=3 3 cars left in the past 2.9 minutes: the first one had 10 passengers, the second one had 6 passengers, the third one had 7 passengers; for i=7 7 cars left in the past 4.9 ainutes: the first one had 10 passengers, the second one had 6 passengers, 19 the third one had 7 passengers, the fourth one had 9 passengers, the seventh one had 2 passengers.

As an example, the rule corresponding to i equals three would be: if (DPTURE-TIME- is SHORT-PERIOD) and (3 is SEVERAL-CARS) and (DPTING ELEVATOR-1 is HEAVILY-LOADED) and (DPTING-ELEVATOR-2 is HEAVILY-LOADED) and (DPTING-ELEVATOR-3 is HEAVILY-LOADED) then set UP-PEAK As described with respect to the example set forth in Figs. 8-10 under conditions of the prose example above, this would result in a set of clauses, each clause being a conditional portion taken from Figs. 8-10, (in the order of period, cars, load) as follows:

F(UD)

3 0.81, 0.92, 0.46, 0.61}.

S 20 For each of the N rules, the up calculations module 152 evaluates the conditional portion of the UP-PEAK-ONSET rule sincp the belief that the onset of up-peak has occurred (all of the clauses of the rule being true) is no greater than the least belief of any 25 one of them, each rule has a value of its lowesconditional. In this example, for N=3, the rule has a value of 0.42. Each rule, one for each of the last seven cars to depart, has a membership in the UP-PEAK rule set. The final value of the UP-PEAK variable equals the maximum value resulting from evaluating each of the N UP-PEAK-ONSET rules the maximum membership in the even rule set.

Referring to Fig. 7, a flow chart 180 for evaluating the N UP-PEAK-ONSET rules shows a first step 182 where i is initialized to the value one followed by a second step 184 where a variable OLD-UP-PEAK is initialized to zero.

20 Following step 184 is a test 186 where the value of i is compared to the value of N, the number of rules. If at test 186 i is greater than N, processing is complete.

Otherwise, control transfers from test 186 to a step 188 where the UP-PEAK-ONSET rule is used to calculate a value fou the membership of the ith rule in the UP-PEAK rule set. This entails looking up the Figs. 8-10 values for ELPTIME, DEPARTURES, and the number of passengers (or use of the result of the intersection of passengers and heavily loaded fuzzy sets referred to hereinbefore).

Following the step 188 is a step 190 where the variable i is incremented.

Following step 190 is a test 192 where the value of OLD-UP-PEAK is compared to UP-PEAK seeking the highest membership in the UP-PEAK rule set. If OLD-UP-PEAK is not greater than UP-PEAK, control transfers from step 192 to a step 194, where OLD-UP-PEAK is set equal to UP-PEAK. If at step 192 OLD-UP-PEAK is greater than UP-PEAK, control transfers from step 192 to a step 196, 20 where UP-PEAK is set equal to OLD-UP-PEAK. Control passes step 194 or step 196 back to test 186. Steps 192, *0 194, 196 ensure that the variables UP-PEAK (to be placed in the UP-PEAK data element 154, for use) and OLD-UP-PEAK (to compare with, in the next iteration) always equal the S 25 greatest value calculated for UP-PEAK at step 188.

The UP-PEAK-TERMINATION rules used by up calculations module 152 have the form: if (DPTURE-TIME-i is not SHORT-PERIOD) and (DPTING-ELEVATOR-1 is not HEAVILY-LOADED) and (DPTING-ELEVATOR-2 is not HEAVILY-LOADED) and and (DPTING-ELEVATOR-i is not HEAVILY-LOADED) then set OFF-UP-PEAK.

Up calculations module 152 processes the N UP-PEAK-TERMINATION rules in a manner similar to that illustrated in Fig. 7 using the complements of the values 21 of Figs. 8 and 10, or of Fig. 8 and the result of an intersection of fuzzy passengers with the fuzzy set of Fig. 10 so that OFF-UP-PEAK is the maximum value resulting from evaluating each of the N UP-PEAK-TERMINATION rules. As is well known, this complement is equal to using one minus the memberships of the up-peak data. For example, "departure time is not SHORT PERIOD", for 2 minutes, has a membership of 1-0.75=0.25. The up calculations module 152 stores the value of the OFF-UP-PEAK variable in the off up peak data element 156.

The DOWN-PEAK-ONSET rules used by down calculations module 162 have the form: if (ARRIVAL-TIME-i is SHORT-PERIOD) and (i is SEVERAL-CARS) and (ARVNG-ELEVATOR-1 is HEAVILY-LOADED) and (ARVNG-ELEVATOR-2 is HEAVILY-LOADED) and f' 20 and (ARVNG-ELEVATOR-i is HEAVILY-LOADED) S• then set DOWN-PEAK, while the DOWN-PEAK-TERMINATION rules used by down calculations module 162 have the form: if (ARRIVAL-TIME-i is not SHORT-PERIOD) and (ARVNG-ELEVATOR-1 is not HEAVILY-LOADED) and (ARVNG-ELEVATOR-2 is not HEAVILY-LOADED) and and (ARVNG-ELEVATOR-i is not HEAVILY-LOADED) then set OFF-DOWN-PEAK Just as with up calculatirns module 152, down calculations module 162 processes the N DOWN-PEAK-ONSET and DOWN-PEAK-TERMINATION rules in a msnner similar to and using the same inputs as that illustrated in Fig. 7 for processing the UP-PEAK-ONSET rules. The resulting values for DOWN-PEAK and OFF-DOWN-PEAK are the maximum 22 values calculated for the N DOWN-PEAK-ONSET and DOWN-PEAK-TERMINATION rules, respectively. Down calculations module 162 stores the values of the DOWN-PEAK and OFF-DOWN-PEAK variables in down-peak data element 164 and off down-peak data element 166, respectively.

Off calculations module 170 sets the variable OFF-PEAK to the maximum of OFF-UP-PEAK (from off up-peak data element 156) and OFF-DOWN-PEAK (from off down-peak data elemenc 166). The variable OFF-PEAK is provided by off calculations module 170 as an output to off-peak data element 172.

Evaluation of the UP-PEAK-TERMINATION, DOWN-PEAR-ONSET, and DOWN-PEAK-TERMINATION rules is similar to evaluation of the UP-PEAK-ONSET rules illustrated above. The values of the UP-PEAK, DOWN-PEAK, and OFF-PEAK variables will be between zero and one.

The processing illustrated herein for traffic module 56 can be done at run-time or can be done off-line, in which case a table is constructed having indices indicating possible inputs to traffic module 56 and having entries indicating possible outputs of traffic module 56. Construction and use of a similar table for weight interpretation module 52 is shown in Fig. 5 and 25 the discussion associated therewith. One skilled in the S.art could extrapolate from the specific example of Fig. to build and use a similar table for traffic module 56.

Fig. 11 is a data floor diagram 260 illustrating operation of count estimator module 60, which estimates the number of hall passengers waiting at a particular stop at a particular time. Recall that a "stop" is on a floor for one direction (up or down); there are two stops per floor except the highest and the lowest. Count estimator module 60 processes the ELPTIME, DEPARTURES, ARRIVALS, and HALLCALLS signals for each stop along with data from the car passenger count data element 54 and S traffic mode data element 58 and writes the output to hall passengers data element 62.

23 Referring to Fig. 11, a first rate calculations module 262 is provided with data from car passengers data element 54 and with the ELPTIME (time from last departure from each stop), DEPARTURES, and ARRIVALS input signals for each stop. First rate calculator module 262 estimates the rate that hall passengers arrive at a stop to wait for a car to service the stop. Calculations by first rate module 262 (described in detail hereinafter) are based upon an estimate of the number of passengers that enter a car at a stop and the time since the stop was last serviced. First rate calculator module 262 provides the estimated rate and information indicative of the particular stop to a first rate data element 264.

A second rate calculations module 266 is provided with input from the ELPTIME, DEPARTURES, ARRIVALS, and HALLCALLS signals. The second rate calculations module 266 also estimates the rate that hall passengers arrive at a stop to wait for one of a car to service the stop.

The second rate calculations module 266 provides the eor r estimated rate along with information indicative of the S" particular stop to a second rate data element 268.

Calculations by second rate module 266 (described in detail hereinafter) are based upon the elapsed time between a car servicing a particular stop and a hall 25 passenger subsequently pressing a hall call button for that stop.

S

A rate averager 270 uses data from rate data elements 264, 268 which are updated in response to requested service (car leaving a stop or hall call registered respectively) along with data from traffic mode data element 58 to calculate an up rate which is stored in an up rate data element 272, a down rate which is stored in a down rate data element 274, and an off rate which is stored in an off rate data element 276. Up rate data element 272 contains information indicating the up passenger rate the rate that hall passengers arrive at the lobby to wait for a car going to other floors). Down rate data element 274 contains information 7 :s'0 24 indicative of the rate that hall passengers arrive at other floors to wait for a car going to the lobby. Off rate data element 276 contains information indicative of the rate that hall passengers arrive to wait for cars travelling between non-lobby floors.

As new rate values are calculated by first and second rate calculations modules 262, 266 and placed in first and second rate data elements 264, 268, respectively, rate averager 270 updates up, down, and off data elements 272, 274, 276 according to the current mode of elevator system 20. If the mode is a crisp value a single value indicative of either up, down, or off), then rate averager 270 applies the data from first and second rate data elements 264, 268 to only one of the appropriate up, down, or off rate data elements 272, 274, 276, respectively.

~If, on the other hand, the traffic mode of elevator i: system 20 is expressed as a fuzzy set having three terms indicative of the extent to which the system is in up, down, and off mode, first and second rate data elements S9 264, 268 are applied to up, down, or off rate data r S' elements 272, 274, 276 in proportion to the degree of membership of terms of the traffic mode fuzzy set stored in traffic mode data element 58.

25 Traffic mode data element 58 and the up rate, down rate, and off rate data elements 272, 274, 276 are provided as inputs to a rate converter module 278, which

S

uses the input data and the ARRIVALS, DEPARTURES, and ELPTIME signals to estimate the number of hall passengers at a particular stop waiting for car service. The number of hall passengers at a stop is determined by multiplying the rate (from one or more of the up, down rate, and off rate data elements 272, 274, 276, depending on the traffic mode of the system) by the amount of elapsed time since the stop was last serviced. The number of passengers is provided to hall passengers data element 62 as a fuzzy set or a crisp value, depending on the needs 0 ejqof the follow-on processes. Operation of rate converter T T7 .0 M

W

N%3-N o0<% 25 module 278 is described in detail hereinafter.

First rate calculation module 262 calculates first instantaneous passenger rate, INSTRATE1, whenever an elevator car stops at a floor to answer a hall call. An assumption is made that any passengers departing from the car will do so before any hall passengers board the car.

The number of passengers who board the car is therefore determined by subtracting the minimum passenger count from the final passenger count the number of passengers in the car when the elevator doors close).

The rate that is provided to first rate data element 264, INSTRATE1, equals the number of passengers that board the car divided by the elapsed time since the particular stop was last serviced.

If the number of passengers provided by car passengers data element 54 is a crisp value, the subtraction and division described above are straightforward. If, however, the number of car passengers is expressed as a fuzzy set, the fuzzy set 20 describing the number of passengers when the weight is a minimum is subtracted from the fuzzy set describing the number of passengers in the car when the elevator door is closed. This subtraction is performed by subtracting eve-y combination of basis elements and taking the 25 minimum of the degrees of membership of the terms thus subtracted. Terms having the same basis element are combined into a single term having a degree of membership equal to the maximum degree of membership of the combined terms.

For example, assume fuzzy set F1 equals {uA, v B, w C} and that fuzzy set F2 equals {xlD, y1E, zlF). The fuzzy set formed by subtracting F2 from F1 would equal: (min(u,x) (A-D),min(u,y) (A-E),min(u,z) min(v,x) (B-D),min(v,y) (B-E),min(v,z) min(w,x) (C-D),min(w,y) (C-E),min(w,z) IwJ 26 Any terms having the same basis elements, for example if A-D equals C-E, are combined by taking the maximum of the degrees of membership of those terms, e.g.: max(min(u,x), min(w,y)) As an example, if A=7, D=4; and w=.6, C=4 and E=l; then the combined term max(min(.3, min(.6, 3 .4j3.

As an added step for subtracting the passenger count fuzzy sets, any term of the resulting set having a basis clement less than zero is eliminated since having fewer than zero passengers board a car at a stop does not make sense. First rate calculations module 262 determines INSTRATE1, the fuzzy set representing the rate of hall passenger arrivals, by dividing the basis elements of the fuzzy set resulting from subtracting the passenger count fuzzy sees by the elapsed time since the particular stop was last serviced. The resulting passenger rate fuzzy set, along with information indicating the particular stop, is provided to first rate data element 264.

Second rate calculations module 266 determines a a second hall passenger arrival rate, INSTRATE2, whenever a hall call button is pressed. The rate fuzzy set produced 25 by the second rate calculations module 266, INSTRATE2, assumes that the arrival of hall passengers follows a Poisson distribution. The number of hall passengers increases by only one passenger at a time. The elapsed time between the last servicing of the particular stop and the pressing of the hall call button is used to construct the INSTRATE2 fuzzy set which has basis elements with value 1/T, 2/T, wherein each term has a degree of membership defined by the formula: degree of membership RTeRT degree of membership RTe where e is the natural logarithm and R is the basis 26a element of the associated term of the fuzzy set. The degrees of membership reduce to: e =0.37; 2e =0.27; 3e 3 =0.15; 10e 0 =0.0005. INSTRATE2, along with information indicative of the particular stop, is provided as an output by second rate calculations module 266 to second rate data element 268.

First rate calculations module 262 updates the value of INSTRATE1, stored in first rate data element 264, in response to a car servicing a hall call. Second rate calculations module 266 updates INSTRATE2, stored in second rate data element 268, in response to a hall passenger pressing a hall call button. The fuzzy sets which represent INSTRATE1 and INSTRATE2 are used to update fuzzy set stored in up rate data element 272, down rate data element 274, and off rate data element 276.

Prior to being used to update the values for the overall system rates stored in up, down, and off rate 0* 0 data elements 272, 274, 276, an adjustment is made to the values of INSTRATE1 an,, INSTRATE2 to compensate for the a greater probability of lower floors having up hall calls and higher floors having down hall calls. When a new INSTRATE1 or INSTRATE2 is calculated in response to a downward travelling car or a down hall call, the basis elements of the INSTRATE1 and INSTRATE2 fuzzy sets are 25 divided by or multiplied by the ratio of to where F is the total number of floors in the building and i is the particular floor that the s.o. system is servicing. Similarly, the basis elements of 6 the INSTRATE1 and INSTRATE2 fuzzy sets are divided by or multiplied by the ratio of to (F-i) whenever a new calculation is made in response to servicing a call with an upward travelling car or an up hall call.

The rate averager 270 updates the fuzzy set stored in up rate data element 272 whenever INSTRATE1 is updated in response to a car servicing the lobby or whenever INSTRATE2 is updated in response to a lobby hall call button being pressed. The new up rate fuzzy set is a 26b running average calculated by the following equation: (0.2xUMxINSTRATE)+(1.0-(0.2xUM))x{old up rate fuzzy set} INSTRATE in the above formula is either INSTRATE1 or INSTRATE2. UM (up membership) is the degree of membership of the term of the traffic mode fuzzy set (from traffic mode data element 58) which corresponds to the up traffic rate. UM ranges from zero to one.

For instance, UM=0.2, the update will be 0.04 new INSTRATE+0.96 old INSTRATE; if UM=0.8, the update will be 0.16 new INSTRATE+0.84 old INSTRATE; term by term.

Using UM in the above equation causes the up rate fuzzy set to be affected by INSTRATE only to the extent that the elevator system is currently in the UP mode.

The multiplication in the above equation affects only the degrees of membership of the terms of the fuzzy sets.

The addition is performed using standard techniques, known to those skilled in the art, for adding fuzzy .20 sets. This is fully analogous to subtraction as defined hereinbefore, except that the sum of the basis elements have a combined membership equal to the max of the individual memberships, term for term; the max of like terms is also used.

Rate averager 270 updates the down rate fuzzy set and stores the new value in down rate data element 274 whenever INSTRATE1 is updated in response to a car going down or whenever INSTRATE2 is updated in response to a down hall cAll button being pressed. The new down rate fuzzy set is calculated by the following equation: (0.2xDMxINSTRATE)+(1.0-(0.2xDM))x(down rate fuzzy set} INSTRATE in the above formula is either INSTRATE1 or INSTRATE2. DM (down membership) is the degree or membership of the term of the traffic mode fuzzy set which corresponds to the down traffic rate. DM ranges yTPR from zero to one.

26c Rate averager 270 updates the off rate fuzzy set and stores the new value in off rate data element 276 whenever INSTRATE1 and INSTRATE2 is updated (in either up or down direction). The new value of the off rate fuzzy set is calculated by the following equation: (0.2xOPxINSTRATE)+(1.0-(0.2xOP))x(off rate fuzzy set} INSTRATE in the above formula is either INSTRATE1 or INSTRATE2. OP (off peak) is the degree of membership of the term of the traffic mode fuzzy set which corresponds to the off-peak traffic mode. OP ranges from zero to one.

Rate converter module 278 provides a fuzzy set indicating the number of hall passengers waiting for a S 15 car at any particular stop at any particular time.

S" First, a total rate fuzzy set is constructed by combining the fuzzy set from up rate data element 272, the fuzzy set from down rate data element 274, and the fuzzy set from off rate data element 276 The sets are combined by 20 scaling the degrees of membership of each term of the sets by the relative degree of membership of the o. corresponding terms of the traffic mode fuzzy set so that the degrees of membership of the up rate fuzzy set are scaled by UM/(UM+DM+OP), the degrees of membership of the down rate fuzzy set are scaled by DM/(UM+DM+OP), and the S"degrees of membership of the off rate fuzzy set are scaled by OP/(UM+DM+OP). After scaling the degrees of S• membership, the three sets are added together and then the values of the basis elements of the result are divided by 3 to produce the total rate fuzzy set.

27 The ELPTIME and DEPARTURE signals are used to determine the amount of time since a particular stop was last serviced.

A fuzzy set indicative of the number of hall passengers waiting at a particular stop is constructed by multiplying the values of basis elements of the total rate fuzzy set by the amount of elapsed time. The resultant fuzzy set it provided by count estimator module 60 to hall passengers data element 62.

The processing illustrated herein for count estimator module 60 can be done at run-time or can be done off-line, in which case a table is constructed having indices indicative of possible inputs to count estimator moaule and having entries indicative of possible outputs of count estimator module 60. Construction and use of a similar table for weight interpretation module 52 is shown in Fig. 5 and the discussion associated therewith. One skilled in the art could extrapolate from the specific example of Fig. 5 to build and use a similar table for count estimator module There are many indicators for measuring elevator system 20 performance, such as average wait time, wait threshold, and average service time. The average wait time is the average time between a hall call and servicing of the hall call.

The wait threshold is the average number of people that wait for longer than a constant, predete-mined amount of time.

The average service time is the average time between a hall passenger pressing a hall call button and the same passenger arriving at the destination floor. The details of calculating the average wait time, the wait threshold, and the average service time are known to those skilled in the 30 art. Note that elevator performance indicators can be o 99 calculated by using either crisp values or fuzzy sets.

The HALLCALLS signal is provided as an input to the performance estimator 64 which, in response to a particular hall call, uses the traffic mode and hall passengers data elements 58, 62 to construct a plurality of performance fuzzy sets. Each performance fuzzy set corresponds to a particular elevator performance indicator. Each term of each set 28 represents the estimated value of the particular performance indicator which corresponds to servicing the hall call with a particular car. The performance estimator 64 stores the fuzzy sets in the performance data element 66.

Referring to Fig. 12, a graph 290 has a plurality of bars 292-297 wherein the height of each bar indicates the inverse of the estimated average wait time associated with a particular car. A higher bar indicates a lower average wait time. The graph 290 can represent a performance fuzzy set wherein each basis element of the set represents a particular elevator car and the degree of membership of each basis element corresponds to the height of each bar 292-297. Similar fuzzy sets can be constructed for any other elevator performance indicators S.. that can either be directly measured or derived from direct measurements. The particular indicators chosen and the method of calculation depend upon a variety of functional factors known to those skilled in the art.

20 Referring to Fig. 13, a flow chart 300 illustrates steps for constructing a plurality of performance fuzzy sets such as for weight time, etc. which are represented on flow chart 300 by the symbol P. The annotation P(I, C) indicates the Cth term, corresponding to car number equals C, of the Ith performance fuzzy set.

At a first step 302, P is initialized to contain no terms and no fuzzy sets. 'ollowing step 302 is a step 304 where an index rariab-e, T, for indexing into all of the performance fuzzy sets, is initialized to 1.

Following step 304 is a test 306 where I is compared to IMAX, a predetermined constant equal to the number of performance indicators (Fig. 14 shows at least seven of them).

If at step 306 I is not greater than IMAX, control passes from step 306 to a step 307 where C, an index variable for indexing through terms of the performance fuzzy sets (and hence corresponding to each car), is initialized to 1. Following step 307 is a step 308 where 29 C is compared to CMAX, the aumber of cars in the system.

If at test 308 C is not greater than CMAX, control passes from step 308 to a step 309, where car C is assumed to be assigned to service a particular hall call at a particular stop and parameters related thereto are identified.

Following step 309 is a step 310 where P(I, C), which equals the Cth term of the Ith fuzzy set, is determined. At step 310, car C is assumed to be assigned to a particular hall call and the performance of the system is calculated using equations and calculation methods that are appropriate for the Ith performance indicator. The value calculated at step 310 becomes the degree of membership of the Cth term in the Ith S 15 performance fu.zzy set: eg. call wait time for car 3+.45 .(Fig. 12).

After step 310 is a step 311 where the index variable C is incremented. After step 311, control passes bac!k to test 308. If at test 308 C is Qreater 20 than CMAX, indicating that the system performance for the Ith performance indicator has been calculated for all of the cars, then control passes from test 308 to a step 312, where the index variable I, indicating the particular performance criteria, is incremented. Control passes from step 312 back to test 306, where I is compared to IMAX. If at step 306 I is greater than IFLAX, ''all of the performance fuzzy sets have been calculated and processing is complete.

Referring to Fig. 14, a customer preferences graph 320 has a plurality of bars 322-328 wherein each bar 322-328 corresponds to a particular elevator performance indicator and wherein the height of each bar 322-328 indicates the importance of the performance indicator to the customer. For example, the height of bar 323, which represents average service time, is greater than the height of bar 322, which represents the average wait time, thereby indicating that given a choice between 3 optimizing performance using average wait time or 30 optimizing performance using average service time, the customer prefers to use average service time.

The graph 320 can represent a customer preferences fuzzy set wherein each basis element (term) the set corresponds to a particular elevator performance indicator and wherein the height of each bar 322-328, indicating the relative importance to the customer of each elevator performance indicators, corresponds to the degree of membership of each term of the fuzzy set. The customer preferences fuzzy set -an be constructed by the elevator manufacturer or can be entered by the elevator customer (owner, operac.or) using a variety of data input means obvious to those skilled in the art. The customer preferences fuzzy set is stored in the customer preferences data element 68.

The performance and customer preferences data elements 66, 68 are provided as inputs to assignment S•utility calculator module 70, which determines the utility (usefulness, suitability) assigning each car to 20 service a hall call and provides to assignment utility data element 72 an assignment utility fuzzy s-t having basis elements corresponding to each car wherein the degree of membership of each basis element corresponds to the utility of assigning the associated car to the particular hall call. The objective, assigning a car to a call in the most useful or suitable manner, include3 99*t9* establishing for each performance factor (such as wait S•time, service time, etc a fuzzy set having a term for each car and a value which is a combination of the value related to the car and the importance of such factor established by the customer preferences fuzzy set.

Referring to Fig. 15, a flow chart 340 illustrates operation of the assignment utility (suitability) calculator module 70. The symbol AU indicates the assignment utility fuzzy set, and the symbol SP indicates a plurality of scaled performance fuzzy sets. The symbol CP indicates the customer preferences fuzzy set. At a Sfirst step 342, the AU and SP fuzzy sets are initialized 31 to be empty. Following step 342 is a step 344 where an index variable I, for indexing into the performance and the scaled performance fuzzy sets, is initialized to 1.

Following step 344 is a test 346, where I is compared to IMAX, a predetermined constant equal to the number of performance fuzzy sets the number of performance inuicators) as in Fig. 14.

If at step 346 I is not greater than IMAX, control passes from step 346 to a step 348 where C, a variable for indexing through all of the ca.s of the elevator system, is set to 1. Following step 348 is a tst 350 where C is compared to CMAX, a predetermined constant equal to the number of cars in the elc.ator system. If at step 350 C is not greater than CMAX, control passes from step 350 to a step 352.

At step 352, the degree of membership of the Cth term in the Ith scaled performance fuzzy set SP(I-C), equal to the degree of membership of the Cth term of the Ith performance fuzzy set P(I, times the degree of membe-ship of the Ith term of the customer preferences fuzzy set, CP(I). If CP(I) is close to one, indicating that the Ith performance indicator is important to the customer, the degree of membership of the Cth term of t' Ith scaled performance fuzzy set will nearly equal the 25 Cth term of the Ith performance fuzzy set. If, on the other hand, CP(I) is at or near zero, indicating that the Ith performance indicator is not important to the customer, then the Cth term of the Ith scaled performance fuzzy set will equal or be close to zero, irrespective of the value of the Cth term of the Ith performance fuzzy set.

After step 352 is a step 354 where the variable C is incremented. After step 354, control passes back to test 350 where C is compared to CMAX. If at step 350 C is greater than CMAX, indicating that all of the terms of the Ith scaled performance fuzzy set have been S calculated, control passes from step 350 to a step 356 Swhere I, the variable used for indexing through the 32 performance indicators, is incremented. After step 356, control passes back to test 346, where I is compared to IMAX, the number of performance indicators.

If at test 346 I is greater than IMAX, control passes from test 346 to a step 358, where the index varible C is initialized to 1. After step 358 is a test 360, where C is compared to CMAX, the number of elevator cars. If at step 360 C is not greater than CNMAX, control passes to a step 362, where the degree of membership of the Cth term of the assignment utility fuzzy set is set equal to the Cth term (car 1, initially) of the first scaled performance fuzzy set SPC(I, After step 362 is a step 364, where the variable I, for indexing of the scaled performance fuzzy sets is set two, so that the term in the second scaled performance fuzzy set for this car can be compared with the term for this car in the first scaled performance fuzzy set SP(1,2) vs. SP(2,3).

After step 364 is a test 366 where I is compared to IMAX, the number of performance indicators (and fuzzy sets) in the system. If I is not greater than IMAX, control passes to a step 368, where the Cth term (car=C) of the assignment utility fuzzy set is set equal to the greater of the Cth term of the Ith (initially, the second) scaled performance fuzzy set and the previous 25 value of the Cth term of the assignment utility fuzzy set. Step 368 ensures that the Cth term of the :assignment utility fuzzy set always equals the maximum value of the Cth terms of all of the scaled performance fuzzy sets.

Following step 368 is a step 370 where the variable I is incremented. After step 370, control passes back to test 366. If at step 366 I is greater than IMAX, control passes from step 366 to a step 372 where C, the index variable for the cars, is incremented. After step 372, control passes back to test 360 where, if C is greater than CMAX, processing is complete. The resulting assignment utility fuzzy set is provided as an output to ^i assignment utility data element 72.

I I 33 The processing illustrated herein for performance estimator module 64 and assignment utility module 70 can be done at run-time or can be done off-line, in which case a table is constructed having indices indicative of possible inputs to performance estimator module 64 and assignment utility module 70 and having entries indj possible outputs of performance estimator mc.ud ient utility module 70 and having enti cf possible outputs o performance ea 64 and assignment utility module Construction and use of a similar table for weight interpretation module 52 is shown in Fig. 5 and the discussion associated therewith. One skilled in the art could extrapolate from the specific example of Fig. 5 to 15 build and use a similar table for performance estimator module 64 and assignment utility module The assignment utility data element 72 is provided as an input to the uncertainty filter module 74, which determines the final tentative elevator car assignment (a 20 crisp value) by choosing the car corresponding to the term of the assignment utility fuzzy set having the highest degree of membership. The uncertainty filter module 74 will only provide an assignment to assignment data element 76 when the uncertainty of the assignment is 25 below a predetermined value stored in customer preferences data element 68 which is provided as an input to uncertainty filter module 74. The uncertainty of an assignment can be expressed in terms of certainty which is defined as the degree of membership of the term having the highest degree of membership (the term of the tentatively assigned car) divided by the sum of the degrees of membership of all of the terms of the assignment utility fuzzy set. A customer that prefers a relatively quick assignment of a car to a hall call would specify a high degree of uncertainty (where the highest degree of membership is not much higher than the rest) while a customer who does not care about a quick assignment would specify a low degree of uncertainty (where highest degree of membership really stands out).

R, Alternatively, uncertainty filter module 74 may 34 provide an assignment to assignment data element 76 after a constant predetermined amount of time which is stored in customer preferences data element 68. The value of the assignment will be the car represented by the basis element (car identity) in utility fuzzy set having the highest degree (inverse uncertainty) therewith.

As a third alternative, the uncertainty filter module 74 may adjust the uncertainty threshold as a function of the elapsed time since the hall call button was pressed. As the elapsed time increases, the threshold decreases. The threshold vs. time function can be linear or non-linear, depending on the requirements of the particular elevator system. Or, the threshold can be a minimum value which the degree of membership of the selected car must have before it is assigned either a fixed threshold or one that decreases with elapsed time from the hall call.

The processing illustrated herein for uncertainty filter module 74 can be done at run-time or can be done r rr 20 off-line, in which case a table is constructed having r indices indicating possible inputs to uncertainty filter module 74 and having entries indicating possible outputs S. Sof uncertainty filter module 74. Construction and use of a similar table for weight interpretation module 52 is shown in Fig. 5 and the discussion associated therewith.

One skilled in the art could extrapolate from the specific example of Fig. 5 to build and use a similar table for uncertainty filter module 74.

The invention illustrated herein is applicable to any elevator system having any number of cars, stopping on any number of floors, having any maximum capacity, maximum velocity, or having any other specific set of physical characteristics. Similarly, the invention may be practiced irrespective of the physical design of the elevator system, including drives, counterweights, cabling, door mechanisms, hall call and car call 34a signaling devices.

Although the invention has been shown in an elevator system having a single lobby floor on the lowest floor of the building, the invention may be practiced irrespective of whether the elevator system has more than one lobby floor and whether or not the lobby floor is the lowest floor in the building.

Furthermore, the invention may be practiced irrespective of the processes used to carry out other elevator dispatching functions, the specific electronic hardware used to implement the invention, or the design of the load weighing device. Portions of the processing illust-ted herein may be implemented with electronic hardware, which would be straightforward in view of the S 15 hardware/software equivalence discussed (in another field) in US Patent No. 4,294,162 entitled "Force Feel Actuator Fault Detection with Directional Threshold" S"(Fowler et al.) Instead of reading and writing data to and from data elements, the hardware would communicate by receiving and sending electronic signals.

Although only run-time operation of traffic module S.56, count estimator module 60, performance estirator module 64, assignment utility calculator module 70, and uncertainty filter module 74 is illustrated herein, module 56, 60, 64, 70, 74 may be run off-line to generate lookup tables containing all of the possible inputs and the resulting outputs. Off-line generation and use of a S"lookup table is illustrated for weight interpretation module 52 in Fig. 5 and the text of the application relating thereto.

Many of the modules which use fuzzy values for input may be adapted, in a manner obvious to one skilled in the art, to use crisp inputs. In fact, the utility (suitability) of assigning each car, expressed as the corresponding term of AU(C), is crisp, just as is the case for any other car to call evaluation from which a winning car is selected for assignment to a call.

R Performance estimator module 35 and customer preferences data element 68 may be adapted to use any type of elevator performance criteria. The invention may be practiced irrespective of the mechanism used to set or change the customer preferences.

Although the invention has been shown and described with respect to exemplary embodiments thereof, it should be understood by those skilled in the art that various changes, omissions and additions may be made therein and thereto, without departing from the spirit and the scope of the invention.

O

IO i o oeoao

Claims (10)

1. In a method of dispatching d plurality of elevators in a building, the steps of: providing a plurality of empirically predetermined sets of signals, each set having signals corresponding to a plurality of terms, each set relating to a given number of people, from near zero to about the maximum number of people which one of said elevator cars is designed to carry, each term including a basis element equalling a given weight and a corresponding degree of membership related to the likelihood that the number of people corresponding to said set will be present when the given weight is measured as the weight of the elevator; providing a weight signal indicative of the current weight of each candidate elevator which may be involved 15 in said method of dispatching; providing for each said candidate elevator a plurality of signals indicative of a passenger count fuzzy set in which each of the terms corresponds to a related term of one of said predetermined sets having a e: oI 20 basis element equalling the weight of such elevator indicated by said weight signal, each term of said fuzzy S• set having a basis element equalling the number of passengers corresponding to the set of said related term and a degree of membership the same as the degree of membership of said related term; and dispatching elevators to provide service in said building in response to a process using the signals of said fuzzy sets to provide corresponding representations of the number of passengers in said elevators.

2. A method according to claim 1 wherein said likelihood is determined by observing the number of people in an elevator in said building of the same type as said candidate elevators at a number of times when the corresponding weight is measured as being the weight of such elevator.

3. A method according to claim 1 wherein said last step includes combining signals of said passenger count 37 fuzzy set to provide a crisp signal indicative of a single crisp value of passenger count.

4. A method according to claim 3 wherein said crisp signal is indicative cf the basis element of said passenger count fuzzy set having the highest degree of membership.

A method according to claim 3 wherein said crisp signal is provided by altering the signals of said passenger count fuzzy set representing each degree of membership by the ratio of its value to the sum of all their values, thereby normalizing said fuzzy set and summing the products of: the value of the normalized degree of membership of each term and the value of the basis element of each term.

6. A method according to claim 1 wherein said last step includes altering the signals of said passenger count fuzzy set representing each degree of membership by 0 g o the ratio of its value to the sum of all their values, thereby normalizing said fuzzy set.

7. In a method of dispatching a plurality of elevators in a building, each of said elevators having a weight ct sensor for providing signals indicative of the weight C thereof, comprising: providing a plurality of empirically predetermined 25 sets of signals, each set having signals corresponding to Qa plurality of terms, each set relating to a given number of people, from near zero to about the maximum number of people which one of said elevator cars is designed to carry, each term includirg a basis element equalling a given weight and a corresponding degree of membership related to the likelihood that the number of people corresponding to said set will be present when the given weight is measured as the weight of the elevator; providing a weight signal indicative of a first value of weight at one extreme of a range of wight which extends from near zero to near the maximum weight of said elevators; a. providing a plurality of signals indicative of 4 I 38 a passenger count fuzzy set in which each of the terms corresponds to a related term of one of said predetermined sets having a besis element equalling the weight indicated by said weight signal, each term of said fuzzy set having a basis element equalling the number of passengers corresponding to the set of said related term and a degree of membership the same as the legree of membership of said related term; b. combining signals of said passenger count fuzzy set to provide a crisp signal indicative of a single crisp value of passenger count; c. storing the values of said weight signal and said crisp signal in a table; d. providing a new weight signal indicative of a value of weight which is further from said one extremne than the value of the weight signal used in step a by about the resolution of said weight sensors; comparing said new weight signal to a signal indicative of the value of weight at the other extreme of said range, and if said new weight signal indicates a value within said range repeating steps a-e, but if said value exceeds said range, proceeding to step f; and f. dispatching elevators to provide service in said building in response to a process using the weight 25 signals provided by said weight sensors to access said S" table to provide corresponding representations of the S" number of passengers in said elevators.

8. A method according to claim 7 wherein said storing step c includes comparing said crisp signal to a crisp signal previously provided by the next prior value of said weight signal and storing signals indicative of weight and passenger count only for values of weight which provide unique passenger counts.

9. A method according to claim 7 wherein said crisp signal is indicative of the basis element of said passenger count fuzzy set having the highest degree of membership.

1 0. A method according to claim 7 wherein said crisp 39 signal is provided by altering the signals of said passenger count fuzzy set representing each degree of membership by the ratio of its value to the sum of all their values, thereby normalizing said fuzzy set, and summing the products of: the value of the normalized degree of membership of each term and the value of the basis element of each term. DATED this 10th day of November 1993 OTIS ELEVATOR COMPANY Attorney: PETER HEATHCOTE Fellow Institute of Patent Attorneys of Australia of SHELSTON WATERS O B o *@sea: B *v *aB« B B 0 g Soo* o Bo B o Beo J. -A0 ABSTRACT Elevator control software uses a signal from a passenger weight sensor (42, 43) and observed weight fuzzy logic sets to provide a fuzzy logic set indicative of the number.of passengers in a car (22, 23). The traffic mode of an elevator system is set according to the number and frequency of passengers departing and arriving at a building lobby. The utility of assigning each zar of an elevator system to service a hall call is determined by estimating the performance of each car 10 using a plurality of performance criteria. The number of hall passengers waiting at a stop for service by a car is -determined by first calculating instantaneous passenger rates whenever a hall call button (38) is pressed or whenever passengers board a car. An uncertainty filter (74) is provided with input data indicating a fuzzy logic set having basis elements corresponding to cars of an elevator system having degrees of membership associated therewith corresponding to the utility of assigning the associated car to service a hall call.