Iterative Planning with MUGS Explanations: Exploring the Design Space
Consider an oversubscription planning problem (i.e., there are more goals that can be achieved simultaneously) and only a human expert can decide which subsets of goals are more important than others. This can be addressed with an iterative planning loop, where a user specifies a set of goals, a planner tries to satisfy them, and returns a set of Minimal Unsolvable Goal Subsets (MUGS). In this paper, we look at different ways to visualise these MUGS, and whether a planner is needed at all during execution.
HAXP 2026 Short Paper
This short paper was accepted at HAXP 2026!
Talk [pdf]
17 minute talk for HAXP.