公开(公告)号：US20090050417A1

公开(公告)日：2009-02-26

申请号：US12194121

申请日：2008-08-19

Applicant: Pieter J. de Groot

Inventor： Pieter J. de Groot

IPC: B66B1/18

CPC classification number: B66B1/2458 ,  B66B2201/103 ,  B66B2201/211 ,  B66B2201/212 ,  B66B2201/213 ,  B66B2201/214 ,  B66B2201/222 ,  B66B2201/225 ,  B66B2201/232 ,  B66B2201/402 ,  B66B2201/403

Abstract: An intelligent destination elevator control system streamlines the efficiency and control of destination elevators. The system monitors a building's population and predicts elevator traffic conditions. The system may monitor attributes of the destination elevators. Based on the monitored data, the system may generate a data structure that renders time-tables and target elevator service quality parameters that may control the destination elevators. A time-table and target elevator service quality parameters may be selected to control destination elevators according to one or more customer selectable mode of operation parameters. The data structure may be processed to control UP and/or DOWN transportation capacities of the destination elevators while satisfying the one or more customer selectable mode of operation parameters.Some intelligent destination elevator control systems may control when elevator cars of a group service the floors of a building. Control of the elevator cars may be flexible to allow the system to increase or decrease traffic capacities of the elevator cars in accordance with anticipated traffic conditions.

Abstract translation: 智能目的地电梯控制系统简化目的地电梯的效率和控制。 系统监测建筑物的人口并预测电梯交通状况。 系统可以监视目的地电梯的属性。 基于所监视的数据，系统可以生成一个数据结构，该数据结构为控制目的地电梯提供时间表和目标电梯服务质量参数。 可以根据一个或多个客户可选择的操作参数模式来选择时间表和目标电梯服务质量参数来控制目的地电梯。 可以处理数据结构以控制目的地电梯的UP和/或DOWN运输能力，同时满足一个或多个客户可选择的操作参数模式。 一些智能目的地电梯控制系统可以控制一组的电梯轿厢服务于建筑物的楼层。 电梯轿厢的控制可以是灵活的，以允许系统根据预期的交通状况增加或减少电梯轿厢的交通容量。

公开(公告)号：US06655501B2

公开(公告)日：2003-12-02

申请号：US10161227

申请日：2002-06-03

Applicant: Miroslav Kostka

Inventor： Miroslav Kostka

IPC: B66B118

CPC classification number: B66B1/2458 ,  B66B2201/103 ,  B66B2201/214 ,  B66B2201/303 ,  B66B2201/305

Abstract: A method for the selection of the most favorable elevator of a elevator installation having at least two elevator groups, wherein a route with changeovers is available for reaching a destination floor from a start floor, the route being broken down into several stretches. An elevator of one of the elevator groups is allocated to each of the stretches solving the multi-route problem in a destination call multi-group control with journeys involving changeovers.

公开(公告)号：US20030000776A1

公开(公告)日：2003-01-02

申请号：US10161227

申请日：2002-06-03

Inventor： Miroslav Kostka

IPC: B66B001/18

CPC classification number: B66B1/2458 ,  B66B2201/103 ,  B66B2201/214 ,  B66B2201/303 ,  B66B2201/305

Abstract: A method for the selection of the most favorable elevator of a elevator installation having at least two elevator groups, wherein a route with changeovers is available for reaching a destination floor from a start floor, the route being broken down into several stretches. An elevator of one of the elevator groups is allocated to each of the stretches solving the multi-route problem in a destination call multi-group control with journeys involving changeovers.

Abstract translation: 一种用于选择具有至少两个电梯组的电梯设备最有利的电梯的方法，其中具有转换的路线可用于从起始楼层到达目的地楼层，该路线被分解成若干段。 将电梯组中的一个的电梯分配给解决多路径问题的每一段，在目的地呼叫多组控制中涉及转换的行程。

公开(公告)号：US20020088672A1

公开(公告)日：2002-07-11

申请号：US10006099

申请日：2001-12-04

Inventor： Kazuhito Hattori ,  Hideyuki Honma

IPC: B66B001/18

