公开(公告)号：US4531616A

公开(公告)日：1985-07-30

申请号：US545194

申请日：1983-10-25

Applicant: Kenichi Uetani ,  Yasukazu Umeda

Inventor： Kenichi Uetani ,  Yasukazu Umeda

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

CPC classification number: B66B1/2458 ,  B66B2201/102 ,  B66B2201/211 ,  B66B2201/222 ,  B66B2201/235

Abstract: An elevator control system includes one elevator control for each elevator car, one group supervisory device for each floor connected in two ways to the elevator controls, a group supervisory accessory connected to group supervisory devices, and a statistical device connected to the group supervisory devices and also to the group supervisory accessory. The group supervisory accessory calculates a car suspending time interval at each of the forward floors in a direction of travel of the elevator car in accordance with a percentage getting-off or -on from the statistical device by considering car and floor calls and the number of passengers within the elevator car increased due to non-responding floor calls and also a presumed arrival time interval at each floor. The group supervisory devices receive those presumed arrival time intervals to assign the optimum elevator car to the desired floor call through an associated one of the elevator controls.

Abstract translation: 电梯控制系统包括对于每个电梯轿厢的一个电梯控制，用于每个楼层的一组监控装置以两种方式连接到电梯控制装置，连接到组监控装置的组监控附件和连接到组监控装置的统计装置，以及 也是集团督察配件。 集体管理附件通过考虑汽车和楼层呼叫以及从统计设备通过考虑汽车和楼层呼叫来计算在电梯轿厢的行进方向上的每个前方楼层上的轿厢暂停时间间隔， 电梯轿厢内的乘客由于不响应的楼层通话而增加，并且在每层楼还有推定的到达时间间隔。 组管理装置接收这些推定的到达时间间隔，以通过相关联的一个电梯控制器将最佳电梯轿厢分配给期望的楼层通话。

公开(公告)号：US4355705A

公开(公告)日：1982-10-26

申请号：US210007

申请日：1980-11-24

Applicant: Joris Schroder ,  Hans Bosshard ,  Jiri Kiml ,  Miroslav Kostka ,  Walter Zimmermann

Inventor： Joris Schroder ,  Hans Bosshard ,  Jiri Kiml ,  Miroslav Kostka ,  Walter Zimmermann

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

CPC classification number: B66B1/2458 ,  B66B2201/102 ,  B66B2201/211 ,  B66B2201/214 ,  B66B2201/222 ,  B66B2201/235

Abstract: With this group control the allocation of elevator cabins or cars to existing storey or floor calls should be timewise optimized and newly arriving storey calls should be immediately allocated. A computer device provided for each elevator computates at each landing or storey, irrespective of whether or not there is present a storey or landing call, from the distance between the storey and the cabin position indicated by a selector, the intermediate cabin stops to be expected within this distance and the momentary cabin load a sum proportional to the time losses of waiting passengers. In this way the cabin load prevailing at the computation time point is corrected such that the expected number of passengers entering and exiting the cabin, derived from the previously ascertained number of entering and exiting passengers is taken into account for the future intermediate cabin stops. Such loss time sum, also referred to as the servicing cost, is stored in a cost storage or memory provided for each elevator. During a cost comparison cycle the servicing costs of all elevators are compared with one another by means of a comparator, and in an allocation storage of the elevator with the lowest servicing cost there can be stored an allocation instruction which designates that storey or floor to which there can be optimumly allocated the relevant elevator cabin.

Abstract translation: 通过该组控制，电梯小屋或汽车对现有楼层或楼层通话的分配应当及时优化，并且应立即分配新到达的楼层通话。 为每个电梯提供的计算机装置在每个着陆层或层架上计算，无论是否存在层叠或着陆呼叫，从层间和由选择器指示的舱位置之间的距离，中间舱停止预期 在这段距离内，瞬间的客舱负载与等候乘客的时间损失成正比的总和。 以这种方式，校正在计算时间点处的舱室负载，使得从以前确定的进入和离开乘客数量得出的进入和离开客舱的乘客的预期数量被考虑在未来的中间客舱停靠点。 这种损失时间总和（也称为维修费用）被存储在为每个电梯提供的成本存储器或存储器中。 在成本比较周期中，通过比较器将所有电梯的维修成本相互比较，并且在具有最低维修成本的电梯的分配存储中可以存储一个分配指令，其指定哪个层或层 可以最佳地分配相关的电梯舱。

公开(公告)号：US4030571A

公开(公告)日：1977-06-21

申请号：US569401

申请日：1975-04-18

Applicant: Takashi Kaneko ,  Takeo Yuminaka ,  Tatsuo Iwasaka ,  Hiroshi Kinoshita

Inventor： Takashi Kaneko ,  Takeo Yuminaka ,  Tatsuo Iwasaka ,  Hiroshi Kinoshita

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

