FGP: Experimental Results
This chapter presents an evaluation of Flexible Graphplan made in two ways. Firstly, a test suite of twelve problems is examined, engineered to contain plans of three different satisfaction degrees at different distributions of plan length. The results for this test allow an examination of the relationship between solution distribution and difficulty of plan synthesis. Boolean versions of the twelve problems are also solved in order to investigate the overhead incurred by searching for a range of plans. In addition, the utility of the limited graph expansion and satisfaction propagation techniques described in Sections 7.3.3 and 7.3.4 respectively are examined with respect to the test suite.
KeywordsTest Suite Ited Graph Expansion Satisfaction Degree Satisfaction Propagation Rescue Problem
Unable to display preview. Download preview PDF.