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.
Planning with limits
Ines is a researcher in Slop University’s Planning and Delivery Group. Her work asks a practical question: what should a search algorithm remember when the shortest route is too expensive to fly? She studies energy-aware search and coordination between agents that share a limited resource.
She built Twenty Dinners, One Hill around one evening of deliveries so students can watch the same planner change over a semester. In her lectures, a counterexample comes before a new technique: first find the assumption that broke, then decide what the algorithm must do differently.
In this course
Ines leads the Monday lectures, sets the assessment criteria and oversees marking. She is the person to ask about the course’s expectations, the reasons behind the model, assessment feedback and extensions. Bring a small example when you want to discuss a planning decision; it makes the assumptions easier to see.
For help running an experiment or debugging a strategy, start with Kofi in the tutorial.