Stubborn Sets Pruning for Privacy Preserving Planning

Authors

  • Tim Schulte Albert-Ludwigs-Universit├Ąt Freiburg

DOI:

https://doi.org/10.1609/socs.v9i1.18467

Abstract

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.

Downloads

Published

2021-09-01