-
公开(公告)号：US4878562A
公开(公告)日：1989-11-07
申请号：US259874
申请日：1988-10-19
Applicant: Joris Schroder
Inventor： Joris Schroder
CPC classification number: B66B1/2458 , B66B2201/103 , B66B2201/211 , B66B2201/222
Abstract: A group control for an elevator system in which a call firmly assigned to a car, but not serviceable at a stop at the respective floor due to an expected overload, can be serviced subsequently by the same car. For this purpose first and second circuits, assigned to the floors, are provided. A selector scanning the floor and car call memories activates at every position the assigned first and second circuits, where the first circuit causes the car to pass the respective floor if an overload would be generated at a stop. The second circuits assigned to the upward and downward directions are linked to each other in such a manner that, on establishment of an overload, the scanning by the selector of the floor and car call memories assigned in each case to the calls of opposite direction is prevented. After passage of the non-serviceable floor and reaching of the point of return of the direction of travel, the car travels without interruption back to the earlier disregarded floor, whereby the blocking of the scanning of the floor and car call memories of the calls in the opposite direction is cancelled.
Abstract translation: 对于电梯系统的组控制，其中可以由相同的轿厢随后对由于预期的过载而稳定地分配给轿厢但是不能在相应楼层的停车处可用的呼叫进行维修。 为此，提供分配给楼层的第一和第二电路。 扫描地板和轿厢通话存储器的选择器在分配的第一和第二电路的每个位置激活，其中如果在停止时将产生过载，则第一电路使轿厢通过相应的楼层。 分配给上下方向的第二电路以这样一种方式彼此连接，即在建立过载时，由每个情况下分配的地板选择器和轿厢呼叫存储器对相反方向的呼叫的扫描是 防止了 在不能使用的地板通过并达到旅行方向的返回点之后，汽车不经中断地行驶回到较早忽视的楼层，从而阻止地面扫描和轿厢呼叫的呼叫记忆 相反的方向被取消。
-
公开(公告)号：US4765442A
公开(公告)日：1988-08-23
申请号：US109639
申请日：1987-10-16
Applicant: Jeffrey W. Blain , Denis D. Shah , Jean Chen
Inventor： Jeffrey W. Blain , Denis D. Shah , Jean Chen
CPC classification number: B66B1/2433 , B66B1/343 , B66B2201/102 , B66B2201/211
Abstract: An elevator control system and method for efficient failure control with a local area network on the traveling cable and distributed electronic control circuits in the car and proximate to the respective floors with a remote microprocessor controller for each car. A local area network communicates with the corridor fixtures in a serial signal format of input and output signals. Each remote controller includes a microprocessor based computer circuit which communicates over a multicar-link with the other and also over the local area networks for car and hall calls to implement an expanded control strategy with interactive program modes with least restrictive capability. This program interacts with programs for floor control strategy and bank control strategy for the elevator system to select the best car and the most efficient operation, despite failures which would otherwise degrade the bank operation sooner and more restrictively.
Abstract translation: 一种电梯控制系统和方法，用于在行驶电缆上的局域网和用于每辆汽车的远程微处理器控制器在汽车中并且靠近各个楼层的分布式电子控制电路进行有效的故障控制。 局域网以输入和输出信号的串行信号格式与走廊灯具通信。 每个遥控器包括基于微处理器的计算机电路，其通过多卡路由与另一个通信，并且还通过局域网进行汽车和门厅呼叫，以实现具有最小限制能力的交互式节目模式的扩展控制策略。 该程序与用于电梯系统的楼层控制策略和银行控制策略的程序相互作用，以选择最佳轿厢和最有效的操作，尽管否则会使银行业务更早和更严格地降级。
-
公开(公告)号：US4760896A
公开(公告)日：1988-08-02
申请号：US102587
申请日：1987-09-29
Applicant: Toru Yamaguchi
Inventor： Toru Yamaguchi
CPC classification number: B66B1/2458 , B66B2201/102 , B66B2201/211 , B66B2201/214 , B66B2201/233 , B66B2201/235 , B66B2201/403 , Y10S706/90 , Y10S706/91
Abstract: An apparatus for performing a group control on elevators is disclosed, by which a total operation of the elevators for respective floors of building is controlled. This apparatus includes condition-instruction table which contains a plurality of predetermined control rules being defined by given conditions and given instructions. The apparatus also includes an elevator controller for detecting, in accordance with a specific rule selected from the control rules, a degree of establishment of the given conditions to provide a detected condition, and for generating, in accordance with the detected condition, an elevator control instruction used for performing the group control.
Abstract translation: 公开了一种用于对电梯进行组群控制的装置，由此控制建筑物各楼层的电梯的总体操作。 该装置包括条件指令表，其包含由给定条件和给定指令定义的多个预定控制规则。 该装置还包括电梯控制器，用于根据从控制规则中选出的特定规则，检测给定条件的建立程度以提供检测条件，并根据检测到的状况来检测电梯控制 用于执行组控制的指令。
-
公开(公告)号：US4531616A
公开(公告)日：1985-07-30
申请号：US545194
申请日：1983-10-25
Applicant: Kenichi Uetani , Yasukazu Umeda
Inventor： Kenichi Uetani , Yasukazu Umeda
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
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: 通过该组控制，电梯小屋或汽车对现有楼层或楼层通话的分配应当及时优化，并且应立即分配新到达的楼层通话。 为每个电梯提供的计算机装置在每个着陆层或层架上计算，无论是否存在层叠或着陆呼叫，从层间和由选择器指示的舱位置之间的距离，中间舱停止预期 在这段距离内，瞬间的客舱负载与等候乘客的时间损失成正比的总和。 以这种方式，校正在计算时间点处的舱室负载，使得从以前确定的进入和离开乘客数量得出的进入和离开客舱的乘客的预期数量被考虑在未来的中间客舱停靠点。 这种损失时间总和（也称为维修费用）被存储在为每个电梯提供的成本存储器或存储器中。 在成本比较周期中，通过比较器将所有电梯的维修成本相互比较，并且在具有最低维修成本的电梯的分配存储中可以存储一个分配指令，其指定哪个层或层 可以最佳地分配相关的电梯舱。
-
Patent Agency Ranking
公开(公告)号：US4323142A
公开(公告)日：1982-04-06
申请号：US99945
申请日：1979-12-03
Applicant: Joseph Bittar
Inventor： Joseph Bittar
CPC classification number: B66B1/2458 , B66B2201/102 , B66B2201/211 , B66B2201/233 , B66B2201/243 , B66B2201/301 , B66B2201/303 , B66B2201/403 , Y02B50/122
Abstract: An elevator control system employs a microprocessor-based group controller which communicates with the cars of the elevator system to determine the condition of the cars, and responds to hall calls registered at a plurality of landings in the building serviced by the cars under control of the group controller, on a cyclic basis which recurs several times per second, to assign every unanswered hall call to a car deemed best suited for response to that call, in each cycle, based upon the information provided by the car to the group controller within that cycle of operation. In any cycle in which a call is assigned to a car other than a car to which the call had previously been assigned, the assignment of the call to the previous car is nullified. At the end of each cycle, any car which indicates that its committable position coincides with the floor of a hall call which has been assigned to it will receive a stop command. In the assignment of calls to cars, preference is given to any car which previously had a call, although the preference is relative and not absolute. Exemplary elevator apparatus, signal processing apparatus, and logic flow diagrams are disclosed to illustrate the specific manner of assigning calls to cars on a continuously updated basis, and to illustrate the environment in which the invention may be practiced.1. Technical FieldThis invention relates to elevator systems, and more particularly to the response to hall calls by a selected one of a group of elevators serving floor landings of a building in common, on a continuously updated basis.Background ArtAs elevator systems have become more sophisticated, including a large number of elevators operating as a group to service a large number of floors, the need developed for determining the manner in which calls for service in either the up or down direction registered at any of the floor landings of the building are to be answered by the respective elevator cars. The most common form of elevator system group control divides the floors of the building into zones, there being one or several floors in each zone, there being approximately the same number of zones as there are cars in the elevator system which can respond to group-controlled service of floor landing calls. Typical operation of such systems forces a car into any zone which does not have an elevator in it, and causes the car to attempt to respond to all the calls registered within the zone. However, the answering of any calls by the car, and the demands made by the passengers in registering car calls will normally carry the car outside of the zone; also, if the car commences traveling upwardly to answer up calls, it is unavailable to answer down calls. For that reason, systems operating under a zone-controlled mode of operation require a wide variety of additional features. For instance, if the calls in a zone are not answerable by the car in that zone, a car may be borrowed from another zone which has no calls; or, if one zone has no car in it, and no car is available for assignment to it, a zone of lesser importance might lose its car in favor of the zone under consideration. In the zone-controlled systems, it frequently occurs that some calls are not answered at all after an impermissible delay; therefore, such systems frequently have one or two modes of backup operation, ultimately resulting in a non-zone type of a flat command to a car to answer a call which has been registered for an impermissible time.A more recent innovation has been the assignment of calls to cars by scanning all unassigned registered hall calls, comparing the location and direction of each such unassigned call with the present conditions of each of the cars, including the car location and direction of travel and the number of stops which the car will make between its present position and the position of the call, and assigning such call, absolutely, to the car which is estimated, in the first examination of each registered hall call, to be able to reach the floor landing of the hall call the quickest, based upon a scheme of operation which considers only approximate travel time and number of stops, along with car travel direction and car location. Such system, however, has a basic disadvantage that the conditions upon which the call has been made may change radically long before the call is answered by the car to which it has been assigned. For instance, a deliveryman may prop the door of the car open while he unloads packages, thus unduly delaying the car; or, at one of its in-between stops, the car may pick up an excessive number of passengers, who register a large number of hall calls that were not considered during the original assignment. In such case, as in the case of zone-controlled group systems, it is necessary to provide several levels of backup modes of operation. For instance, a first level backup mode may reenter the call for reassignment if it is not answered within a first predetermined time interval. And if that fails, and the call is still unanswered after a second, longer predetermined interval, then an absolute priority assignment of a car to answer that call may be required. Or, assigned calls may be reevaluated with respect to reassignment to other cars; but the comparison is made with respect to a previously determined response time for the first car to which the call was assigned. Such response time does not reflect current conditions appertaining to the previous car.In either of these mode of operation, the facts that the primary mode of operation (zone or call assignment) is upset by anything other than an ideal pattern of traffic flow, necessarily requiring the backup modes, the change of the system from operating in the primary mode to backup mode resulting in further disruption, and further requirement for an additional backup mode, indicate that such systems fail to provide the desired service.The zone type of operation does not take into account conditions within the building at any time. The assignment of calls-to-cars mode which has been known in the prior art assumes that it can anticipate conditions, assign calls on that basis, but is incapable of truly responding to actual conditions of the building insofar as assigning calls to cars is concerned. And, both types of systems are non-dynamic until something goes wrong (undue delay in responding to a call) and then shift into other non-dynamic modes, which still do not take into account the actual, current conditions in the building, but respond in a reactionary sort of a way to a condition which is deemed to be exceptional and unacceptable with respect to the principal mode of operation, thus causing still further disruption.Both of the types of systems described hereinbefore are based upon the relationship between a registered call and a car, be that relationship an estimated time for response or a zone within which each is located. In neither of these cases are the actual current conditions of the system continuously reevaluated with respect to all unanswered hall calls.DISCLOSURE OF INVENTIONOjbects of the present invention include provision of an elevator control system in which all unanswered hall calls are assigned to cars on a current, dynamic basis, which takes into account actual, current conditions of the system.According to the present invention, all unanswered hall calls registered at a plurality of landings in a multi-elevator system are repetitively assigned to cars on a cyclic basis recurring several times per second on the basis of conditions of each car relative to each such unanswered hall call, including the floor landing and direction of the unanswered hall call under consideration and including service to be performed by each car in advance of its ability to service the hall call under consideration, as indicated within each cycle in which such call is assigned to any car; after making the assignment of any hall call in any cycle, the assignment of such hall call made to any car in a cycle next preceding such cycle is removed from such car if the call is assigned to a different car during such cycle; at the end of each cycle, a stop command is issued to any car to which the committable floor position coincides with the landing of a hall call assigned to it.In accordance with other aspects of the present invention, in each cycle of assigning calls to cars based upon conditions of the car relative to the call in question, preference is given to a car to which the call was assigned in a next preceding cycle; the preference may be based upon a weighted factor, when call assignments are made on the basis of weighted factors; if a weighted perference factor is employed in practicing the invention, the weighted preference factor may have a value on the same order of magnitude as it takes for an elevator to service from one to ten call landings, or it may be based on a reasonable time for a call to be unanswerable before desiring reassignment, or it may relate to a delay in servicing said call on the order of some part of a minute.The present invention provides for assignment of calls to cars based upon current information, at a rate of updating which is serveral times faster than the rate at which an elevator car may pass a landing at high speed; the conditions considered in assigning the calls to the cars are current, being updated in every cycle; the assignment of a call to a car is based upon the best assignment possible, in any cycle, which recur several times per second, thereby ensuring that as conditions change, the assignment may also change, if desirable, to provide proper service to the call while at the same maintaining other factors of overall system response. Provision of preference for a call assigned to a car to be reassigned to the same car permits control over race conditions so that cars are not unnecessarily started nor alternatively having a hall call assigned to them, which only one ultimately will answer. The invention provides, for the first time, a total capability for rapidly updating hall call assignments without any of the adverse effects which would otherwise be created.The foregoing and other objects, features and advantages of the present invention will become more apparent in the light of the following detailed description of an exemplary embodiment thereof, as illustrated in the accompanying drawing.
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
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: 一种用于控制多个电梯轿厢的电梯控制系统，用于并行操作，用于维修建筑物的多个服务楼层着陆，其中提供了这样的装置，使得除了门厅呼叫之外还响应于新的门厅呼叫的发起 并已经分配，可以选择一个适合用于维修这个新的门厅呼叫的汽车，并且可以将新的门厅呼叫分配给所选择的轿厢以由所选择的轿厢服务。 在该系统中，在选择合适的轿厢时考虑到由于分配了这个新的门厅呼叫而已经分配的门厅呼叫的所有轿厢的服务状况的变化。 例如，提供了用于为每个轿厢计算待维护的每个已经分配的楼层上的预测等待时间的装置，从而检测当该新的门厅呼叫始发层被维护时的预测等待时间的变化。 新的大厅呼叫被分配给汽车，其提供小于预定极限的预测等待时间，并且该车服务于该特定楼层。
-
公开(公告)号：US20240150152A1
公开(公告)日：2024-05-09
申请号：US18282225
申请日：2021-03-24
Applicant: Mitsubishi Electric Corporation
Inventor： Kazunori SAKO
CPC classification number: B66B1/468 , B66B1/2408 , B66B1/3423 , B66B2201/211 , B66B2201/214 , B66B2201/215 , B66B2201/22 , B66B2201/222 , B66B2201/223
Abstract: A group control device according to the present disclosure includes a registration unit, a calculation unit, and a selection unit. The registration unit makes call registration for a boarding floor, a destination floor, and an allocated car when a user makes a hall destination call by a hall destination calling device. The calculation unit calculates an in-car stay time of the user for the hall destination call. The selection unit selects a past hall destination call as an alternative candidate for call registration for a new hall destination call, in a case where the past hall destination call which has already been registered by the registration unit, whose allocated car is different from a car allocated to the new hall destination call, and whose in-car stay time is shorter than the in-car stay time calculated by the calculation unit.
-
公开(公告)号：US20180251335A1
公开(公告)日：2018-09-06
申请号：US15448644
申请日：2017-03-03
Inventor： Daniel Nikolaev Nikovski , Arvind U. Raghunathan , Srikumar Ramalingam
IPC: B66B1/24
CPC classification number: B66B1/2458 , B66B1/2433 , B66B2201/00 , B66B2201/211 , B66B2201/34
Abstract: Systems and Methods for controlling a movement of cars of an elevator system. A processor determines for each car an individual waiting time of each hall call. Determines for each pair of hall calls assigned for each car, a pairwise delay over the individual waiting time of each hall call in the pair caused by a joint assignment of the car to the pair of the hall calls. Approximate a cumulative waiting time of an assignment of the cars to the hall calls as a sum of individual waiting times for each hall call with the assigned car and a sum of all pairwise delays determined between all pairs of hall calls assigned to the same car. Determine the assignment of the cars using a greedy optimization algorithm that greedily assigns hall calls to the cars to minimize the approximated cumulative waiting time, and control the movement of the cars.
-
公开(公告)号：US09463953B2
公开(公告)日：2016-10-11
申请号：US14333658
申请日：2014-07-17
Inventor： Hou-Hsien Lee , Chang-Jung Lee , Chih-Ping Lo
IPC: B66B1/34
CPC classification number: B66B1/3476 , B66B2201/211
Abstract: A control system for elevators includes a capture apparatus, a processor and a storage apparatus. The capture apparatus captures images of each floor. The processor performs human detection on images of each floor to calculate the number of waiting passengers of each floor. The processor further calculates waiting time of each floor. The processor calculates weight of each floor based on the number of the waiting passengers and waiting time, and controls the elevator to the floor with maximum weight.
Abstract translation: 电梯的控制系统包括捕获装置，处理器和存储装置。 捕获设备捕获每层楼的图像。 处理器对每层楼的图像执行人体检测，以计算每层楼的等待乘客人数。 处理器进一步计算每层的等待时间。 处理器基于等待乘客的数量和等待时间来计算每个楼层的重量，并且以最大的权重控制电梯到楼层。
-
-
-
-
-
-
-
-
-
Search Results
322
records
(took 0.014 seconds)
