1 / 30

Aggregation in Dynamic Programming

Aggregation in Dynamic Programming. Yu & Ashwin. Introduction. State aggregation done to reduce computation burdens Since information is lost through state identification, this does not always lead to optimal solution Value = Reduced computation Vs Increased error. Introduction (contd.).

yuki
Download Presentation

Aggregation in Dynamic Programming

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Aggregation in Dynamic Programming Yu & Ashwin

  2. Introduction • State aggregation done to reduce computation burdens • Since information is lost through state identification, this does not always lead to optimal solution • Value = Reduced computation Vs Increased error

  3. Introduction (contd.) Aggregation Approach • Aggregate the nodes • Solve the aggregated problem • Disaggregate the solution

  4. Original Problem • Goal: find min-length path from node 0 to node m with respect to specified arc lengths Cij for • fi: the length of a shortest path from node 0 to node i, for i=0,1,2,…,m, so we actually looking for fm

  5. Aggregation • Notations • Entering node • Sequential Aggregation Dis-aggregation (SADA) Algorithm • Error and bound

  6. Notations • Macro-nodes: sets of micro-nodes that form a partition of the nodes of original problem • Macro-arc: directs from macro-node J to J’ if and only if a • Macro-network: Require this to be acyclic so that when we number the macro-nodes 0 through M, a macro-arc is directed from J to J’ only if J<J’

  7. Entering Node • Entering node and set of entering node • Entering node of J from a specific I • Fixed entering node of J

  8. SADA • Goal: Min-length path from macro-node 0 to macro-node M with respect to specified macro-arc lengths • Fi is the length of a shortest Macro-path from macro-node 0 to macro-node i, for i=0,1,2,…,m, so we actually looking for FM

  9. C12 C27 C01 C37 C03 C35 C57 C04 C45 SADA (Con’d) Macro-Node 2 Macro-Node 1 Macro-Node 7 Macro-Node 3 t Macro-Node 0 S Macro-Node 5 Macro-Node 4

  10. Concern of Error • SADA finds the micro-path by construction a shortest path through the micro-network, with the restriction that it must pass through the fixed entering micro-nodes. • This may not give the optimal result for the original problem

  11. Analysis of Error Bound • Now we will prove

  12. Analysis of Error Bound (Con’d)

  13. Error Bound (con’d) We can set the error bound to • the longest path length among any set of paths known to contain the path through N* • the longest path length in the macro-network with arc lengths

  14. Benefits of SADA • Computational savings if not all entering micro-nodes of a macro-node are accessible from the fixed entering micro-node of that macro-node

  15. Corollary #3 Let I є N be any macronode and let J є N be any adjacent macronode, so that (I,J) є A. Suppose for any i є GI, thereis a j єGI U GJ, with f(i,j) ≤ εI , for some εI ≥ 0 and dkJ ≥ djJ for all k є GI Then F* – f*≤ ε, where ε is the maximum path length in the macroarc network with zero arc lengths and node penalties εJ for J є N.

  16. djJ j εI i k dkJ I J

  17. Remark If all pairs of nodes are mutually accesible then εI would be bounded by the diameter pI of macronode I , i.e, εI ≤ pI = maxi,j є I f(i,j)

  18. Block staging We can avoid the task solving a longest path problem in finding error bounds in the important special case that the network contains a single macropath from 0 to node M.

  19. Applications to infinite Horizon otpimization We have a acyclic infinite network (N,A) with time ti associated with each node i. The nodes are numbered from 0 to N-1, such that (i,j) є A only if ti<tj, with t0 = 0. Let C(i,j) arc cost for each arc (i,j).

  20. No. of arcs along every path is infinite • Arc cost tends to zero. Every C(i,j) emerging out of node i will be multiplied by a discount factor e-rti for some constant r >0. • Time diverges to infinity • Capacity expansion, production and inventory conrol, etc.

  21. Such problems are solved by truncating them to a finite length problem of T periods. • The resulting problem is solved by standard dynamic programming • Under mild regulations, this procedure for large enough T will result in optimal initial arc decision that is optimal for infinite horizon problem

  22. A sufficiently large T is difficult to identify. • All data must be first forecasted over infinite horizon • For an ε error the planner willing to accept, then an approximate horizon length Tε* can be determined

  23. a) Bounded reaching

  24. b) Declining future cost

  25. Let F* denote the minimum discounted cost of the macronetwork, is obtained by solving a sequence of T period finite horizon problems

  26. Rolling horizon procedure • Solve the finite horizon problem over [0,T] • Implement the optimal sequence of decision obtained in 1 • Beginning with micronode state obtained from solution 1, solve the problem over [T,2T] • Implement the optimal sequence of decisions in 3 • Repeat steps 1-4 indefinitely

  27. Theorem 5

  28. Proof

  29. Proof (Contd.)

More Related