Week 9 Tutorial: Clear the corridor
Mark the conflict between two independent trajectories, complete the reservation query, and show the spatial-visited bug at the waiting point.
21 April 2027
Open Week 9 in the Lab →Try your own change on this week's case.
Two-hour tutorial: preparation, coding and checks
This week’s task#
Model: A heading to #13 and B returning; corridor capacity one. The live intervals use seconds after A takes off; the P@3 exercise is separate.
Before you start · 15 minutes#
Read W9 or its deck. Calculate the overlap of [87,112) and [107,132) before running.
Trace the example · 25 minutes#
Let A wait for B and check that A enters at 112. Compare arrival and hover energy; then try the detour using the arrangement selector.
Implement and compare · 55 minutes#
Complete the half-open interval query in myNeighbours. Switch to the symbolic waiting case and trace P@3→P@4→P@5→P@6→G@8. Show what a place-only visited key would discard.
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#
Test [0,6) against [5,7) and against [6,8). Explain the waiting point, interval boundary and energy model.
What to keep: A2: conflict definition and reservation filtering. Show the tutor your prediction, experiment and explanation for this week’s participation point; keep the record to develop your assignment.
Optional extension#
Propose another reservation window and predict how long A waits before using it in the local exercise.
W9 · The whole interval must fit.
What disappears when the search remembers only the node?
Two recorded flight legs use one narrow passage. Let one drone wait so they do not occupy it together.
Conflict on [107, 112): both drones occupy the corridor.
Computed from this case · 1.53 ms · lab-1.0 · corridor
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.
Two towers · one shared passage
Overlap [107, 112) · 5 s conflict
| Drone | Pass entry | Pass exit |
|---|---|---|
| A | 107 s | 132 s |
| B | 87 s | 112 s |
The passage runs between two buildings on the slope. Its capacity-one rule applies to the whole crossing interval, not just the entry time.
Explore the evidence, replay or open full Lab
Open full Lab ↗ for editable inputs, strategy code and saved comparisons.
A waits 5 seconds. The corridor intervals then touch without overlapping; hovering adds energy.
Read the example above
A waits 5 seconds. The corridor intervals then touch without overlapping; hovering adds energy.
Two individual flight legs: loaded A outbound, unloaded B returning · Corridor capacity one; half-open intervals · This case checks the shared passage, not a complete delivery schedule
| Inspect | Drone | From | To | Start | End | Energy (J) |
|---|---|---|---|---|---|---|
| A | West Passage Gate | East Passage Gate | 107 | 132 | 5246 | |
| B | East Passage Gate | West Passage Gate | 87 | 112 | 2982 |
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 219 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.
- you can give concrete evidence of "same place, different future choices"
- your overlap test uses half-open intervals and catches the [0,6) against [5,7) case
- you can say which waits are legal and what each one costs
Teaching team
- Kofi Marchetti — tutor