利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

81 条记录 (耗时 0.028 秒)

    PROGRAM, METHOD, AND SYSTEM
    5.
    发明公开
    PROGRAM, METHOD, AND SYSTEM 审中-公开

    公开(公告)号：EP4325389A1

    公开(公告)日：2024-02-21

    申请号：EP22788200.8

    申请日：2022-04-14

    申请人： Plantstream Inc.

    发明人： SAKAI Fumitaka ,  ODA Takeshi ,  NARUE Seitaro ,  SAKAI Fumiaki

    IPC分类号： G06F30/18 ,  G06F30/20 ,  G06Q50/04 ,  G06F113/14

    摘要： A program of the present disclosure causes a processor to execute: a step of receiving, from a user, an operation to arrange a first object having a start point and a second object having an end point in a virtual space; a step of setting a plurality of tentative routes connecting the start point and the end point along coordinate axes of the virtual space; a step of detecting whether or not there is interference with an obstacle for each of the set tentative routes; and a step of selecting an optimum route with a lowest cost from the tentative routes for which no interference has been detected.

    ERMITTELN VON PFADEN ZUR VERDRAHTUNG VON ELEKTRISCHEN KOMPONENTEN
    7.
    发明公开
    ERMITTELN VON PFADEN ZUR VERDRAHTUNG VON ELEKTRISCHEN KOMPONENTEN 审中-公开

    公开(公告)号：EP4148610A1

    公开(公告)日：2023-03-15

    申请号：EP21196505.8

    申请日：2021-09-14

    申请人： Siemens Aktiengesellschaft

    发明人： Lohse, Oliver ,  Robl, Peter

    IPC分类号： G06F30/18

    摘要： Die Erfindung betrifft ein computerimplementiertes Verfahren zum Ermitteln von Pfaden (P1,...,Pn) zur Verdrahtung von mehreren elektrischen Komponenten (100,110,120), die in einem definierten Volumen (V) angeordnet sind. Um eine verbesserte Ermittlung von Pfaden (P1,...,Pn) zur Verdrahtung von mehreren elektrischen Komponenten (100,110,120) anzugeben werden die folgenden Schritte vorgeschlagen:
    - Bereitstellen von Verdrahtungsdaten (RD), die für jeden der zu ermittelnden Pfade (P1,...,Pn) die über den jeweiligen Pfad (P1,...,Pn) zu verbindenden Komponenten (100,110,120) angeben,
    - Ermitteln der Pfade (P1,...,Pn) für die elektrischen Komponenten (100,110,120) auf Basis der Verdrahtungsdaten (RD) mittels eines kürzester Pfad Algorithmus (RA), wobei der Algorithmus (RA) zum Ermitteln für jeden der Pfade (P1,...,Pn) zumindest folgende Nebenbedingungen (C1,C2) berücksichtigt:
    - Minimierung (C1) von Diagonalen im Pfad (P1,...,Pn) und
    - Minimierung (C2) der Anzahl von Richtungsänderungen im Pfad (P1,...,Pn) .

    PLANNING METHOD AND SYSTEM FOR CABLE PATH OF WIND POWER PLANT, MEDIUM, AND ELECTRONIC DEVICE
    8.
    发明公开
    PLANNING METHOD AND SYSTEM FOR CABLE PATH OF WIND POWER PLANT, MEDIUM, AND ELECTRONIC DEVICE 审中-公开

    公开(公告)号：EP4068172A1

    公开(公告)日：2022-10-05

    申请号：EP19954658.1

    申请日：2019-11-25

    申请人： Shanghai Electric Wind Power Group Co., Ltd. ,  SEWPG European Innovation Center ApS

    发明人： HOU, Peng ,  ZHU, Jiangsheng ,  JIN, Rongsen ,  CHEN, Le ,  MENG, Xiaogang ,  MIAO, Jun

    IPC分类号： G06Q10/04 ,  G06Q50/06 ,  G06F30/18 ,  G06F113/16

    摘要： The present disclosure provides methods, systems, media and electronic devices for planning a cable path of a wind farm. The method includes: obtaining operating parameters of the wind farm; constructing a first function based on total unit costs of cables with different cross sectional areas, the operating parameters and a preset maximum quantity of cable-carried wind turbines; respectively calculating the total unit costs corresponding to the different cross sectional areas and taking a cross sectional area corresponding to a lowest total unit cost as a target cross sectional area; constructing a second function based on total cable costs of the wind farm, cable paths, the target cross sectional area, the preset maximum quantity of cable-carried wind turbines and the operating parameters; respectively calculating the total cable costs corresponding to different cable paths and taking the cable path corresponding to a lowest total cable cost as a target cable path. The technical solution of the present disclosure can decouple the cable type selection and the cable path optimization to reduce the calculation complexity and increase the solving efficiency.