SDSC6007 - Assignment 2
发表于
|浏览量:
SDSC6007 - Assignment 2
#assignment #sdsc6007
文章作者: Eric_Chen
版权声明: 本博客所有文章除特别声明外，均采用 CC BY-NC-SA 4.0 许可协议。转载请注明来源 迷麟の小站！
相关推荐
2025-09-28
SDSC6007 - Assignment 1
SDSC6007 - Assignment 1 #assignment #sdsc6007 Question 1 Ash Ketchum is preparing his next trip and packing up. His backpack has maximum weight capacity is z and he wants to fill it up with different quantities of N different items. Denote viv_{i}vi : the value of the i th type of item wiw_{i}wi : the weight of i th item xix_{i}xi : the number of items of type i that are loaded in the backpack Ash Ketchum is trying to maximize the total value of all the items in his backpack, i.e. t...
2025-10-03
SDSC6007 - Question of Assignment 1
#assignment #sdsc6007
2025-10-25
SDSC6007 - Question of Assignment 2
#assignment #sdsc6007
2025-09-02
SDSC6007 Course 1-Introduction of Dynamic Programming Algorithm
#sdsc6007 English / 中文 Introduction The Discrete-Time Dynamic System The system has the form xk+1=fk(xk,uk,wk),k=0,1,...,N−1,x_{k + 1} = f_{k} (x_k, u_k, w_k ), k = 0, 1, . . . , N − 1, xk+1=fk(xk,uk,wk),k=0,1,...,N−1, where kkk : index of discrete time NNN : the horizon or number of times control is applied xkx_kxk : the state of the system, from the set of states Sk uku_kuk : the control/decision variable/action to be selected from the set Uk (xk ) at time k wkw_kwk : a ...
2025-09-10
SDSC6007 Course 2-Shortest Path Problems (SPP)
#sdsc6007 English / 中文 Shortest Path Problems (SPP) Problem Definition Given node set {1,2,…,N,t}\{1,2,\dots,N,t\}{1,2,…,N,t} (ttt=destination), aija_{ij}aij: Cost from node iii to jjj (aij=∞a_{ij} = \inftyaij=∞ if no direct path) Key assumption: All cycles have non-negative cost (∀ cycles i→j1→⋯→jk→i, total cost≥0\forall \text{ cycles } i \to j_1 \to \cdots \to j_k \to i,\ \text{total cost} \geq 0∀ cycles i→j1→⋯→jk→i, total cost≥0) Goal: Find min-cost path from any iii to ttt Sig...
2025-09-16
SDSC6007 Course 3-Tutorial and HMM
#sdsc6007 English/ Chinese Tutorial 1 Problem Setting Dynamic System: xk+1=xk+uk+wkx_{k+1} = x_k + u_k + w_kxk+1=xk+uk+wk, k=0,1,2,3k = 0,1,2,3k=0,1,2,3 Initial State: x0=5x_0 = 5x0=5 Cost Function: ∑k=03(xk2+uk2)\sum_{k=0}^{3}(x_k^2 + u_k^2)∑k=03(xk2+uk2) State Space: Sk={0,1,2,3,4,5}S_k = \{0,1,2,3,4,5\}Sk={0,1,2,3,4,5} Control Constraints: Uk(xk)={u∣0≤xk+u≤5,u∈Z}U_k(x_k) = \{u \mid 0 \leq x_k + u \leq 5, u \in \mathbb{Z}\}Uk(xk)={u∣0≤xk+u≤5,u∈Z} Stochastic Disturban...