Week 11 Tutorial: Explain a feedback change
Compare independent-cost assignment, fixed assignment with coordination, and assignment with cost feedback; trace one order through the chain.
Open Week 11 in the Lab →Try your own change on this week's case.
Two-hour tutorial: preparation, coding and checks
This week’s task#
Model: Twenty orders, five drones, two pads and the corridor. Compare from the same initial assignment with a stated candidate budget.
Before you start · 15 minutes#
Read W11. Pick an order and predict how changing its drone might affect charging and reservations.
Trace the example · 25 minutes#
Compare Independent routes, Add coordination only, and feedback. The first two may tie; do not invent a conflict. Feedback reports the best feasible result within its budget.
Implement and compare · 55 minutes#
Complete myImprove using myMigrations and the provided full-plan evaluator. Start each candidate with fresh resource state and retain only complete feasible improvements.
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#
Inspect an accepted migration and its changed task times. Record the objective before/after, the search budget and a causal explanation. A budget stop is not a local-optimum proof.
What to keep: A2: integrated improvement and a same-input comparison. Show the tutor your prediction, experiment and explanation for this week’s participation point; keep the record to develop your assignment.
Optional extension#
Repeat with a different candidate budget and report both quality and computation cost. Keep the stored reference labelled separately.
W11 · Recheck costs after each change.
Will a different assignment still improve after every queue is recomputed?
Compare independent routes, coordinated routes and an assignment revised using the real waiting costs.
13/20 on time. Every order delivered and every drone returned with all checks passing.
Computed from this case · 12.44 ms · lab-1.0 · evening
Let the actual waiting cost change the plan
- 1 · AssignIndependent flight costs
- 2 · CoordinateConflicts still possible
- 3 · ReconsiderNo accepted feedback move yet
- 4 · Check again13/20 on time
The feedback action tries changes against the real coordinated cost. A valid improvement must survive the whole-plan check.
Candidate budget: 120. Search stopped: —. A budget stop is not a proof of optimality.
Explore the evidence, replay or open full Lab
Open full Lab ↗ for editable inputs, strategy code and saved comparisons.
Inspect the accepted move and the 120-candidate stopping reason. A valid budget-limited plan is not a proven optimum.
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.
Read the example above
Inspect the accepted move and the 120-candidate stopping reason. A valid budget-limited plan is not a proven optimum.
Mixed fleet; complete trips · Shared charging, FCFS · Corridor capacity one
| Inspect | Order | Drone | Load start | Deliver | Return | Late (s) | Energy (J) |
|---|---|---|---|---|---|---|---|
| #01 | A | 82 | 358 | 529 | 0 | 52958 | |
| #02 | B | 576 | 846 | 1011 | 0 | 56083 | |
| #03 | A | 1258 | 1393 | 1423 | 0 | 12529 | |
| #04 | A | 1642 | 1978 | 2209 | 0 | 76764 | |
| #05 | B | 1780 | 1946 | 2007 | 0 | 21712 | |
| #08 | B | 2879 | 3174 | 3364 | 0 | 63728 | |
| #06 | A | 3239 | 3459 | 3574 | 0 | 43225 | |
| #07 | A | 4180 | 4511 | 4712 | 405 | 80443 | |
| #11 | B | 4229 | 4496 | 4658 | 0 | 56437 | |
| #13 | B | 5431 | 5693 | 5850 | 0 | 56781 | |
| #14 | D | 5438 | 5891 | 6239 | 0 | 183535 | |
| #09 | A | 5789 | 6038 | 6182 | 356 | 47704 | |
| #16 | B | 6628 | 6933 | 7133 | 0 | 60053 | |
| #10 | A | 6845 | 7096 | 7242 | 835 | 52720 | |
| #20 | D | 7758 | 8221 | 8579 | 0 | 194341 | |
| #18 | B | 7952 | 8124 | 8191 | 0 | 22572 | |
| #12 | A | 8175 | 8461 | 8642 | 1743 | 62354 | |
| #15 | A | 9490 | 9699 | 9803 | 2024 | 34477 | |
| #17 | A | 10299 | 10480 | 10556 | 2002 | 27425 | |
| #19 | A | 10963 | 11269 | 11470 | 2037 | 70019 |
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 11530 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 record shows route cost reaching the assignment decision, not two tables side by side
- all three methods were run on the same inputs, priority and budget
- you can name one input the result depends on that a joint optimum would not
Teaching team
- Kofi Marchetti — tutor