会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明公开
    • AUTOMATIC SYSTEM FOR MONITORING ELECTRIC POWER CONSUMPTION
    • 用于监测电力消耗的自动系统
    • EP3221666A1
    • 2017-09-27
    • EP14815589.8
    • 2014-11-18
    • Telecom Italia S.p.A.
    • BOREAN, ClaudioGRASSO, Ennio
    • G01D4/02G05B13/02G06Q50/06
    • G01D4/00G05B15/02G05B2219/2639G05B2219/2642G06N7/00G06Q50/06H02J3/14H02J2003/143H04L67/125Y02B70/3225Y02B70/3241Y02B70/3266Y02B90/245Y04S20/222Y04S20/227Y04S20/242Y04S20/40
    • A system (100) for managing devices (110(i)) supplied through a power grid is proposed. Each device is configured to consume over time electric power according to at least one respective power profile when operating. The system comprises at least one unit (130; 132; 135; 155) interfaced with the devices for exchanging data. The at least one unit is configured to: - collect power profile data indicative of the power profiles of said devices; - generate a time schedule (160) of the device operations by distributing over time start times of the power profiles in such a way that at any time the total power consumption of the devices is kept under a maximum power threshold of the power grid The at least one unit is configured to generate said time schedule through a particle swarm optimization approach by: a) randomly generating a population of candidate time schedules within a search space comprising a set of the possible candidate time schedules; b) subdividing the population of candidate time schedules in a first group of candidate time schedules and in a second group of candidate time schedules; c) performing phases d) and e) at least once; d) moving the candidate time schedules of the first group in the search space following a random walk based on a stable probability distribution having an infinite variance; e) moving the candidate time schedules of the second group in the search space following a random walk based on a probability distribution having a finite variance; f) selecting a candidate time schedule based on a cost of said candidate time schedule corresponding to its position in the search space calculated by means of a cost function.
    • 提出了一种用于管理通过电网供电的设备(110(i))的系统(100)。 每个设备被配置为在操作时根据至少一个相应的功率曲线随时间消耗电功率。 该系统包括与用于交换数据的设备接口的至少一个单元(130; 132; 135; 155)。 该至少一个单元被配置为: - 收集指示所述设备的功率分布的功率分布数据; - 通过以这样的方式随时间分配功率分布图的时间分布来生成设备操作的时间表(160),使得在任何时候设备的总功耗保持在电网的最大功率阈值以下。at 通过以下步骤通过粒子群优化方法生成所述时间表:a)在包括一组可能的候选时间表的搜索空间内随机生成候选时间表的总体; b)在第一组候选时间安排和第二组候选时间安排中细分候选时间安排的总体; c)执行阶段d)和e)至少一次; d)基于具有无限方差的稳定概率分布,在随机游走之后,在搜索空间中移动第一组的候选时间进度表; e)基于具有有限方差的概率分布在随机游走之后在搜索空间中移动第二组的候选时间表; f)基于与通过成本函数计算的搜索空间中的其位置相对应的所述候选时间表的成本来选择候选时间表。
    • 8. 发明公开
    • METHOD AND SYSTEM FOR PROVIDING A DYNAMIC RIDE SHARING SERVICE
    • 用于提供动态骑乘共享服务的方法和系统
    • EP3189479A1
    • 2017-07-12
    • EP14777275.0
    • 2014-09-02
    • Telecom Italia S.p.A.
    • BOREAN, ClaudioGIANNANTONIO, RobertaGRANDI, SimoneGRASSO, Ennio
    • G06Q10/02
    • G06Q10/06313G01C21/3438G06Q50/30H04W4/023H04W4/08
    • A method is proposed for arranging, in a ride sharing system (100) providing a ride sharing service, ride sharing proposals (RSP) to users of the ride sharing service. The method comprises the following steps: determining candidate users groups each one comprising users potentially matching to share a ride; defining (115) a cost function (C) comprising, for each candidate users group, at least one term indicative of an impact on the users of the ride sharing service in case the ride sharing takes place among candidate users group, and at least one weighting coefficient (cu, ce, ct, cr) each one associated with a respective one of said at least one term; minimizing (125) the cost function (C) thereby obtaining ride sharing proposals (RSP) for the users; sending the ride sharing proposals (RSP) to the respective users; receiving by the users acceptance feedbacks indicative of acceptance or rejection of the ride sharing proposals, and dynamically varying (120, 200) a value of said at least one weighting coefficient (cu, ce, ct, cr) according to an acceptance rate of the ride sharing proposals (RSP) by the users.
    • 提出了一种用于在提供乘坐共享服务的乘坐共享系统(100)中为乘坐共享服务的用户安排乘坐共享建议(RSP)的方法。 该方法包括以下步骤:确定候选用户组,每个候选用户组包括可能匹配共享乘坐的用户; 定义(115)成本函数(C),其包括针对每个候选用户组的至少一个表示对乘坐共享服务的用户的影响的项,以及在至少一个候选用户组 加权系数(cu,ce,ct,cr),每一个与所述至少一个项中的相应一个相关联; 最小化(125)成本函数(C),从而获得用户的乘坐分享建议(RSP); 将乘车分享建议(RSP)发送给各个用户; 由用户接收指示接受或拒绝乘坐共享建议的接受反馈,以及根据所述至少一个加权系数(cu,ce,ct,cr)的接受率动态地改变(120,200)所述至少一个加权系数 由用户搭乘共享建议(RSP)。