METHOD AND DEVICE FOR ESTIMATING STATE OF POWER SYSTEM

Abstract

A method and a device for estimating a state of a power system are provided. The method includes: dividing the power system into a plurality of sub-systems; establishing a first linear model of the power system for a first stage; solving the first linear model by an alternating direction multiplier method to obtain the intermediate state variables of each sub-system; performing a nonlinear transformation at a second stage on the intermediate state variables to obtain intermediate measured values; establishing a second linear model of the power system for a third stage according to the intermediate measured values; and solving the third linear model by the alternating direction multiplier method to obtain the final state variables of each sub-system.

Claims

1. A method for estimating a state of a power system, performed by one or more computing devices and comprising: S1, dividing the power system into a plurality of sub-systems, each of the plurality of sub-systems comprising one or more buses as one or more nodes; S2, establishing a first linear model of the power system for a first stage, the first linear model comprising a first target function and a first constraint condition, the first target function ensuring minimizing a sum of first residual squares and first penalty terms of the plurality of sub-systems, the first residual square being obtained according to intermediate state variables of each sub-system, the first penalty term ensuring bad data sparsity at the first stage, the first constraint condition comprising a zero injection equality constraint of each of the plurality of sub-systems and constraints ensuring consistency of boundary state variables of adjacent sub-systems; S3, solving the first linear model by an alternating direction multiplier method to obtain the intermediate state variables of each of the plurality of sub-systems; S4, performing a nonlinear transformation on the intermediate state variables of each of the plurality of sub-systems at a second stage, to obtain intermediate measured values; S5, establishing a second linear model of the power system for a third stage according to the intermediate measured values, the second linear model comprising a second target function and a second constraint condition, the second target function ensuring minimizing a sum of second residual squares and second penalty terms of the plurality of sub-systems, the second residual square being obtained according to final state variables of each sub-system and the intermediate measured values, the second penalty term ensuring bad data sparsity at the third stage, the second constraint condition comprising equality constraints ensuring consistency of the boundary state variables of adjacent sub-systems; and S6, solving the second linear model by the alternating direction multiplier method to obtain the final state variables of each of the plurality of sub-systems.

2. The method according to claim 1, wherein the intermediate state variables are denoted as {U.sub.a,j, K.sub.a,ij, L.sub.a,ij}, in which
U.sub.a,i=V.sub.a,i.sup.2,
K.sub.a,ij=V.sub.a,iV.sub.a,j cos θ.sub.a,ij,
L.sub.a,ij=V.sub.a,iV.sub.a,j sin θ.sub.a,ij,
θ.sub.a,ij=θ.sub.a,i−θ.sub.a,j, where a represents a serial number of the sub-system, i and j represent a serial number of the node in the sub-system a respectively, ij represent a serial number of a branch in the sub-system a, V.sub.a,i represents a voltage amplitude of the node in the sub-system a, V.sub.a,j represents a voltage amplitude of the node j in the sub-system a, 0.sub.a,i represents a voltage phase angle of the node in the sub-system a, θ.sub.a,j represents a voltage phase angle of the node j in the sub-system a, and θ.sub.a,ij represents a voltage phase angle of the branch ij in the sub-system a.

3. The method according to claim 2, wherein the final state variables comprise voltage amplitudes and voltage phase angles of the nodes.

4. The method according to claim 3, wherein the first target function is denoted by a formula of $\min .Math.\underset{a=1}{\overset{R}{.Math.}}.Math..Math.J_a^f\left(y_a,o_a^f\right)=\underset{a=1}{\overset{R}{.Math.}}.Math..Math.\left[\frac{1}{2}.Math.{\left(z_a-B_a.Math.y_a-o_a^f\right)}^T.Math.\left(z_a-B_a.Math.y_a-o_a^f\right)+\lambda .Math.{.Math.o_a^f.Math.}_1\right]$ where min represents a minimizing operator, R represents the number of the plurality of sub-systems and is a positive integer greater than or equal to 2, J.sub.a.sup.f represents a first target function of the sub-system a, y.sub.a represents an intermediate state variable vector of the sub-system a and is denoted as {U.sub.a,i, K.sub.a,ij, L.sub.a,ij}, o.sub.a.sup.f represents a bad data vector of the sub-system a at the first stage, z.sub.a represents a measured value vector of the sub-system a and comprises a measured voltage amplitude value, a measured branch active power value, a measured branch reactive power value, a measured node injection active power value and a measured node injection reactive power value, B.sub.a represents a measured matrix of the sub-system a at the first stage, ∥ ∥.sub.1 represents 1-norm, λ represents a constant, and λ∥o.sub.a.sup.f∥.sub.1 represents the first penalty term of the sub-system a.

5. The method according to claim 4, wherein elements in B, are determined according to formulas of $P_{a,i}^m=\underset{j\in i}{\overset{j\ne i}{.Math.}}.Math..Math.\left[\left(g_{\mathrm{sh},i}+g_{\mathrm{ij}}\right).Math.U_{a,i}-g_{\mathrm{ij}}.Math.K_{a,\mathrm{ij}}-b_{\mathrm{ij}}.Math.L_{a,\mathrm{ij}}\right]+{\mathrm{.Math.}}_P$ $Q_{a,i}^m=\underset{j\in i}{\overset{j\ne i}{.Math.}}.Math..Math.\left[-\left(b_{\mathrm{sh},i}+b_{\mathrm{ij}}\right).Math.U_{a,i}-g_{\mathrm{ij}}.Math.L_{a,\mathrm{ij}}+b_{\mathrm{ij}}.Math.K_{a,\mathrm{ij}}\right]+{\mathrm{.Math.}}_Q$ $P_{a,\mathrm{ij}}^m=\left(g_{\mathrm{sh},i}+g_{\mathrm{ij}}\right).Math.U_{a,i}-g_{\mathrm{ij}}.Math.K_{a,\mathrm{ij}}-b_{\mathrm{ij}}.Math.L_{a,\mathrm{ij}}+{\mathrm{.Math.}}_P$ $Q_{a,\mathrm{ij}}^m=-\left(b_{\mathrm{sh},i}+b_{\mathrm{ij}}\right).Math.U_{a,i}-g_{\mathrm{ij}}.Math.L_{a,\mathrm{ij}}+b_{\mathrm{ij}}.Math.K_{a,\mathrm{ij}}+{\mathrm{.Math.}}_Q$ $U_{a,i}^m=U_{a,i}+{\mathrm{.Math.}}_U$ where P.sub.a,i.sup.m represents a measured injection active power value of the node i in the sub-system a, Q.sub.a,i.sup.m represents a measured injection reactive power value of the node i in the sub-system a, P.sub.a,ij.sup.m represents a measured active power value of the branch ij in the sub-system a at terminal i, Q.sub.a,ij.sup.m represents a measured reactive power value of the branch ij in the sub-system a at terminal i, U.sub.a,i.sup.m represents a square of a measured voltage amplitude of the node i in the sub-system a, g.sub.ij represents a conductance of the branch ij, g.sub.sh,i, represents a shunt conductance of the node i, b.sub.ij represents a susceptance of the branch ij, b.sub.sh,i, represents a shunt susceptance of the node i, ε.sub.P,ε.sub.Q,ε.sub.U, represent error items of the measured active power value, the measured reactive power value and the square of the measured voltage amplitude respectively.

