EP1705146B1 - Elevator group supervisory control system - Google Patents

Elevator group supervisory control system Download PDF

Info

Publication number
EP1705146B1
EP1705146B1 EP05017313A EP05017313A EP1705146B1 EP 1705146 B1 EP1705146 B1 EP 1705146B1 EP 05017313 A EP05017313 A EP 05017313A EP 05017313 A EP05017313 A EP 05017313A EP 1705146 B1 EP1705146 B1 EP 1705146B1
Authority
EP
European Patent Office
Prior art keywords
route
car
target
elevator
time
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
EP05017313A
Other languages
German (de)
English (en)
French (fr)
Other versions
EP1705146A1 (en
Inventor
Toshifumi Yoshikawa
Satoru Toriyabe
Takamichi Hoshino
Atsuya Fujino
Shunichi Tanae
Hiromi Inaba
Kenji Yoneda
Toru Yamaguchi
Ryo Okabe
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hitachi Ltd
Hitachi Mito Engineering Co Ltd
Original Assignee
Hitachi Ltd
Hitachi Mito Engineering Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Hitachi Ltd, Hitachi Mito Engineering Co Ltd filed Critical Hitachi Ltd
Publication of EP1705146A1 publication Critical patent/EP1705146A1/en
Application granted granted Critical
Publication of EP1705146B1 publication Critical patent/EP1705146B1/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B1/00—Control systems of elevators in general
    • B66B1/24—Control systems with regulation, i.e. with retroactive action, for influencing travelling speed, acceleration, or deceleration
    • B66B1/2408—Control systems with regulation, i.e. with retroactive action, for influencing travelling speed, acceleration, or deceleration where the allocation of a call to an elevator car is of importance, i.e. by means of a supervisory or group controller
    • B66B1/2458—For elevator systems with multiple shafts and a single car per shaft
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B2201/00—Aspects of control systems of elevators
    • B66B2201/10—Details with respect to the type of call input
    • B66B2201/102—Up or down call input
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B2201/00—Aspects of control systems of elevators
    • B66B2201/20—Details of the evaluation method for the allocation of a call to an elevator car
    • B66B2201/211—Waiting time, i.e. response time
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B2201/00—Aspects of control systems of elevators
    • B66B2201/20—Details of the evaluation method for the allocation of a call to an elevator car
    • B66B2201/216—Energy consumption
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B2201/00—Aspects of control systems of elevators
    • B66B2201/20—Details of the evaluation method for the allocation of a call to an elevator car
    • B66B2201/226—Taking into account the distribution of elevator cars within the elevator system, e.g. to prevent clustering of elevator cars
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B2201/00—Aspects of control systems of elevators
    • B66B2201/40—Details of the change of control mode
    • B66B2201/402—Details of the change of control mode by historical, statistical or predicted traffic data, e.g. by learning
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B2201/00—Aspects of control systems of elevators
    • B66B2201/40—Details of the change of control mode
    • B66B2201/403—Details of the change of control mode by real-time traffic data

Definitions

  • the present invention relates to an elevator group supervisory control system and in particular to control of elevator assignment to generated hall calls.
  • An elevator group supervisory control system treats multiple elevator cages as one group to provide more efficient transport service to users. Specifically, four to eight elevator cages are typically controlled as one group. If a hall call occurs at a floor, the most appropriate one is selected from this group and assigned to the hall call.
  • Assignment control based on an assignment evaluation function of waiting time which constitutes the basic assignment control principle of existing group supervisory control systems, was developed around 1980 when microcomputers were introduced. In this method, yet-to-be served hall calls are kept under management. If a new hall call occurs, the time for which the new hall call would wait until served is calculated for each cage according to the predicted waiting time of each yet-to-be served hall call. Consequently, the new hall call is assigned to either a cage that requires the shortest waiting time or a cage that is not to serve a hall call which has long been pendent.
  • This control principle determining call assignment according to an evaluation function of predicted waiting time, provided an epoch-making control method in those days and has been inherited to the present elevator makers for group supervisory control. However, this control has the following two problems:
  • GB-A-2 264 571 discloses a group controlled elevator system monitoring the concentration level of the elevator cars and issuing a dispersion commands to individual elevator cars whenever the concentration level exceeds a given threshold.
  • EP-A-1 055 633 discloses another related system estimating arrival times based on estimated route data for elevator cars on hall calls and then assigning elevator cars based on the estimated arrival times.
  • the present invention provides a system and a method as defined in the independent claims. Further advantageous features are set out in the dependent claims.
  • An elevator group supervisory control system allows cages to settle in temporally equal interval condition over a long period of time since reference routes which guides.the cages into temporally equal interval condition are generated and car assignment is executed so as to make the respective cages follow their reference routes.
  • FIG. 1 , 2 , 4 through 9 and 11 through 15 each concern the first embodiment.
  • Fig. 8 is an example of a control image concerning the elevator group supervisory control system in accordance with the present invention.
  • a longitudinal (vertical) section of shafts within a building is conceptually shown with elevator cars moving therein.
  • Shown right in Fig. 8 is a diagram (generally called an operation diagram) which depicts the trajectory of each elevator car with the horizontal axis (A01) representing the time and the vertical axis (A02) representing the vertical position of a given floor in the building.
  • the elevator group supervisory control system controls two cars.
  • Left in Fig. 8 the elevator group supervisory control system controls two cars.
  • the first car (given reference numeral 1) is going up after changing its direction at the first floor while the second car (given reference numeral 2) is going down from the second floor.
  • This situation can be grasped by examining the operation diagram shown right in Fig. 8 .
  • the first car (A03) and the second car (A04) were descending toward the landings of the first floor and second floor, respectively. That is, the actual trajectory of each car is shown to the left of the present time in the operation diagram of Fig. 8 . That is, the actual trajectory of the first car is a trajectory A031 while the actual trajectory of the second car is a trajectory A041.
  • the present invention concerns the future trajectory of each car to the right of the present time along the time axis in the operation diagram.
  • this target trajectory is denoted as a "target route”.
  • An elevator group supervisory control system according to the present invention is characterized in that the operation (to be precise, assignment) of each car is controlled so as to follow the target route.
  • A032 is the target route of the first car while A042 is the target route of the second car.
  • Fig. 9 depicts how an elevator car is decided to be assigned to a hall call according to the target route.
  • the left side provides a vertical sectional view of the shafts showing the situation of the elevators while the right side provides an operation diagram.
  • the group supervisory control assigns an appropriate car, the first car (B03) or the second car (B04).
  • the target route of the first car is trajectory B032.
  • the predicted route (a trajectory predicted to be followed after the present time) of the first car is route B033 (predicted route 1) if the new hall call is not assigned or route B034 (predicted route 2) if the new hall call is assigned.
  • Group supervisory control tries to move each car so that its target route is followed. Accordingly, since predicted route 1, that is, the route predicted to be taken if the hall call is not assigned is nearer to the target route, the hall call is not assigned to the first car. Consequently, the actual trajectory of the first car approximates to the target route.
  • the actual trajectory (B031) of the first car (B03) is close to the actual trajectory (B041) of the second car (B04), that is, they are run in a string-of-cars condition until the present time.
  • the first car (B03) and the second car (B04) will continue to be close to each other in a string-of-cars condition.
  • the first car is controlled so as to distance itself from the second car by following its target route designed to locate the respective cars at temporally equal intervals, that is, if the new hall call is not assigned to the first car (B03), the first car will follow its target route aimed at the temporally equal interval condition.
  • FIG. 1 depicts the control system configuration of an elevator group supervisory control system in accordance with the present invention
  • this control system is implemented on a microcomputer, DSP (Digital Signal Processor), system LSI, computer (personal computer, etc.) or the like.
  • DSP Digital Signal Processor
  • system LSI system LSI
  • computer personal computer, etc.
  • the following four components are key components: a target route preparation section 103, a predicted route preparation section 104, a route evaluation function-used route evaluation function calculating section 105, and an assignment elevator selecting unit 2 within a target route control unit 101.
  • target route-based control as described with Figs. 8 and 9 is executed by these four components.
  • Fig. 1 is largely composed of: a plurality of elevators (42A, 42B and 42C); controllers (41A, 41B and 41C) which respectively control these individual elevators (the first through Nth elevators); and a group supervisory control system 1 which collectively controls these elevators as one group.
  • the controllers (41A, 41B and 41C) associated respectively with the individual elevators or the first through Nth elevators control the positions and velocities of their elevators based on the hall calls assigned to elevators and the car call information derived from the hall calls.
  • the function of the group supervisory controller 1 is to determine which car is the most appropriate for a generated hall call based on the information regarding each elevator (position, moving direction, already assigned hall call, derived car call, hall call waiting time, etc.) and assign the hall call to the car. This function is described below in detail.
  • a target route specification setting section 102 sets specifications for target routes based on the information from a traffic data unit 7. This will be described later in detail. Basically, trajectories that keep the respective elevators at temporally equal intervals are set as these specifications.
  • the traffic data unit 7 outputs the latest information about traffic within the building (statistical information about elevator-used human traffic).
  • the target route preparation section 103 generates target routes (such as A032 and A042 in Fig. 8 ) for the respective elevator cars.
  • this target route preparation uses: hall call information (information about hall calls assigned to the respective cars) obtained from a hall call data unit 8; car call information (information about car calls assigned to the respective cars) obtained from a car call data unit 9; traffic information obtained from the traffic data unit 7; average stop frequencies (for example, how many times an elevator is expected to stop during ascent or descent) obtained from an average stop frequency data unit 5; stoppage time information (for example, average stoppage time per stop) obtained from a stoppage time data unit 6; each elevator car's rated velocity and other specification information obtained from an individual car specification data unit 11; available car count/name information (indicating how many and which cars can be controlled as a group at that time or in that period) obtained from an available car count/name data unit 12; service floor information (information about which floors can be served at that time or in that period) obtained from a service floor data unit 13; and predicted route information
  • the average stop frequency data unit 5 and the stoppage time data unit 6 are configured to receive traffic information from the traffic data unit 7. By using such detailed information about the traffic in the building and the situation of the elevators, it is possible to set more appropriate target routes.
  • the target route preparation method will be described later in detail.
  • predicted routes are prepared for each car.
  • Predicted route 1 (B033) and predicted route 2 (B034) shown in Fig. 9 are specific examples.
  • a predicted route of a car is a predicted trajectory that the car may follow from the present time.
  • the predicted route preparation uses the following input data: hall call information obtained from the hall call data unit 8; car call information obtained from the car call data unit 9; traffic information obtained from the traffic data unit 7; average stop frequencies obtained from the average stop frequency data unit 5; stoppage time information obtained from the stoppage time data unit 6; each elevator car's specification information obtained from the individual car specification data unit 11; available car count/name information (indicating how many and which cars can be run at that time or in that period) obtained from the available car count/name data unit 12; service floor information (information about which floors can be served at that time or in that period) obtained from the service floor data unit 13; and provisional assignment information from a provisional assignment car setting unit.
  • accurate prediction is one of the important points. This can be realized by using detailed information about the traffic in the building and the condition of the elevators as mentioned above. How to prepare predicted routes will be described later in detail.
  • the route distance index-used route evaluation function calculating section 105 'nearness' between a target route and a predicted route is evaluated for each car by a route distance index-used route evaluation function.
  • this route evaluation function makes it possible to select an elevator car whose predicted route to be taken by the car if assigned to the hall call is closer to its target route.
  • the route distance index is an index to quantify the nearness between the first car's target route (B032) and predicted route (B033 or B034). The route distance index and the route evaluation function will be described later in detail.
  • a waiting time evaluation value calculating unit 15 calculates an evaluation value for each car based on the time for which a hall call is predicted to wait if assigned to the car. For example, the evaluation value for a car assigned provisionally to a newly generated hall call may directly be the time for which the hall call is predicted to wait. Likewise, the largest of the times for which all hall calls already assigned to the car are respectively predicted to wait may be set as the evaluation value for the car.
  • a waiting time evaluation value calculated by the waiting time evaluation value calculating unit 15 is weighted and added to a route evaluation function value calculated by the route distance index-used route evaluation function calculating section 105 to calculate a total evaluation value.
  • the weighting factor WC is varied depending on the traffic condition at that time.
  • the WC value is made smaller since hall calls do not frequently occur and it is therefore appropriate to give greater importance to the waiting time evaluation value than to the route evaluation value.
  • the WC value is made larger since hall calls occur frequently and target route-based control is effective.
  • the assignment elevator selecting unit 2 determines which car is to be assigned to the hall call.
  • Figs. 8 and 9 focus on the operation of target route control unit 101 and the operation of the waiting time evaluation value calculating unit 15 is omitted therein.
  • an input information update process updates input information and data as the latest input information required for control.
  • the input information and data include: hall call information (input from the hall call data unit 8 of Fig. 1 ), car call information (input from the car call data unit 9 of Fig. 1 ), car information (input from the car information data unit 10 of Fig. 1 ), traffic information (input from the individual car's specification data unit 11 of Fig. 1 ), traffic information-dependent average stop frequencies (input from the average stop frequency data unit 5 of Fig. 1 ), traffic information-dependent stoppage times (input from the stoppage time data unit 6 of Fig.
  • Fig. 19 conveniently indicates that all the above information is entered at a time by the input information update process, it is also possible to enter the information in steps as necessary. For example, the information is entered in several places in the general flow of Fig. 19 . It is also possible to enter some of the information at a time and another at another time. Also note that each elevator car's rated speed and other specification information (obtained from the individual car's specification data unit of Fig. 1 ) is set as constants which are determined depending on the building where the elevators are installed.
  • a target route specification is set through the operation of the target route specification setting section 102 of Fig. 1 .
  • a temporally equal interval state is set as this specification.
  • target routes are prepared according to the set target route specification through the operation of the target route preparation section 103 of Fig. 1 .
  • predicted route preparation process A predicted routes are prepared through operation of the predicted route preparation section 104 of Fig. 1 .
  • car assignment processing is invoked due to the detection of a newly generated hall call (ST105)
  • ST105 a series of car assignment processes shown below the conditional branch is executed. The following describes the car assignment process flow.
  • provisional assignment of each car to the hall call is executed by loop processing.
  • this loop is named a "provisional car assignment loop" (ST106).
  • the variable ka which means the ka-th car is incremented one by one from 1 to N so that each elevator car is given the provisional car assignment processing in a loop form.
  • the provisional assignment setting unit 3 of Fig. 1 executes the provisional assignment process noted above.
  • a predicted route preparation process B (ST107) is executed at first. This process prepares a predicted route which the ka-th car would take if assigned to the hall call (whereas provisional assignment is not considered in the predicted route preparation process A (ST104)).
  • the route evaluation function is an index that basically represents the closeness between the target route and the predict route ant its calculation is executed by the route evaluation unction-used route evaluation function calculating section 105 of Fig. 1 . Then, a waiting time evaluation value is calculated based on the predicted waiting time of the hall call for the provisionally assigned ka-th car (ST 109).
  • the waiting time evaluation value for the ka-th car may directly be the time for which the hall call is predicted to wait for the ka-th car if assigned. Likewise, the largest of the times for which all hall calls already assigned to the ka-th car are respectively predicted to wait may be set as the evaluation value for the ka-th car.
  • N total evaluation values (N: the number of cars under group supervisory control) are obtained as a result of provisionally and sequentially assigning the hall call to the respective cars by incrementing ka from 1 to N.
  • N the number of cars under group supervisory control
  • N the number of cars under group supervisory control
  • the most appropriate car is selected for assignment based on the N total evaluation values (ST112). This process is executed by the elevator selecting unit 2 of Fig. 1 .
  • the control system configuration of the elevator group supervisory control system shown in Fig. 1 includes the target route control unit 101 comprising: 1) the target route preparation section (103 of Fig. 1 ), 2) the predicted route preparation section (104 of Fig. 1 ), 3) the route evaluation function calculating section (105 of Fig. 1 ) and 4 ) the target route specification setting section (102 of Fig. 1 ).
  • the following provides a detailed description of how these components operate.
  • Fig. 2 shows an example of the configuration of the target route preparation section.
  • the configuration of the target route preparation section is largely composed of four components: 1) a target route update judgment block (103A of Fig. 2 ), 2) a current temporal phase value calculating block (103B of Fig. 2 ), 3) an individual car's temporal phase value adjustment amount calculating block (103C of Fig. 2 ) and 4 ) an adjusted route preparation block (103D of Fig. 2 ).
  • the target route update judgment block (103A of Fig. 2 ) it is judged whether the current target route is to be updated. If it is judged that the target route is to be updated, the subsequent current temporal phase value calculating block (103B of Fig. 2 ) evaluates the temporal relation among the current predicted routes of the respective elevator cars by calculating the temporal phase value of each predicted route as an index.
  • phase is reasonable if, for example, three-phase alternating sinusoidal waveforms are considered in electrical circuit theory. The respective waveforms are evenly separated from each other when the waveforms are separated from each other by 2p/3(rad) in phase.
  • the individual car's temporal phase value adjustment amount calculating block (103C in Fig. 2 ) calculates adjustment amounts to make the temporal phase values distributed evenly. Based on the thus calculated adjustment amounts, the adjusted route preparation block (103D in Fig. 2 ) adjusts the temporal phase values of the predicted routes of the respective cars. The routes obtained as a result of this adjustment become the target routes of the respective cars.
  • Figs. 11A and 11B illustrate an operation image of the target route preparation process executed by the target route preparation section shown in Fig. 2 .
  • the graph (target route profiles before adjusted) of Fig. 11A corresponds to the current predicted routes of the respective cars based on which target routes are prepared as described with Fig. 2 .
  • the elevator group supervisory control system is assumed to control three cars In Fig.
  • the first car (C010), second car (C020) and third car (C030) are now on the present time axis (C050) and descending from the eighth floor, third floor and fourth floor, respectively.
  • the predicted routes (predicted trajectories) of these three cars beyond the present time are respectively drawn by a solid line (C011) for the first car, a chain line (C021) for the second car and a broken line (C031) for the third car.
  • the predicted route preparation method will be described as part of the description of the predicted route preparation section. As shown, since these trajectories are close to each other, the cars are to some extent in a string-of-cars condition. Referring back to the control configuration of the target route preparation section in Fig.
  • the current temporal phase value calculating block calculates the temporal phase values of the predicted routes (C011, C021 and C031) of the respective cars by regarding these routes as waveforms of a kind. These temporal phase values are calculated at points where the predicted routes of the respective cars intersect the adjustment reference time axis (C040) in the graph of Fig. 11A . Then, based on these temporal phase values, adjustment amounts to make the respective predicted routes distributed evenly are calculated in the individual car's temporal phase value adjustment amount calculating block (103C in Fig. 2 ). In Fig.
  • the point C01A reflects the adjustment amount for the first car.
  • the predicted route (C011 in Fig. 11A ) of the first car is adjusted by the subsequent process so as to go through this point (C01A).
  • the predicted route (C021 in Fig. 11A ) of the second car and the predicted route (C031 in Fig. 11A ) of the third car are respectively adjusted by the subsequent process so as to go through the point C02A and point C03A.
  • This process is executed by the adjusted route preparation block 103D in Fig. 2 to prepare new target routes by adjusting the predicted routes based on the adjustment amounts.
  • Fig. 11B shows the new target routes prepared based on the predicted routes shown in Fig. 11A .
  • the target routes of the three cars (C010, C020 and C030 in Fig. 11B ) are respectively drawn by a solid line (C011N) for the firs car (C010), a chain line (C021N) for the second car (C020) and a broken line (C031N) for the third car (C030).
  • the trajectories of the target routes are characterized in that they are drawn so as to guide the cars into the temporally equal interval condition as shown in Fig. 11B .
  • the target routes of the three cars are in a temporally equal interval condition.
  • the trajectories of the respective cars are drawn so as to guide the cars into the temporally equal interval condition.
  • Figs. 12 and 13 represent the basic concept of how to prepare target routes unique to the present invention. Firstly, a description is made of what is shown in Fig. 12.
  • Fig. 12 is provided to describe the concept of the adjustment area-based target route preparation method.
  • the horizontal axis represents the time while the vertical axis represents the position of a given floor in the building.
  • the graph is divided by the adjustment reference time axis (D04) into two areas. Of them, the left area is the adjustment area.
  • the adjustment area is sandwiched between the time axis (D03) representing the present time and the adjustment reference time axis (D04).
  • Fig. 12 is provided to describe the concept of the adjustment area-based target route preparation method.
  • the horizontal axis represents the time while the vertical axis represents the position of a given floor in the building.
  • the graph is divided by the adjustment reference time axis (D04) into two areas. Of them, the left area is the adjustment area.
  • the adjustment area is sandwiched between the
  • this area is used as a transient state area, that is, an area for transition to an ideal temporally equal interval state.
  • the subsequent area (D02) beyond the adjustment reference time axis is a steady state area, that is, an area where the cars are to settle in the ideal temporally equal interval state.
  • a transient state is generated in the adjustment area so as to guide the cars into the ideal state in the steady state area (D02).
  • Fig. 13 depicts the concept of using the adjustment area to control the target routes. This figure shows the processes that prepare target routes by using the adjustment area. As already described briefly with Fig. 2 , target routes are prepared by four processes: 1) drawing the current predicted routes (ST701 in Fig.
  • target routes are prepared by the four basic processes shown in Fig. 13 according to the basic concept described with Fig. 12 .
  • the current temporal phase value calculating block (103B in Fig. 2 ) comprises an initial route preparation part (103B1), an adjustment reference time axis setting part (103B2), an adjustment reference time axis-based individual car's temporal phase value calculating part (103B3) and a temporal phase value sorting part (103B4).
  • the initial route preparation part (103B1) the current predicted routes of the respective cars are prepared as the initial routes. These initial routes correspond to the pre-adjustment target route profiles shown in Fig. 11A .
  • an adjustment reference time axis is set.
  • the temporal phase values of the respective cars are calculated on the adjustment reference time axis.
  • the horizontal axis of the graph represents the temporal phase value while the vertical axis represents the position of a given floor in the building.
  • the graph shown in Fig. 15 indicates a predicted route of an elevator car on the assumption that this predicted route is given by a periodic function with a period of T. For example, the predicted route (C011 in Fig.
  • the predicted route (C011 in Fig. 11A ) of the first car in Fig. 11A corresponds to this route.
  • the predicted route (C011 in Fig. 11A ) of the first car in Fig. 11A is given by a periodic function.
  • the graph of Fig. 15 shows one period of this predicted route given by a periodic function. Starting at the lowest floor, this one-period has a car-ascending segment (G01 in Fig. 15 ) and a car-descending segment (G02 in Fig. 15 ), making one round in the building.
  • the phase is considered as the floor position. Accordingly, when the car is at the lowest floor, the phase is considered 0 or 2p (rad). Likewise, when the car is at the highest floor, the phase is p (rad).
  • the phase is considered positive in polarity when the phase is between 0 and p (the car is ascending) whereas negative when the phase is between p and 2p (the car is descending).
  • Tp time Tp in Fig. 15
  • y_max is used to mean the position of the highest floor.
  • the amount y is represented by the floor axis and means the car's predicted floor position.
  • the temporal phase value tp of a predicted route point (G03 in Fig. 15 ) whose position is y can be calculated according to equation (1) (T ⁇ /y_max) x y.
  • Temporal phase value tp is characterized in that the amount of phase of any route point can be evaluated uniquely since dimensional conversion is made from phase to time. Thus, by using temporal phase values, it is possible to easily evaluate the degree of temporal equality of intervals among the predicted routes of the respective cars.
  • Figs. 14A and 14B show how a target route is prepared. To facilitate understanding, only one car (2nd car) is picked up in this figure.
  • the predicted route (C021 in Fig. 14A ) is shown as a pre-adjustment target route profile. This predicted route is prepared in the initial route preparation part (103B1 in Fig. 2 ).
  • the adjustment reference time axis (C040) in Fig. 14A is set in the adjustment reference time axis setting part (103B2 in Fig. 2 ).
  • the temporal phase value tp of the predicted route of the second car on this adjustment reference time axis (C040 in Fig. 14A ), or the temporal phase value tp of a point (C060 in Fig. 14A ) where the predicted route of the second car intersects the adjustment reference time axis is calculated by the adjustment reference time axis-based individual car's temporal phase value calculating part (103B3 in Fig. 2 ).
  • the temporal phase value tp can be calculated from the car's predicted position y according to equation (1).
  • the period T can be obtained from the following data: the number of stories of the building, width per story, car's rated speed and current traffic-dependent average stop frequency and stoppage time.
  • the turnaround temporal phase Tp can also be obtained from the above-mentioned data.
  • the highest floor's position y_max is a fixed value dependent on the building.
  • these temporal phase values of the respective cars are sorted into the increasing order of phase by the temporal phase value sorting part (103B4 in Fig. 2 ).
  • this order is denoted as increasing phase order.
  • the temporal phase value tp of each car is defined during one period of the waveform. In Fig. 15 , the more the waveform is advanced, the larger its temporal phase value becomes. On the other hand, adjustment is made so that 0 ⁇ tp(k) ⁇ T is met by tp. For example, consider the pre-adjustment target route profiles (or predicted routes) of three cars in Fig. 11A .
  • the third car has the smallest temporal phase value, followed by the second car and then the first car in increasing phase order.
  • This order is determined in the temporal phase value sorting part (103B4 in Fig. 2 ) by using a sorting algorithm (for example, selection sort, bubble sort or the like).
  • a sorting algorithm for example, selection sort, bubble sort or the like.
  • the third car comes first, followed by the second car and the first car in increasing phase order according to the temporal phase values of the predicted routes (C011, C021 and C031 in Fig. 11A ) of the respective cars on the adjustment reference time axis (C040 in Fig. 11A ).
  • T common to the three cars
  • the respective car-to-car intervals are calculated in increasing phase order.
  • the respective car-to-car intervals can be evaluated quantitatively using the temporal phase values. That is, it is found from the result that the second and third cars are very close to each other. Since one period is T, the target car-to-car interval to run the cars in a temporally equal interval condition is given by T/N if N cars are collectively controlled. In the case of Fig.
  • the difference between this target interval and the current car-to-car interval should be eliminated by adjustment.
  • the positive sign means to increase the interval (widen the current interval toward the target)
  • the negative sign means to decrease the interval (narrow the current interval toward the target).
  • correction values for the temporal phase values of the respective cars are calculated. This is possible by using the following algorithm. For example, assume that three cars, car A, car B and car C in increasing phase order, are collectively controlled (for generalization, here, each car is given an alphabetic name). Therefore, 0 ⁇ tp(A) ⁇ tp(B) ⁇ tp(C) ⁇ T is met.
  • ⁇ tp(k) k means car k.
  • equation (3) the adjusted temporal phase value is given by tp(B) + ⁇ tp(B) where the current temporal phase value is given by tp(B). Accordingly, equation (3) indicates that the difference between the adjusted temporal phase value of car B and the adjusted temporal phase value of car A, or the interval between them, must be T/3. Since the above three equations are not independent of each other, only these three equations can not be solved for ⁇ tp(A), ⁇ tp(B) and ⁇ tp(C). Therefore, another condition is added. This condition is that the center of gravity of the distributed cars must not change after they are adjusted. This condition is expressed in terms of the temporal phase value of each car by the following equation.
  • Equation (6) can be simplified to equation (7) below.
  • ⁇ ⁇ t ⁇ p A + ⁇ ⁇ t ⁇ p B + ⁇ ⁇ t ⁇ p C 0
  • Solving equations (3), (4), (5) and (7) for ⁇ tp(A), ⁇ tp(B) and ⁇ tp(C) results in the following equations.
  • Fig. 14A shows the pre-adjustment target route (corresponding to the predicted route) of the second car alone.
  • a grid is defined as a turnaround point of a route of concern within the adjustment area.
  • three turnaround points C022, C023 and C024 of the pre-adjustment target route (C021) are grids (restricted to these three turnaround points within the adjustment area).
  • the temporal phase of the route of concern can be adjusted by changing the horizontal positions of these grids.
  • the grid adjustment values are determined one by one for the grids in temporal order starting from the grid nearest to the present time.
  • the grid adjustment values must amount in total to the adjustment value determined for the car.
  • Each grid is given the largest adjustment value which does not exceed a limiter value set to the grid by the grid limiter value setting part (103D2 in Fig. 2 ). Taking the case of Fig. 14A , the following describes this method.
  • i means the number of the grid.
  • the grids in temporal order from the present time forward, are given increasing numbers.
  • the target route data calculating part (103D4 in Fig. 2 ) updates the target route data by calculating new target data.
  • a route drawn by a thick line is the adjusted target route prepared based on the pre-adjustment target route (corresponding to a predicted route) shown in Fig. 14A .
  • the pre-adjustment target route is drawn by a thin chain line (C021) whereas the adjusted target route is drawn by a thick chain line (C021N).
  • An adjusted grid position is calculated in the adjusted grid position calculating part (103D3 in Fig. 2 ).
  • the grid C022 is shifted to C022N.
  • the grids C023 and C024 are shifted respectively to C023N and C024N.
  • the resultant target routes (C011N, C021N and C031N) are in temporally equal interval state after the adjustment reference time axis (C040 in Fig. 11B ).
  • the respective routes (C011N, C021N, C031N) go through their post-adjustment target points (C01A, C02A and C03A in Fig. 11B ).
  • the target routes adjusted by the grids in the adjustment area play a transient role to guide the cars into a temporally equal interval condition beyond the adjustment reference time axis.
  • the target route preparation process it is judged whether the target routes are to be updated (ST201). This step is executed by the target route update judgment block (103A) in Fig. 2 . If it is decided to perform no update as the result of the update judgment, control exits the process. If it is decided to perform update, control goes to the subsequent step.
  • the update judgment method will be described later in detail with reference to Fig. 24 . If it is decided to update the target routes, a car number loop (ST202) is executed to apply loop processing to each car. In the loop processing, a current temporal phase value calculating step is executed (ST203).
  • This step is executed by the current temporal phase value calculating block (103B) described earlier with Fig. 2 .
  • control exits the car number loop (ST204).
  • a temporal phase adjustment value is calculated for each car (ST205).
  • This processing is already described in detail.
  • an adjusted route preparation step is performed for each car (ST207) by executing the car loop again (ST206).
  • This adjusted route preparation step is executed by the adjusted route preparation block (103D) in Fig. 2 .
  • This processing is already described in detail as well.
  • control exits the car number loop (ST208) to terminate the target route preparation process.
  • target routes may be updated by three methods: 1) periodically updating the target routes at certain intervals; 2) detecting the distance between the target route and predicted route of each car (hereinafter, called the inter-route distance) and, if the inter-route distance exceeds a certain value, updating the target routes; and 3) a combination of methods 1) and 2).
  • Fig. 24 corresponds to method 3).
  • Either method 1) or method 2) may be executed by partly using method 3).
  • a watch or timer is examined to check if the predetermined update period has passed (ST601 in Fig. 20 ).
  • the target route update processing is performed (ST606). This processing corresponds to the processing done by the components downstream of the target route update judgment block (103A in Fig. 2 ), or the processing which is done (by the ST202 and subsequent steps in Fig. 20 ) if the result of the update judgment (ST201) is YES. If the update period has not passed, loop processing is done through a car number loop (ST602 in Fig. 24 ) to calculate the distance (inter-route distance) between the target route and predicted route of each car and judges whether this distance is not smaller than a predefined threshold (ST603). The distance (inter-route distance) between the target route and the predicted route is an index to indicate how the target route is distant from the predicted route.
  • a predetermined threshold is used to judge whether the target route is so deviated from the predicted route as to require correction. If the inter-route distance of any one car is beyond the threshold (ST603), the target route update processing is performed (ST606). The inter-route distance of each car is checked (ST606). If the inter-route distance of any car is smaller than the threshold, the current target routes are used without updating them (ST605). Two different policies may be adopted in updating the target routes. One is to keep the target routes always appropriate by correcting them as necessary ('flexible target routes'). The other is not to change the target routes as long as possible once determined ('rigid target routes'). Since either has both merits and demerits, it is reasonable to appropriately set the two control parameters, namely, the update period and inter-route distance threshold described with Figs. 18A and 18B .
  • the foregoing has provided a description of the target route preparation method, the core of the target route-based elevator group supervisory control of the present invention.
  • the following provides a description of how to prepare predicted routes which are consulted in guiding the actual trajectories of the cars to the target routes.
  • Fig. 19 is a flowchart showing the general control processing flows of an elevator group supervisory control system in accordance with the present invention.
  • Fig. 19 there are two predicted route preparation processes: Predicted Route Preparation Step A (ST104 in Fig. 19 ) and Predicted Route Preparation Step B (ST107 in Fig. 19 ).
  • the predicted route preparation step A prepares predicted routes without assuming assignment to any hall call. In other words, only the current condition is reflected in the preparation of predicted routes.
  • Such a predicted route is used to judge its distance from the target route and as a pre-adjustment target route or the prototype (initial profile before adjustment) of a target route to be prepared.
  • the other predicted route preparation step B prepares a predicted route of each car on the provisional assumption that the car is assigned. Such predicted routes are used to evaluate provisional assignments, for example, when a new hall call occurs.
  • an estimated each floor arrival time calculating block 104B1 calculates the estimated times of arrival at the respective floors by using: average stop frequency data and stoppage time data dependent on the current traffic condition; data on the hall calls assigned to the respective cars (hall call-generated floors, etc.); data on the car calls occurring in the respective cars (car call-generated floors, etc.); car condition data (current position, direction, speed, etc.); each car's specification data (rated speed, etc.); available car count/name data; and service floor data (data on the floors to be served by the respective cars).
  • an average stop frequency means the number of times the car stops at a given floor on the average during one round trip in the building.
  • the estimated times of arrival at the respective floors are calculated - first floor (up): 0 sec, second floor (up): 2 sec, third floor (up): 14 sec, fourth floor (up): 18.5 sec, fifth floor (turnaround): 30.5 sec, fourth floor (down): 35 sec, third floor (down): 39.5 sec, second floor (down): 44 sec and 0.25, first floor (turnaround): 48.5 sec.
  • these estimated times of arrival at the respective floors indicate the predicted positions of the car at given future times. Accordingly, in a coordinate system where the horizontal axis represents the time while the vertical axis represents the floor position, a predicted route can be prepared by connecting the points each of which is plotted according to the estimated time of arrival at the floor position.
  • (t(sec), y(floor)) points (0, 1), (2, 2), (14.3, 3), (18.5, 4), (30.5, 5), (35, 4), (39.5, 3), (44.2, 2) and (48.5, 1) can be plotted in a coordinate system with a horizontal time axis (t axis) and a vertical floor position axis (y axis).
  • a predicted route can be prepared by connecting these points.
  • stoppage times are omitted in this example, it is also possible to include stoppage times in drawing the predicted route. If stoppage times are included by adding stop end points, the predicted route is prepared more accurately. Referring back to Fig.
  • a predicted route data calculating block (104B2) prepares predicted route data through the above-described procedure based on the estimated times of arrival at the respective floors calculated by the estimated each floor arrival time calculating block (104B1).
  • the estimated times of arrival at the respective floors are plotted in a coordinate system where the horizontal axis represents the time while the vertical axis represents the floor position.
  • a predicted route is prepared by connecting the plotted points.
  • This predicted route can be regarded as a function plotted in a coordinate system where the horizontal axis represents the time while the vertical axis represents the floor position.
  • the following describes the flows of processing done by the predicted route preparation step A to prepare predicted routes with reference to Fig. 21 .
  • ST301 it is judged whether predicted routes are to be updated. Since updating the predicted routs every time imposes a great load on the processor consisting of a microcomputer or the like, this step intends to update the predicted routes at such long intervals (for example, 0.5 sec) as not to cause a substantial load. If it is decided to perform no update as the result of the update judgment, control exits the process. If it is decided to perform update, control goes to the subsequent step.
  • an estimated each floor arrival time calculating step (ST303) and an estimated arrival time-based predicted route data calculating step (S304) are executed for each car. These steps are executed respectively by the estimated each floor arrival time calculating block (104B1) and predicted route data calculating block (104B2) in Fig. 6 . These steps were already described in detail.
  • Fig. 5 shows the components of the predicted route preparation section which implement the predicted route preparation step B (ST107 in Fig. 19 to prepare assignment-considered predicted routes).
  • the predicted route preparation step B is identical to the predicted route preparation step A of Fig. 6 except that each car is provisionally assigned and this provisional assignment is reflected in the preparation of its predicted route.
  • estimated times of arrival at the respective floors are calculated (by an estimated each floor arrival time calculating block 104A1) from the provisional assignment information (provisionally assigned car (ka-th car) and hall call-generated floor and direction) in addition to the input information required for the preparation of an ordinary predicted route (information described with Fig. 6 ).
  • predicted route data is calculated (by a predicted route data calculating block).
  • Each predicted route obtained in this manner by reflecting a provisional assignment can be expressed as a function R (t, ka) in a time-floor position coordinate system.
  • R (t, ka) in a time-floor position coordinate system.
  • Estimated times of arrival at the respective floors are firstly calculated by the estimated each floor arrival time calculating block (104A3) and, based on the result, predicted route data is prepared by the predicted route data calculating block (104A4).
  • Each predicted route obtained can be expressed as a function R(t, k)(1 ⁇ k ⁇ N, k ⁇ ka).
  • Fig. 22 shows a flowchart of the predicted route preparation processing which corresponds to the above-described predicted route preparation step B.
  • provisional assignment (hall call-generated floor, direction, etc.) information concerning a provisionally assigned ka-th car is obtained (ST401).
  • Estimated times of arrival at the respective floors are calculated based on the information (ST402) and predicted route data is calculated based on the estimated times of arrival at the respective floors (ST403).
  • a car number loop is executed (ST404) to calculate the estimated times of arrival at the respective floors for each car excluding the provisionally assigned ka-th car (ST405).
  • predicted route data is calculated (ST406).
  • This process is terminated after executed for all cars excluding the ka-th car (ST406).
  • ST406 It is possible to prepare the predicted route of the provisionally assigned ka-th car and the predicted route of each k-th car not assigned provisionally (1 ⁇ k ⁇ N, i ⁇ ka).
  • the foregoing has provided a description of how predicted routes are prepared.
  • the following describes the inter-route distance, an index of nearness between a target route and a predicted route, and the route evaluation function which is used as an index in determining which car to assign.
  • "assignment evaluation function" to quantitatively evaluate each assignment to a call is defined as a function of the predicted waiting time.
  • the control method of the present invention is greatly characterized in that "assignment evaluation function" is defined as a function of the quantity (inter-route distance) representing the target route-to-predicted route nearness instead of the predicted waiting time.
  • Figs. 18A and 18B the following firstly describes the inter-route distance, an index to represent the nearness between a target route and a predicted route.
  • Route distance calculation methods are shown in Figs. 18A and 18B .
  • a target route R*(t, k) (where, t: time and k: car number of the car) is drawn as a trajectory F011 and a predicted route R(t, k) is as a trajectory F012. From Fig.
  • the area sandwiched by the target route and predicted route is considered the most appropriate index to indicate their nearness. Hence, the area decreases as the two routes come closer to each other. When the two routes agree with each other, the area is zero. Accordingly, the area sandwiched between the function R*(t, k) representing the target route and the function R(t, k) representing the predicted route is defined as the inter-route distance.
  • the area can be obtained by integration. The integration may be done along either the time axis or the floor height axis. In Fig. 18A , the integration is done along the time axis. This integration is given by ⁇ R ⁇ t k ⁇ R t k ⁇ d ⁇ t
  • the area in the time range from the present time to the adjustment reference time axis that is, the area in the adjustment area is obtained. Accordingly, the area to be calculated is shown in Fig. 18A as vertical line-filled regions sandwiched between the target route R*(t, k) (F011) and the predicted route R(t, k) (F012).
  • L[R*(t, k), R(t, k)] is here used to denote the inter-route distance between the target route and the predicted route.
  • L[R*(t, k), R(t, k)] is given by the following equation.
  • the following provides a detailed description of the route distance index-based route evaluation function calculating section (105 in Fig. 1 ) which calculates the value of the assignment evaluation function to evaluate each provisional assignment by using inter-route distances.
  • This processing corresponds to the route evaluation function calculating step (ST108 in Fig. 19 ) where for each provisionally assigned car, the inter-route distances between the target route and predicted route of the provisionally assigned car and between those of each non-assigned car are calculated and, based on the result, the route evaluation function is calculated.
  • this route evaluation function calculating process is described below in detail. In Fig. 7 , it is assumed that the ka-th car is provisionally assigned.
  • the inter-route distance L[R*(t, ka), R(t, ka)] is firstly calculated by an inter-route distance calculating block 105A. Stopping of the car due to the provisional assignment is reflected in the predicted route data R(t, ka).
  • the calculated inter-route distance L[R*(t, ka), R(t, ka)] is converted to an absolute value
  • an inter-route distance calculating block 105C calculates the inter-route distance L[R*(t, k), R(t, k)] from the k-th car's target route data R*(t, k) and predicted route data R(t, k).
  • the inter-route distance L[R*(t, k), R(t, k)] is converted to an absolute value
  • the result obtained by the absolute value calculating block 105F and the result obtained by the sum calculating block 105E are added by an addition calculating 105B to calculate the route evaluation function ⁇ R(ka) to evaluate the provisional assignment of the ka-th car.
  • 1 ⁇ k ⁇ N , k ⁇ k ⁇ a , N total number of elevator cars
  • Fig. 23 shows a flowchart of the route evaluating function calculating process described with Fig. 7 . Its flows are briefly described below. Firstly, information about the provisionally assigned ka-th car (provisionally assigned hall call-generated floor, direction, etc.) is obtained (ST501). The inter-route distance L[R*(t, ka), R(t, ka)] of the provisionally assigned ka-th car is calculated based on the information and converted to an absolute value (ST502). Then, a car number loop is executed for each car excluding the provisionally assigned ka-th car (ST503).
  • L[R*(t, ka), R(t, ka)] of the provisionally assigned ka-th car is calculated based on the information and converted to an absolute value (ST502). Then, a car number loop is executed for each car excluding the provisionally assigned ka-th car (ST503).
  • the inter-route distance L[R*(t, k), R(t, k)] of the k-th car is calculated and converted to an absolute value (ST504). Further, this value of each car is added up (ST505) by repeating the car number loop until the processing is done for all cars (ST506).
  • the route evaluation function ⁇ R(ka) given by equation (19) is calculated by adding the absolute value
  • a route specification selecting block 102A based on the current traffic data and time data, selects the most appropriate route specification from a route specification database 102B. As the route specification to be implemented, this specification is output to the target route preparation section (103 in Fig. 1 ).
  • route specification database 102B several route specification patterns (hereinafter, denoted as route modes) are stored to cope with different traffic conditions in the building.
  • temporally equal interval route mode 102B1 may include a temporally equal interval route mode 102B1 as described already, clock-in time-addressed route mode 102B2, lunch start time-addressed route mode 102B3, lunch end time-addressed route mode 102B4, special traffic A-addressed route mode 102B5, and special traffic B-addressed route mode 102B6.
  • the temporally equal interval route mode 102B1 is the most basic mode and its specification intends to put the routes of the respective cars in a temporally equal interval state. Normally, this temporally equal interval route mode is selected.
  • the clock-in time-addressed route mode 102B2 prescribes a specification to cope with the up-peak type of traffic which occurs at the beginning of office hours.
  • the lunch start time-addressed route mode 102B3 prescribes a target specification to cope with the down-peak type of traffic which occurs during the first half of the lunch hour while the lunch end time-addressed route mode 102B4 is for the last half of the lunch hour which shows both up-peak and down-peak types of traffic.
  • the special traffic A-addressed route mode 102B5 and special traffic B-addressed route mode 102B6 prescribe target specifications to cope with special types of traffic unique to the building.
  • Fig. 10A illustrates the target route-used control concept of the present invention on an operation diagram.
  • Fig. 10B illustrates the conventional control concept on an operation diagram.
  • the target route-used control in Fig. 10A since routes which should be taken by the respective cars in the future are determined as target routes, it is possible to control the respective cars by considering their future movements based on the target routes.
  • the respective cars can be kept stably in temporally equal interval state, reducing the possibility of long waits (longer than, for example, 1 min) occurring in the future.
  • evaluation of a car assignment to a newly generated call is basically made based only on the waiting time for which the call is predicted to wait as shown in Fig. 10B .
  • the future situation of the cars is not taken into consideration in this evaluation. Therefore, since the future trajectories of the respective cars cannot be controlled, this method is likely to cause a string-of-cars condition, increasing the possibility of long waits occurring.
  • a predicted route is applied in the target route preparation method of Fig. 2 .
  • this predicted route is prepared by using data which reflect the current traffic situation, namely, average stop frequency data on an each floor/direction basis and average stoppage time data (in addition to data on hall calls already assigned and data on a generated hall call). Therefore, the current traffic situation is reflected in the profile of the predicted route. For example, at the beginning of office hours, since the car stops almost only while the car is ascending (i.e.
  • the profile of the predicted route has a gentle uphill slope ( ⁇ y/ ⁇ t is a positive small value) and a steep downhill slope ( ⁇ y/ ⁇ t is a negative large value). Since a target route is prepared by adjusting the grids of this predicted route in the adjustment area, the profile of the target route reflects the traffic situation at that time. For example, at the beginning of office hours, the profile of the target route has a gentle uphill slope and a steep downhill slope, reflecting the traffic situation at the beginning of office hours as well.
  • the target route preparation method shown in Fig. 2 can prepare appropriate target routes by reflecting the current traffic situation.
  • the method for preparing target routes as reference routes has a great influence on the control performance.
  • the target route preparation method of Fig. 2 capable of accurately reflecting the traffic situation, is considered very effective.
  • FIG. 16A shows the profile of a pre-adjustment target route (an initial route to prepare a target route). Like in the first embodiment, a predicted route at that time is used as the pre-adjustment target route.
  • Fig. 16B shows the profile of the target route that is adjusted.
  • each target route is drawn from the current position of the car.
  • each target route is not drawn from the current position of the car. This difference is attributable to their different policies about target routes.
  • the target routes provide transient routes that the cars should take from the current positions in order to settle in temporally equal interval state.
  • the target routes provide routes that the cars should reach. In plain language, the target routes in Fig.
  • first route are 'kind' target routes which guide the cars from the current positions into temporally equal interval state.
  • the target routes in Fig. 16B (second embodiment) do not have such a guiding part. Only the final target routes are shown to indicate "anyway follow these routes".
  • Figs. 17A and 17B show a target route and the subsequent actual trajectory of the car.
  • the subsequent actual trajectory of the car indicates that the car is not assigned many times, namely, not stopped many times.
  • the car is assigned many times and therefore stopped many times.
  • the deviation of the actual trajectory from the target route is smaller in Fig. 17B .
  • assignment control according to the present invention selects such a car as to make the deviation (inter-route distance) of its predicted route from the target route. Therefore, control should be done so as to assign many calls to this car (2nd car assumed) in Fig. 17B . Consequently, the actual routes follow the target routes. That is, the cars can be controlled so as to follow such target routes as prepared in the second embodiment.
  • a target route update judgment block 103A, current temporal phase value calculating block 103B and individual car's temporal phase value adjustment amount calculating block 103C in Fig. 3 are identical in processing to those in Fig. 2 (first embodiment).
  • An adjusted route preparation block 103E is unique.
  • target points on the adjustment reference time axis are calculated by an each car's target point calculating part 103E1; 2) target route grids are calculated by a target point-based grid position calculating part 103E2; 3) grids are connected by a target route data calculating part 103E3 to calculate target route data.
  • the following provides a detailed description of how this adjusted route preparation block 103E operates. Firstly, a target point on the adjustment reference axis is calculated in the each car's target point calculating part 103E1 for each car by using the temporal phase adjustment value ⁇ tp(k) (k means the k-th car) calculated by the individual car's temporal phase value adjustment amount calculating block 103C.
  • the adjusted temporal phase value tp_N(k) plotted on the adjustment reference axis (along the floor position axis) becomes the target point of the car.
  • Symbol y_N(k) the target point position of a car, can be given by the following equation (see Fig. 15 ).
  • y_N k y_ max / T ⁇ ⁇ ⁇ tp_N k
  • the target points of the respective cars are points E012 (first car), E022 (second car) and E032 (third car). Based on these target points, the pre-adjustment target routes (or predicted routes) E011, E021 and E031 of the respective cars are translated so that they go through their respective target points, thus calculating the adjusted target routes (routes in Fig. 16B ). This translating calculation is done by the target point-based grid position calculating part 103E2 in Fig. 3 .
  • gp_N k i g ⁇ p k i + tp_N k
  • Equation (23) means to translate all grids of the k-th car by adjustment amount tp_N(k).
  • target route data is calculated by connecting these adjusted grids according to their temporal positions gp_N(k, i). Consequently, the pre-adjustment target routes (E011, E021 and E031 in Fig. 16A ) are converted to adjusted target routes (E011, E021 and E031 in Fig. 16B which come at temporally equal intervals. It can be verified in Fig. 16B that the adjusted target routes go through their respective target points E012, E022 and E032 on the adjustment reference axis (E040 in Fig. 16B ) as intended.
  • the target points themselves do not directly relate to the adjusted target route calculating process. Accordingly, the adjusted target routes (E011, E021 and E031 in Fig. 16B ) can be obtained even if the each car's target point calculating part 103E1 is removed from the adjusted route preparation block 103E.
  • the target points themselves are used for operation check, etc.
  • the target route profiles are completely in temporally equal interval state in the adjustment area between the present time axis (E050) and the adjustment reference time axis (E040), they are simplified on the assumption that there is no hall/car call which is already assigned. If hall/car calls are already assigned, the target routes are not always in temporally equal interval state in the adjustment area since the stop calls are not evenly distributed among the cars.
  • control by the aforementioned embodiments intends to put the respective cars in temporally equal interval condition
  • the present invention is not limited to the control for temporally equal interval condition. According to the present invention, it is possible to run elevators according to a specific purpose only by determining the target routes in consistence with the purpose. If the target routes of the respective elevators are determined by taking, for example, energy saving into consideration, it is possible to realize energy-saved elevator group supervisory control.

Landscapes

  • Engineering & Computer Science (AREA)
  • Automation & Control Theory (AREA)
  • Elevator Control (AREA)
EP05017313A 2005-03-23 2005-08-09 Elevator group supervisory control system Active EP1705146B1 (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP2005082906A JP4139819B2 (ja) 2005-03-23 2005-03-23 エレベータの群管理システム

Publications (2)

Publication Number Publication Date
EP1705146A1 EP1705146A1 (en) 2006-09-27
EP1705146B1 true EP1705146B1 (en) 2012-11-28

Family

ID=36572381

Family Applications (1)

Application Number Title Priority Date Filing Date
EP05017313A Active EP1705146B1 (en) 2005-03-23 2005-08-09 Elevator group supervisory control system

Country Status (6)

Country Link
US (3) US7426982B2 (zh)
EP (1) EP1705146B1 (zh)
JP (1) JP4139819B2 (zh)
CN (4) CN101428720B (zh)
HK (3) HK1131599A1 (zh)
SG (2) SG126017A1 (zh)

Families Citing this family (22)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP4139819B2 (ja) * 2005-03-23 2008-08-27 株式会社日立製作所 エレベータの群管理システム
JP4567553B2 (ja) * 2005-08-31 2010-10-20 株式会社日立製作所 エレベータの群管理システム及びその制御方法
JP4997008B2 (ja) * 2007-07-20 2012-08-08 株式会社日立製作所 エレベータの群管理システム
WO2009024853A1 (en) 2007-08-21 2009-02-26 De Groot Pieter J Intelligent destination elevator control system
JP5347492B2 (ja) * 2008-12-25 2013-11-20 フジテック株式会社 エレベータの群管理制御方法及び装置
JP2012250787A (ja) * 2011-05-31 2012-12-20 Hitachi Ltd エレベータ制御装置
JP5894842B2 (ja) * 2012-04-11 2016-03-30 株式会社日立製作所 エレベータシステム
JP5965823B2 (ja) * 2012-11-12 2016-08-10 株式会社日立製作所 エレベータ群管理システム
JP5977655B2 (ja) * 2012-11-30 2016-08-24 株式会社日立製作所 エレベータの群管理システム
JP6156032B2 (ja) * 2013-09-30 2017-07-05 フジテック株式会社 エレベータの群管理システム
US9491092B1 (en) * 2014-09-30 2016-11-08 Juniper Networks, Inc. Apparatus, system, and method for preventing unintentional forwarding reconfiguration in network environments
JP6730216B2 (ja) 2017-03-23 2020-07-29 株式会社日立製作所 エレベータ管理システム、及び、エレベータの管理方法
US10358318B2 (en) * 2017-04-10 2019-07-23 International Business Machines Corporation Predictive analytics to determine elevator path and staging
CN111225865A (zh) * 2017-10-30 2020-06-02 株式会社日立制作所 电梯运行管理系统以及电梯运行管理方法
JP2019156607A (ja) * 2018-03-15 2019-09-19 株式会社日立製作所 エレベーターシステム
US11584614B2 (en) 2018-06-15 2023-02-21 Otis Elevator Company Elevator sensor system floor mapping
US11383954B2 (en) 2018-06-26 2022-07-12 Otis Elevator Company Super group architecture with advanced building wide dispatching logic
US11345566B2 (en) * 2018-07-30 2022-05-31 Otis Elevator Company Elevator car route selector
CN111232772B (zh) * 2018-11-29 2023-06-06 奥的斯电梯公司 控制电梯的运行的方法、系统、计算机可读存储介质
CN109665386A (zh) * 2019-01-21 2019-04-23 郑州云海信息技术有限公司 一种基于大数据的电梯调度方法及调度系统
CN111239696A (zh) * 2020-01-15 2020-06-05 深圳大学 目标轨迹动态显示方法、装置、设备及存储介质
CN115924663B (zh) * 2023-03-09 2023-05-12 常熟理工学院 基于物联网的智能电梯设备控制方法

Family Cites Families (30)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CA1032072A (en) 1974-07-29 1978-05-30 Russell B. Strout Severing of plastic film at softening temperatures
JP2607597B2 (ja) * 1988-03-02 1997-05-07 株式会社日立製作所 エレベータの群管理制御方法
JPH0712891B2 (ja) * 1988-02-17 1995-02-15 三菱電機株式会社 エレベータの群管理装置
JPH0211008A (ja) 1988-06-29 1990-01-16 Matsushita Electric Ind Co Ltd 圧電共振子
JPH0772059B2 (ja) 1988-10-19 1995-08-02 三菱電機株式会社 エレベータの群管理装置
JPH0725491B2 (ja) * 1989-04-06 1995-03-22 三菱電機株式会社 エレベータの群管理装置
US5083640A (en) * 1989-06-26 1992-01-28 Mitsubishi Denki Kabushiki Kaisha Method and apparatus for effecting group management of elevators
JPH05238653A (ja) * 1992-02-27 1993-09-17 Hitachi Ltd 群管理エレベータ装置
JPH0761722A (ja) 1993-08-27 1995-03-07 Hitachi Ltd エレベーターの群管理制御装置
JPH07117941A (ja) * 1993-10-26 1995-05-09 Hitachi Ltd エレベータの群管理制御装置
ATE182856T1 (de) * 1994-01-12 1999-08-15 Inventio Ag Intelligent verteilte steuerung für aufzüge
JPH08175769A (ja) 1994-12-28 1996-07-09 Otis Elevator Co 群管理エレベーター
MY154394A (en) * 1995-10-24 2015-06-15 Toshiba Kk Elevator group management control apparatus and elevator group management control method
CN1089718C (zh) * 1997-04-07 2002-08-28 三菱电机株式会社 电梯的群管理控制装置
DE69731634T2 (de) * 1997-04-07 2005-12-01 Mitsubishi Denki K.K. Gruppensteuerung für aufzug
FI107379B (fi) * 1997-12-23 2001-07-31 Kone Corp Geneettinen menetelmä hissiryhmän ulkokutsujen allokoimiseksi
JP2000118890A (ja) * 1998-10-09 2000-04-25 Toshiba Corp エレベータ群管理制御装置
JP2000302343A (ja) * 1999-04-13 2000-10-31 Otis Elevator Co エレベータシステムの制御方法
JP2001048431A (ja) * 1999-08-06 2001-02-20 Mitsubishi Electric Corp エレベータ装置およびかご割当て制御方法
BR0108953A (pt) * 2000-03-03 2002-12-17 Kone Corp Processo e aparelho para alocar passageiros em um grupo de elevadores
JP4762397B2 (ja) * 2000-03-30 2011-08-31 三菱電機株式会社 エレベータの群管理制御装置
FI112065B (fi) * 2001-02-23 2003-10-31 Kone Corp Hissiryhmän ohjausmenetelmä
FI112064B (fi) * 2001-02-23 2003-10-31 Kone Corp Hissiryhmän ohjausmenetelmä
FI115421B (fi) * 2001-02-23 2005-04-29 Kone Corp Menetelmä monitavoiteongelman ratkaisemiseksi
US6644442B1 (en) * 2001-03-05 2003-11-11 Kone Corporation Method for immediate allocation of landing calls
US6672431B2 (en) * 2002-06-03 2004-01-06 Mitsubishi Electric Research Laboratories, Inc. Method and system for controlling an elevator system
US7014015B2 (en) * 2003-06-24 2006-03-21 Mitsubishi Electric Research Laboratories, Inc. Method and system for scheduling cars in elevator systems considering existing and future passengers
FI115130B (fi) * 2003-11-03 2005-03-15 Kone Corp Menetelmä ja laite hissiryhmän ohjaamiseksi
JP4139819B2 (ja) * 2005-03-23 2008-08-27 株式会社日立製作所 エレベータの群管理システム
JP4657794B2 (ja) * 2005-05-06 2011-03-23 株式会社日立製作所 エレベータの群管理システム

Also Published As

Publication number Publication date
CN1837004B (zh) 2010-05-05
CN101439820A (zh) 2009-05-27
US20080289911A1 (en) 2008-11-27
US20060213728A1 (en) 2006-09-28
SG126934A1 (en) 2006-11-29
CN101439820B (zh) 2013-04-24
CN101700844B (zh) 2012-09-19
CN1837004A (zh) 2006-09-27
CN101428720A (zh) 2009-05-13
CN101428720B (zh) 2013-01-02
CN101700844A (zh) 2010-05-05
US7426982B2 (en) 2008-09-23
JP4139819B2 (ja) 2008-08-27
EP1705146A1 (en) 2006-09-27
HK1132245A1 (en) 2010-02-19
JP2006264832A (ja) 2006-10-05
HK1131599A1 (en) 2010-01-29
US20090283368A1 (en) 2009-11-19
US7730999B2 (en) 2010-06-08
SG126017A1 (en) 2006-10-30
US7740111B2 (en) 2010-06-22
HK1143125A1 (en) 2010-12-24

Similar Documents

Publication Publication Date Title
EP1705146B1 (en) Elevator group supervisory control system
EP1719727B1 (en) System and display for an elevator group supervisory and method for supervising a plurality of elevators
CN110589642B (zh) 电梯的群管理控制系统
JP3042904B2 (ja) エレベータ配送システム
KR101674693B1 (ko) 엘리베이터의 군 관리 제어 방법 및 장치
US8006807B2 (en) Elevator group control apparatus
KR940009984B1 (ko) 엘리베이터 제어장치
EP2500308A1 (en) Double-deck elevator group control device
EP1760025A1 (en) Elevator group control system and control method thereof
JP2014234296A (ja) エレベーターシステムの群管理制御方法
US20070131484A1 (en) Elevator group management controller
JP2000501059A (ja) シングルソーストラフィックのエレベータ配送を制御するためのファジー論理を使ったロビーの通行量と通行率の予想
JP4434231B2 (ja) エレベータの群管理システム
CN112141831B (zh) 电梯的群管理系统
EP0623545B1 (en) Measurement and reduction of bunching in elevator dispatching with multiple term objection function
JPH0610069B2 (ja) エレベータの群管理装置
JP4879887B2 (ja) エレベータシステムの制御パラメータ設定装置
JP2000302343A (ja) エレベータシステムの制御方法
JP4997008B2 (ja) エレベータの群管理システム
JP4839296B2 (ja) エレベータの群管理システム
JP2007261819A (ja) エレベータの群管理システム
Thangavelu Artificial intelligence based learning system predicting ‘peak-period’times for elevator dispatching

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20060331

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL BA HR MK YU

AKX Designation fees paid

Designated state(s): DE FR

17Q First examination report despatched

Effective date: 20070604

R17C First examination report despatched (corrected)

Effective date: 20080103

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

GRAC Information related to communication of intention to grant a patent modified

Free format text: ORIGINAL CODE: EPIDOSCIGR1

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): DE FR

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602005037154

Country of ref document: DE

Effective date: 20130124

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed

Effective date: 20130829

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602005037154

Country of ref document: DE

Effective date: 20130829

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20140808

Year of fee payment: 10

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

Effective date: 20160429

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20150831

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20230627

Year of fee payment: 19