CN101888119A - Generation method of scheduling operating command ticket - Google Patents
Generation method of scheduling operating command ticket Download PDFInfo
- Publication number
- CN101888119A CN101888119A CN 201010194466 CN201010194466A CN101888119A CN 101888119 A CN101888119 A CN 101888119A CN 201010194466 CN201010194466 CN 201010194466 CN 201010194466 A CN201010194466 A CN 201010194466A CN 101888119 A CN101888119 A CN 101888119A
- Authority
- CN
- China
- Prior art keywords
- node
- execution
- mutual
- item
- carry out
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 26
- 238000013138 pruning Methods 0.000 claims description 13
- 230000005611 electricity Effects 0.000 claims description 7
- 230000002452 interceptive effect Effects 0.000 claims description 7
- 238000012217 deletion Methods 0.000 claims description 2
- 230000037430 deletion Effects 0.000 claims description 2
- 239000011888 foil Substances 0.000 claims description 2
- 230000002265 prevention Effects 0.000 abstract 1
- 238000009966 trimming Methods 0.000 abstract 1
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000009795 derivation Methods 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 230000002950 deficient Effects 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
- 230000001960 triggered effect Effects 0.000 description 1
Images
Abstract
The invention discloses a generating method of a scheduling operating command ticket, which comprises the steps of: growing and trimming an intelligent inference tree, wherein the growth comprises the steps of: 1, starting, 2, selecting an operating device and 3, ending, and the step 2 comprises the steps of: 2.1, generating a target node; 2.2, adding one group of attribute nodes for the target node; 2.3, traversing to obtain an attribute node; 2.4, judging whether the attribute node exists or not; 2.5, executing the attribute node and carrying out drop-out analysis and load flow calculation on relevant operations; 2.6, checking whether the drop-out, the error prevention and the load flow are safe or not, if not meeting the requirements, executing the step 2.7, if meeting the requirements, executing the step 2.3; 2.7, adding one group of trigger nodes for the attribute node; 2.8, traversing the trigger nodes; and 2.9, checking whether the attribute node exists the trigger nodes or not , if not, executing the step 2.3, and if so, executing the step 2.1.
Description
Technical field
The present invention relates to Automation of Electric Systems, relate in particular to a kind of generation method of scheduling operating command ticket.
Background technology
Common information model (CIM in No. 6197 standards of International Electrotechnical Commission (IEC 61970), Common Information Model) in, equipment belongs to some equipment containers, equipment container may belong in other the container again, for example: switch belongs to some intervals (container), may belong to a certain mode of connection (equipment container) at interval, the mode of connection belongs to factory station (container).
During an equipment at first Cheng Shengyi " running node ", this running node can be divided into several concrete operations again, is referred to as " attribute node " here in operation.When operation some " attribute node ", may trigger the operation of some miscellaneous equipments---claim that this category node is " a triggering node ".Distribute and select " triggering node " by analyzing the mode of connection, dead electricity information and trend.Fig. 1 shows several category nodes that occur in the derivation tree.The degree of depth elder generation preface first search of tree is meant from bottom to top search procedure from left to right.The tree the degree of depth after sequence search be meant from bottom to top, search procedure from right to left.
But present tree type reasoning target is unintelligible, and is unfavorable for expansion, modification, realizes the mutual relatively difficulty with the user.
Summary of the invention
For overcoming the defective of prior art, the technical problem to be solved in the present invention provided a kind of set type reasoning target clear, be convenient to expand and revise, be easy to realize generation method with user's mutual scheduling operating command ticket.
Technical scheme of the present invention is: the generation method of this scheduling operating command ticket comprises growth and the pruning of intelligent inference tree, and the growth of intelligent inference tree may further comprise the steps: (1) beginning; (2) selection operation equipment; (3) finish; Wherein step (2) comprises step by step following: (2.1) generate destination node; (2.2) add one group of attribute node for destination node; (2.3) traversal obtains an attribute node; (2.4) judge whether to exist attribute node, if exist then execution in step (2.5), if there is no execution in step (3) then; (2.5) carry out attribute node, and associative operation is carried out power loss analysis and trend calculating; (2.6) check whether safety of dead electricity, anti-error and trend, if can not meet the requirements of (2.7), if meet the requirements of (2.3); (2.7) for adding one group, attribute node triggers node; (2.8) traversal triggers node; (2.9) check whether attribute node exists the triggering node, if there is no execution in step (2.3) is if exist execution in step (2.1) to generate new impact point.
The tree type reasoning target of this method is clear, be convenient to expand and revise, be easy to realize mutual with the user.
Description of drawings
Fig. 1 shows the node type of derivation tree;
Fig. 2 is the flow chart of the growth course of tree;
Fig. 3 is the flow chart of the pruning process of tree.
Embodiment
Below by drawings and Examples, technical scheme of the present invention is described in further detail.
Whole process can be divided into two stages: growth of tree and the pruning of tree.
1) Shu growth
During an equipment, at first generate a node in operation, promptly want the operation carried out, be referred to as " destination node "; Then this step is operated specific to each operation of " cut-offfing equipment ", be referred to as " attribute node ", promptly added several " attribute nodes " in " destination node " bottom.
When operation certain " attribute node ", want " container " at apparatus operating place to judge whether this attribute node needs to trigger the operation of the miscellaneous equipment in the container by attribute node---seek " triggering node ".Trigger if desired, do not judge and can satisfy static security analysis having triggered afterwards to calculate by power loss analysis, trend.If can not satisfy static security, in outer one deck container of this container, seek the condition that new triggering node satisfies current triggering node again.
Fig. 2 is the flow chart of the growth course of tree.The method of this scheduling operating command ticket comprises growth and the pruning of intelligent inference tree, and the growth of intelligent inference tree may further comprise the steps: (1) beginning; (2) selection operation equipment; (3) finish; Wherein step (2) comprises step by step following: (2.1) generate destination node; (2.2) add one group of attribute node for destination node; (2.3) traversal obtains an attribute node; (2.4) judge whether to exist attribute node, if exist then execution in step (2.5), if there is no execution in step (3) then; (2.5) carry out attribute node, and associative operation is carried out power loss analysis and trend calculating; (2.6) check whether safety of dead electricity, anti-error and trend, if can not meet the requirements of (2.7), if meet the requirements of (2.3); (2.7) for adding one group, attribute node triggers node; (2.8) traversal triggers node; (2.9) check whether attribute node exists the triggering node, if there is no execution in step (2.3) is if exist execution in step (2.1) to generate new impact point.
2) Shu pruning
The pruning of tree can be divided into manual pruning again and prune automatically.
● manual pruning: manual pruning mainly is exactly a manual screening process to " branch ".Adopt good interactive interface, point out the user to select " branch " accordingly.After the user had selected certain " branch ", system will show the result who carries out this " branch " from figure, operation information, dead electricity information and trend information.If the dispatcher thinks that selecting this " branch " to have problem, system to provide returns function, and allows to select once more.That is to say that employing " guide pattern " finishes the whole reasoning of making out an invoice: at first traveling through out by " degree of depth elder generation preface first search " needs mutual node and points out the user to select branch; And then with " degree of depth elder generation preface first search " and carry out selected branch; Then travel through out the next mutual node that needs again.Guide the dispatcher to finish makes out an invoice so step by step.If the dispatcher finds a certain situation of own beyong contemplation now of walking out of, he can " returning previous step " reselect branch.
● prune automatically: according to " branch " situation various reasonable plan (branch implementation status) are all enumerated out, the user only need carry out " preview " to each scheme, decides which scheme of final selection.
Fig. 3 is the flow chart of the pruning process of tree.The pruning of described intelligent inference tree may further comprise the steps: (a1) beginning; (a2) judge whether complete, if variable finished is True, execution in step (a6) then, if otherwise execution in step (a3); (a3) look for next mutual node; (a4) node ID of returning according to the last time finds the mutual node of previous step; (a5) logical process of interactive interface; (a6) the root node Root of Deltree deletes chained list List; (a7) finish.
Preferably, described step (a3) comprises step by step following: (a3.1) degree of depth elder generation preface preferentially travels through root node Root, obtains the mutual node of a tree; (a3.2) judge whether mutual node exists, if there is execution in step (a3.3), if there is no execution in step (a3.5); (a3.3) judge whether mutual node was performed, if carried out then return execution in step (a3.1), if do not carry out execution in step (a3.4); (a3.4) obtain the interactive information and the node ID of this mutual node; (a3.5) all mutual nodes all traverse, and finished is arranged to True variable.
Further, described step (a4) comprises step by step following: (a4.1) degree of depth elder generation preface preferentially travels through node, obtains a child node; (a4.2) judge whether child node exists, if there is execution in step (a4.3), if there is no execution in step (a5); (a4.3) judge whether child node is deleted node, if return execution in step (a4.4), otherwise execution in step (a4.1); (a4.4) judge the child node type, if " dummy node " execution in step (a4.1), if be " task node " execution in step (a4.5), if " attribute node " execution in step (a4.6); (a4.5) obtain " degree of depth " of child node, and generate a comprehensive order; (a4.6) obtain the degree of depth of attribute node, carry out this node, carry out power loss analysis and an order item by item that generates is added in the chained list List.Preferably, described step (a4.5) comprises step by step following: (a4.5.1) List of the traversal overall situation, find an order item by item; (a4.5.2) judge whether to exist order item by item,, otherwise carry out (a4.1) if there is execution in step (a4.5.3); (a4.5.3) whether " degree of depth " of judging the node that order item by item is corresponding less than " degree of depth " of current task node, if greater than execution in step (a4.5.1), otherwise execution in step (a4.5.4); (a4.5.4) this made item by item add in the comprehensive order, among the chained list List deletion this make item by item.
Further, described step (a5) comprises step by step following: (a5.1) show operation information, dead electricity information, and information such as anti-error; (a5.2) user selects the current operation that may carry out; (a5.3) selection of process user is arranged to node of choosing that makes correspondence and child node thereof to carry out, and corresponding node and the child node thereof of nonoptional order is arranged to delete; (a5.4) user judges whether to continue to carry out, and still selects to get back to previous step and reselects, and still cancels this operation, if select next step, execution in step (a2) is if select previous step, execution in step (a5.5), if the user cancels this operation, execution in step (a6); (a5.5) according to mutual node ID, find mutual node, cancel the operation of this node correspondence; (a5.6) obtain the last mutual information that needs.Preferably, described step (a5.5) comprises step by step following: (a5.5.1) degree of depth postorder preferentially travels through node, obtains a child node; (a5.5.2) judge whether this child node exists, if there is no execution in step (a5.6) is if exist execution in step (a5.5.3); (a5.5.3) nodal community is arranged to not carry out; (a5.5.4) whether decision node is attribute node, if execution in step (a5.5.5); (a5.5.5) cancel this nodal operation, and carry out power loss analysis.Preferably, described step (a5.6) comprises step by step following: (a5.6.1) degree of depth postorder preferentially travels through, and obtains new mutual node ID; (a5.6.2) judge whether mutual node exists, if there is execution in step (a5.6.3), if the capable step of counter foil (a5.6.5) not; (a5.6.3) judge whether mutual node is carried out, if carry out, execution in step (a5.6.4), otherwise execution in step (a5.6.1); (a5.6.4) obtain the interactive information and the node ID of mutual node; (a5.6.5) prompting has been the first step.
The above; it only is preferred embodiment of the present invention; be not that the present invention is done any pro forma restriction, every foundation technical spirit of the present invention all still belongs to the protection range of technical solution of the present invention to any simple modification, equivalent variations and modification that above embodiment did.
Claims (8)
1. the generation method of scheduling operating command ticket, it comprises growth and the pruning of intelligent inference tree, the growth of intelligent inference tree may further comprise the steps: (1) beginning; (2) selection operation equipment; (3) finish; It is characterized in that: step (2) comprises step by step following:
(2.1) generate destination node;
(2.2) add one group of attribute node for destination node;
(2.3) traversal obtains an attribute node;
(2.4) judge whether to exist attribute node, if exist then execution in step (2.5), if there is no execution in step (3) then;
(2.5) carry out attribute node, and associative operation is carried out power loss analysis and trend calculating;
(2.6) check whether safety of dead electricity, anti-error and trend, if can not meet the requirements of (2.7), if meet the requirements of (2.3);
(2.7) for adding one group, attribute node triggers node;
(2.8) traversal triggers node;
(2.9) check whether attribute node exists the triggering node, if there is no execution in step (2.3) finishes if exist execution in step (2.1) to generate new impact point.
2. the generation method of scheduling operating command ticket according to claim 1 is characterized in that, the pruning of described intelligent inference tree may further comprise the steps: (a1) beginning; (a2) judge whether complete, if variable finished is True, execution in step (a6) then, otherwise execution in step (a3); (a3) look for next mutual node; (a4) node ID of returning according to the last time finds the mutual node of previous step; (a5) logical process of interactive interface; (a6) the root node Root of Deltree deletes chained list List; (a7) finish.
3. the generation method of scheduling operating command ticket according to claim 2 is characterized in that, described step (a3) comprises step by step following: (a3.1) degree of depth elder generation preface preferentially travels through root node Root, obtains the mutual node of a tree; (a3.2) judge whether mutual node exists, if there is execution in step (a3.3), if there is no execution in step (a3.5); (a3.3) judge whether mutual node was performed, if carried out then execution in step (a3.1), if do not carry out execution in step (a3.4); (a3.4) obtain the interactive information and the node ID of this mutual node; (a3.5) all mutual nodes all travel through, and finished is arranged to True variable.
4. the generation method of scheduling operating command ticket according to claim 3 is characterized in that, described step (a4) comprises step by step following: (a4.1) degree of depth elder generation preface preferentially travels through node, obtains a child node; (a4.2) judge whether child node exists, if there is execution in step (a4.3), if there is no execution in step (a5); (a4.3) judge whether child node is deleted node, if execution in step (a4.4), otherwise execution in step (a4.1); (a4.4) judge the child node type, if " dummy node " execution in step (a4.1), if " task node " execution in step (a4.5), if " attribute node " execution in step (a4.6); (a4.5) obtain " degree of depth " of child node, and generate a comprehensive order; (a4.6) obtain the degree of depth of attribute node, carry out this node, carry out power loss analysis and an order item by item that generates is added in the chained list List.
5. the generation method of scheduling operating command ticket according to claim 4 is characterized in that, described step (a4.5) comprises step by step following: (a4.5.1) List of the traversal overall situation, find an order item by item; (a4.5.2) judge whether to exist order item by item,, otherwise carry out (a4.1) if there is execution in step (a4.5.3); (a4.5.3) whether " degree of depth " of judging the node that order item by item is corresponding less than " degree of depth " of current task node, if greater than execution in step (a4.5.1), otherwise execution in step (a4.5.4); (a4.5.4) this made item by item add in the comprehensive order, among the chained list List deletion this make item by item.
6. the generation method of scheduling operating command ticket according to claim 5 is characterized in that, described step (a5) comprises step by step following: (a5.1) show operation information, dead electricity information, and information such as anti-error; (a5.2) user selects the current operation that may carry out; (a5.3) selection of process user is arranged to node of choosing that makes correspondence and child node thereof to carry out, and corresponding node and the child node thereof of nonoptional order is arranged to delete; (a5.4) user judges whether to continue to carry out, and still selects to get back to previous step and reselects, and still cancels this operation, if select next step, execution in step (a2) is if select previous step, execution in step (a5.5), if the user cancels this operation, execution in step (a6); (a5.5) according to mutual node ID, find mutual node, cancel the operation of this node correspondence; (a5.6) obtain the last mutual information that needs.
7. the generation method of scheduling operating command ticket according to claim 6 is characterized in that, described step (a5.5) comprises step by step following: (a5.5.1) degree of depth postorder preferentially travels through node, obtains a child node; (a5.5.2) judge whether this child node exists, if there is no execution in step (a5.6) is if exist execution in step (a5.5.3); (a5.5.3) nodal community is arranged to not carry out; (a5.5.4) whether decision node is attribute node, if execution in step (a5.5.5); (a5.5.5) cancel this nodal operation, and carry out power loss analysis.
8. the generation method of scheduling operating command ticket according to claim 7 is characterized in that, described step (a5.6) comprises step by step following: (a5.6.1) degree of depth postorder preferentially travels through, and obtains new mutual node ID; (a5.6.2) judge whether mutual node exists, if there is execution in step (a5.6.3), if the capable step of counter foil (a5.6.5) not; (a5.6.3) judge whether mutual node is carried out, if carry out, execution in step (a5.6.4), otherwise execution in step (a5.6.1); (a5.6.4) obtain the interactive information and the node ID of mutual node; (a5.6.5) prompting has been the first step.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010101944661A CN101888119B (en) | 2010-05-28 | 2010-05-28 | Generation method of scheduling operating command ticket |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010101944661A CN101888119B (en) | 2010-05-28 | 2010-05-28 | Generation method of scheduling operating command ticket |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101888119A true CN101888119A (en) | 2010-11-17 |
| CN101888119B CN101888119B (en) | 2012-07-18 |
Family
ID=43073891
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010101944661A Active CN101888119B (en) | 2010-05-28 | 2010-05-28 | Generation method of scheduling operating command ticket |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101888119B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102508059A (en) * | 2011-10-18 | 2012-06-20 | 北京科东电力控制系统有限责任公司 | Topology error-preventing checking method based on intelligent identification of state of equipment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5581694A (en) * | 1994-10-17 | 1996-12-03 | The United States Of America As Represented By The Administrator Of The National Aeronautics And Space Administration | Method of testing and predicting failures of electronic mechanical systems |
| CN101311959A (en) * | 2007-05-23 | 2008-11-26 | 上海申瑞电力科技股份有限公司 | Preposing subsystem of electric power scheduling automatization system |
| CN101371235A (en) * | 2006-01-23 | 2009-02-18 | Lg电子株式会社 | Device management scheduling method and apparatus thereof |
| CN201322778Y (en) * | 2008-12-02 | 2009-10-07 | 河南电力调度通信中心 | Measuring device for load characteristic of power system |
-
2010
- 2010-05-28 CN CN2010101944661A patent/CN101888119B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5581694A (en) * | 1994-10-17 | 1996-12-03 | The United States Of America As Represented By The Administrator Of The National Aeronautics And Space Administration | Method of testing and predicting failures of electronic mechanical systems |
| CN101371235A (en) * | 2006-01-23 | 2009-02-18 | Lg电子株式会社 | Device management scheduling method and apparatus thereof |
| CN101311959A (en) * | 2007-05-23 | 2008-11-26 | 上海申瑞电力科技股份有限公司 | Preposing subsystem of electric power scheduling automatization system |
| CN201322778Y (en) * | 2008-12-02 | 2009-10-07 | 河南电力调度通信中心 | Measuring device for load characteristic of power system |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102508059A (en) * | 2011-10-18 | 2012-06-20 | 北京科东电力控制系统有限责任公司 | Topology error-preventing checking method based on intelligent identification of state of equipment |
| CN102508059B (en) * | 2011-10-18 | 2013-09-25 | 北京科东电力控制系统有限责任公司 | Topology error-preventing checking method based on intelligent identification of state of equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101888119B (en) | 2012-07-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2016000341A1 (en) | Method and system for searching cross-regional power supply range based on cim model | |
| CN102403718B (en) | Generating method for power grid topological relationship based on Arcgis | |
| CN106155658A (en) | The behavior tree editing machine realized based on U3D Plugin Mechanism | |
| CN103414169B (en) | Based on relaying protection anti-error system and the method for work of automation system for the power network dispatching | |
| CN104318006B (en) | A kind of optimization method of virtual terminals of intelligent substation design | |
| CN102254056A (en) | Method for designing cable path of nuclear power station | |
| CN104933535A (en) | An intelligent monitoring operation ticket management method and a system thereof | |
| CN103714414A (en) | Process node returning method used for intelligent power grid dispatching | |
| CN102931727A (en) | Topological anti-error check method of power dispatching master station type integrated intelligent anti-error system | |
| CN108183502B (en) | Active power distribution network reconstruction method for promoting distributed energy consumption | |
| CN106021344B (en) | A kind of flexible CIME electric network model sharing method | |
| CN105608636A (en) | Rule mining-based power grid switching operation rule base building method | |
| CN115774915A (en) | Method and device for quickly constructing real-time topology of power grid | |
| CN105719102A (en) | Intelligentized power grid accident plan processing method | |
| CN104407577A (en) | Intelligent check anti-maloperation method based on real-time trend | |
| CN101888119B (en) | Generation method of scheduling operating command ticket | |
| CN109034403A (en) | A kind of urban rail transit equipment skeleton | |
| Ji et al. | Research on self healing technology of smart distribution network based on multi Agent system | |
| CN112416344B (en) | Black start path generation and system recovery decision making system based on 3D visualization technology | |
| CN106877497A (en) | A kind of electric power terminal communication access net and optimization method | |
| CN106250356A (en) | The fast resolving method of protective relaying device abstract object based on Hash table | |
| CN109740763A (en) | A kind of quantum wire neighbourization two-dimensional grid form selection method | |
| CN113659570B (en) | Elastic lifting-oriented power distribution network power-communication fault collaborative restoration method | |
| CN101853310A (en) | Method for producing preorder and postorder code of single traversing tree | |
| CN110852533A (en) | Automatic power grid operation flow extraction and equivalence method based on CIM/E and QS files |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C53 | Correction of patent of invention or patent application | ||
| CB03 | Change of inventor or designer information |
Inventor after: Zhou Qingjie Inventor after: Zhou Xinghua Inventor after: Qiu Xiangdong Inventor after: Wang Zhanxin Inventor after: Ge Zheng Inventor after: Wang Liqiang Inventor before: Zhou Xinghua Inventor before: Zheng Jian Inventor before: Ge Zheng Inventor before: Wang Liqiang |
|
| COR | Change of bibliographic data |
Free format text: CORRECT: INVENTOR; FROM: ZHOU XINGHUA ZHENG JIAN GE ZHENG WANG LIQIANG TO: ZHOU QINGJIE ZHOU XINGHUA CHOU XIANGDONG WANG ZHANXIN GE ZHENG WANG LIQIANG |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20200109 Address after: 612, block D, Jinyu Jiahua building, No.9, Shangdi Third Street, Dongcheng District, Beijing 100085 Co-patentee after: HANGZHOU ZHONHEN ELECTRIC Co.,Ltd. Patentee after: BEIJING JOIN BRIGHT DIGITAL POWER TECHNOLOGY Co.,Ltd. Address before: 100085, D, building nine, Ka Wah building, 612 3rd Street, Beijing, Haidian District Patentee before: BEIJING JOIN BRIGHT DIGITAL POWER TECHNOLOGY Co.,Ltd. |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20221116 Address after: 302-1, F3, No. 39, Xierqi street, Haidian District, Beijing 100089 Patentee after: BEIJING JOIN BRIGHT DIGITAL POWER TECHNOLOGY Co.,Ltd. Patentee after: HANGZHOU ZHONHEN ELECTRIC Co.,Ltd. Patentee after: BEIJING SGITG-ACCENTURE INFORMATION TECHNOLOGY Co.,Ltd. Address before: Room 612, Block D, Jinyu Jiahua Building, No. 9, Shangdi 3rd Street, Dongcheng District, Beijing 100085 Patentee before: BEIJING JOIN BRIGHT DIGITAL POWER TECHNOLOGY Co.,Ltd. Patentee before: HANGZHOU ZHONHEN ELECTRIC Co.,Ltd. |
|
| TR01 | Transfer of patent right |