-
1.发明授权Method and system for scheduling cars in elevator systems considering existing and future passengers 有权考虑现有和未来乘客的电梯系统调度方法和系统公开(公告)号：US07014015B2
公开(公告)日：2006-03-21
申请号：US10602849
申请日：2003-06-24
IPC分类号： B66B1/18
CPC分类号： B66B1/2458 , B66B2201/102 , B66B2201/211 , B66B2201/235 , B66B2201/243 , B66B2201/403
摘要： 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.
摘要翻译： 一种方法安排建筑物中的电梯系统的车辆。 只要新到达的乘客按下向上或向下按钮以产生服务呼叫，该方法开始执行。 对于每辆车，根据电梯系统的未来状况，如果汽车被分配到服务呼叫，则确定所有现有乘客的第一等待时间。 对于每辆汽车，根据汽车的着陆模式，确定未来乘客的第二等待时间，如果汽车被分配到服务呼叫。 对于每辆车，组合第一等待时间和第二等待时间以产生经调整的等待时间。该方法通过分配具有最低调整等待时间的特定车辆来服务呼叫并最小化所有乘客的平均等待时间来结束。
-
2.发明申请Method and System for Determining Instantaneous Peak Power Consumption in Elevator Banks 有权确定电梯银行瞬时峰值功耗的方法和系统公开(公告)号：US20080308361A1
公开(公告)日：2008-12-18
申请号：US11761683
申请日：2007-06-12
IPC分类号： B66B1/18
CPC分类号： B66B1/2458 , B66B2201/102 , B66B2201/211 , B66B2201/212 , B66B2201/216 , B66B2201/222 , Y02B50/122
摘要： A method and system determine peak power consumption over time by a bank of elevator for servicing a set of passenger hall calls and delivery requests, and selecting elevator schedules that keep peak power consumption below a predetermined threshold. For each car in response to receiving a hall call, a set of all possible paths to service all hall calls assigned to the car are determined, in which each path includes a set of all possible segments. A peak power consumption for each possible segment is also determined. The peak power consumptions for the set of all possible segments for each time instant are added to determine a total peak power consumption for each time instant, and a particular path is selected as a schedule to operate the bank of elevator cars, if the total peak power consumption for any instant in time while operating according to the selected schedule is below a predetermined threshold.
摘要翻译： 一种方法和系统确定由电梯组提供的用于服务一组乘客大厅呼叫和递送请求的时间的峰值功率消耗，以及选择使峰值功率消耗低于预定阈值的电梯时间表。 对于每个轿厢响应于接收到一个门厅呼叫，确定一组所有可能的路径来服务分配给轿厢的所有门厅呼叫，其中每个路径包括一组所有可能的段。 每个可能的段的峰值功率消耗也被确定。 添加每个时刻的所有可能段的集合的峰值功率消耗以确定每个时刻的总峰值功耗，并且选择特定路径作为操作电梯轿厢组的调度，如果总峰值 根据所选择的时间表操作时的任何时刻的功率消耗低于预定阈值。
-
公开(公告)号：US06808049B2
公开(公告)日：2004-10-26
申请号：US10293520
申请日：2002-11-13
IPC分类号： B66B120
CPC分类号： B66B1/2458 , B66B2201/102 , B66B2201/211 , B66B2201/243 , B66B2201/302 , B66B2201/403
摘要： A method controls the distribution of free cars in an elevator system. First, the number of free cars in the elevator system are counted whenever this number changes. At the same time, the arrival/destination rates of passengers at each of the floor is determined. The rates are used to identify up-peak and down-peak traffic patterns. The floors of the building are then assigned to zones. The number of floors in each zone is determined according to the arrival rates, and the free cars are then parked in the zones so that the expected waiting time of the next arriving passenger is minimized.
摘要翻译： 一种方法控制电梯系统中自由车的分配。 首先，当这个数字变化时，电梯系统中的免费汽车的数量将被计数。 同时，确定每层楼的乘客的到达/目的地率。 这些费率用于识别高峰和低峰流量模式。 然后将建筑物的楼层分配到区域。 每个区域中的楼层数量根据到达率确定，然后将自由轿厢停放在区域中，使得下一个到达乘客的预期等待时间最小化。
-
公开(公告)号：US06672431B2
公开(公告)日：2004-01-06
申请号：US10161304
申请日：2002-06-03
IPC分类号： B66B118
CPC分类号： B66B1/2458 , B66B2201/102 , B66B2201/211 , B66B2201/222
摘要： A method controls an elevator system including multiple elevator cars and multiple floors. A new passenger at one of the floors signals a hall call. In response to receiving the hall call, the method determines, for each car, a set of all possible future states of the elevator system. The future states depend on the current state of the system, which is defined by passengers already assigned to cars, the direction of travel, position and velocity of the cars. A cost function is evaluated to determine a cost for each set of all possible future states. Then, the car associated with the set having a least cost is assigned to service the hall call. The method is applicable to any type of traffic. It is particularly well-suited for up-peak traffic because it handles efficiently the uncertainty in passenger destinations.
摘要翻译： 一种方法控制包括多个电梯轿厢和多个楼层的电梯系统。 其中一层的新乘客发出门厅通知。 响应于接收到门厅呼叫，该方法针对每个轿厢确定电梯系统的所有可能的未来状态的集合。 未来的状态取决于系统的当前状态，这是由已经分配给汽车的乘客，旅行方向，位置和速度来定义的。 评估成本函数以确定每组可能的未来状态的成本。 然后，分配与具有最低成本的集合相关联的轿厢来服务门厅呼叫。 该方法适用于任何类型的流量。 它特别适用于高峰交通，因为它有效地处理了旅客目的地的不确定性。
-
5.发明授权System and method for scheduling elevator cars using pairwise delay minimization 有权使用成对延迟最小化来安排电梯轿厢的系统和方法公开(公告)号：US07546905B2
公开(公告)日：2009-06-16
申请号：US11390508
申请日：2006-03-27
IPC分类号： B66B1/16
CPC分类号： B66B1/18
摘要： A method schedules cars of an elevator system, the elevator system including a set of cars, and a set of hall calls. For each car, a waiting time is determined independently if the hall call is the only hall call assigned to the car. For each car, a mutual delay ΔW(h|g) is determined for each possible pair of unassigned hall calls h and assigned hall calls g. The waiting time and mutual delays are summed. Then, the assignments are made to the set of cars so that the sum is a minimum.
摘要翻译： 一种方法调度电梯系统的汽车，包括一组轿厢的电梯系统和一组门厅呼叫。 对于每辆车，如果门厅呼叫是分配给汽车的唯一门厅呼叫，则独立地确定等待时间。 对于每个轿厢，对于每个可能的一对未分配的门厅呼叫h和所分配的门厅呼叫g，确定相互延迟DeltaW（h | g）。 等待时间和相互延迟相加。 然后，分配给一组汽车，使得总和是最小的。
-
公开(公告)号：US07484597B2
公开(公告)日：2009-02-03
申请号：US11389942
申请日：2006-03-27
IPC分类号： B66B1/18
CPC分类号： B66B1/18
摘要： A method schedules cars of an elevator system. Each possible assignment of a set of hall calls to a set of cars is represented by a solution vector maintained as a node in a search tree. Each solution vector is evaluated using an ESA-DP process according to an immediate policy to determine initially a best solution. A branch-and-bound process is applied to each solution vector using the initial best solution and the search tree to determine a globally optimal solution for scheduling the cars according to a reassignment policy.
摘要翻译： 一种方法安排电梯系统的汽车。 通过在搜索树中作为节点维护的解向量来表示对一组轿厢的一组门厅呼叫的每个可能的分配。 每个解矢量根据立即的策略使用ESA-DP过程进行评估，以便最初确定最佳解决方案。 使用初始最佳解决方案和搜索树将分支绑定过程应用于每个解向量，以根据重新分配策略来确定用于安排车辆的全局最优解。
-
7.发明授权公开(公告)号：US07743890B2
公开(公告)日：2010-06-29
申请号：US11761683
申请日：2007-06-12
IPC分类号： B66B1/18
CPC分类号： B66B1/2458 , B66B2201/102 , B66B2201/211 , B66B2201/212 , B66B2201/216 , B66B2201/222 , Y02B50/122
摘要： A method and system determine peak power consumption over time by a bank of elevator for servicing a set of passenger hall calls and delivery requests, and selecting elevator schedules that keep peak power consumption below a predetermined threshold. For each car in response to receiving a hall call, a set of all possible paths to service all hall calls assigned to the car are determined, in which each path includes a set of all possible segments. A peak power consumption for each possible segment is also determined. The peak power consumptions for the set of all possible segments for each time instant are added to determine a total peak power consumption for each time instant, and a particular path is selected as a schedule to operate the bank of elevator cars, if the total peak power consumption for any instant in time while operating according to the selected schedule is below a predetermined threshold.
摘要翻译： 一种方法和系统确定由电梯组提供的用于服务一组乘客大厅呼叫和递送请求的时间的峰值功率消耗，以及选择使峰值功率消耗低于预定阈值的电梯时间表。 对于每个轿厢响应于接收到一个门厅呼叫，确定一组所有可能的路径来服务分配给轿厢的所有门厅呼叫，其中每个路径包括一组所有可能的段。 每个可能的段的峰值功率消耗也被确定。 添加每个时刻的所有可能段的集合的峰值功率消耗以确定每个时刻的总峰值功耗，并且选择特定路径作为操作电梯轿厢组的调度，如果总峰值 根据所选择的时间表操作时的任何时刻的功率消耗低于预定阈值。
-
8.发明授权公开(公告)号：US08996185B2
公开(公告)日：2015-03-31
申请号：US13153239
申请日：2011-06-03
申请人： Daniel N. Nikovski , Weihong Zhang
发明人： Daniel N. Nikovski , Weihong Zhang
CPC分类号： G05B19/00 , G05B13/024 , H02J3/381 , H02J3/46 , H02J2003/007 , H02P9/00
摘要： A unit commitment problem is solved for a set of generators with a set of configurations having a set of 2N.T schedules, wherein N is a number of generators i and T is a number of decision time steps. A reduced set of configurations is determined, and then a functional metric to measure a similarity of all possible pairs of the configurations is defined. Dynamic programming is applied to the reduced set of configurations using the similarity metric to determine an optimal configuration.
摘要翻译： 针对具有一组2N.T计划的一组配置的一组发生器解决了单元承诺问题，其中N是发生器i的数量，T是决定时间步骤的数量。 确定一组缩减的配置，然后定义用于测量所有可能的配置对的相似性的功能度量。 使用相似性度量将动态规划应用于简化的配置集以确定最佳配置。
-
9.发明授权Method for scheduling the operation of power generators using factored Markov decision process 失效使用因子Markov决策过程调度发电机运行的方法公开(公告)号：US08566266B2
公开(公告)日：2013-10-22
申请号：US12870703
申请日：2010-08-27
申请人： Daniel N. Nikovski , Weihong Zhang
发明人： Daniel N. Nikovski , Weihong Zhang
IPC分类号： G06N5/02
CPC分类号： G05B13/024 , G06Q10/0631 , G06Q50/06 , H02J2003/007 , Y02E40/76 , Y02E60/76 , Y04S10/54 , Y04S10/545 , Y04S40/22
摘要： An optimal conditional operational schedule for a set of power generators is determined by constructing states and transitions of a factored Markov decision process (fMDP) from a target electrical demand and generator variables. A cost function for the fMDP is constructed based on the electrical demand, the generator variables, and a risk coefficient. Then, the fMDP is solved to obtain the optimal conditional operational schedule.
摘要翻译： 通过从目标电力需求和发电机变量构建因子马尔可夫决策过程（fMDP）的状态和转换来确定一组发电机的最佳条件运行调度。 基于电力需求，发电机变量和风险系数构建了fMDP的成本函数。 然后，解决了fMDP以获得最优条件运行时间表。
-
公开(公告)号：US08315961B2
公开(公告)日：2012-11-20
申请号：US12502676
申请日：2009-07-14
申请人： Daniel N. Nikovski
发明人： Daniel N. Nikovski
IPC分类号： G06F15/18
摘要： An average environmental condition for a specified target date and time is determined by indexing a database of time series data to retrieve the environment condition for each day and time where an orbital position of the earth with respect to the sun is nearest to the orbital position of the earth on the target date and time. The average environmental condition is then determined from the retrieved environmental conditions.
摘要翻译： 指定目标日期和时间的平均环境条件通过索引时间序列数据的数据库来确定，以便检索每天的时间和地球相对于太阳的轨道位置最接近轨道位置的时间 地球上的目标日期和时间。 然后根据检索的环境条件确定平均环境条件。
-
-
-
-
-
-
-
-
-
搜索结果
25 条记录 (耗时 0.019 秒)
