Debugging a Policy: Automatic Action-Policy Testing in AI Planning

Abstract

Testing is a promising way to gain trust in neural action policies π. Previous work on policy testing in sequential decision making targeted environment behavior leading to failure conditions. But if the failure is unavoidable given that behavior, then π is not actually to blame. For a situation to qualify as a" bug" in π, there must be an alternative policy π’that does better. We introduce a generic policy testing framework based on that intuition. This raises the bug confirmation problem, deciding whether or not a state is a bug. We analyze the use of optimistic and pessimistic bounds for the design of test oracles approximating that problem. We contribute an implementation of our framework in classical planning, experimenting with several test oracles and with random-walk methods generating test states biased to poor policy performance and/or state novelty. We evaluate these techniques on policies π learned with ASNets. We find that they are able to effectively identify bugs in these π, and that our random-walk biases improve over uninformed baselines.

@inproceedings{steinmetzDebuggingAPolicyAutomatic2022,
 author = {Marcel Steinmetz and Daniel Fišer and Hasan Ferit Eniser and Patrick Ferber and Timo P. Gros and Philippe Heim and Daniel Höller and Xandra Schuler and Valentin Wüstholz and Maria Christakis and Jörg Hoffmann},
 booktitle = {Proceedings of the 32nd International Conference on Automated Planning and Scheduling. International Conference on Automated Planning and Scheduling (ICAPS-2022), July 13-24},
 doi = {10.1609/icaps.v32i1.19820},
 editor = {Akshat Kumar and Sylvie Thiébaux and Pradeep Varakantham and William Yeoh},
 isbn = {978-1-57735-874-9},
 month = {6},
 pages = {353-361},
 publisher = {AAAI Press},
 series = {ICAPS conference series},
 title = {Debugging a Policy: Automatic Action-Policy Testing in AI Planning},
 volume = {32 (2022)},
 year = {2022}
}