CBPOP: A Domain‐Independent Multi‐Case Reuse Planner

The reuse of multiple cases to solve a single planning problem presents a promise of better utilization of past experience over single‐reuse planning, which can lead to better planning performance. In this paper, we present the theory and implementation of CBPOP, and show how it addresses the multi‐reuse planning problems. In particular, we present novel approaches to retrieval and refitting. We also explore the difficult issue of when to retrieve in multi‐reuse scenarios, and we empirically compare the results of several solutions we propose. Results from our experiments show that the best ranking function for pure generative planning is not necessarily the best ranking function for multi‐reuse planning. The surprising result in the reuse scenarios is that the single‐goal case library performed better than larger case libraries consisting of solutions to multi‐goal problems.