CPC classification number: B66B1/2458 ,  B66B2201/102 ,  B66B2201/211 ,  B66B2201/214 ,  B66B2201/304 ,  B66B2201/306 ,  Y10S187/902

Abstract: The present invention improves the performance of the group control of elevators by shortening the waiting time for connections to the top floor in a system composed of a plurality double deck elevators having upper decks (1aU)null(1eU) and lower decks (1aL)null(1eL), respectively.

Abstract translation: 本发明通过缩短由具有上甲板（1aU）〜（1U）〜（1L）〜（1L）〜（1L）〜（1））的多台双层电梯构成的系统中，缩短连接到顶层的等待时间，从而提高了电梯群控制的性能。 （1eL）。

公开(公告)号：US06315082B2

公开(公告)日：2001-11-13

申请号：US09809210

申请日：2001-03-16

Applicant: Shiro Hikita

Inventor： Shiro Hikita

IPC: B66B116

CPC classification number: B66B1/2458 ,  B66B2201/103 ,  B66B2201/211 ,  B66B2201/214 ,  B66B2201/222 ,  B66B2201/243 ,  B66B2201/301 ,  B66B2201/403

Abstract: A rule base storing control rule sets simulates the behavior of each car of an elevator system in real time by assigning scanning to each car which is caused to run until the direction of running is reversed, while applying a specified rule set in the rule base to the current traffic condition, and predicts group supervisory control performance upon application of the specified rule set. In response to the results of performance prediction, an optimal rule set is selected and a real time simulation can be carried out during a group supervisory control operation, so that group supervisory control can be performed on multiple elevator cars while applying the optimal rule set at all times, thus providing excellent service.

Abstract translation: 存储控制规则集的规则库通过向运行中的每个轿厢分配扫描，直到运行方向反转，同时在规则库中应用规定的规则集，来实时地模拟电梯系统的每个轿厢的行为 当前交通状况，并在应用指定的规则集时预测组监控性能。 响应于性能预测的结果，选择最佳规则集，并且可以在群组监督操作期间进行实时仿真，从而可以对多台电梯轿厢进行群组监控，同时将最优规则集应用于 一次次，从而提供优质的服务。

公开(公告)号：US20010010278A1

公开(公告)日：2001-08-02

申请号：US09809210

申请日：2001-03-16

Inventor： Shiro Hikita

IPC: B66B001/18

CPC classification number: B66B1/2458 ,  B66B2201/103 ,  B66B2201/211 ,  B66B2201/214 ,  B66B2201/222 ,  B66B2201/243 ,  B66B2201/301 ,  B66B2201/403

Abstract: The present invention prepares a rule base storing a plurality of control rule sets, simulates the behavior of each car in real time by assigning scanning to each car which is caused to run until the direction of running thereof is reversed while applying a specified rule set in the rule base to the current traffic condition, and predicts group supervisory control performance which is obtained upon application of the specified rule set. In response to the results of performance prediction, an optimal rule set is selected and a real time simulation can be carried out during a group supervisory control operation, so that group supervisory control can be performed on a plurality of elevators while applying thereto the optimal rule set at all times, thus providing excellent service.

Abstract translation: 本发明准备存储多个控制规则集的规则库，通过向每个轿厢分配扫描来实时地模拟每个轿厢的行为，直到其运行方向反转，同时将规定的规则集合 根据当前交通状况的规则库，并预测在应用指定的规则集时获得的组监督控制性能。 响应于性能预测的结果，选择最佳规则集，并且可以在组监控操作期间执行实时仿真，使得可以在多台电梯上执行组管理控制，同时向其施加最优规则 随时设置，从而提供优质的服务。

公开(公告)号：US5306878A

公开(公告)日：1994-04-26

申请号：US591887

申请日：1990-10-02

Applicant: Susumu Kubo

Inventor： Susumu Kubo

IPC: B66B1/18 ,  B66B1/20 ,  B66B1/24

CPC classification number: B66B1/2458 ,  B66B2201/102 ,  B66B2201/211 ,  B66B2201/214 ,  B66B2201/215 ,  B66B2201/222 ,  B66B2201/401 ,  B66B2201/403