CPC classification number: B66B1/2458 ,  B66B2201/102 ,  B66B2201/211 ,  B66B2201/222 ,  B66B2201/235

Abstract: An elevator control system for controlling a plurality of elevator cars arranged for parallel operation for servicing a plurality of service floor landings of a building, in which means are provided so that, in response to origination of a new hall call in addition to hall calls originated and allotted already, a suitable car for servicing this new hall call can be selected and the new hall call can be allotted to the selected car to be serviced by the selected car. In the system, the change in the service condition of all the cars for the already allotted hall calls due to allotment of this new hall call thereto is taken into account in selecting the suitable car. For example, means are provided for computing for each car the forecast waiting time at each of the already allotted floors to be serviced thereby to detect the change in the forecast waiting time when this new hall call originating floor is serviced. The new hall call is allotted to the car which provides a forecast waiting time less than a predetermined limit, and this car services this specific floor.

Abstract translation: 一种用于控制多个电梯轿厢的电梯控制系统，用于并行操作，用于维修建筑物的多个服务楼层着陆，其中提供了这样的装置，使得除了门厅呼叫之外还响应于新的门厅呼叫的发起 并已经分配，​​可以选择一个适合用于维修这个新的门厅呼叫的汽车，并且可以将新的门厅呼叫分配给所选择的轿厢以由所选择的轿厢服务。 在该系统中，在选择合适的轿厢时考虑到由于分配了这个新的门厅呼叫而已经分配的门厅呼叫的所有轿厢的服务状况的变化。 例如，提供了用于为每个轿厢计算待维护的每个已经分配的楼层上的预测等待时间的装置，从而检测当该新的门厅呼叫始发层被维护时的预测等待时间的变化。 新的大厅呼叫被分配给汽车，其提供小于预定极限的预测等待时间，并且该车服务于该特定楼层。

公开(公告)号：US11753273B2

公开(公告)日：2023-09-12

申请号：US15964827

申请日：2018-04-27

Applicant: Kone Corporation

Inventor： Sergey Kitov

IPC: B66B1/24 ,  G06N3/08 ,  G06N3/044 ,  G06N3/086 ,  G06N5/046

CPC classification number: B66B1/2408 ,  G06N3/044 ,  G06N3/08 ,  G06N3/086 ,  G06N5/046 ,  B66B2201/231 ,  B66B2201/235 ,  B66B2201/402

Abstract: A method for determining an allocation decision for at least one elevator includes using an existing calls in an elevator system as a first input in a machine learning module, processing the first input with the machine learning module to provide a first output comprising a first allocation decision, using the first output as a second input in an iterative module, processing the second input with the iterative module to provide a second ouput comprising a second allocation decision, and providing the second allocation decision to an elevator control module and to an allocation decision storage for further machine learning module training.

公开(公告)号：US20180290859A1

公开(公告)日：2018-10-11

申请号：US15905878

申请日：2018-02-27

Applicant: International Business Machines Corporation

Inventor： Emmanuel Barajas Gonzalez ,  Shaun E. Harrington ,  Harry R. McGregor ,  Christopher B. Moore

IPC: B66B1/24 ,  B66B1/34 ,  B66B1/28 ,  G06N5/04

CPC classification number: B66B1/2408 ,  B66B1/28 ,  B66B1/3476 ,  B66B2201/235 ,  B66B2201/243 ,  B66B2201/402 ,  B66B2201/4676 ,  G06N5/04

Abstract: In an approach for determining an optimal path for an elevator, a processor receives information, wherein the information includes social media data associated with a user and calendar entries associated with the user, indicating one or more locations within a building. A processor analyzes the received information. A processor determines a location to send an elevator within the building to minimize movement of the elevator, based on the analyzed information. A processor causes the elevator to move to the location.

公开(公告)号：US10035679B2

公开(公告)日：2018-07-31

申请号：US14381052

申请日：2012-02-27

Applicant: Jason R. Armistead ,  Theresa M. Christy

Inventor： Jason R. Armistead ,  Theresa M. Christy

IPC: B66B1/18 ,  B66B1/24 ,  B66B1/46 ,  G06Q10/10

CPC classification number: B66B1/2408 ,  B66B1/46 ,  B66B2201/235 ,  B66B2201/402 ,  B66B2201/4661 ,  G06Q10/1093

Abstract: An elevator control system including an elevator management system obtaining meeting information from at least one of a calendar system and a user interface; the elevator management system generating a control command in response to the meeting information; and an elevator controller controlling destinations of one or more elevator cars in response to the control command.

公开(公告)号：US20180093853A1

公开(公告)日：2018-04-05

申请号：US15819719

申请日：2017-11-21

Applicant: KONE Corporation

Inventor： Juha-Matti Kuusinen ,  Marja-Liisa Siikonen