6. The method according to claim 4, wherein the zero injection equality constraint of the sub-system is denoted by a formula of
E.sub.ay.sub.a=0, ∀a where E.sub.a represents a zero injection measured matrix of the sub-system a; the constraint ensuring consistency of boundary state variables of adjacent sub-systems is denoted by a formula of $\begin{array}{c}{K}_{a,\mathrm{ij}}=K_{b,\mathrm{ij}}\\ L_{a,\mathrm{ij}}=L_{b,\mathrm{ij}}\end{array},\forall \left(i,j\right)\in {\Gamma }_{a,b},\forall b\in {\Delta }_a,\forall a$ where b represents a serial number of a sub-system adjacent to the sub-system a, Δ.sub.a represents a set of sub-systems adjacent to the sub-system a, Γ.sub.a,b represents a set of call wires between the sub-system a and the sub-system b.

7. The method according to claim 6, wherein S3 comprises: S30, initializing a first iteration subscript t.sub.i of the alternating direction multiplier method to be equal to 0, and setting a first convergence criteria ε.sup.f of the alternating direction multiplier method as ε.sup.f∈R.sup.+, where R.sup.+ represents a set of real numbers; S31, updating the intermediate state variable vector of the sub-system a according to a formula of
y.sub.a.sup.t+1=Ĝ.sub.B,a.sup.−1(I−E.sub.a.sup.T{circumflex over (B)}.sub.a)[B.sub.a.sup.T(z.sub.a−o.sub.a.sup.f,t)+ρ.sup.fŷ.sub.a.sup.t]+{circumflex over (B)}.sub.a.sup.Tz.sub.e,a where ρ.sup.f∈R.sup.+ represents a first penalty factor of the alternating direction multiplier method, Ĝ.sub.B,a=B.sub.a.sup.TB.sub.a+ρ.sup.fI represents an augmented information matrix at the first stage, I represents a unit matrix, ŷ.sub.a.sup.t represents an auxiliary intermediate state variable vector of the sub-system a at t.sub.i.sup.th iteration and comprises auxiliary intermediate state variables {.Math..sub.a.sup.t, {circumflex over (K)}.sub.a.sup.t, {circumflex over (L)}.sub.a.sup.t} corresponding to {U.sub.a, K.sub.a, L.sub.a}, {circumflex over (B)}.sub.a=(E.sub.aĜ.sub.B,a.sup.−1E.sub.a.sup.T).sup.−1E.sub.aĜ.sub.B,a.sup.−1 represents an auxiliary measured matrix of the sub-system a at the first stage; S32, updating the bad data variable vector of the sub-system a at the first stage according to a formula of
o.sub.a.sup.f,t+1=[z.sub.a−B.sub.ay.sub.a.sup.t+1].sub.λ.sup.+ where [.Math.].sub.λ.sup.+ represents a threshold operator, which corresponds to preforming an Operation on each component in z.sub.a−B.sub.ay.sub.a.sup.t+1 according to a formula of ${\left[{\xi }_a\left(l\right)\right]}_{\lambda }^{+}=\{\begin{array}{cc}{\xi }_a\left(l\right)+\lambda ,& {\xi }_a\left(l\right)<-\lambda \\ {\xi }_a\left(l\right)-\lambda ,& {\xi }_a\left(l\right)>\lambda \\ 0,& \mathrm{others}\end{array}$ where l represents a serial number of each component, and ξ.sub.a(l) represents l.sup.th component in z.sub.a−B.sub.ay.sub.a.sup.t+1; S33, computing mean values of boundary interactive auxiliary variables K and L of the sub-systems a and b according to a formula of $\begin{array}{c}{\stackrel{\_}{K}}_{a,\mathrm{ij}}^{i+1}=\frac{1}{2}.Math.\left(K_{a,\mathrm{ij}}^{i+1}+K_{b,\mathrm{ij}}^{i+1}\right)\\ {\stackrel{\_}{L}}_{a,\mathrm{ij}}^{i+1}=\frac{1}{2}.Math.\left(L_{a,\mathrm{ij}}^{i+1}+L_{b,\mathrm{ij}}^{i+1}\right)\end{array},\forall \left(i,j\right)\in {\Gamma }_{a,b},\forall b\in {\Delta }_a;$ S34, updating auxiliary intermediate state variables of the sub-system a according to a formula of
{circumflex over (K)}.sub.a,ij.sup.t+1={circumflex over (K)}.sub.a,ij.sup.t+2K.sub.a,ij.sup.t+1−K.sub.a,ij.sup.t−K.sub.a,ij.sup.t+1{circumflex over (L)}.sub.a,ij.sup.t+1={circumflex over (L)}.sub.a,ij.sup.t+2L.sub.a,ij.sup.t+1−L.sub.a,ij.sup.t−L.sub.a,ij.sup.t+1, ∀(i, j)∈Γ.sub.a,b, ∀b∈Δ.sub.a where {circumflex over (K)}.sub.a,ij.sup.t+1, {circumflex over (L)}.sub.a,ij.sup.t+1 represent components of y.sub.a.sup.t+1 respectively; S35, judging whether the alternating direction multiplier method converges at the first stage; and S36, t.sub.1:=t.sub.1+1 and returning to S31 if the alternating direction multiplier method does not converge, and executing S4 if the alternating direction multiplier method converges.

8. The method according to claim 7, wherein S35 comprises: calculating a first original residual vector according to a formula of $r^{f,i}=\frac{1}{2}.Math.\left\{.Math.K_{a,\mathrm{ij}}^i-K_{b,\mathrm{ij}}^i.Math.,.Math.L_{a,\mathrm{ij}}^i-L_{b,\mathrm{ij}}^i.Math.|\forall \left(i,j\right)\in {\Gamma }_{a,b},\forall b\in {\Delta }_a,\forall a\right\};$ calculating a first antithesis residual vector according to a formula of
d.sup.ft={|K.sub.a,ij.sup.t−K.sub.a,ij.sup.t+1|, |L.sub.a,ij.sup.t−L.sub.a,ij.sup.t+1||∀(i, j)∈Γ.sub.a,b, ∀b∈Δ.sub.a, ∀.sub.a}; calculating a first total residual according to a formula of ${\delta }^{f,i}={.Math.\left(\begin{array}{c}{r}^{f,i}\\ d^{f,i}\end{array}\right).Math.}_{\infty };$ judging whether δ.sup.f J≧ε.sup.f; and judging that the alternating direction multiplier method does not converge if δ.sup.f j≧ε.sup.f, and judging that the alternating direction multiplier method converges if δ.sup.f j<ε.sup.f.

9. The method according to claim 8, wherein S4 comprises: performing the nonlinear transformation on the intermediate state variables of sub-system a to obtain the intermediate measured values {a.sub.a,i, θ.sub.a,ij, a.sub.a,ij) according to formulas of ${\alpha }_{a,i}=\ln .Math..Math.U_{a,i}$ ${\alpha }_{a,\mathrm{ij}}=\ln \left(K_{a,\mathrm{ij}}^2+L_{a,\mathrm{ij}}^2\right)$ ${\theta }_{a,\mathrm{ij}}=\arctan \left(\frac{L_{a,\mathrm{ij}}}{K_{a,\mathrm{ij}}}\right).$

10. The method according to claim 9, wherein the second target function is denoted by a formula of $\min .Math..Math.J^s\left(x,o^s\right)=\underset{a=1}{\overset{R}{.Math.}}.Math..Math.J_a^s\left(x_a,o_a^s\right)=\underset{a=1}{\overset{R}{.Math.}}.Math..Math.\left[\frac{1}{2}.Math.{\left({\tilde{u}}_a-C_a.Math.x_a-o_a^s\right)}^T.Math.\left({\tilde{u}}_a-C_a.Math.x_a-o_a^s\right)+\lambda .Math.{.Math.o_a^s.Math.}_1\right]$ where J.sub.a.sup.s represents a second target function of the sub-system a , x.sub.a represents a final state variable vector of the sub-system a, o.sub.a.sup.s represents a bad data vector of the sub-system a at the second stage, λ∥o.sub.a.sup.s∥.sub.1 represents the second penalty term of the sub-system a, ū.sub.a represents the intermediate measured value vector obtained in S4, c.sub.a represents a measured matrix of the sub-system a at the second stage.

11. The method according to claim 10, wherein elements in c.sub.a are determined according to formulas of
α.sub.a,ij=α.sub.a,i+α.sub.a,j+ε.sub.a
θ.sub.a,ij=θ.sub.a,i−θ.sub.a,j+ε.sub.θ where ε.sub.a, ε.sub.θ represent error items of α.sub.a,ij,θ.sub.a,ij at the third stage respectively.

12. The method according to claim 11, wherein the equality constraint ensuring consistency of the boundary state variables of adjacent sub-systems is denoted by a formula of
s.t. x.sub.a,i=x.sub.b,i, ∀i∈{circumflex over (N)}.sub.a.sup.BB,∀a where st. means subjecting to, x.sub.a,i represents a state variable of the node i of the sub-system a, x.sub.b,i represents a state variable of the node i of the sub-system b, and {circumflex over (N)}.sub.a.sup.BB represents a set of boundary nodes.

13. The method according to claim 12, wherein S6 comprises: S60, initializing a second iteration subscript of the alternating direction multiplier method to be equal to 0, and setting a second convergence criteria ε.sup.s of the alternating direction multiplier method as ε.sup.s∈R.sup.+; S61, updating the final state variable vector of the sub-system a according to a formula of
x.sub.a.sup.t+1=Ĝ.sub.C,a.sup.t−1(C.sub.a.sup.T(ũ.sub.a−o.sub.a.sup.s.t)+ρ.sub.s{circumflex over (x)}.sub.a.sup.t), ∀a where ρ.sup.s∈R.sup.+ represents a second penalty factor of the alternating direction multiplier method, Ĝ.sub.C,a=C.sub.a.sup.TC.sub.a+ρ.sup.sI represents an augmented information matrix at the third stage, {circumflex over (x)}.sub.a.sup.t represents an auxiliary final state variable vector of the sub-system a at t.sub.2.sup.th iteration and an initial value of which is 0; S62, updating the bad data variable vector of the sub-system a at the third stage according to a formula of
o.sub.a.sup.s.t+1=[ũ.sub.a−C.sub.ax.sub.a.sup.t+1].sub.λ.sup.+; S63, computing a mean value of state variables of any boundary node i of the sub-system a according to a formula of ${\stackrel{\_}{x}}_{a,i}^{i+1}=\frac{1}{m_i}.Math.\underset{a\in M_i}{.Math.}.Math..Math.x_{a,i}^{i+1},\forall i\in {\hat{N}}_a^{\mathrm{BB}}$ where M.sub.i represents a set of sub-systems comprising the node i, and m.sub.i represents the number of sub-systems comprising the node i; S64, updating auxiliary final state variables of the sub-system a according to a formula of and
{circumflex over (x)}.sub.a,i.sup.t+1={circumflex over (x)}.sub.a,i.sup.t+2x.sub.a,i.sup.t+1−x.sub.a,i.sup.t+1, ∀i∈{circumflex over (N)}.sub.a.sup.BB; S65, judging whether the alternating direction multiplier method converges at the third stage; and S66, t.sub.2:=t.sub.2+1 and returning to S61 if the alternating direction multiplier method does not converge, and outputting x.sub.a of the sub-system a as the final state variables of the sub-system a in the power system if the alternating direction multiplier method converges.

14. The method according to claim 13, wherein S65 comprises: calculating a second original residual vector according to a formula of $r^{s,i}=\frac{1}{2}.Math.\left\{.Math.x_{a,i}^i-x_{b,i}^i.Math.|\forall i\in {\hat{N}}_a^{\mathrm{BB}},\forall b\in {\Delta }_a,\forall a\right\};$ calculating second antithesis residual vectors according to formulas of, $d^{s,i}=\frac{1}{2}.Math.\left\{.Math.{\stackrel{\_}{x}}_{a,i}^i-{\stackrel{\_}{x}}_{a,i}^{i-1}.Math.|\forall i\in {\hat{N}}_a^{\mathrm{BB}},\forall b\in {\Delta }_a,\forall a\right\},.Math.d^{f,i}=\left\{.Math.{\stackrel{\_}{K}}_{a,\mathrm{ij}}^i-{\stackrel{\_}{K}}_{a,\mathrm{ij}}^{i-1}.Math.,.Math.{\stackrel{\_}{L}}_{a,\mathrm{ij}}^i-{\stackrel{\_}{L}}_{a,\mathrm{ij}}^{i-1}.Math.|\forall \left(i,j\right)\in {\Gamma }_{a,b},\forall b\in {\Delta }_a,\forall a\right\};$ calculating a second total residual according to a formula of ${\delta }^{s,i}={.Math.\left(\begin{array}{c}{r}^{s,i}\\ d^{s,i}\end{array}\right).Math.}_{\infty };$ judging whether δ.sup.s,i≧ε.sup.s; and judging that the alternating direction multiplier method does not converge if δ.sup.s,i≧ε.sup.s, and judging that the alternating direction multiplier method converges if δ.sup.s.t<ε.sup.s.

15. A device for estimating a state of a power system, comprising: a processor; a memory configured to store an instruction executableby the processor; wherein the processor is configured to: divide the power system into a plurality of sub-systems, each of the plurality of sub-systems comprising one or more buses as one or more nodes; establish a first linear model of the power system for a first stage, the first linear model comprising a first target function and a first constraint condition, the first target function ensuring minimizing a sum of first residual squares and first penalty terms of the plurality of sub-systems, the first residual square being obtained according to intermediate state variables of each sub-system, the first penalty term ensuring bad data sparsity at the first stage, the first constraint condition comprising a zero injection equality constraint of each of the plurality of sub-systems and constraints ensuring consistency of boundary state variables of adjacent sub-systems; solve the first linear model by an alternating direction multiplier method to obtain the intermediate state variables of each of the plurality of sub-systems; perform a nonlinear transformation on the intermediate state variables of each of the plurality of sub-systems at a second stage, to obtain intermediate measured values; establish a second linear model of the power system for a third stage according to the intermediate measured values, the second linear model comprising a second target function and a second constraint condition, the second target function ensuring minimizing a sum of second residual squares and second penalty terms of the plurality of sub-systems, the second residual square being obtained according to final state variables of each sub-system and the intermediate measured values, the second penalty term ensuring bad data sparsity at the third stage, the second constraint condition comprising equality constraints ensuring consistency of the boundary state variables of adjacent sub-systems; and solve the second linear model by the alternating direction multiplier method to obtain the final state variables of each of the plurality of sub-systems.

16. A non-transitory computer readable storage medium having stored therein instructions that, when executed by a processor of a computing device, causes the computing device to perform a method for estimating a state of a power system, the method comprising: S1, dividing the power system into a plurality of sub-systems, each of the plurality of sub-systems comprising one or more buses as one or more nodes; S2, establishing a first linear model of the power system for a first stage, the first linear model comprising a first target function and a first constraint condition, the first target function ensuring minimizing a sum of first residual squares and first penalty terms of the plurality of sub-systems, the first residual square being obtained according to intermediate state variables of each sub-system, the first penalty term ensuring bad data sparsity at the first stage, the first constraint condition comprising a zero injection equality constraint of each of the plurality of sub-systems and constraints ensuring consistency of boundary state variables of adjacent sub-systems; S3, solving the first linear model by an alternating direction multiplier method to obtain the intermediate state variables of each of the plurality of sub-systems; S4, performing a nonlinear transformation on the intermediate state variables of each of the plurality of sub-systems at a second stage, to obtain intermediate measured values; S5, establishing a second linear model of the power system for a third stage according to the intermediate measured values, the second linear model comprising a second target function and a second constraint condition, the second target function ensuring minimizing a sum of second residual squares and second penalty terms of the plurality of sub-systems, the second residual square being obtained according to final state variables of each sub-system and the intermediate measured values, the second penalty term ensuring bad data sparsity at the third stage, the second constraint condition comprising equality constraints ensuring consistency of the boundary state variables of adjacent sub-systems; and S6, solving the second linear model by the alternating direction multiplier method to obtain the final state variables of each of the plurality of sub-systems.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0011] These and other aspects and advantages of embodiments of the present disclosure will become apparent and more readily appreciated from the following descriptions made with reference to the drawings, in which:

