Navigation · Local Planning and Obstacle Avoidance · M6-L1 · Intermediate
Escape the Local Minimum
14:05. Scout is parked in the east corridor with the medication tray and a clear goal 8 m ahead. Nothing is in its way except a long partition wall that is not on the planned path. The planner is happy. The controller says the robot is fine. It has not moved for four minutes.
You will write the force that the goal and the walls exert on the robot, build the monitor that notices a robot that has stopped for no good reason, and add the rule that gets it moving again.
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 heapq. 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.