IPC: B66B1/34 ,  B66B1/24

CPC classification number: B66B1/3407 ,  B66B1/2408 ,  B66B2201/235 ,  B66B2201/402

Abstract: A method for the call allocation in an elevator group uses a call allocation unit of an elevator group control. In the call allocation unit, passenger flow data of the elevator group is used to adapt call allocation parameters to improve the performance of the elevator group. The public traffic data is retrieved from at least one public transportation system, and is used to supplement expected passenger flow data for the adaption of call allocation parameters.

公开(公告)号：US20120090922A1

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

申请号：US13293616

申请日：2011-11-10

Applicant: Niko Elomaa ,  Jukka-Pekka Sarjanen ,  Tuomas Susi

Inventor： Niko Elomaa ,  Jukka-Pekka Sarjanen ,  Tuomas Susi

IPC: G05B15/00

CPC classification number: B66B1/2458 ,  B66B2201/102 ,  B66B2201/103 ,  B66B2201/211 ,  B66B2201/215 ,  B66B2201/222 ,  B66B2201/235 ,  B66B2201/402 ,  B66B2201/403

Abstract: The present invention discloses a method for controlling an elevator system. In the method, hints relating to potential elevator passengers are received from at least one observation point connected to the elevator system. Based on the hints, forecasts relating to potential elevator passengers are prepared, on the basis of which forecasts one or more anticipatory control actions are executed.

Abstract translation: 本发明公开了一种电梯系统的控制方法。 在该方法中，从连接到电梯系统的至少一个观察点接收与潜在的电梯乘客相关的提示。 根据提示，准备与潜在电梯乘客有关的预测，根据该预测预测一个或多个预期控制措施。

公开(公告)号：US07032716B2

公开(公告)日：2006-04-25

申请号：US11118127

申请日：2005-04-28

Applicant: Peter Meyle ,  Stefan Schneider ,  Gerhard Thumm

Inventor： Peter Meyle ,  Stefan Schneider ,  Gerhard Thumm

IPC: B66B1/20 ,  B66B9/00

CPC classification number: B66B1/2466 ,  B66B1/2458 ,  B66B11/0095 ,  B66B2201/103 ,  B66B2201/215 ,  B66B2201/224 ,  B66B2201/235 ,  B66B2201/301 ,  B66B2201/401 ,  B66B2201/4615 ,  B66B2201/463

Abstract: The invention relates to a method for controlling an elevator installation with at least one shaft and a number of cars, it being possible to make at least two cars travel separately up and down along a common traveling path and a passenger being able to enter a destination call by means of an input unit disposed outside the shaft and the destination call being allocated to a car in dependence on an allocation assessment. To develop the method in such a way that the transporting capacity can be increased, with the cars which can be made to travel along a common traveling path hindering one another as little as possible, it is proposed according to the invention that, in the case of allocation of the destination call to one of the cars which can be made to travel along the common traveling path, the portion of the traveling path required for serving the destination call is assigned to this car and blocked for the time of the assignment for the other cars. Furthermore, an elevator installation for carrying out the method is proposed.

Abstract translation: 本发明涉及一种用于利用至少一个轴和多个轿厢来控制电梯安装的方法，可以使至少两辆汽车沿共同的行进路径上下移动，乘客能够进入目的地 通过设置在轴外部的输入单元呼叫，并且根据分配评估将目的地呼叫分配给汽车。 为了开发该方法，使得能够提高输送能力，可以使可沿着彼此相互阻碍的公共行进路径行驶的轿厢尽可能少地相互阻碍，根据本发明提出，在这种情况下 将目的地呼叫分配给可以沿着公共行进路径行驶的其中一个轿厢，将服务于目的地呼叫所需的行驶路径的部分分配给该轿厢，并且为了分配的时间被阻止 其他车。 此外，提出了一种用于实施该方法的电梯装置。

公开(公告)号：US20040262089A1

公开(公告)日：2004-12-30

申请号：US10602849

申请日：2003-06-24

Inventor： Daniel N. Nikovski ,  Matthew E. Brand

IPC: B66B001/36

CPC classification number: B66B1/2458 ,  B66B2201/102 ,  B66B2201/211 ,  B66B2201/235 ,  B66B2201/243 ,  B66B2201/403

Abstract: A method schedules cars of an elevator system in a building. The method begins execution whenever a newly arrived passenger presses an up or down button to generate a call for service. For each car, determine a first waiting time for all existing passengers if the car is assigned to service the call, based on future states of the elevator system. For each car, determine a second waiting time of future passengers if the car is assigned to service the call, based on a landing pattern of the cars. For each car, combine the first and second waiting times to produce an adjusted waiting time, The method ends by assigning a particular car having a lowest adjusted waiting time to service the call and minimize an average waiting time of all passengers.