中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

106 records (took 0.015 seconds)

    ELEVATOR SYSTEM
    71.
    发明申请
    ELEVATOR SYSTEM 有权
    电梯系统

    公开(公告)号：US20090159374A1

    公开(公告)日：2009-06-25

    申请号：US12340478

    申请日：2008-12-19

    Applicant: Janne SORSA ,  Marja-Liisa SIIKONEN

    Inventor： Janne SORSA ,  Marja-Liisa SIIKONEN

    IPC: B66B1/20

    CPC classification number: B66B1/2458 ,  B66B2201/103 ,  B66B2201/104 ,  B66B2201/211 ,  B66B2201/212 ,  B66B2201/214 ,  B66B2201/215 ,  B66B2201/222 ,  B66B2201/232 ,  B66B2201/306 ,  B66B2201/402 ,  Y10S187/902

    Abstract: A method for allocating destination calls in an elevator system, the system including at least one multi-deck elevator, where the passenger gives his/her destination floor by means of a destination call device at the beginning of the journey route, thereby defining the starting point and final point of the passenger's journey route in the elevator system. The method includes the steps of generating possible route alternatives from the starting point to the final point of the journey route, determining a cost function containing at least one travel time term, determining the value of the travel time term corresponding to each route alternative in the cost function, calculating the total cost of each route alternative by using the cost function, allocating for the passenger the route alternative that gives the minimum total cost, and guiding the passenger to a waiting lobby and/or elevator consistent with the route alternative allocated.

    Abstract translation: 一种用于在电梯系统中分配目的地呼叫的方法，所述系统包括至少一个多层电梯，其中乘客在旅程路线开始时借助于目的地呼叫装置给出他/她的目的地楼层，由此定义起始 乘客在电梯系统中的旅程路线的最终点和终点。 该方法包括以下步骤：从起点到行程路线的最终点产生可能的路线替代方案，确定包含至少一个旅行时间项的成本函数，确定对应于 成本函数，通过使用成本函数计算每个路由替代方案的总成本，为乘客分配给出最小总成本的路由选择，并将乘客引导到与分配的路由选择一致的等待的大厅和/或电梯。

    Elevator system
    72.
    发明授权
    Elevator system 有权
    电梯系统

    公开(公告)号：US07546906B2

    公开(公告)日：2009-06-16

    申请号：US12216314

    申请日：2008-07-02

    Applicant: Tapio Tyni ,  Jari Ylinen

    Inventor： Tapio Tyni ,  Jari Ylinen

    IPC: B66B1/18

    CPC classification number: G06N3/126 ,  B66B1/2458 ,  B66B2201/102 ,  B66B2201/103 ,  B66B2201/211 ,  B66B2201/212 ,  B66B2201/214 ,  B66B2201/216 ,  B66B2201/222 ,  B66B2201/306 ,  B66B2201/40 ,  Y02B50/122

    Abstract: The present invention discloses an extension to a prior-art genetic algorithm, with which the routing of elevators based on the calls given in an elevator system is formed. A new type of gene, a so-called run type gene, is connected to the chromosome of the genetic algorithm according to the invention, with which gene the desired speed profile for the elevator trip can be set. In this way e.g. an upper limit can be set for the acceleration or for the maximum travel speed of the elevator. By means of the run type gene a kinetic energy term is included in the optimization. The energy consumed by the system can thus be minimized more effectively by means of the algorithm, because the varying travel speeds of the elevators create more freedom of choice for the chromosomes of the algorithm.

    Abstract translation: 本发明公开了对现有技术遗传算法的扩展，其中基于电梯系统中给出的呼叫形成电梯的路由。 一种新型的基因，即所谓的运行型基因，连接到根据本发明的遗传算法的染色体，利用该基因可以设置用于电梯跳闸的期望速度分布。 以这种方式，例如 可以为电梯的加速度或最大行驶速度设定上限。 通过运行型基因，动能项被包括在优化中。 因此，由于电梯的变化的行进速度为算法的染色体创造了更多的选择自由度，因此通过该算法可以更有效地使系统消耗的能量最小化。

    Elevator system
    73.
    发明申请
    Elevator system 有权
    电梯系统

    公开(公告)号：US20080105499A1

    公开(公告)日：2008-05-08

    申请号：US11907811

    申请日：2007-10-17

    Applicant: Tapio Tyni ,  Jari Ylinen

    Inventor： Tapio Tyni ,  Jari Ylinen

    IPC: B66B1/18

    CPC classification number: H02J3/12 ,  B66B1/2458 ,  B66B5/027 ,  B66B2201/102 ,  B66B2201/103 ,  B66B2201/211 ,  B66B2201/212 ,  B66B2201/214 ,  B66B2201/216 ,  B66B2201/222 ,  B66B2201/241 ,  B66B2201/40 ,  H02J9/06 ,  Y02B50/122

    Abstract: The present invention discloses a method for optimal routing of the elevators in an elevator system in a situation where the supply power received by the system is limited e.g. due to emergency power operation. In the invention, routes are optimized by using a cost function to which has been added a term containing the summed instantaneous power consumed. Power consumption is monitored in real time, and the elevators need a start permission from the control system. A route alternative that exceeds the power limit is penalized in the cost function by a so-called penal term. With the elevator routing obtained as a result, the instantaneous power consumed by the system remains continuously below the set power limit. Some call can thus be postponed to be served later. By the method of the invention, the number of elevators serving passengers in an emergency power situation can be varied dynamically.

    Abstract translation: 本发明公开了一种在系统接收的供电功率有限的情况下电梯系统中的电梯的最佳路线选择方法。 由于应急电源运行。 在本发明中，通过使用已经添加了包含消耗的总和瞬时功率的术语的成本函数来优化路线。 实时监控功耗，电梯需要控制系统的启动许可。 超过功率极限的路由选择在成本函数中被所谓的刑罚惩罚。 由于获得的电梯路由，系统消耗的瞬时功率保持在设定功率极限以下。 因此可以推迟一些电话，以便稍后提供服务。 通过本发明的方法，可以动态地改变在紧急电力情况下为乘客服务的电梯的数量。

    Service/equipment equalization destination system (SEEDS) for elevators
    76.
    发明申请
    Service/equipment equalization destination system (SEEDS) for elevators 失效
    电梯的服务/设备均衡目的地系统（SEEDS）

    公开(公告)号：US20040200672A1

    公开(公告)日：2004-10-14

    申请号：US10411652

    申请日：2003-04-12

    Inventor： William Newby

    IPC: B66B001/18

    CPC classification number: B66B1/2458 ,  B66B2201/103 ,  B66B2201/211 ,  B66B2201/212 ,  B66B2201/214 ,  B66B2201/215 ,  B66B2201/222 ,  B66B2201/302

    Abstract: The nullSEEDSnull assignment process shall address directly the equalization of service and use of all cars and will specifically control the demand/assignment process to minimize round trip times. SEEDS will create zones consisting of contiguous or near contiguous demands. SEEDS shall specifically evaluate the best potential assignment for each demand based on its overall effect on the system. Each demand (Origin and Destination) will be assigned, not on the basis of the best solution for the individual demand, but on the basis of its effect on the total system. The primary target is the equalization of service to all calls rather than the best response to each individual demand. Assignments, which increase the total number of system stops made or those, which increase the relative round trip beyond the mean round trip time of all cars will be avoided. All nullElevator Group Systemsnull (conventional or destination type) of recent invention have been based on nullCost of Servicenull algorithms (e.g.: Shortest waiting times) using as few elevators in the group as possible, with no direct means of controlling equalization of service characteristics or equipment use, or creating contiguous demand assignment.

    Abstract translation: “SEEDS”分配过程应直接处理所有车辆的服务和使用均等化，具体控制需求/分配过程，尽量减少往返时间。 SEEDS将创建由连续或接近邻近需求组成的区域。 SEEDS应根据其对系统的整体影响，对每个需求进行具体评估。 每个需求（原产地和目的地）将被分配，而不是根据个人需求的最佳解决方案，而是基于其对整个系统的影响。 主要目标是将服务均等化为所有呼叫，而不是对每个个体需求的最佳响应。 这样可以避免作出的系统停止总数或增加相对往返行驶超过所有轿厢的平均往返时间的作业。 最近发明的所有“电梯组系统”（常规或目的地类型）已经基于使用尽可能少的电梯的“服务成本”算法（例如：最短等待时间），没有直接的方法来控制均衡 服务特征或设备使用，或创建连续的需求分配。

    Double-deck elevator group controller for call allocation based on monitored passenger flow and elevator status
    77.
    发明授权
    Double-deck elevator group controller for call allocation based on monitored passenger flow and elevator status 有权
    基于监控乘客流量和电梯状态的双层电梯组控制器进行呼叫分配

    公开(公告)号：US06401874B2

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

    申请号：US09771597

    申请日：2001-01-30

    Applicant: Marja-Liisa Siikonen

    Inventor： Marja-Liisa Siikonen

    IPC: B66B118

    CPC classification number: B66B1/2458 ,  B66B2201/102 ,  B66B2201/103 ,  B66B2201/211 ,  B66B2201/212 ,  B66B2201/213 ,  B66B2201/214 ,  B66B2201/215 ,  B66B2201/222 ,  B66B2201/306 ,  B66B2201/402 ,  B66B2201/403 ,  Y10S187/902

    Abstract: A procedure for controlling an elevator group consisting of double deck elevators consists of allocating landing calls to elevators and elevator decks in such a way that passenger journey time is optimized. The time of the call and the estimated time of arrival to destination floor are taken into account. Passenger flow and elevator status within the elevator group are monitored and passenger wait time and arrive time estimated based thereon. The best elevator is selected to minimize passenger wait and ride time. The best deck is further selected based on the estimated wait time and ride time to minimize passenger journey time.

    Abstract translation: 用于控制由双层电梯组成的电梯组的程序包括以优化乘客行驶时间的方式分配对电梯和电梯甲板的着陆呼叫。 考虑到通话时间和到达目的地楼层的预计时间。 对电梯组内的乘客流量和电梯状况进行监控，并根据此估计乘客等待时间和到达时间。 选择最好的电梯以尽量减少乘客等待和乘车时间。 根据估计的等待时间和乘车时间进一步选择最佳甲板，以尽量减少乘客行驶时间。

Patent Agency Ranking