On the complexity of case-based planning

Paolo Liberatore

Journal of Experimental and Theoretical Computer Science

This paper analyses the computational complexity of problems related to case-based planning: planning when a plan for a similar instance is known, and planning from a library of plans. It is proven that planning from a single case has the same complexity than generative planning (i.e. planning from scratch); using an extended definition of cases, complexity is reduced if the domain stored in the case is similar to the one to search plans for. Planning from a library of cases is shown to have the same complexity. In both cases, the complexity of planning remains, in the worst case, PSPACE-complete.


 @article{libe-05-g,
 title = {On the complexity of case-based planning},
 year = {2005},
 author = {Liberatore, Paolo},
 journal = {Journal of Experimental and Theoretical Computer
 Science},
 pages = {283--295},
 number = {3},
 volume = {17},
 }
 
doi: 10.1080/09528130500283717