# Site

## Pages

- [Page not found](https://comp4020-agentic-coding-studio.github.io/comp4020-ass2-1181278174/404/): That page doesn't exist, or it has moved since you last looked
- [Assessment](https://comp4020-agentic-coding-studio.github.io/comp4020-ass2-1181278174/assessments/): Every piece of graded work in the course, what it is worth, and when it is due.
- [Assignment 1: single-drone routing and delivery plan](https://comp4020-agentic-coding-studio.github.io/comp4020-ass2-1181278174/assessments/assignment-1/): One drone, the six known orders #01–#06: correct search, the full round trip with energy, and a justified task order. Released week 3, due week 7.
- [Assignment 2: multi-drone cooperative delivery planner](https://comp4020-agentic-coding-studio.github.io/comp4020-ass2-1181278174/assessments/assignment-2/): All twenty orders, up to five drones of two types, two charging pads and one shared corridor. Reuses assignment 1. Released week 7, due week 12.
- [Tutorial attendance and lab participation](https://comp4020-agentic-coding-studio.github.io/comp4020-ass2-1181278174/assessments/tutorial-participation/): All twelve tutorials count: one point for attendance and one for taking part in the weekly experiment. Together they make up 20% of your course grade.
- [Lectures](https://comp4020-agentic-coding-studio.github.io/comp4020-ass2-1181278174/lectures/): What is covered, week by week, and which topics each lecture draws on.
- [One order, a complete task](https://comp4020-agentic-coding-studio.github.io/comp4020-ass2-1181278174/lectures/w01-one-order/): Why a line from the kitchen to the customer is not yet a problem definition: graph, state, legal edges, goal and cost.
- [Dijkstra: when to stop](https://comp4020-agentic-coding-studio.github.io/comp4020-ass2-1181278174/lectures/w02-dijkstra/): Tentative distances, settled nodes and relaxation; why the goal being discovered is not the goal being found.
- [A*: a useful estimate](https://comp4020-agentic-coding-studio.github.io/comp4020-ass2-1181278174/lectures/w03-a-star/): f = g + h, lower bounds with units, admissible versus consistent, and what re-expansion is for.
- [A route that can return](https://comp4020-agentic-coding-studio.github.io/comp4020-ass2-1181278174/lectures/w04-back-with-battery/): Payload, energy and the return leg; time–energy labels, dominance, and why the fastest arrival is not enough.
- [Which dinner goes first?](https://comp4020-agentic-coding-studio.github.io/comp4020-ass2-1181278174/lectures/w05-many-orders/): The timetable recurrence, and four objectives that are not the same objective.
- [When swaps stop helping](https://comp4020-agentic-coding-studio.github.io/comp4020-ass2-1181278174/lectures/w06-one-swap/): Plans as permutations, a swap neighbourhood, strict improvement, and what a local optimum does and does not mean.
- [Choose a capable drone](https://comp4020-agentic-coding-studio.github.io/comp4020-ass2-1181278174/lectures/w07-which-drone/): One sequence per drone, a feasibility matrix, earliest-completion greedy assignment and cross-drone migration.
- [Who gets the charging pad?](https://comp4020-agentic-coding-studio.github.io/comp4020-ass2-1181278174/lectures/w08-charging-pads/): Two charging pads as a shared resource: discrete events, capacity intervals, the queue recurrence and how a change reaches a third drone.
- [Two drones, one corridor](https://comp4020-agentic-coding-studio.github.io/comp4020-ass2-1181278174/lectures/w09-same-place/): Defining a conflict, putting time into the state, half-open occupancy intervals, and why visited[node] deletes waiting.
- [Search around a reservation](https://comp4020-agentic-coding-studio.github.io/comp4020-ass2-1181278174/lectures/w10-searching-in-time/): A* over (place, phase, time) under committed reservations; prioritised planning and what it does and does not guarantee.
- [Let delays change the assignment](https://comp4020-agentic-coding-studio.github.io/comp4020-ass2-1181278174/lectures/w11-routes-changed/): Assignment, routes, resources and the objective as one evaluation; full re-evaluation of every candidate; what a decomposed method can claim.
- [Audit the twenty dinners](https://comp4020-agentic-coding-studio.github.io/comp4020-ass2-1181278174/lectures/w12-twenty-dinners/): From spatial nodes to resource labels to space-time states; proven properties, tested results and untested generalisations.
- [Ines Halvorsen-Tan](https://comp4020-agentic-coding-studio.github.io/comp4020-ass2-1181278174/people/ines-halvorsen-tan/): Ines studies how route planners change when energy, deadlines and shared space matter. She leads the lectures and connects each new algorithm to its assumptions.
- [Kofi Marchetti](https://comp4020-agentic-coding-studio.github.io/comp4020-ass2-1181278174/people/kofi-marchetti/): Kofi turns planning ideas into experiments you can inspect. He leads the tutorials and helps students explain the gap between a prediction and a result.
- [Policies and boundaries](https://comp4020-agentic-coding-studio.github.io/comp4020-ass2-1181278174/policies/): What the simulation is and is not, the parameters it runs on, what a static site can and cannot check, the rules for the two assignments, accessibility, and who to ask.
- [Check a legal route](https://comp4020-agentic-coding-studio.github.io/comp4020-ass2-1181278174/sessions/w01-one-order/): Hand-compute the available candidate routes on the ten-node block graph, find the edge that passes through a building, and draw the task state diagram.
- [Catch an early stop](https://comp4020-agentic-coding-studio.github.io/comp4020-ass2-1181278174/sessions/w02-dijkstra/): Trace a wrong implementation, complete the search core, and test the four cases that catch it.
- [Reopen a better route](https://comp4020-agentic-coding-studio.github.io/comp4020-ass2-1181278174/sessions/w03-a-star/): An admissible but inconsistent heuristic on a four-edge graph: predict, trace, find the bug, fix re-expansion, then compare h = 0 with a legal heuristic.
- [Keep the route home](https://comp4020-agentic-coding-studio.github.io/comp4020-ass2-1181278174/sessions/w04-back-with-battery/): Ridge or contour: complete the budget and dominance checks, show what single-label pruning loses, confirm by enumeration.
- [Order six dinners](https://comp4020-agentic-coding-studio.github.io/comp4020-ass2-1181278174/sessions/w05-many-orders/): Compute the first orders by hand, implement the recurrence, and compare FIFO with earliest-deadline on the course's objective.
- [Compare swaps with all 720](https://comp4020-agentic-coding-studio.github.io/comp4020-ass2-1181278174/sessions/w06-one-swap/): Implement a swap improver, find where it stops, and measure its exact gap against all 720 permutations.
- [Assign the hotpot](https://comp4020-agentic-coding-studio.github.io/comp4020-ass2-1181278174/sessions/w07-which-drone/): Assign #01–#09 and #20 across three drones, then two types; build an equal-counts, unequal-time counterexample.
- [Trace the pad queue](https://comp4020-agentic-coding-studio.github.io/comp4020-ass2-1181278174/sessions/w08-charging-pads/): Schedule a two-drone, one-pad case by hand, run the five-drone, two-pad case, and locate where shared charging changes the answer.
- [Clear the corridor](https://comp4020-agentic-coding-studio.github.io/comp4020-ass2-1181278174/sessions/w09-same-place/): Mark the conflict between two independent trajectories, complete the reservation query, and show the spatial-visited bug at the waiting point.
- [Change the planning priority](https://comp4020-agentic-coding-studio.github.io/comp4020-ass2-1181278174/sessions/w10-searching-in-time/): Complete neighbour generation and reservation filtering, compare two priorities, and add a failed-reservation rollback test.
- [Explain a feedback change](https://comp4020-agentic-coding-studio.github.io/comp4020-ass2-1181278174/sessions/w11-routes-changed/): Compare independent-cost assignment, fixed assignment with coordination, and assignment with cost feedback; trace one order through the chain.
- [Audit a complete evening](https://comp4020-agentic-coding-studio.github.io/comp4020-ass2-1181278174/sessions/w12-twenty-dinners/): Run the final plan, trace one late or unscheduled order to its cause, and reproduce someone else's conclusion.