Navigation · Safety, Uncertainty and Recovery · M7-L3 · Intermediate
Build a Recovery Behavior Tree
15:45. A patient trolley is parked half across the corridor. Scout's follow-path action fails once and the whole mission is aborted. In another run it spins in a narrow corridor because the recovery list is a sequence and runs every item, whatever went wrong.
You will write the tick of a small behaviour tree, build the tree that recovers in a sensible order and asks for help last, and give a retry node its budget.
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.