Before revision:  This work proposes a distributed planning approach based on local search , and shows how to reduce its computation and communication requirements without sacrificing algorithm performance .
After revision:  This work proposes a distributed planning approach based on local search , and shows how lazy/greedy methods can be adopted to reduce the computation and communication requirements without sacrificing algorithm performance .