Stubborn Sets Pruning for Privacy Preserving Planning

We adapt a partial order reduction technique based on stubborn sets to the setting of privacy-preserving multi-agent planning. We prove that the presented approach preserves optimality and show experimentally that it can significantly improve search performance on some domains