Power- Network- Distribution课件.pptVIP

Worst-Case Noise with Non-zero Current Transition Times Problem formulation II T: chosen to be such that h(t) has died down to some negligible value. * f(t) replaces i(T-τ) Proposed Algorithm Based on Dynamic Programming GetTransPos(j,k1,k2): find the smallest i such that Fj(k1,i)≤ Fj(k2,i) Q.GetMin(): return the minimum element in the priority queue Q Q.DeleteMin(): delete the minimum element in the priority queue Q Q.Add(e): insert the element e in the priority queue Q Proposed Algorithm: Initial Setup Divide the time range [0, T] into m intervals [t0=0, t1], [t1, t2], …, [tm-1, tm=T]. h(ti) = 0, i=1, 2, …, m-1 u0 = 0, u1, u2, …, un = b are a set of n+1 values within [0, b]. The value of f(t) is chosen from those values. A larger n gives more accurate results. h(t) Proposed Algorithm: f(t) within a time interval [tj, tj+1] Ij(k,i): worst-case f(t) starting with uk at time tj and ending with ui at time tj+1 h(t) Theorem 1: The worst-case f(t) can be cons-tructed by determining the values at the zero-crossing points of the h(t) Proposed Algorithm: Dynamic Programming Formulation Define Vj(k,i): the corresponding output within time interval [tj, tj+1] Define the intermediate objective function OPT(j,i): the maximum output generated by the f(t) ending at time tj with the value ui Recursive formula for the dynamic programming algorithm: Time complexity: Acceleration of the Dynamic Programming Algorithm Without loss of generality, consider the time interval [tj, tj+1] where h(t) is negative. Define Wj(k,i): the absolute value of Vj(k,i): Lemma 1: Wj(k2,i2)- Wj(k1,i2)≤ Wj(k2,i1)- Wj(k1,i1) for any 0 ≤ k1 k2 ≤ n and 0 ≤ i1 i2 ≤ n Acceleration of the Dynamic Programming Algorithm Define Fj(k,i): the candidate corresponding to k for OPT(j,i) Accelerated algorithm: Based on Theorem 2 Using binary search and priority queue Theorem 2: Suppose k1 k2, i1∈[0,n] and Fj(k1,i1)≤ Fj(k2,i1), then for any i2 i1, we have Fj(k1,i2)≤ Fj(k2,i2). Case Stud