Abstract: A method and an apparatus for elevator group control, capable of performing the elevator car allocation control with the evaluation characteristics and the control parameters which are most appropriate for a unique situation of each building. In the apparatus, a hall call allocation control to determine a most appropriate one of the elevator cars to respond to a hall call produced at one of the destination floor, is performed by carrying out evaluations in accordance with a given traffic demand of the elevator system; and the control parameters to be utilized in carrying out the evaluations, are determined in accordance with a response resulting from the hall call allocation control and the given traffic demand.

Abstract translation: 一种用于电梯组控制的方法和装置，其能够执行具有最适合于每个建筑物的独特情况的评估特性和控制参数的电梯轿厢分配控制。 在该装置中，通过根据电梯系统的给定交通需求进行评估来执行门厅呼叫分配控制，用于确定电梯车厢中最适当的一个以响应在目的地楼层之一处产生的门厅呼叫 ; 并且根据由门厅呼叫分配控制和给定交通需求产生的响应来确定用于执行评估的控制参数。

公开(公告)号：US5305198A

公开(公告)日：1994-04-19

申请号：US659022

申请日：1991-02-20

Applicant: Joris Schroder ,  Paul Friedli

Inventor： Joris Schroder ,  Paul Friedli

IPC: B66B1/18 ,  B66B1/00 ,  B66B1/20 ,  B66B1/24 ,  G05B13/00

CPC classification number: B66B1/2458 ,  G06Q10/06375 ,  B66B2201/103 ,  B66B2201/211 ,  B66B2201/214 ,  B66B2201/222 ,  B66B2201/235 ,  B66B2201/403

Abstract: A method of controlling a group of elevators allocates target calls definitively and immediately to the individual elevators for serving the call according to higher rank and lower rank function requirements and these allocations are indicated immediately at the call input floors. A weighted sum corresponding to higher rank function requirements is formed from partial operating costs, this sum is modified into operating costs in the sense of lower rank function requirements by means of variable bonus and penalty point factors and a target call is allocated to the elevator with the lowest operating costs. A target call allocation algorithm with subordinate algorithms for the bonus and penalty point tracking and the costs computation implements this method in a computer. The bonus and penalty point factors are continuously made to follow the traffic volume or the car load group by group or elevator by elevator with the tracking algorithm. The computation of the operating costs takes place in the costs computation algorithm according to a special costs formula, wherein the readjusted bonus and penalty point factors act multiplicatively on a six term partial costs sum.

Abstract translation: 控制一组电梯的方法根据较高等级和较低等级的功能要求，明确地立即将目标呼叫分配给用于服务呼叫的各个电梯，并且这些分配在呼叫输入层立即被指示。 由部分运营成本构成对应于较高等级函数要求的加权总和，通过可变奖金和惩罚点因素将该总和修改为低等级函数要求的运营成本，并将目标呼叫分配给电梯 运营成本最低。 具有用于奖金和罚点追踪的下属算法和成本计算的目标呼叫分配算法在计算机中实现该方法。 奖励积分和罚点积分因素不断使跟踪算法按照电梯跟踪交通量或乘用车乘坐群组或电梯。 运营成本的计算根据特殊成本公式在成本计算算法中进行，其中重新调整的奖金和罚点值因素对六项部分成本总和进行乘法运算。

公开(公告)号：US5248860A

公开(公告)日：1993-09-28

申请号：US879530

申请日：1992-05-04

Applicant: David J. Sirag, Jr.

Inventor： David J. Sirag, Jr.

IPC: B66B1/20 ,  B66B1/24 ,  B66B1/34

CPC classification number: B66B1/2408 ,  B66B1/2458 ,  B66B1/3484 ,  B66B2201/102 ,  B66B2201/211 ,  B66B2201/214 ,  B66B2201/222 ,  B66B2201/401 ,  B66B2201/403 ,  Y10S706/90

