Abstract
We describe a method for explaining the differences between the quality of plans produced for similar planning problems. The method exploits a process of abstracting away details of the planning problems until the difference in solution quality they support has been minimised. We give a general definition of a valid abstraction of a planning problem. We then give the details of the implementation of a number of useful abstractions. Finally, we present a breadth-first search algorithm for finding suitable abstractions for explanations; and detail the results of an evaluation of the approach.
Original language | English |
---|---|
Title of host publication | Proceedings of the 34th International Conference on Automated Planning and Scheduling |
Publisher | AAAI Press |
Publication status | Accepted/In press - 1 Jun 2024 |