Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag London
About this chapter
Cite this chapter
Miguel, I. (2004). FGP: Experimental Results. In: Dynamic Flexible Constraint Satisfaction and its Application to AI Planning. Distinguished Dissertations. Springer, London. https://doi.org/10.1007/978-0-85729-378-7_8
Download citation
DOI: https://doi.org/10.1007/978-0-85729-378-7_8
Publisher Name: Springer, London
Print ISBN: 978-1-4471-1048-4
Online ISBN: 978-0-85729-378-7
eBook Packages: Springer Book Archive