[0012] FIG. 1 is a flow chart showing a method for estimating a state of a power system according to an embodiment of the present disclosure;

[0013] FIG. 2 is a schematic diagram illustrating solving at a first stage according to an embodiment of the present disclosure; and

[0014] FIG. 3 is a schematic diagram illustrating solving at a third stage according to an embodiment of the present disclosure.

DETAILED DESCRIPTION

[0015] Reference will be made in detail to embodiments of the present disclosure. The embodiments described herein with reference to drawings are explanatory, illustrative, and used to generally understand the present disclosure. The embodiments shall not be construed to limit the present disclosure, in contrast, the present disclosure may include alternatives, modifications and equivalents within the spirit and scope of the appended claims. The same or similar elements and the elements having same or similar functions are denoted by like reference numerals throughout the descriptions.

[0016] In addition, terms such as “first” and “second” are used herein for purposes of description and are not intended to indicate or imply relative importance or significance. In the description of the present disclosure, it should be understood that, unless specified or limited otherwise, the terms “mounted,” “connected,” and “coupled” and variations thereof are used broadly and encompass such as mechanical or electrical mountings, connections and couplings, also can be inner mountings, connections and couplings of two components, and further can be direct and indirect mountings, connections, and couplings, which can be understood by those skilled in the art according to the detail embodiment of the present disclosure. In the description of the present disclosure, “a plurality of” means two or more, unless specified otherwise.

