Week 10 Tutorial: Change the planning priority
Complete neighbour generation and reservation filtering, compare two priorities, and add a failed-reservation rollback test.
28 April 2027
Open Week 10 in the Lab →Try your own change on this week's case.
Two-hour tutorial: preparation, coding and checks
This week’s task#
Model: Two complete tasks with synchronised loading, fixed ready times, energy reserve and whole corridor intervals.
Before you start · 15 minutes#
Read W10. Predict who waits under A-first and B-first; do not assume either priority is better.
Trace the example · 25 minutes#
Plan B before A. Inspect both tasks and their resource intervals, then compare ground waiting with airborne waiting.
Implement and compare · 55 minutes#
Complete myNeighbours and use it in the supplied state-search driver. Test legal move/wait successors and blocked crossings. Use the full reference evaluator to check the fleet comparison separately.
Use Open full Lab for editable inputs, strategy code, exports and the practice pack. The example on this page compares this week’s published cases; your local student runner must call the functions you complete.
Check and explain · 25 minutes#
Add a failed-reservation rollback test. Record priority, budget, delivery, return and energy. Explain why one priority failing does not establish joint impossibility.
What to keep: A2: space-time search, priorities and rollback evidence. Show the tutor your prediction, experiment and explanation for this week’s participation point; keep the record to develop your assignment.
Optional extension#
Change a requested departure while holding the priority fixed. Label the changed initial condition.
W10 · Reserve, then plan the next drone.
Who waits when you change which drone is planned first?
Two complete deliveries compete for the passage. Change which drone reserves its route first.
2/2 on time. Every order delivered and every drone returned with all checks passing.
Computed from this case · 1.99 ms · lab-1.0 · two-tasks
Colour bands show ground elevation. The marked passage runs between two towers; its rule allows one drone at a time. Height shown at 3× scale.
Reserve a time, then plan the next drone
| Drone | Waiting state | From | Until |
|---|
State = place + phase + absolute time + energy. The next drone must fit around the recorded intervals.
Explore the evidence, replay or open full Lab
Open full Lab ↗ for editable inputs, strategy code and saved comparisons.
Compare the recorded waits under the same tasks and budgets. A priority change need not improve the objective.
Read the example above
Compare the recorded waits under the same tasks and budgets. A priority change need not improve the objective.
Two complete tasks; original ready times and payloads · Both loads start together at the later ready time · Full return, reserve and corridor interval checks
| Inspect | Order | Drone | Load start | Deliver | Return | Late (s) | Energy (J) |
|---|---|---|---|---|---|---|---|
| #13 | A | 4991 | 5253 | 5410 | 0 | 56781 | |
| #11 | B | 4991 | 5258 | 5420 | 0 | 56437 |
Play the recorded flight, or drag the time slider.
Time and shared resources
NowThe vertical line marks the current time; outlined intervals are active. Select an interval to jump to its start. Intervals include their start and exclude their end.
0 s 5480 s
Continue in the Lab →The same case, with every input open to change.
The spec
What you bring to the session. Written so a reader can tell whether it has been met without asking you.
- your search never reuses a reservation left behind by a failed attempt
- you can explain the guarantee range of prioritised planning without the word optimal
- added waiting changes energy, delivery and return time together in your results
Teaching team
- Kofi Marchetti — tutor