KAYA chahiye: ek discrete set of weighted points {Xi,Wi} jo x ke mean aur covariance ko exactly reproduce kare, taaki unhe transform karne ke baad y ki statistics ka achha estimate mile.
KAISE sigma points banate hain — first principles se.
Hume aise points chahiye jinका weighted mean xˉ ke barabar ho aur weighted spread P ke barabar ho:
∑iWiXi=xˉ,∑iWi(Xi−xˉ)(Xi−xˉ)⊤=P.
Ye constraint kyun? Kyunki agar point cloud ka sahi mean aur covariance ho, toh uski low-order statistics second order tak Gaussian se match karti hain — aur do moments match karna exactly wahi hai jo ek Kalman filter care karta hai.
Points ko P ki "shape" ke along spread karne ke liye, hume uska matrix square root S chahiye jahan SS⊤=P. Hum P use karte hain (usually Cholesky factor). Hum place karte hain:
Toh hume milte hain ==2n+1== sigma points: ek center pe, aur P ke har principal axis ke dono taraf ek-ek. Factor (n+λ) control karta hai ki points kitni door baithte hain.
KAISE weights chunte hain. Hume do moment conditions chahiye (mean, covariance), isliye hum do weight sets allow karte hain:
Do weight sets kyun? Mean weight W(m) aur covariance weight W(c)sirf center point pe differ karte hain, isliye hum Gaussian-tuning term (1−α2+β) covariance mein inject kar sakte hain bina mean ko disturb kiye. Clever bookkeeping, kuch nahi.
n-dim state ke liye kitne sigma points? 2n+1 kyun?
Sigma set ko exactly kaunsi do statistics reproduce karni chahiye?
Gaussian-tuning β=2 kahan enter hota hai?
UKF, EKF ko y=x2 at x=0 pe kyun beat karta hai?
Gain mein Jacobian H ki jagah kya aata hai?
UKF Jacobians kyun avoid karta hai?
Ye deterministic sigma points ko true nonlinear function ke through propagate karta hai aur unse statistics estimate karta hai, isliye koi linearization/derivative ki zaroorat nahi.
n-dimensional state ke liye kitne sigma points?
2n+1 — ek center point aur P ke principal axes ke along har dimension mein do (±).
Sigma points ko define karne wali do moment conditions kya hain?
Unka weighted mean xˉ ke barabar aur unka weighted covariance exactly P ke barabar hona chahiye.
Sigma point formula do.
X0=xˉ, Xi=xˉ±((n+λ)P)i, with λ=α2(n+κ)−n.
Mean weight W0(m) kya hai?
W0(m)=λ/(n+λ); baaki sab 1/[2(n+λ)] hain.
W0(c) aur W0(m) mein kya fark hai?
W0(c)=W0(m)+(1−α2+β); sirf center covariance weight Gaussian tuning term carry karta hai.
β kya hai aur uski optimal Gaussian value kya hai?
Ek parameter jo prior distribution knowledge encode karta hai; β=2 Gaussian priors ke liye optimal hai.
Linear Kalman gain ke PH⊤ ki jagah kya aata hai?
Sigma-point cross-covariance Pxz; gain K=PxzPzz−1.
UT Gaussians ke liye EKF ke muqable mein kis order tak accurate hai?
UT: 3rd order; EKF: 1st order.
x∼N(0,σ2) aur y=x2 ke liye UKF kya mean deta hai?
Exactly σ2 (EKF galat tarike se 0 deta hai kyunki origin pe Jacobian 0 hai).
Additive UKF mein Q aur R kahan add hote hain?
Q predicted covariance Pk− mein; R innovation covariance Pzz mein.
Recall Feynman: 12-saal ke bachche ko explain karo
Socho tumhare paas dots ka ek dhundhla cloud hai jo dikhata hai ki rocket kahan ho sakta hai. Tumhe jaanna hai ki ek curved, twisty motion ke baad wo kahan hoga. Purana trick (EKF) ye dakhavta hai ki twisty path ek seedhi line hai — sasta lekin tez modon pe galat. UKF trick: bas kuch "scout" dots chuno — ek beech mein aur ek-ek dono taraf — har scout ko real twisty path ke through bhejo, aur dekho wo kahan utarte hain. Jahan scouts aaye, wahan se naya cloud banao. Kyunki tumne real path use kiya (seedhi-line guess nahi), tumhara naya cloud bahut zyada accurate hai — aur tumhe sirf muthi bhar scouts move karne pade, na ki ek million.