[0017] The centralized management way is used to estimate the state of the power system in the related art, which has some problems, such as communication congestion, a bottleneck of processing information, maintenance issues, privacy issues, etc. Therefore, embodiments of the present disclosure provide a method and a device for estimating a state of a power system, which may protect data privacy for each sub-system very well, suppress influence caused by bad data by using a very small amount of interactive information between each sub-system only, and have a high agility and robustness.

[0018] The above problems in the related art will encourage the centralized state estimation to become the distributed architecture, and the decision-making mechanism becomes an autonomous mode from a single mode. The distributed architecture does not require the centralized management and coordination for each sub-system and each sub-system is completely autonomous and computes its problems in parallel and interacts with the adjacent sub-system about interaction boundary information, so the state variable of the whole system may be obtained accurately and the influence caused by bad data may be suppressed.

[0019] FIG. 1 is a flow chart showing a method for estimating a state of a power system according to an embodiment of the present disclosure. As shown in FIG. 1, the method includes following steps.

[0020] In step S1, the power system is divided into a plurality of sub-systems, and each of the plurality of sub-systems includes one or more buses as one or more nodes and one or more generators attaching to each bus.

[0021] It is assumed that the power system is divided into R (which is a positive integer greater than or equal to 2) sub-systems, and sub-systems a and b are any two adjacent sub-systems in R sub-systems. A set of nodes of the sub-system a is defined as M.sub.j:={a|j⊂{circumflex over (N)}.sup.a}, in which represents a defining operator, j represents any node in the sub-system a, {circumflex over (N)}.sup.a represents the number of nodes in sub-system a, and the number of sub-systems including the node j is defined as m.sub.j:=|M.sub.j|.