Abstract: The utility of assigning each car of an elevator system to service a hall call is determined by estimating the performance of each elevator car using a plurality of performance criteria. The performance criteria are then scaled by values indicative of the customer preferences for elevator system performance in order to form a plurality of scaled performance fuzzy sets. An assignment utility fuzzy set is formed from terms of the scaled performance fuzzy sets. The utility of assigning each car to service a particular hall call is then set equal to the maximum value of the degrees of membership of all of the terms of the scaled performance fuzzy sets. Alternatively, the utility of assigning each car to service a particular hall call can be set equal to the minimum value of the degrees of membership of all of the terms of the scaled performance fuzzy sets.

Abstract translation: 通过使用多个性能标准估计每个电梯轿厢的性能来确定分配电梯系统的每个轿厢来维修门厅呼叫的效用。 然后，通过表示电梯系统性能的客户偏好的值来缩放性能标准，以便形成多个缩放的性能模糊集合。 分配效用模糊集由缩放的性能模糊集合的术语形成。 然后，将每个轿厢分配给服务于特定门厅呼叫的效用被设置为等于缩放的性能模糊集合的所有项的隶属度的最大值。 或者，将每个轿厢分配给服务于特定门厅呼叫的效用可以被设置为等于缩放的演出模糊集合的所有项的隶属度的最小值。

公开(公告)号：US5183981A

公开(公告)日：1993-02-02

申请号：US487344

申请日：1990-03-02

Applicant: Kandasamy Thangavelu

Inventor： Kandasamy Thangavelu

IPC: B66B1/20 ,  B66B1/24 ,  B66B3/00

CPC classification number: B66B1/2458 ,  B66B1/2408 ,  B66B2201/102 ,  B66B2201/211 ,  B66B2201/214 ,  B66B2201/222 ,  B66B2201/302 ,  B66B2201/402 ,  B66B2201/403

Abstract: The present invention is directed to the grouping of contiguous floors in a building into sectors. According to the present invention, historical information regarding the number of passengers arriving at each floor is obtained and used to predict the number of passengers to be arriving at each of the floors. By summing the predicted traffic per floor and dividing by the number of sectors to be formed, average traffic per sector can be determined. In the preferred embodiment, sectors are formed, starting from the first floor above the lobby and continuing through to the top floor in the building, by selecting a set of contiguous floors for each sector such that the predicted traffic for each sector is less than a predetermined threshold. Specifically, if the predicted traffic for a selectable next contiguous floor, added to the predicted traffic for all contiguous floors already selected for the sector, is less than the predetermined threshold, the selectable floor is included in the sector. Otherwise, another sector is begun with the selectable floor as the bottom floor in the other sector. In the preferred embodiment, the predetermined threshold is based on the determined average traffic per sector. In another aspect of the present invention, the frequency of service of elevator cars to each sector is variable. The traffic volume for each formed sector is determined and compared with the determined average traffic per sector. The frequency of service of elevator cars to each sector is variable, based on this comparison. Thus, sectors having a larger traffic volume are serviced more often, relative to sectors having a smaller traffic volume.

Abstract translation: 本发明涉及将建筑物中的连续楼层分组为扇区。 根据本发明，获得关于到达每层的乘客人数的历史信息，并用于预测到达每个楼层的乘客人数。 通过将每层预测的流量相加除以待形成的扇区数，可以确定每扇区的平均流量。 在优选实施例中，通过为每个扇区选择一组连续的楼层，从大厅上方的第一层开始并且继续通往建筑物的顶层，形成扇区，使得每个扇区的预测业务量小于 预定阈值。 具体地，如果为已经为该扇区选择的所有连续楼层的预测业务量增加了可选择的下一个连续楼层的预测业务量，则小于预定阈值，则该可选楼层被包括在扇区中。 否则，开始另一个扇区，其中可选择的楼层作为另一扇区的底层。 在优选实施例中，预定阈值基于所确定的每个扇区的平均业务量。 在本发明的另一方面，电梯轿厢对每个扇区的服务频率是可变的。 确定每个成型部门的流量，并与确定的每个扇区的平均流量进行比较。 基于此比较，电梯轿厢对各部门的服务频率是可变的。 因此，相对于具有较小业务量的扇区，更频繁地服务具有较大业务量的扇区。