Linear Algebra · Covariance and State Estimation · M9-L1 · Advanced
Robot Localization with Uncertainty
Robot scenario
Scout has to know where it is, and it knows only a rough guess and a few noisy distances to beacons on the walls. A good estimate is not a single point: it is a point and an ellipse that says how far off it might be.
You will place beacons to shape that ellipse, find out why a filter that trusts its sensor too much stops listening, and then write the Kalman update and a full localiser that rejects a bad range, graded on scenarios you have not seen.
Your task
Lab complete: post-mortem
You have passed every stage. Now connect it back to the theory and move on:
Output
What Python can I use?
Plain Python with math and lakit (import lakit as la: vectors, matmul, solve, qr, svd, eigh, lstsq, pinv and more; NumPy is not available in the browser). Your code runs in a background worker: an endless loop is stopped after a few seconds and the page stays usable. It runs in your browser and is never sent anywhere.