[0022] In step S2, a first linear model of the power system for a first stage is established, in which the first linear model is distributed and includes a first target function and a first constraint condition, the first target function ensures minimizing a sum of first residual squares and first penalty terms of the plurality of sub-systems, the first square is obtained according to intermediate state variables of each sub-system, the first penalty term ensures bad data sparsity at the first stage, the first constraint condition includes a zero injection equality constraint of each of the plurality of sub-systems and constraints ensuring consistency of boundary state variables of adjacent sub-systems.

[0023] As shown in FIG. 2, the sub-systems a and h are any two adjacent sub-systems in the power system, and the sub-system a includes nodes 1, 2, and 4, which is defined as N.sup.a={1,2,4 . . . }, and the sub-system h includes nodes 3 and 5, which is defined as N.sup.b={3,5 . . . }.

[0024] In an embodiment of the present disclosure, the intermediate state variables are denoted as {U.sub.a,i, K.sub.a,ij, L.sub.a,ij}, in which

U.sub.a,i=V.sub.a,i.sup.2,

K.sub.a,ij=V.sub.a,iV.sub.a,j cos θ.sub.a,ij,

L.sub.a,ij=V.sub.a,iV.sub.a,j sin θ.sub.a,ij,

θ.sub.a,ij=θ.sub.a,i−θ.sub.a,j,

where a represents a serial number of the sub-system, i and j represent a serial number of the node in the sub-system a respectively, ij represent a serial number of a branch in the sub-system a, V.sub.a,i represents a voltage amplitude of the node r in the sub-system a, V.sub.a,j represents a voltage amplitude of the node j in the sub-system a, 0.sub.a,i represents a voltage phase angle of the node in the sub-system a, θ.sub.a,j represents a voltage phase angle of the node j in the sub-system a, and θ.sub.a,ij represents a voltage phase angle of the branch ij in the sub-system a.

[0025] In an embodiment of the present disclosure, the first target function is denoted by a formula of

[00001]$\min .Math.\underset{a=1}{\overset{R}{.Math.}}.Math..Math.J_a^f\left(y_a,o_a^f\right)=\underset{a=1}{\overset{R}{.Math.}}.Math..Math.\left[\frac{1}{2}.Math.{\left(z_a-B_a.Math.y_a-o_a^f\right)}^T.Math.\left(z_a-B_a.Math.y_a-o_a^f\right)+\lambda .Math.{.Math.o_a^f.Math.}_1\right]$

where min represents a minimizing operator, R represents the number of the plurality of sub-systems and is a positive integer greater than or equal to 2, J.sub.a.sup.f represents a first target function of the sub-system a, y.sub.a represents an intermediate state variable vector of the sub-system a and is denoted as {U.sub.a,i, K.sub.a,ij, L.sub.a,ij}, o.sub.a.sup.f represents a bad data vector of the sub-system a at the first stage, z.sub.a represents a measured value vector of the sub-system a and includes a measured voltage amplitude value, a measured branch active power value, a measured branch reactive power value, a measured node injection active power value and a measured node injection reactive power value, B.sub.a represents a measured matrix of the sub-system a at the first stage, ∥ ∥.sub.1 represents 1-norm, λ represents a constant, usually, the value of which may be 1.34e-2, and λ∥o.sub.a.sup.f∥.sub.1 represents the first penalty term of the sub-system a.

[0026] In an embodiment of the present disclosure, elements in B.sub.a are determined according to formulas of

[00002]$P_{a,i}^m=\underset{j\in i}{\overset{j\ne i}{.Math.}}.Math..Math.\left[\left(g_{\mathrm{sh},i}+g_{\mathrm{ij}}\right).Math.U_{a,i}-g_{\mathrm{ij}}.Math.K_{a,\mathrm{ij}}-b_{\mathrm{ij}}.Math.L_{a,\mathrm{ij}}\right]+{\mathrm{.Math.}}_P$$Q_{a,i}^m=\underset{j\in i}{\overset{j\ne i}{.Math.}}.Math..Math.\left[-\left(b_{\mathrm{sh},i}+b_{\mathrm{ij}}\right).Math.U_{a,i}-g_{\mathrm{ij}}.Math.L_{a,\mathrm{ij}}+b_{\mathrm{ij}}.Math.K_{a,\mathrm{ij}}\right]+{\mathrm{.Math.}}_Q$$P_{a,\mathrm{ij}}^m=\left(g_{\mathrm{sh},i}+g_{\mathrm{ij}}\right).Math.U_{a,i}-g_{\mathrm{ij}}.Math.K_{a,\mathrm{ij}}-b_{\mathrm{ij}}.Math.L_{a,\mathrm{ij}}+{\mathrm{.Math.}}_P$$Q_{a,\mathrm{ij}}^m=-\left(b_{\mathrm{sh},i}+b_{\mathrm{ij}}\right).Math.U_{a,i}-g_{\mathrm{ij}}.Math.L_{a,\mathrm{ij}}+b_{\mathrm{ij}}.Math.K_{a,\mathrm{ij}}+{\mathrm{.Math.}}_Q$$U_{a,i}^m=U_{a,i}+{\mathrm{.Math.}}_U$

where P.sub.a,i.sup.m, represents a measured injection active power value of the node i in the sub-system a, Q.sub.a,i.sup.m represents a measured injection reactive power value of the node in the sub-system a, represents a measured active power value of the branch ij in the sub-system a at terminal i, Q.sub.a,ij.sup.m represents a measured reactive power value of the branch ij in the sub-system a at terminal i, U.sub.a,i.sup.m, represents a square of a measured voltage amplitude of the node e in the sub-system a, represents a conductance of the branch ij, g.sub.sh,i represents a shunt conductance of the node i, b.sub.ij represents a susceptance of the branch represents a shunt susceptance of the node i, ε.sub.p, ε.sub.Q, ε.sub.U, represent error items of the measured active power value, the measured reactive power value and the square of the measured voltage amplitude respectively.

[0027] In an embodiment of the present disclosure, the zero injection equality constraint of the sub-system is denoted by a formula of

E.sub.ay.sub.a=0, ∀a

where E.sub.a represents a zero injection measured matrix of the sub-system a;

[0028] the constraint ensuring consistency of boundary state variables of each adjacent sub-systems is denoted by a formula of

[00003]$\begin{array}{c}{K}_{a,\mathrm{ij}}=K_{b,\mathrm{ij}}\\ L_{a,\mathrm{ij}}=L_{b,\mathrm{ij}}\end{array},.Math.\forall \left(i,j\right)\in {\Gamma }_{a,b},\forall b\in {\Delta }_a,\forall a$

