Confidential distributed optimal scheduling method and system, computer equipment and medium

The invention provides a confidential distributed optimal scheduling method and system, computer equipment and a medium. The method comprises the following steps: constructing a single-target optimal scheduling model according to actual topology of a smart power grid; converting the single-target op...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: ZHOU BAORONG, CHENG LANFEN, SU XIANGRUI, TANG CHONG, XUAN PEIZHENG, ZHOU SHANGCHOU, MAO TIAN
Format: Patent
Sprache:chi ; eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator ZHOU BAORONG
CHENG LANFEN
SU XIANGRUI
TANG CHONG
XUAN PEIZHENG
ZHOU SHANGCHOU
MAO TIAN
description The invention provides a confidential distributed optimal scheduling method and system, computer equipment and a medium. The method comprises the following steps: constructing a single-target optimal scheduling model according to actual topology of a smart power grid; converting the single-target optimal scheduling model into a corresponding Lagrange dual model; and according to a subgradient iteration rule, solving the Lagrange duality model to obtain an optimal scheduling solution of the smart power grid. According to the method, noise meeting certain conditions is added to main body node privacy information of communication transmission in combination with the subgradient iteration rule, so that the defects that in the prior art, optimality is easily influenced by privacy levels, all security attacks cannot be handled, the communication efficiency is low, and the cost is high are solved, the optimal scheduling problem and the information security problem of generator sets in a modern smart power grid are e
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_CN113839845A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>CN113839845A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_CN113839845A3</originalsourceid><addsrcrecordid>eNqNjLEKwjAQhrs4iPoO565DqUIdJShOTo5Cib2rPcglsbkMvr1BfACnH77v459XdxP8wEhe2TpATjrxIyshhKgshaV-JMyO_ROEdAwI1iOkd1KSDfRBYsknoFfmKOXnq4WQsyyr2WBdotVvF9X6fLqZy5Zi6ChF25Mn7cy1rpu2ObS7_bH5p_kAJYY8pg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Confidential distributed optimal scheduling method and system, computer equipment and medium</title><source>esp@cenet</source><creator>ZHOU BAORONG ; CHENG LANFEN ; SU XIANGRUI ; TANG CHONG ; XUAN PEIZHENG ; ZHOU SHANGCHOU ; MAO TIAN</creator><creatorcontrib>ZHOU BAORONG ; CHENG LANFEN ; SU XIANGRUI ; TANG CHONG ; XUAN PEIZHENG ; ZHOU SHANGCHOU ; MAO TIAN</creatorcontrib><description>The invention provides a confidential distributed optimal scheduling method and system, computer equipment and a medium. The method comprises the following steps: constructing a single-target optimal scheduling model according to actual topology of a smart power grid; converting the single-target optimal scheduling model into a corresponding Lagrange dual model; and according to a subgradient iteration rule, solving the Lagrange duality model to obtain an optimal scheduling solution of the smart power grid. According to the method, noise meeting certain conditions is added to main body node privacy information of communication transmission in combination with the subgradient iteration rule, so that the defects that in the prior art, optimality is easily influenced by privacy levels, all security attacks cannot be handled, the communication efficiency is low, and the cost is high are solved, the optimal scheduling problem and the information security problem of generator sets in a modern smart power grid are e</description><language>chi ; eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES ; ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRICITY ; PHYSICS ; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR ; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><creationdate>2021</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20211224&amp;DB=EPODOC&amp;CC=CN&amp;NR=113839845A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25542,76289</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20211224&amp;DB=EPODOC&amp;CC=CN&amp;NR=113839845A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>ZHOU BAORONG</creatorcontrib><creatorcontrib>CHENG LANFEN</creatorcontrib><creatorcontrib>SU XIANGRUI</creatorcontrib><creatorcontrib>TANG CHONG</creatorcontrib><creatorcontrib>XUAN PEIZHENG</creatorcontrib><creatorcontrib>ZHOU SHANGCHOU</creatorcontrib><creatorcontrib>MAO TIAN</creatorcontrib><title>Confidential distributed optimal scheduling method and system, computer equipment and medium</title><description>The invention provides a confidential distributed optimal scheduling method and system, computer equipment and a medium. The method comprises the following steps: constructing a single-target optimal scheduling model according to actual topology of a smart power grid; converting the single-target optimal scheduling model into a corresponding Lagrange dual model; and according to a subgradient iteration rule, solving the Lagrange duality model to obtain an optimal scheduling solution of the smart power grid. According to the method, noise meeting certain conditions is added to main body node privacy information of communication transmission in combination with the subgradient iteration rule, so that the defects that in the prior art, optimality is easily influenced by privacy levels, all security attacks cannot be handled, the communication efficiency is low, and the cost is high are solved, the optimal scheduling problem and the information security problem of generator sets in a modern smart power grid are e</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES</subject><subject>ELECTRIC COMMUNICATION TECHNIQUE</subject><subject>ELECTRICITY</subject><subject>PHYSICS</subject><subject>SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</subject><subject>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2021</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNjLEKwjAQhrs4iPoO565DqUIdJShOTo5Cib2rPcglsbkMvr1BfACnH77v459XdxP8wEhe2TpATjrxIyshhKgshaV-JMyO_ROEdAwI1iOkd1KSDfRBYsknoFfmKOXnq4WQsyyr2WBdotVvF9X6fLqZy5Zi6ChF25Mn7cy1rpu2ObS7_bH5p_kAJYY8pg</recordid><startdate>20211224</startdate><enddate>20211224</enddate><creator>ZHOU BAORONG</creator><creator>CHENG LANFEN</creator><creator>SU XIANGRUI</creator><creator>TANG CHONG</creator><creator>XUAN PEIZHENG</creator><creator>ZHOU SHANGCHOU</creator><creator>MAO TIAN</creator><scope>EVB</scope></search><sort><creationdate>20211224</creationdate><title>Confidential distributed optimal scheduling method and system, computer equipment and medium</title><author>ZHOU BAORONG ; CHENG LANFEN ; SU XIANGRUI ; TANG CHONG ; XUAN PEIZHENG ; ZHOU SHANGCHOU ; MAO TIAN</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_CN113839845A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>chi ; eng</language><creationdate>2021</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES</topic><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRICITY</topic><topic>PHYSICS</topic><topic>SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</topic><topic>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</topic><toplevel>online_resources</toplevel><creatorcontrib>ZHOU BAORONG</creatorcontrib><creatorcontrib>CHENG LANFEN</creatorcontrib><creatorcontrib>SU XIANGRUI</creatorcontrib><creatorcontrib>TANG CHONG</creatorcontrib><creatorcontrib>XUAN PEIZHENG</creatorcontrib><creatorcontrib>ZHOU SHANGCHOU</creatorcontrib><creatorcontrib>MAO TIAN</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>ZHOU BAORONG</au><au>CHENG LANFEN</au><au>SU XIANGRUI</au><au>TANG CHONG</au><au>XUAN PEIZHENG</au><au>ZHOU SHANGCHOU</au><au>MAO TIAN</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Confidential distributed optimal scheduling method and system, computer equipment and medium</title><date>2021-12-24</date><risdate>2021</risdate><abstract>The invention provides a confidential distributed optimal scheduling method and system, computer equipment and a medium. The method comprises the following steps: constructing a single-target optimal scheduling model according to actual topology of a smart power grid; converting the single-target optimal scheduling model into a corresponding Lagrange dual model; and according to a subgradient iteration rule, solving the Lagrange duality model to obtain an optimal scheduling solution of the smart power grid. According to the method, noise meeting certain conditions is added to main body node privacy information of communication transmission in combination with the subgradient iteration rule, so that the defects that in the prior art, optimality is easily influenced by privacy levels, all security attacks cannot be handled, the communication efficiency is low, and the cost is high are solved, the optimal scheduling problem and the information security problem of generator sets in a modern smart power grid are e</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language chi ; eng
recordid cdi_epo_espacenet_CN113839845A
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES
ELECTRIC COMMUNICATION TECHNIQUE
ELECTRICITY
PHYSICS
SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
title Confidential distributed optimal scheduling method and system, computer equipment and medium
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-07T03%3A19%3A19IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=ZHOU%20BAORONG&rft.date=2021-12-24&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3ECN113839845A%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true