专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

11. 发明授权

US08838304B2 Method for determining run-curves for vehicles based on travel time 有权
标题翻译：基于行驶时间确定车辆行驶曲线的方法
公开(公告)号：US08838304B2
公开(公告)日：2014-09-16
申请号：US13538794
申请日：2012-06-29
申请人： Jingyang Xu , Daniel Nikovski
发明人： Jingyang Xu , Daniel Nikovski
IPC分类号： B61L27/04
CPC分类号： B61L3/006
摘要： A method reduces the computation time for determining optimal run-curves for a specific travel time of a vehicle along a route between two locations. The computation is partitioned between pre-processing and real-time steps. A set of weights μ are generated, and run-curves for the weights are obtained and stored during the pre-processing. State transition matrices can also be determined and stored during the pre-processing. During real-time, a specific travel time is obtained. The travel time is used to interpolate the weight μ for the specific travel time from the stored weights. The memory can be updated for each solution for a specific travel time to dramatically reduce the time to optimize the run-curves.
摘要翻译：一种方法减少了用于确定车辆沿着两个位置之间的路线的特定行驶时间的最佳行驶曲线的计算时间。计算在预处理和实时步骤之间进行分区。生成一组权重μ，并且在预处理期间获得并存储权重的运行曲线。也可以在预处理期间确定和存储状态转移矩阵。实时获取具体的旅行时间。旅行时间用于从存储的权重内插特定行程时间的权重μ。可以为每个解决方案更新存储器的特定行程时间，以显着减少优化运行曲线的时间。

12. 发明申请

US20070221455A1 System and method for scheduling elevator cars using branch-and-bound 有权
标题翻译：使用分支机构调度电梯轿厢的系统和方法
公开(公告)号：US20070221455A1
公开(公告)日：2007-09-27
申请号：US11389942
申请日：2006-03-27
申请人： Daniel Nikovski , Matthew Brand , Dietmar Ebner
发明人： Daniel Nikovski , Matthew Brand , Dietmar Ebner
IPC分类号： B66B1/20
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过程进行评估，以便最初确定最佳解决方案。使用初始最佳解决方案和搜索树将分支绑定过程应用于每个解向量，以根据重新分配策略来确定用于安排车辆的全局最优解。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式