where b represents a serial number of a sub-system adjacent to the sub-system a, Δ.sub.a represents a set of sub-systems adjacent to the sub-system a, Γ.sub.a,b represents a set of call wires between the sub-system a and the sub-system b. For example, as shown in FIG. 2, in the call wire 1-3, the constraint K.sub.a,13=K.sub.b,13, L.sub.a,13=L.sub.b,13 to ensure the consistency of boundary state variables of adjacent sub-systems.

[0029] In step S3, the first linear model is solved by an alternating direction multiplier method to obtain the intermediate state variables of each of the plurality of sub-systems.

[0030] In an embodiment of the present disclosure, step S3 includes following step S30-S36.

[0031] In step S30, a first iteration subscript t.sub.i of the alternating direction multiplier method is initialized to be equal to 0, and a first convergence criteria ε.sup.f of the alternating direction multiplier method is set as ε.sup.f∈R.sup.+, where R.sup.+ represents a set of real numbers.

[0032] In step S31, the intermediate state variable vector of the sub-system a is updated according to a formula of

y.sub.a.sup.t+1=Ĝ.sub.R,a.sup.−1(I−E.sub.a.sup.T{circumflex over (B)}.sub.a)[B.sub.a.sup.T(z.sub.a−o.sub.a.sup.f,t)+ρ.sup.iŷ.sub.a.sup.t)+{circumflex over (B)}.sub.a.sup.Tz.sub.e,a

where ρ.sup.j∈R.sup.+ represents a first penalty factor of the alternating direction multiplier method, the value of which is equal to 1, Ĝ.sub.B,a=B.sub.a.sup.TB.sub.a+ρ.sup.fI represents an augmented information matrix at the first stage, I represents a unit matrix, ŷ.sub.a.sup.t represents an auxiliary intermediate state variable vector of the sub-system a at t, iteration and includes auxiliary intermediate state variables {.Math..sub.a.sup.t, K.sub.a.sup.t, L.sub.a.sup.t} corresponding to {U.sub.a, K.sub.a, L.sub.a}, the initial value {.Math..sub.a.sup.0, {circumflex over (K)}.sub.a.sup.0, {circumflex over (L)}.sub.a.sup.0}=1,1,0}, {circumflex over (B)}.sub.a=(E.sub.aĜ.sub.B,a.sup.−1E.sub.a.sup.T).sup.−1E.sub.aĜ.sub.B,a.sup.−1 represents an auxiliary measured matrix of the sub-system a at the first stage.

[0033] In step S32, the had data variable vector of the sub-system a at the first stage is updated according to a formula of

o.sub.a.sup.f,t+1=[z.sub.a B.sub.ay.sub.a.sup.t+1].sub.λ.sup.+

where [.Math.].sub.λ.sup.+ threshold operator, which corresponds to preforming an operation on each component in z.sub.a−B.sub.ay.sub.a.sup.t+1 according to a R.sup.t represents a set of real numbers

[00004]${\left[{\xi }_a\left(l\right)\right]}_{\lambda }^{+}=\{\begin{array}{cc}{\xi }_a\left(l\right)+\lambda ,& {\xi }_a\left(l\right)<-\lambda \\ {\xi }_a\left(l\right)-\lambda ,& {\xi }_a\left(l\right)>\lambda \\ 0,& \mathrm{others}\end{array}$

where l represents a serial number of each component, and ξ.sub.a(l) represents l.sup.th component in z.sub.a-B.sub.ay.sub.a.sup.t+1.

[0034] In step S33, mean values of boundary interactive auxiliary variables K and L of the sub-systems a and b are computed according to a formula of

[00005]$\begin{array}{c}{\stackrel{\_}{K}}_{a,\mathrm{ij}}^{i+1}=\frac{1}{2}.Math.\left(K_{a,\mathrm{ij}}^{i+1}+K_{b,\mathrm{ij}}^{i+1}\right)\\ {\stackrel{\_}{L}}_{a,\mathrm{ij}}^{i+1}=\frac{1}{2}.Math.\left(L_{a,\mathrm{ij}}^{i+1}+L_{b,\mathrm{ij}}^{i+1}\right)\end{array},.Math.\forall \left(i,j\right)\in {\Gamma }_{a,b},\forall b\in {\Delta }_a.$

[0035] In step S34, auxiliary intermediate state variables of the sub-system a are updated according to a formula of

{circumflex over (K)}.sub.a,ij.sup.t+1={circumflex over (K)}.sub.a,ij.sup.t+2K.sub.a,ij.sup.t+1−K.sub.a,ij.sup.t−K.sub.a,ij.sup.t+1{circumflex over (L)}.sub.a,ij.sup.t+1={circumflex over (L)}.sub.a,ij.sup.t+2L.sub.a,ij.sup.t−L.sub.a,ij.sup.t+1, ∀(i, j)∈Γ.sub.a,b∀b∈Δ.sub.a

where {circumflex over (K)}.sub.a,ij.sup.t+1, {circumflex over (L)}.sub.a,ij.sup.t+1 represent components of ŷ.sub.a.sup.t+1 respectively.

[0036] In step S35, it is judged whether the alternating direction multiplier method converges at the first stage.

[0037] In an embodiment of the present disclosure, S35 includes:

[0038] calculating a first original residual vector according to a formula of

[00006]$r^{f,t}=\frac{1}{2}.Math.\left\{.Math.K_{a,\mathrm{ij}}^i-K_{b,\mathrm{ij}}^i.Math.,.Math.L_{a,\mathrm{ij}}^i-L_{b,\mathrm{ij}}^i.Math.|\forall \left(i,j\right)\in {\Gamma }_{a,b},\forall b\in {\Delta }_a,\forall a\right\};$

[0039] calculating a first antithesis residual vector according to a formula of

d.sup.f J={|K.sub.a,ij.sup.t−K.sub.a,ij.sup.t+1|, |L.sub.a,ij.sup.t−L.sub.a,ij.sup.t+1||∀(i, j)∈Γ.sub.a,b, ∀b∈Δ.sub.a, ∀a};

[0040] calculating a first total residual according to a formula of

[00007]${\delta }^{f,t}={.Math.\left(\begin{array}{c}{r}^{f,t}\\ d^{f,t}\end{array}\right).Math.}_{\infty };$

[0041] judging whether δ.sup.f,t≧ε.sup.f; and

[0042] judging that the alternating direction multiplier method does not converge if δ.sup.f,t≧ε.sup.f, and judging that the alternating direction multiplier method converges if δ.sup.f J<ε.sup.f.

[0043] In step S36, t.sub.l:=t.sub.l+1 and S31 is returned if the alternating direction multiplier method does not converge, and S4 is executed if the alternating direction multiplier method converges.

[0044] In step S4, a nonlinear transformation is performed on the intermediate state variables of each of the plurality of sub-systems at a second stage to obtain intermediate measured values.

[0045] In an embodiment of the present disclosure, the nonlinear transformation at the second stage is performed on the intermediate state variables of sub-system a to obtain the intermediate measured values {α.sub.a,i, θ.sub.a,ij, α.sub.a,ij} according to formulas of

α.sub.a,j=lnU.sub.a,i

α.sub.a,ij=ln(K.sub.a,ij.sup.2+L.sub.a,ij.sup.2)

[00008]${\theta }_{a,\mathrm{ij}}=\arctan \left(\frac{L_{a,\mathrm{ij}}}{K_{a,\mathrm{ij}}}\right)$

[0046] In step S5, a second linear model of the power system for a third stage is established according to the intermediate measured values, the second linear model is distributed and includes a second target function and a second constraint condition, the second target function ensures minimizing a sum of second residual squares and second penalty terms of the plurality of sub-systems, the second residual square is obtained according to final state variables of each sub-system and the intermediate measured values, the second penalty term ensures bad data sparsity at the third stage, the second constraint condition includes equality constraints ensuring consistency of the boundary state variables of adjacent sub-systems.

[0047] In an embodiment of the present disclosure, the final state variables include voltage amplitudes and voltage phase angles of the nodes.

[0048] As shown in FIG. 3, the system includes 5 nodes and 2 sub-systems, in which the sub-system a includes nodes 1, 2, 3 and 4, and the sub-system b includes nodes 3 and 5, and the node 3 is the shared node by two sub-systems.

[0049] In an embodiment of the present disclosure, the second target function is denoted by a formula of

[00009]$\min .Math..Math.J^s\left(x,o^s\right)=\underset{a=1}{\overset{R}{.Math.}}.Math..Math.J_a^s\left(x_a,o_a^s\right)=\underset{a=1}{\overset{R}{.Math.}}.Math..Math.\left[\frac{1}{2}.Math.{\left({\tilde{u}}_a-C_a.Math.x_a-o_a^s\right)}^T.Math.\left({\tilde{u}}_a-C_a.Math.x_a-o_a^s\right)+\lambda .Math.{.Math.o_a^s.Math.}_1\right]$

where J.sub.a.sup.s represents a second target function of the sub-system a, x.sub.a represents a final state variable vector of the sub-system a, a.sub.a.sup.s represents a had data vector of the sub-system a at the second stage, λ∥a.sub.a.sup.s∥.sub.1 represents the second penalty term of the sub-system a, ũ.sub.a represents the intermediate measured value vector obtained in S4, c.sub.a represents a measured matrix of the sub-system a at the third stage.

[0050] In an embodiment of the present disclosure, elements in c.sub.a are determined according to formulas of

α.sub.a,ij=α.sub.a,i+α.sub.a,jε.sub.a

θ.sub.a,ij=θ.sub.a,i−θ.sub.a,j+ε.sub.θ

where ε.sub.a, ε.sub.θ represent error items of α.sub.a,ij, θ.sub.a,ij at the third stage respectively.

[0051] In an embodiment of the present disclosure, the equality constraint ensuring consistency of the boundary state variables of adjacent sub-systems is denoted by a formula of

s.t. x.sub.a,i=x.sub.b,i, ∀i∈{circumflex over (N)}.sub.a.sup.BB, •a

where s.t, means subjecting to, x.sub.a,i represents a state variable of the node of the sub-system a, x.sub.b,i represents a state variable of the node of the sub-systems b, and {circumflex over (N)}.sub.a.sup.BB represents a set of boundary nodes.

[0052] As shown in FIG. 3, equality constraint x.sub.a,3=x.sub.b,3 introduced in the node 3.

[0053] As shown in FIG. 3, the system includes 5 nodes and 2 sub-systems, in which the sub-system a includes nodes 1, 2, 3 and 4, and the sub-system b includes nodes 3 and 5, and the node 3 is the shared node by two sub-systems.

[0054] In an embodiment of the present disclosure, step S6 includes following step S60-S66.

[0055] In step S60, a second iteration subscript t.sub.2 of the alternating direction multiplier method is initialized to be equal to 0, and a second convergence criteria ε.sup.s of the alternating direction multiplier method is set as ε.sub.s∈R.sup.+.

[0056] In step S61, the final state variable vector of the sub-system a is updated according to a formula of

x.sub.a.sup.t+1=Ĝ.sub.C,a.sup.−1(C.sub.a.sup.T(ũ.sub.a−o.sub.a.sup.s.t.)+ρ.sup.s{circumflex over (x)}.sub.a.sup.t), ∀a

where ρ.sup.s∈R.sup.+ it represents a second penalty factor of the alternating direction multiplier method, the value of which is 1, Ĝ.sub.C,a=C.sub.a.sup.T+ρ.sup.sI or represents an augmented information matrix at the third stage, {circumflex over (x)}.sub.a.sup.f represents an auxiliary final state variable vector of the sub-system a at t.sub.2.sup.th iteration and an initial value of which is 0, and the initial value of which is 0.

[0057] In step S62, the bad data variable vector of the sub-system a at the third stage is updated according to a formula of

o.sub.a.sup.s.t.+1=[ũ.sub.a−C.sub.ax.sub.a.sup.t+1].sub.λ.sup.+

[0058] In step S63, a mean value of state variables of any boundary node i of the sub-system a is computed according to a formula of

[00010]${\stackrel{\_}{x}}_{a,i}^{i+1}=\frac{1}{m_i}.Math.\underset{a\in M_i}{.Math.}.Math..Math.x_{a,i}^{i+1},.Math.\forall i\in {\hat{N}}_a^{\mathrm{BB}}$

where M.sub.i represents a set of sub-systems including the node i, and m.sub.i represents the number of sub-systems including the node i.

[0059] In step S64, auxiliary final state variables of the sub-system a are updated according to a formula of

{circumflex over (x)}.sub.a,j.sup.t+1={circumflex over (x)}.sub.a,j.sup.t+2x.sub.a,j.sup.t+1−x.sub.a,j.sup.t−x.sub.a,j.sup.t+1, ∀i∈{circumflex over (N)}.sub.a.sup.BB.

[0060] In step S65, it is judged whether the alternating direction multiplier method converges at the third stage.

[0061] In an embodiment of the present disclosure, S65 includes:

[0062] calculating a second original residual vector according to a formula of

[00011]$r^{s,i}=\frac{1}{2}.Math.\left\{.Math.x_{a,i}^i-x_{b,i}^i.Math.|\forall i\in {\hat{N}}_a^{\mathrm{BB}},\forall b\in {\Delta }_a,\forall a\right\};$

[0063] calculating second antithesis residual vectors respectively according to formulas of

[00012]$d^{s,i}=\frac{1}{2}.Math.\left\{.Math.{\stackrel{\_}{x}}_{a,i}^i-{\stackrel{\_}{x}}_{a,i}^{i-1}.Math.|\forall i\in {\hat{N}}_a^{\mathrm{BB}},\forall b\in {\Delta }_a,\forall a\right\},.Math.d^{f,i}=\left\{.Math.{\stackrel{\_}{K}}_{a,\mathrm{ij}}^i-{\stackrel{\_}{K}}_{a,\mathrm{ij}}^{i-1}.Math.,.Math.{\stackrel{\_}{L}}_{a,\mathrm{ij}}^i-{\stackrel{\_}{L}}_{a,\mathrm{ij}}^{i-1}.Math.|\forall \left(i,j\right)\in {\Gamma }_{a,b},\forall b\in {\Delta }_a,\forall a\right\};$

[0064] calculating a second total residual according to a formula of judging whether δ.sup.s.t≧ε.sup.s; and

[00013]$\begin{array}{cc}{\delta }^{s,t}={.Math.\left(\begin{array}{c}{r}^{s,t}\\ d^{s,t}\end{array}\right).Math.}_{\infty };& \left(30\right)\end{array}$

judging that the alternating direction multiplier method does not converge if δ.sup.s.t≧ε.sup.s, and judging that the alternating direction multiplier method converges if δ.sup.s.t>ε.sup.s.

[0065] In step S66, t.sub.2:=t.sub.2+1 and S61 is returned if the alternating direction multiplier method does not converge, and x.sub.a of the sub-system a is outputted as the final state variables of the sub-system a in the power system if the alternating direction multiplier method converges.

[0066] Technical solutions provided in embodiments of the present disclosure have the following advantages.

[0067] (1) Scalability: after the power system is divided into the plurality of sub-systems, the sub-problem scale of each sub-system is very small;

[0068] (2) Maintainability: in this technical solution, each sub-system needs to perform the collaborative iteration with adjacent sub-systems, and the control center does not require the coordination process and does not need to maintain a large centralized model;

[0069] (3) Privacy: each sub-system only needs to interact with the adjacent sub-system about boundary interaction information in the first stage and the third stage, so the data privacy within the sub-system is well protected.

[0070] In order to realize the above objective, embodiments of the present disclosure also provide a device for estimating a state of a power system, the device includes a processor; a memory configured to store an instruction executable by the processor; in which the processor is configured to perform the method for estimating a state of a power system according to any one of above embodiments.

[0071] In order to realize the above objective, embodiments of the present disclosure also provide a non-transitory computer readable storage medium having stored therein instructions that, when executed by a processor of a computing device, causes the computing device to perform the method for estimating a state of a power system according to any one of above embodiments.

[0072] It will be understood that, the flow chart or any process or method described herein in other manners may represent a module, segment, or portion of code that comprises one or more executable instructions to implement the specified logic function(s) or that comprises one or more executable instructions of the steps of the progress. Although the flow chart shows a specific order of execution, it is understood that the order of execution may differ from that which is depicted. For example, the order of execution of two or more boxes may be scrambled relative to the order shown. Also, two or more boxes shown in succession in the flow chart may be executed concurrently or with partial concurrence. In addition, any number of counters, state variables, warning semaphores, or messages might be added to the logical flow described herein, for purposes of enhanced utility, accounting, performance measurement, or providing troubleshooting aids, etc. It is understood that all such variations are within the scope of the present disclosure. Also, the flow chart is relatively self-explanatory and is understood by those skilled in the art to the extent that software and/or hardware can be created by one with ordinary skill in the art to carry out the various logical functions as described herein.

[0073] The logic and/or procedures indicated in the flowing diagram or described in other means herein, such as a constant sequence table of the executable code for performing a logical function, may be implemented in any computer readable storage medium so as to be adopted by the code execution system, the device or the equipment (such a system based on the computer, a system including a processor or other systems fetching codes from the code execution system, the device and the equipment, and executing the codes) or to be combined with the code execution system, the device or the equipment to be used. With respect to the description of the present invention, “the computer readable storage medium” may include any device including, storing, communicating, propagating or transmitting program so as to be used by the code execution system, the device and the equipment or to be combined with the code execution system, the device or the equipment to be used. The computer readable medium includes specific examples (a non-exhaustive list): the connecting portion (electronic device) having one or more arrangements of wire, the portable computer disc cartridge (a magnetic device), the random access memory (RAM), the read only memory ROM), the electrically programmable read only memory (EPROMM or the flash memory), the optical fiber device and the compact disk read only memory (CDROM). In addition, the computer readable storage medium even may be papers or other proper medium printed with program, as the papers or the proper medium may be optically scanned, then edited, interpreted or treated in other ways if necessary to obtain the program electronically which may be stored in the computer memory.

[0074] It should be understood that, each part of the present invention may be implemented by the hardware, software, firmware or the combination thereof. In the above embodiments of the present invention, the plurality of procedures or methods may be implemented by the software or hardware stored in the computer memory and executed by the proper code execution system. For example, if the plurality of procedures or methods is to be implemented by the hardware, like in another embodiment of the present invention, any one of the following known technologies or the combination thereof may be used, such as discrete logic circuits having logic gates for implementing various logic functions upon an application of one or more data signals, application specific integrated circuits having appropriate logic gates, programmable gate arrays (PGA), field programmable gate arrays (FPGA).

[0075] It can be understood by those having the ordinary skills in the related art that all or part of the steps in the method of the above embodiments can be implemented by instructing related hardware via programs, the program may be stored in a computer readable storage medium, and the program includes one step or combinations of the steps of the method when the program is executed.

[0076] In addition, each functional unit in the present disclosure may be integrated in one progressing module, or each functional unit exists as an independent unit, or two or more functional units may be integrated in one module. The integrated module can be embodied in hardware, or software. If the integrated module is embodied in software and sold or used as an independent product, it can be stored in the computer readable storage medium.

[0077] The computer readable storage medium may be, but is not limited to, read-only memories, magnetic disks, or optical disks.

[0078] Reference throughout this specification to “an embodiment,” “some embodiments.” “one embodiment”, “another example,” “an example,” “a specific example,” or “some examples,” means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the present disclosure. Thus, the appearances of the phrases such as “in some embodiments,” in one embodiment“, “in an embodiment”, “in another example,” “in an example,” “in a specific example,” or “in some examples,” in various places throughout this specification are not necessarily referring to the same embodiment or example of the present disclosure. Furthermore, the particular features, structures, materials, or characteristics may be combined in any suitable manner in one or more embodiments or examples.

[0079] Although explanatory embodiments have been shown and described, it would be appreciated by those skilled in the art that the above embodiments cannot be construed to limit the present disclosure, and changes, alternatives, and modifications can be made in the embodiments without departing from spirit, principles and scope of the present disclosure.